#include "../include/ts.h" #include "../include/editor.h" #include "../include/knot.h" #include #include #include #include #include std::unordered_map regex_cache; void clear_regex_cache() { for (auto &kv : regex_cache) { pcre2_code_free(kv.second); } regex_cache.clear(); } pcre2_code *get_re(const std::string &pattern) { auto it = regex_cache.find(pattern); if (it != regex_cache.end()) return it->second; int errornum; PCRE2_SIZE erroffset; pcre2_code *re = pcre2_compile((PCRE2_SPTR)pattern.c_str(), PCRE2_ZERO_TERMINATED, 0, &errornum, &erroffset, nullptr); regex_cache[pattern] = re; return re; } TSQuery *load_query(const char *query_path, Editor *editor) { const TSLanguage *lang = editor->language; std::ifstream file(query_path, std::ios::in | std::ios::binary); if (!file.is_open()) return nullptr; std::string highlight_query((std::istreambuf_iterator(file)), std::istreambuf_iterator()); int errornumber = 0; PCRE2_SIZE erroroffset = 0; pcre2_code *re = pcre2_compile( (PCRE2_SPTR) R"((@[A-Za-z0-9_.]+)|(;; \#[0-9a-fA-F]{6} \#[0-9a-fA-F]{6} [01] [01] [01] \d+))", PCRE2_ZERO_TERMINATED, 0, &errornumber, &erroroffset, nullptr); if (!re) return nullptr; pcre2_match_data *match_data = pcre2_match_data_create_from_pattern(re, nullptr); std::map capture_name_cache; Highlight *c_hl = nullptr; int i = 0; int limit = 20; editor->query_map.resize(limit); PCRE2_SIZE offset = 0; PCRE2_SIZE subject_length = highlight_query.size(); while (offset < subject_length) { int rc = pcre2_match(re, (PCRE2_SPTR)highlight_query.c_str(), subject_length, offset, 0, match_data, nullptr); if (rc <= 0) break; PCRE2_SIZE *ovector = pcre2_get_ovector_pointer(match_data); std::string mct = highlight_query.substr(ovector[0], ovector[1] - ovector[0]); if (!mct.empty() && mct[0] == '@') { std::string capture_name = mct; if (!capture_name_cache.count(capture_name)) { if (c_hl) { if (i >= limit) { limit += 20; editor->query_map.resize(limit); } editor->query_map[i] = *c_hl; delete c_hl; c_hl = nullptr; } capture_name_cache[capture_name] = i; i++; } } else if (mct.size() >= 2 && mct[0] == ';' && mct[1] == ';') { if (c_hl) delete c_hl; c_hl = new Highlight(); c_hl->fg = HEX(mct.substr(4, 6)); c_hl->bg = HEX(mct.substr(12, 6)); int bold = std::stoi(mct.substr(19, 1)); int italic = std::stoi(mct.substr(21, 1)); int underline = std::stoi(mct.substr(23, 1)); c_hl->priority = std::stoi(mct.substr(25)); c_hl->flags = (bold ? CF_BOLD : 0) | (italic ? CF_ITALIC : 0) | (underline ? CF_UNDERLINE : 0); } offset = ovector[1]; } if (c_hl) delete c_hl; pcre2_match_data_free(match_data); pcre2_code_free(re); uint32_t error_offset = 0; TSQueryError error_type = (TSQueryError)0; TSQuery *q = ts_query_new(lang, highlight_query.c_str(), (uint32_t)highlight_query.length(), &error_offset, &error_type); return q; } static inline const TSNode *find_capture_node(const TSQueryMatch &match, uint32_t capture_id) { for (uint32_t i = 0; i < match.capture_count; i++) if (match.captures[i].index == capture_id) return &match.captures[i].node; return nullptr; } static inline std::string node_text(const TSNode &node, Knot *source) { uint32_t start = ts_node_start_byte(node); uint32_t end = ts_node_end_byte(node); char *text = read(source, start, end - start); std::string final = std::string(text, end - start); free(text); return final; } static inline bool ts_predicate(TSQuery *query, const TSQueryMatch &match, Knot *source) { uint32_t step_count; const TSQueryPredicateStep *steps = ts_query_predicates_for_pattern(query, match.pattern_index, &step_count); if (!steps || step_count != 4) return true; if (source->char_count >= (1024 * 64)) return false; std::string command; std::string regex_txt; uint32_t subject_id = 0; for (uint32_t i = 0; i < step_count; i++) { const TSQueryPredicateStep *step = &steps[i]; if (step->type == TSQueryPredicateStepTypeDone) break; switch (step->type) { case TSQueryPredicateStepTypeString: { uint32_t length = 0; const char *s = ts_query_string_value_for_id(query, step->value_id, &length); if (i == 0) command.assign(s, length); else regex_txt.assign(s, length); break; } case TSQueryPredicateStepTypeCapture: { subject_id = step->value_id; break; } case TSQueryPredicateStepTypeDone: break; } } const TSNode *node = find_capture_node(match, subject_id); std::string subject = node_text(*node, source); pcre2_code *re = get_re(regex_txt); pcre2_match_data *md = pcre2_match_data_create_from_pattern(re, nullptr); int rc = pcre2_match(re, (PCRE2_SPTR)subject.c_str(), subject.size(), 0, 0, md, nullptr); pcre2_match_data_free(md); bool ok = (rc >= 0); return (command == "match?" ? ok : !ok); } const char *read_ts(void *payload, uint32_t byte_index, TSPoint, uint32_t *bytes_read) { if (!running) { *bytes_read = 0; return ""; } Editor *editor = (Editor *)payload; if (byte_index >= editor->root->char_count) { *bytes_read = 0; return ""; } return leaf_from_offset(editor->root, byte_index, bytes_read); } static inline Highlight *safe_get(std::vector &vec, size_t index) { if (index >= vec.size()) return nullptr; return &vec[index]; } void ts_collect_spans(Editor *editor) { static int parse_counter = 0; if (!editor->parser || !editor->root || !editor->query) return; TSInput tsinput = { .payload = editor, .read = read_ts, .encoding = TSInputEncodingUTF8, .decode = nullptr, }; TSTree *tree, *copy = nullptr; std::unique_lock knot_mtx(editor->knot_mtx); if (editor->tree) copy = ts_tree_copy(editor->tree); knot_mtx.unlock(); if (!running) return; std::vector edits; TSInputEdit edit; if (copy) while (editor->edit_queue.pop(edit)) { edits.push_back(edit); ts_tree_edit(copy, &edits.back()); }; if (copy && edits.empty() && parse_counter < 64) { parse_counter++; ts_tree_delete(copy); return; } parse_counter = 0; editor->spans.mid_parse = true; std::shared_lock lock(editor->knot_mtx); tree = ts_parser_parse(editor->parser, copy, tsinput); lock.unlock(); if (copy) ts_tree_delete(copy); knot_mtx.lock(); if (editor->tree) ts_tree_delete(editor->tree); editor->tree = tree; copy = ts_tree_copy(tree); knot_mtx.unlock(); TSQueryCursor *cursor = ts_query_cursor_new(); ts_query_cursor_exec(cursor, editor->query, ts_tree_root_node(copy)); std::vector new_spans; new_spans.reserve(4096); TSQueryMatch match; while (ts_query_cursor_next_match(cursor, &match)) { if (!running) break; if (!ts_predicate(editor->query, match, editor->root)) continue; for (uint32_t i = 0; i < match.capture_count; i++) { if (!running) break; TSQueryCapture cap = match.captures[i]; uint32_t start = ts_node_start_byte(cap.node); uint32_t end = ts_node_end_byte(cap.node); Highlight *hl = safe_get(editor->query_map, cap.index); if (hl) new_spans.push_back({start, end, hl}); } } ts_query_cursor_delete(cursor); ts_tree_delete(copy); if (!running) return; std::sort(new_spans.begin(), new_spans.end()); std::pair span_edit; while (editor->spans.edits.pop(span_edit)) apply_edit(new_spans, span_edit.first, span_edit.second); std::unique_lock span_mtx(editor->spans.mtx); editor->spans.mid_parse = false; editor->spans.spans.swap(new_spans); span_mtx.unlock(); }