101 lines
2.6 KiB
C
101 lines
2.6 KiB
C
#ifndef RUNTIME_TREE_H_
|
|
#define RUNTIME_TREE_H_
|
|
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
#include <stdbool.h>
|
|
#include "tree_sitter/parser.h"
|
|
|
|
typedef enum {
|
|
TSTreeOptionsHidden = 1 << 0,
|
|
TSTreeOptionsExtra = 1 << 1,
|
|
TSTreeOptionsSingleton = 1 << 2,
|
|
TSTreeOptionsFragileLeft = 1 << 3,
|
|
TSTreeOptionsFragileRight = 1 << 4,
|
|
} TSTreeOptions;
|
|
|
|
struct TSTree {
|
|
struct {
|
|
struct TSTree *parent;
|
|
size_t index;
|
|
} context;
|
|
size_t child_count;
|
|
size_t visible_child_count;
|
|
union {
|
|
struct TSTree **children;
|
|
char lookahead_char;
|
|
};
|
|
TSLength padding;
|
|
TSLength size;
|
|
TSSymbol symbol;
|
|
TSTreeOptions options;
|
|
unsigned short int ref_count;
|
|
};
|
|
|
|
typedef struct {
|
|
TSTree *tree;
|
|
TSLength offset;
|
|
} TSTreeChild;
|
|
|
|
static inline bool ts_tree_is_extra(const TSTree *tree) {
|
|
return !!(tree->options & TSTreeOptionsExtra);
|
|
}
|
|
|
|
static inline bool ts_tree_is_visible(const TSTree *tree) {
|
|
return !(tree->options & TSTreeOptionsHidden);
|
|
}
|
|
|
|
static inline bool ts_tree_is_singleton(const TSTree *tree) {
|
|
return !!(tree->options & TSTreeOptionsSingleton);
|
|
}
|
|
|
|
static inline void ts_tree_unset_singleton(TSTree *tree) {
|
|
tree->options = (TSTreeOptions)(tree->options & ~TSTreeOptionsSingleton);
|
|
}
|
|
|
|
static inline void ts_tree_set_options(TSTree *tree, TSTreeOptions options) {
|
|
tree->options = (TSTreeOptions)(tree->options | options);
|
|
}
|
|
|
|
static inline void ts_tree_set_extra(TSTree *tree) {
|
|
ts_tree_set_options(tree, TSTreeOptionsExtra);
|
|
}
|
|
|
|
static inline void ts_tree_set_fragile_left(TSTree *tree) {
|
|
ts_tree_set_options(tree, TSTreeOptionsFragileLeft);
|
|
}
|
|
|
|
static inline void ts_tree_set_fragile_right(TSTree *tree) {
|
|
ts_tree_set_options(tree, TSTreeOptionsFragileRight);
|
|
}
|
|
|
|
static inline bool ts_tree_is_fragile_left(TSTree *tree) {
|
|
return tree->options & TSTreeOptionsFragileLeft;
|
|
}
|
|
|
|
static inline bool ts_tree_is_fragile_right(TSTree *tree) {
|
|
return tree->options & TSTreeOptionsFragileRight;
|
|
}
|
|
|
|
TSTree *ts_tree_make_leaf(TSSymbol, TSLength, TSLength, bool);
|
|
TSTree *ts_tree_make_node(TSSymbol, size_t, TSTree **, bool);
|
|
TSTree *ts_tree_make_error(TSLength size, TSLength padding, char lookahead_char);
|
|
void ts_tree_retain(TSTree *tree);
|
|
void ts_tree_release(TSTree *tree);
|
|
bool ts_tree_eq(const TSTree *tree1, const TSTree *tree2);
|
|
char *ts_tree_string(const TSTree *tree, const char **names);
|
|
char *ts_tree_error_string(const TSTree *tree, const char **names);
|
|
TSLength ts_tree_total_size(const TSTree *tree);
|
|
void ts_tree_prepend_children(TSTree *, size_t, TSTree **);
|
|
|
|
static inline bool ts_tree_is_empty(TSTree *tree) {
|
|
return ts_tree_total_size(tree).bytes == 0;
|
|
}
|
|
|
|
#ifdef __cplusplus
|
|
}
|
|
#endif
|
|
|
|
#endif // RUNTIME_TREE_H_
|