325 lines
9.6 KiB
C
325 lines
9.6 KiB
C
#include <assert.h>
|
|
#include <limits.h>
|
|
#include <string.h>
|
|
#include <stdbool.h>
|
|
#include <stdio.h>
|
|
#include "tree_sitter/parser.h"
|
|
#include "runtime/tree.h"
|
|
#include "runtime/length.h"
|
|
|
|
TSStateId TS_TREE_STATE_INDEPENDENT = USHRT_MAX;
|
|
TSStateId TS_TREE_STATE_ERROR = USHRT_MAX - 1;
|
|
|
|
TSTree *ts_tree_make_leaf(TSSymbol sym, TSLength padding, TSLength size,
|
|
TSSymbolMetadata metadata) {
|
|
TSTree *result = malloc(sizeof(TSTree));
|
|
*result = (TSTree){
|
|
.ref_count = 1,
|
|
.symbol = sym,
|
|
.size = size,
|
|
.child_count = 0,
|
|
.visible_child_count = 0,
|
|
.named_child_count = 0,
|
|
.children = NULL,
|
|
.padding = padding,
|
|
.visible = metadata.visible,
|
|
.named = metadata.named,
|
|
.lex_state = TS_TREE_STATE_INDEPENDENT,
|
|
.parse_state = TS_TREE_STATE_INDEPENDENT,
|
|
};
|
|
|
|
if (sym == ts_builtin_sym_error) {
|
|
result->fragile_left = true;
|
|
result->fragile_right = true;
|
|
}
|
|
|
|
return result;
|
|
}
|
|
|
|
TSTree *ts_tree_make_error(TSLength size, TSLength padding, char lookahead_char) {
|
|
TSTree *result = ts_tree_make_leaf(ts_builtin_sym_error, padding, size,
|
|
(TSSymbolMetadata){
|
|
.visible = true, .named = true,
|
|
});
|
|
result->lookahead_char = lookahead_char;
|
|
return result;
|
|
}
|
|
|
|
TSTree *ts_tree_make_copy(TSTree *self) {
|
|
TSTree *result = malloc(sizeof(TSTree));
|
|
*result = *self;
|
|
return result;
|
|
}
|
|
|
|
void ts_tree_assign_parents(TSTree *self) {
|
|
TSLength offset = ts_length_zero();
|
|
for (size_t i = 0; i < self->child_count; i++) {
|
|
TSTree *child = self->children[i];
|
|
if (child->context.parent != self) {
|
|
child->context.parent = self;
|
|
child->context.index = i;
|
|
child->context.offset = offset;
|
|
ts_tree_assign_parents(child);
|
|
}
|
|
offset = ts_length_add(offset, ts_tree_total_size(child));
|
|
}
|
|
}
|
|
|
|
void ts_tree_set_children(TSTree *self, size_t child_count, TSTree **children) {
|
|
self->children = children;
|
|
self->child_count = child_count;
|
|
self->named_child_count = 0;
|
|
self->visible_child_count = 0;
|
|
for (size_t i = 0; i < child_count; i++) {
|
|
TSTree *child = children[i];
|
|
ts_tree_retain(child);
|
|
|
|
if (i == 0) {
|
|
self->padding = child->padding;
|
|
self->size = child->size;
|
|
} else {
|
|
self->size = ts_length_add(self->size, ts_tree_total_size(child));
|
|
}
|
|
|
|
if (child->visible) {
|
|
self->visible_child_count++;
|
|
if (child->named)
|
|
self->named_child_count++;
|
|
} else {
|
|
self->visible_child_count += child->visible_child_count;
|
|
self->named_child_count += child->named_child_count;
|
|
}
|
|
|
|
if (child->symbol == ts_builtin_sym_error) {
|
|
self->fragile_left = self->fragile_right = true;
|
|
self->parse_state = TS_TREE_STATE_ERROR;
|
|
}
|
|
}
|
|
|
|
if (child_count > 0) {
|
|
self->lex_state = children[0]->lex_state;
|
|
if (children[0]->fragile_left)
|
|
self->fragile_left = true;
|
|
if (children[child_count - 1]->fragile_right)
|
|
self->fragile_right = true;
|
|
}
|
|
}
|
|
|
|
TSTree *ts_tree_make_node(TSSymbol symbol, size_t child_count,
|
|
TSTree **children, TSSymbolMetadata metadata) {
|
|
TSTree *result =
|
|
ts_tree_make_leaf(symbol, ts_length_zero(), ts_length_zero(), metadata);
|
|
ts_tree_set_children(result, child_count, children);
|
|
return result;
|
|
}
|
|
|
|
void ts_tree_retain(TSTree *self) {
|
|
assert(self->ref_count > 0);
|
|
self->ref_count++;
|
|
}
|
|
|
|
void ts_tree_release(TSTree *self) {
|
|
assert(self->ref_count > 0);
|
|
self->ref_count--;
|
|
if (self->ref_count == 0) {
|
|
for (size_t i = 0; i < self->child_count; i++)
|
|
ts_tree_release(self->children[i]);
|
|
if (self->child_count > 0)
|
|
free(self->children);
|
|
free(self);
|
|
}
|
|
}
|
|
|
|
size_t ts_tree_start_column(const TSTree *self) {
|
|
size_t column = self->padding.columns;
|
|
if (self->padding.rows > 0)
|
|
return column;
|
|
for (const TSTree *tree = self; tree != NULL; tree = tree->context.parent) {
|
|
column += tree->context.offset.columns;
|
|
if (tree->context.offset.rows > 0)
|
|
break;
|
|
}
|
|
return column;
|
|
}
|
|
|
|
size_t ts_tree_end_column(const TSTree *self) {
|
|
size_t result = self->size.columns;
|
|
if (self->size.rows == 0)
|
|
result += ts_tree_start_column(self);
|
|
return result;
|
|
}
|
|
|
|
bool ts_tree_eq(const TSTree *self, const TSTree *other) {
|
|
if (self) {
|
|
if (!other)
|
|
return false;
|
|
} else {
|
|
return !other;
|
|
}
|
|
|
|
if (self->symbol != other->symbol)
|
|
return false;
|
|
if (self->visible != other->visible)
|
|
return false;
|
|
if (self->named != other->named)
|
|
return false;
|
|
if (self->symbol == ts_builtin_sym_error)
|
|
return self->lookahead_char == other->lookahead_char;
|
|
if (self->child_count != other->child_count)
|
|
return false;
|
|
if (self->visible_child_count != other->visible_child_count)
|
|
return false;
|
|
if (self->named_child_count != other->named_child_count)
|
|
return false;
|
|
for (size_t i = 0; i < self->child_count; i++)
|
|
if (!ts_tree_eq(self->children[i], other->children[i]))
|
|
return false;
|
|
return true;
|
|
}
|
|
|
|
int ts_tree_compare(const TSTree *left, const TSTree *right) {
|
|
if (left->symbol < right->symbol)
|
|
return -1;
|
|
if (right->symbol < left->symbol)
|
|
return 1;
|
|
if (left->child_count < right->child_count)
|
|
return -1;
|
|
if (right->child_count < left->child_count)
|
|
return 1;
|
|
for (size_t i = 0; i < left->child_count; i++) {
|
|
TSTree *left_child = left->children[i];
|
|
TSTree *right_child = right->children[i];
|
|
switch (ts_tree_compare(left_child, right_child)) {
|
|
case -1:
|
|
return -1;
|
|
case 1:
|
|
return 1;
|
|
default:
|
|
break;
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
static size_t write_lookahead_to_string(char *string, size_t limit,
|
|
char lookahead) {
|
|
switch (lookahead) {
|
|
case '\0':
|
|
return snprintf(string, limit, "<EOF>");
|
|
default:
|
|
return snprintf(string, limit, "'%c'", lookahead);
|
|
}
|
|
}
|
|
|
|
static size_t ts_tree__write_to_string(const TSTree *self,
|
|
const char **symbol_names, char *string,
|
|
size_t limit, bool is_root,
|
|
bool include_anonymous) {
|
|
if (!self)
|
|
return snprintf(string, limit, "(NULL)");
|
|
|
|
char *cursor = string;
|
|
char **writer = (limit > 0) ? &cursor : &string;
|
|
bool visible =
|
|
is_root || (self->visible && (include_anonymous || self->named));
|
|
|
|
if (visible && !is_root)
|
|
cursor += snprintf(*writer, limit, " ");
|
|
|
|
if (visible) {
|
|
if (self->symbol == ts_builtin_sym_error && self->child_count == 0) {
|
|
cursor += snprintf(*writer, limit, "(UNEXPECTED ");
|
|
cursor += write_lookahead_to_string(*writer, limit, self->lookahead_char);
|
|
} else {
|
|
cursor += snprintf(*writer, limit, "(%s", symbol_names[self->symbol]);
|
|
}
|
|
}
|
|
|
|
for (size_t i = 0; i < self->child_count; i++) {
|
|
TSTree *child = self->children[i];
|
|
cursor += ts_tree__write_to_string(child, symbol_names, *writer, limit,
|
|
false, include_anonymous);
|
|
}
|
|
|
|
if (visible)
|
|
cursor += snprintf(*writer, limit, ")");
|
|
|
|
return cursor - string;
|
|
}
|
|
|
|
char *ts_tree_string(const TSTree *self, const char **symbol_names,
|
|
bool include_anonymous) {
|
|
static char SCRATCH[1];
|
|
size_t size = 1 + ts_tree__write_to_string(self, symbol_names, SCRATCH, 0,
|
|
true, include_anonymous);
|
|
char *result = malloc(size * sizeof(char));
|
|
ts_tree__write_to_string(self, symbol_names, result, size, true,
|
|
include_anonymous);
|
|
return result;
|
|
}
|
|
|
|
static inline long min(long a, long b) {
|
|
return a <= b ? a : b;
|
|
}
|
|
|
|
void ts_tree_edit(TSTree *self, TSInputEdit edit) {
|
|
size_t start = edit.position;
|
|
size_t new_end = edit.position + edit.chars_inserted;
|
|
size_t old_end = edit.position + edit.chars_removed;
|
|
assert(old_end <= ts_tree_total_chars(self));
|
|
|
|
self->has_changes = true;
|
|
|
|
if (start < self->padding.chars) {
|
|
ts_length_set_unknown(&self->padding);
|
|
long remaining_padding = self->padding.chars - old_end;
|
|
if (remaining_padding >= 0) {
|
|
self->padding.chars = new_end + remaining_padding;
|
|
} else {
|
|
self->padding.chars = new_end;
|
|
self->size.chars += remaining_padding;
|
|
ts_length_set_unknown(&self->size);
|
|
}
|
|
} else if (start == self->padding.chars && edit.chars_removed == 0) {
|
|
self->padding.chars += edit.chars_inserted;
|
|
ts_length_set_unknown(&self->padding);
|
|
} else {
|
|
self->size.chars += (edit.chars_inserted - edit.chars_removed);
|
|
ts_length_set_unknown(&self->size);
|
|
}
|
|
|
|
bool found_first_child = false;
|
|
long remainder_to_delete = edit.chars_removed - edit.chars_inserted;
|
|
size_t child_left = 0, child_right = 0;
|
|
for (size_t i = 0; i < self->child_count; i++) {
|
|
TSTree *child = self->children[i];
|
|
size_t child_size = ts_tree_total_chars(child);
|
|
child_left = child_right;
|
|
child_right += child_size;
|
|
|
|
if (!found_first_child) {
|
|
if (child_right >= start) {
|
|
found_first_child = true;
|
|
size_t chars_removed = min(edit.chars_removed, child_right - start);
|
|
remainder_to_delete -= (chars_removed - edit.chars_inserted);
|
|
ts_tree_edit(child, (TSInputEdit){
|
|
.position = start - child_left,
|
|
.chars_inserted = edit.chars_inserted,
|
|
.chars_removed = chars_removed,
|
|
});
|
|
}
|
|
} else {
|
|
if (remainder_to_delete > 0) {
|
|
size_t chars_removed = min(remainder_to_delete, child_size);
|
|
remainder_to_delete -= chars_removed;
|
|
ts_tree_edit(
|
|
child,
|
|
(TSInputEdit){
|
|
.position = 0, .chars_inserted = 0, .chars_removed = chars_removed,
|
|
});
|
|
} else {
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|