mirror of
https://github.com/neovim/neovim.git
synced 2026-03-21 16:09:42 +00:00
marktree.c was originally constructed as a "generic" datatype, to make the prototyping of its internal logic as simple as possible and also as the usecases for various kinds of extmarks/decorations was not yet decided. As a consequence of this, various extra indirections and allocations was needed to use marktree to implement extmarks (ns/id pairs) and decorations of different kinds (some which is just a single highlight id, other an allocated list of virtual text/lines) This change removes a lot of indirection, by making Marktree specialized for the usecase. In particular, the namespace id and mark id is stored directly, instead of the 64-bit global id particular to the Marktree struct. This removes the two maps needed to convert between global and per-ns ids. Also, "small" decorations are stored inline, i.e. those who doesn't refer to external heap memory anyway. That is highlights (with priority+flags) are stored inline, while virtual text, which anyway occurs a lot of heap allocations, do not. (previously a hack was used to elide heap allocations for highlights with standard prio+flags) TODO(bfredl): the functionaltest-lua CI version of gcc is having severe issues with uint16_t bitfields, so splitting up compound assignments and redundant casts are needed. Clean this up once we switch to a working compiler version.
454 lines
13 KiB
C
454 lines
13 KiB
C
// This is an open source non-commercial project. Dear PVS-Studio, please check
|
|
// it. PVS-Studio Static Code Analyzer for C, C++ and C#: http://www.viva64.com
|
|
|
|
#include "nvim/decoration.h"
|
|
#include "nvim/extmark.h"
|
|
#include "nvim/highlight.h"
|
|
#include "nvim/lua/executor.h"
|
|
#include "nvim/screen.h"
|
|
#include "nvim/syntax.h"
|
|
#include "nvim/vim.h"
|
|
|
|
#ifdef INCLUDE_GENERATED_DECLARATIONS
|
|
# include "decoration.c.generated.h"
|
|
#endif
|
|
|
|
/// Add highlighting to a buffer, bounded by two cursor positions,
|
|
/// with an offset.
|
|
///
|
|
/// TODO(bfredl): make decoration powerful enough so that this
|
|
/// can be done with a single ephemeral decoration.
|
|
///
|
|
/// @param buf Buffer to add highlights to
|
|
/// @param src_id src_id to use or 0 to use a new src_id group,
|
|
/// or -1 for ungrouped highlight.
|
|
/// @param hl_id Highlight group id
|
|
/// @param pos_start Cursor position to start the highlighting at
|
|
/// @param pos_end Cursor position to end the highlighting at
|
|
/// @param offset Move the whole highlighting this many columns to the right
|
|
void bufhl_add_hl_pos_offset(buf_T *buf, int src_id, int hl_id, lpos_T pos_start, lpos_T pos_end,
|
|
colnr_T offset)
|
|
{
|
|
colnr_T hl_start = 0;
|
|
colnr_T hl_end = 0;
|
|
Decoration decor = DECORATION_INIT;
|
|
decor.hl_id = hl_id;
|
|
|
|
// TODO(bfredl): if decoration had blocky mode, we could avoid this loop
|
|
for (linenr_T lnum = pos_start.lnum; lnum <= pos_end.lnum; lnum++) {
|
|
int end_off = 0;
|
|
if (pos_start.lnum < lnum && lnum < pos_end.lnum) {
|
|
// TODO(bfredl): This is quite ad-hoc, but the space between |num| and
|
|
// text being highlighted is the indication of \n being part of the
|
|
// substituted text. But it would be more consistent to highlight
|
|
// a space _after_ the previous line instead (like highlight EOL list
|
|
// char)
|
|
hl_start = MAX(offset-1, 0);
|
|
end_off = 1;
|
|
hl_end = 0;
|
|
} else if (lnum == pos_start.lnum && lnum < pos_end.lnum) {
|
|
hl_start = pos_start.col + offset;
|
|
end_off = 1;
|
|
hl_end = 0;
|
|
} else if (pos_start.lnum < lnum && lnum == pos_end.lnum) {
|
|
hl_start = MAX(offset-1, 0);
|
|
hl_end = pos_end.col + offset;
|
|
} else if (pos_start.lnum == lnum && pos_end.lnum == lnum) {
|
|
hl_start = pos_start.col + offset;
|
|
hl_end = pos_end.col + offset;
|
|
}
|
|
extmark_set(buf, (uint32_t)src_id, NULL,
|
|
(int)lnum-1, hl_start, (int)lnum-1+end_off, hl_end,
|
|
&decor, true, false, kExtmarkNoUndo);
|
|
}
|
|
}
|
|
|
|
void decor_redraw(buf_T *buf, int row1, int row2, Decoration *decor)
|
|
{
|
|
if ((!decor || decor->hl_id) && row2 >= row1) {
|
|
redraw_buf_range_later(buf, row1+1, row2+1);
|
|
}
|
|
|
|
if (decor && kv_size(decor->virt_text)) {
|
|
redraw_buf_line_later(buf, row1+1);
|
|
}
|
|
|
|
if (decor && kv_size(decor->virt_lines)) {
|
|
redraw_buf_line_later(buf, MIN(buf->b_ml.ml_line_count,
|
|
row1+1+(decor->virt_lines_above?0:1)));
|
|
}
|
|
}
|
|
|
|
void decor_remove(buf_T *buf, int row, int row2, Decoration *decor)
|
|
{
|
|
decor_redraw(buf, row, row2, decor);
|
|
if (decor && kv_size(decor->virt_lines)) {
|
|
assert(buf->b_virt_line_blocks > 0);
|
|
buf->b_virt_line_blocks--;
|
|
}
|
|
decor_free(decor);
|
|
}
|
|
|
|
void decor_free(Decoration *decor)
|
|
{
|
|
if (decor) {
|
|
clear_virttext(&decor->virt_text);
|
|
for (size_t i = 0; i < kv_size(decor->virt_lines); i++) {
|
|
clear_virttext(&kv_A(decor->virt_lines, i).line);
|
|
}
|
|
kv_destroy(decor->virt_lines);
|
|
xfree(decor);
|
|
}
|
|
}
|
|
|
|
void clear_virttext(VirtText *text)
|
|
{
|
|
for (size_t i = 0; i < kv_size(*text); i++) {
|
|
xfree(kv_A(*text, i).text);
|
|
}
|
|
kv_destroy(*text);
|
|
*text = (VirtText)KV_INITIAL_VALUE;
|
|
}
|
|
|
|
Decoration *decor_find_virttext(buf_T *buf, int row, uint64_t ns_id)
|
|
{
|
|
MarkTreeIter itr[1] = { 0 };
|
|
marktree_itr_get(buf->b_marktree, row, 0, itr);
|
|
while (true) {
|
|
mtkey_t mark = marktree_itr_current(itr);
|
|
if (mark.pos.row < 0 || mark.pos.row > row) {
|
|
break;
|
|
} else if (marktree_decor_level(mark) < kDecorLevelVisible) {
|
|
goto next_mark;
|
|
}
|
|
Decoration *decor = mark.decor_full;
|
|
if ((ns_id == 0 || ns_id == mark.ns)
|
|
&& decor && kv_size(decor->virt_text)) {
|
|
return decor;
|
|
}
|
|
next_mark:
|
|
marktree_itr_next(buf->b_marktree, itr);
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
bool decor_redraw_reset(buf_T *buf, DecorState *state)
|
|
{
|
|
state->row = -1;
|
|
state->buf = buf;
|
|
for (size_t i = 0; i < kv_size(state->active); i++) {
|
|
DecorRange item = kv_A(state->active, i);
|
|
if (item.virt_text_owned) {
|
|
clear_virttext(&item.decor.virt_text);
|
|
}
|
|
}
|
|
kv_size(state->active) = 0;
|
|
return buf->b_marktree->n_keys;
|
|
}
|
|
|
|
Decoration get_decor(mtkey_t mark)
|
|
{
|
|
if (mark.decor_full) {
|
|
return *mark.decor_full;
|
|
} else {
|
|
Decoration fake = DECORATION_INIT;
|
|
fake.hl_id = mark.hl_id;
|
|
fake.priority = mark.priority;
|
|
fake.hl_eol = (mark.flags & MT_FLAG_HL_EOL);
|
|
return fake;
|
|
}
|
|
}
|
|
|
|
|
|
bool decor_redraw_start(buf_T *buf, int top_row, DecorState *state)
|
|
{
|
|
state->top_row = top_row;
|
|
marktree_itr_get(buf->b_marktree, top_row, 0, state->itr);
|
|
if (!state->itr->node) {
|
|
return false;
|
|
}
|
|
marktree_itr_rewind(buf->b_marktree, state->itr);
|
|
while (true) {
|
|
mtkey_t mark = marktree_itr_current(state->itr);
|
|
if (mark.pos.row < 0) { // || mark.row > end_row
|
|
break;
|
|
}
|
|
if ((mark.pos.row < top_row && mt_end(mark))
|
|
|| marktree_decor_level(mark) < kDecorLevelVisible) {
|
|
goto next_mark;
|
|
}
|
|
|
|
Decoration decor = get_decor(mark);
|
|
|
|
mtpos_t altpos = marktree_get_altpos(buf->b_marktree, mark, NULL);
|
|
|
|
if ((!mt_end(mark) && altpos.row < top_row
|
|
&& !kv_size(decor.virt_text))
|
|
|| (mt_end(mark) && altpos.row >= top_row)) {
|
|
goto next_mark;
|
|
}
|
|
|
|
if (mt_end(mark)) {
|
|
decor_add(state, altpos.row, altpos.col, mark.pos.row, mark.pos.col,
|
|
&decor, false);
|
|
} else {
|
|
if (altpos.row == -1) {
|
|
altpos.row = mark.pos.row;
|
|
altpos.col = mark.pos.col;
|
|
}
|
|
decor_add(state, mark.pos.row, mark.pos.col, altpos.row, altpos.col,
|
|
&decor, false);
|
|
}
|
|
|
|
next_mark:
|
|
if (marktree_itr_node_done(state->itr)) {
|
|
marktree_itr_next(buf->b_marktree, state->itr);
|
|
break;
|
|
}
|
|
marktree_itr_next(buf->b_marktree, state->itr);
|
|
}
|
|
|
|
return true; // TODO(bfredl): check if available in the region
|
|
}
|
|
|
|
bool decor_redraw_line(buf_T *buf, int row, DecorState *state)
|
|
{
|
|
if (state->row == -1) {
|
|
decor_redraw_start(buf, row, state);
|
|
}
|
|
state->row = row;
|
|
state->col_until = -1;
|
|
state->eol_col = -1;
|
|
return true; // TODO(bfredl): be more precise
|
|
}
|
|
|
|
static void decor_add(DecorState *state, int start_row, int start_col, int end_row, int end_col,
|
|
Decoration *decor, bool owned)
|
|
{
|
|
int attr_id = decor->hl_id > 0 ? syn_id2attr(decor->hl_id) : 0;
|
|
|
|
DecorRange range = { start_row, start_col, end_row, end_col,
|
|
*decor, attr_id,
|
|
kv_size(decor->virt_text) && owned, -1 };
|
|
|
|
kv_pushp(state->active);
|
|
size_t index;
|
|
for (index = kv_size(state->active)-1; index > 0; index--) {
|
|
DecorRange item = kv_A(state->active, index-1);
|
|
if (item.decor.priority <= range.decor.priority) {
|
|
break;
|
|
}
|
|
kv_A(state->active, index) = kv_A(state->active, index-1);
|
|
}
|
|
kv_A(state->active, index) = range;
|
|
}
|
|
|
|
int decor_redraw_col(buf_T *buf, int col, int win_col, bool hidden, DecorState *state)
|
|
{
|
|
if (col <= state->col_until) {
|
|
return state->current;
|
|
}
|
|
state->col_until = MAXCOL;
|
|
while (true) {
|
|
// TODO(bfredl): check duplicate entry in "intersection"
|
|
// branch
|
|
mtkey_t mark = marktree_itr_current(state->itr);
|
|
if (mark.pos.row < 0 || mark.pos.row > state->row) {
|
|
break;
|
|
} else if (mark.pos.row == state->row && mark.pos.col > col) {
|
|
state->col_until = mark.pos.col-1;
|
|
break;
|
|
}
|
|
|
|
if (mt_end(mark)
|
|
|| marktree_decor_level(mark) < kDecorLevelVisible) {
|
|
goto next_mark;
|
|
}
|
|
|
|
Decoration decor = get_decor(mark);
|
|
|
|
mtpos_t endpos = marktree_get_altpos(buf->b_marktree, mark, NULL);
|
|
|
|
if (endpos.row == -1) {
|
|
endpos = mark.pos;
|
|
}
|
|
|
|
if (endpos.row < mark.pos.row
|
|
|| (endpos.row == mark.pos.row && endpos.col <= mark.pos.col)) {
|
|
if (!kv_size(decor.virt_text)) {
|
|
goto next_mark;
|
|
}
|
|
}
|
|
|
|
decor_add(state, mark.pos.row, mark.pos.col, endpos.row, endpos.col,
|
|
&decor, false);
|
|
|
|
next_mark:
|
|
marktree_itr_next(buf->b_marktree, state->itr);
|
|
}
|
|
|
|
int attr = 0;
|
|
size_t j = 0;
|
|
for (size_t i = 0; i < kv_size(state->active); i++) {
|
|
DecorRange item = kv_A(state->active, i);
|
|
bool active = false, keep = true;
|
|
if (item.end_row < state->row
|
|
|| (item.end_row == state->row && item.end_col <= col)) {
|
|
if (!(item.start_row >= state->row && kv_size(item.decor.virt_text))) {
|
|
keep = false;
|
|
}
|
|
} else {
|
|
if (item.start_row < state->row
|
|
|| (item.start_row == state->row && item.start_col <= col)) {
|
|
active = true;
|
|
if (item.end_row == state->row && item.end_col > col) {
|
|
state->col_until = MIN(state->col_until, item.end_col-1);
|
|
}
|
|
} else {
|
|
if (item.start_row == state->row) {
|
|
state->col_until = MIN(state->col_until, item.start_col-1);
|
|
}
|
|
}
|
|
}
|
|
if (active && item.attr_id > 0) {
|
|
attr = hl_combine_attr(attr, item.attr_id);
|
|
}
|
|
if ((item.start_row == state->row && item.start_col <= col)
|
|
&& kv_size(item.decor.virt_text)
|
|
&& item.decor.virt_text_pos == kVTOverlay && item.win_col == -1) {
|
|
item.win_col = (item.decor.virt_text_hide && hidden) ? -2 : win_col;
|
|
}
|
|
if (keep) {
|
|
kv_A(state->active, j++) = item;
|
|
} else if (item.virt_text_owned) {
|
|
clear_virttext(&item.decor.virt_text);
|
|
}
|
|
}
|
|
kv_size(state->active) = j;
|
|
state->current = attr;
|
|
return attr;
|
|
}
|
|
|
|
void decor_redraw_end(DecorState *state)
|
|
{
|
|
state->buf = NULL;
|
|
}
|
|
|
|
bool decor_redraw_eol(buf_T *buf, DecorState *state, int *eol_attr, int eol_col)
|
|
{
|
|
decor_redraw_col(buf, MAXCOL, MAXCOL, false, state);
|
|
state->eol_col = eol_col;
|
|
bool has_virttext = false;
|
|
for (size_t i = 0; i < kv_size(state->active); i++) {
|
|
DecorRange item = kv_A(state->active, i);
|
|
if (item.start_row == state->row && kv_size(item.decor.virt_text)) {
|
|
has_virttext = true;
|
|
}
|
|
|
|
if (item.decor.hl_eol && item.start_row <= state->row) {
|
|
*eol_attr = hl_combine_attr(*eol_attr, item.attr_id);
|
|
}
|
|
}
|
|
return has_virttext;
|
|
}
|
|
|
|
void decor_add_ephemeral(int start_row, int start_col, int end_row, int end_col, Decoration *decor)
|
|
{
|
|
if (end_row == -1) {
|
|
end_row = start_row;
|
|
end_col = start_col;
|
|
}
|
|
decor_add(&decor_state, start_row, start_col, end_row, end_col, decor, true);
|
|
}
|
|
|
|
|
|
DecorProvider *get_decor_provider(NS ns_id, bool force)
|
|
{
|
|
size_t i;
|
|
size_t len = kv_size(decor_providers);
|
|
for (i = 0; i < len; i++) {
|
|
DecorProvider *item = &kv_A(decor_providers, i);
|
|
if (item->ns_id == ns_id) {
|
|
return item;
|
|
} else if (item->ns_id > ns_id) {
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (!force) {
|
|
return NULL;
|
|
}
|
|
|
|
// Adding a new provider, so allocate room in the vector
|
|
(void)kv_a(decor_providers, len);
|
|
if (i < len) {
|
|
// New ns_id needs to be inserted between existing providers to maintain
|
|
// ordering, so shift other providers with larger ns_id
|
|
memmove(&kv_A(decor_providers, i + 1),
|
|
&kv_A(decor_providers, i),
|
|
(len - i) * sizeof(kv_a(decor_providers, i)));
|
|
}
|
|
DecorProvider *item = &kv_a(decor_providers, i);
|
|
*item = DECORATION_PROVIDER_INIT(ns_id);
|
|
|
|
return item;
|
|
}
|
|
|
|
void decor_provider_clear(DecorProvider *p)
|
|
{
|
|
if (p == NULL) {
|
|
return;
|
|
}
|
|
NLUA_CLEAR_REF(p->redraw_start);
|
|
NLUA_CLEAR_REF(p->redraw_buf);
|
|
NLUA_CLEAR_REF(p->redraw_win);
|
|
NLUA_CLEAR_REF(p->redraw_line);
|
|
NLUA_CLEAR_REF(p->redraw_end);
|
|
p->active = false;
|
|
}
|
|
|
|
void decor_free_all_mem(void)
|
|
{
|
|
for (size_t i = 0; i < kv_size(decor_providers); i++) {
|
|
decor_provider_clear(&kv_A(decor_providers, i));
|
|
}
|
|
kv_destroy(decor_providers);
|
|
}
|
|
|
|
|
|
int decor_virt_lines(win_T *wp, linenr_T lnum, VirtLines *lines)
|
|
{
|
|
buf_T *buf = wp->w_buffer;
|
|
if (!buf->b_virt_line_blocks) {
|
|
// Only pay for what you use: in case virt_lines feature is not active
|
|
// in a buffer, plines do not need to access the marktree at all
|
|
return 0;
|
|
}
|
|
|
|
int virt_lines = 0;
|
|
int row = (int)MAX(lnum - 2, 0);
|
|
int end_row = (int)lnum;
|
|
MarkTreeIter itr[1] = { 0 };
|
|
marktree_itr_get(buf->b_marktree, row, 0, itr);
|
|
while (true) {
|
|
mtkey_t mark = marktree_itr_current(itr);
|
|
if (mark.pos.row < 0 || mark.pos.row >= end_row) {
|
|
break;
|
|
} else if (marktree_decor_level(mark) < kDecorLevelVirtLine) {
|
|
goto next_mark;
|
|
}
|
|
bool above = mark.pos.row > (int)(lnum - 2);
|
|
Decoration *decor = mark.decor_full;
|
|
if (decor && decor->virt_lines_above == above) {
|
|
virt_lines += (int)kv_size(decor->virt_lines);
|
|
if (lines) {
|
|
kv_splice(*lines, decor->virt_lines);
|
|
}
|
|
}
|
|
next_mark:
|
|
marktree_itr_next(buf->b_marktree, itr);
|
|
}
|
|
|
|
return virt_lines;
|
|
}
|