2019-06-17 19:33:10 +02:00
|
|
|
#include "grid.h"
|
|
|
|
|
|
2020-02-15 22:19:08 +01:00
|
|
|
#include <string.h>
|
2019-06-17 21:15:20 +02:00
|
|
|
#include <assert.h>
|
|
|
|
|
|
2019-06-19 10:27:31 +02:00
|
|
|
#define LOG_MODULE "grid"
|
2019-07-03 20:21:03 +02:00
|
|
|
#define LOG_ENABLE_DBG 0
|
2019-06-19 10:27:31 +02:00
|
|
|
#include "log.h"
|
2020-09-24 18:53:05 +02:00
|
|
|
#include "macros.h"
|
2020-03-13 18:44:23 +01:00
|
|
|
#include "sixel.h"
|
2020-05-01 11:46:24 +02:00
|
|
|
#include "util.h"
|
2020-08-08 20:34:30 +01:00
|
|
|
#include "xmalloc.h"
|
2020-02-15 22:19:08 +01:00
|
|
|
|
2019-07-01 12:23:38 +02:00
|
|
|
void
|
2020-05-16 23:43:05 +02:00
|
|
|
grid_swap_row(struct grid *grid, int row_a, int row_b)
|
2019-07-01 12:23:38 +02:00
|
|
|
{
|
2019-07-10 16:08:53 +02:00
|
|
|
assert(grid->offset >= 0);
|
|
|
|
|
assert(row_a != row_b);
|
2019-07-01 19:18:52 +02:00
|
|
|
|
2019-08-22 17:33:23 +02:00
|
|
|
int real_a = (grid->offset + row_a) & (grid->num_rows - 1);
|
|
|
|
|
int real_b = (grid->offset + row_b) & (grid->num_rows - 1);
|
|
|
|
|
|
|
|
|
|
struct row *a = grid->rows[real_a];
|
|
|
|
|
struct row *b = grid->rows[real_b];
|
2019-08-23 20:07:27 +02:00
|
|
|
|
2019-08-22 17:33:23 +02:00
|
|
|
grid->rows[real_a] = b;
|
|
|
|
|
grid->rows[real_b] = a;
|
2019-07-01 19:18:52 +02:00
|
|
|
}
|
2019-07-10 16:27:55 +02:00
|
|
|
|
|
|
|
|
struct row *
|
2019-08-22 17:33:23 +02:00
|
|
|
grid_row_alloc(int cols, bool initialize)
|
2019-07-10 16:27:55 +02:00
|
|
|
{
|
2020-08-08 20:34:30 +01:00
|
|
|
struct row *row = xmalloc(sizeof(*row));
|
2019-08-22 17:33:23 +02:00
|
|
|
row->dirty = false;
|
2020-02-14 22:39:26 +01:00
|
|
|
row->linebreak = false;
|
2019-08-22 17:33:23 +02:00
|
|
|
|
|
|
|
|
if (initialize) {
|
2020-08-08 20:34:30 +01:00
|
|
|
row->cells = xcalloc(cols, sizeof(row->cells[0]));
|
2019-08-22 17:33:23 +02:00
|
|
|
for (size_t c = 0; c < cols; c++)
|
|
|
|
|
row->cells[c].attrs.clean = 1;
|
unicode-combining: store seen combining chains "globally" in the term struct
Instead of storing combining data per cell, realize that most
combinations are re-occurring and that there's lots of available space
left in the unicode range, and store seen base+combining combinations
chains in a per-terminal array.
When we encounter a combining character, we first try to pre-compose,
like before. If that fails, we then search for the current
base+combining combo in the list of previously seen combinations. If
not found there either, we allocate a new combo and add it to the
list. Regardless, the result is an index into this array. We store
this index, offsetted by COMB_CHARS_LO=0x40000000ul in the cell.
When rendering, we need to check if the cell character is a plain
character, or if it's a composed character (identified by checking if
the cell character is >= COMB_CHARS_LO).
Then we render the grapheme pretty much like before.
2020-05-03 11:03:22 +02:00
|
|
|
} else
|
2020-08-08 20:34:30 +01:00
|
|
|
row->cells = xmalloc(cols * sizeof(row->cells[0]));
|
2019-08-22 17:33:23 +02:00
|
|
|
|
2019-07-10 16:27:55 +02:00
|
|
|
return row;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
grid_row_free(struct row *row)
|
|
|
|
|
{
|
|
|
|
|
if (row == NULL)
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
free(row->cells);
|
|
|
|
|
free(row);
|
|
|
|
|
}
|
2020-02-15 22:19:08 +01:00
|
|
|
|
2020-04-16 19:38:30 +02:00
|
|
|
void
|
resize: don’t reflow text on alt screen
Alt screen applications normally reflow/readjust themselves on a
window resize.
When we do it too, the result is graphical glitches/flashes since our
re-flowed text is rendered in one frame, and the application re-flowed
text soon thereafter.
We can’t avoid rendering some kind of re-flowed frame, since we don’t
know when, or even if, the application will update itself. To avoid
glitches, we need to render, as closely as possible, what the
application itself will render shortly.
This is actually pretty simple; we just need to copy the visible
content over from the old grid to the new grid. We don’t bother with
text re-flow, but simply truncate long lines.
To simplify things, we simply cancel any active selection (since often
times, it will be corrupted anyway when the application redraws
itself).
Since we’re not reflowing text, there’s no need to translate e.g. the
cursor position - we just keep the current position (but bounded to
the new dimensions).
Fun thing: ‘less’ gets corrupted if we don’t leave the cursor at
the (new) bottom row. To handle this, we check if the cursor (before
resize) is at the bottom row, and if so, we move it to the new bottom
row.
Closes #221
2020-11-24 19:00:57 +01:00
|
|
|
grid_resize_without_reflow(
|
|
|
|
|
struct grid *grid, int new_rows, int new_cols,
|
|
|
|
|
int old_screen_rows, int new_screen_rows)
|
|
|
|
|
{
|
|
|
|
|
struct row *const *old_grid = grid->rows;
|
|
|
|
|
const int old_rows = grid->num_rows;
|
|
|
|
|
const int old_cols = grid->num_cols;
|
|
|
|
|
|
|
|
|
|
struct row **new_grid = xcalloc(new_rows, sizeof(new_grid[0]));
|
|
|
|
|
|
|
|
|
|
tll(struct sixel) untranslated_sixels = tll_init();
|
|
|
|
|
tll_foreach(grid->sixel_images, it)
|
|
|
|
|
tll_push_back(untranslated_sixels, it->item);
|
|
|
|
|
tll_free(grid->sixel_images);
|
|
|
|
|
|
|
|
|
|
int new_offset = 0;
|
|
|
|
|
|
|
|
|
|
/* Copy old lines, truncating them if old rows were longer */
|
2020-11-25 20:33:07 +01:00
|
|
|
for (int r = 0, n = min(old_screen_rows, new_screen_rows); r < n; r++) {
|
resize: don’t reflow text on alt screen
Alt screen applications normally reflow/readjust themselves on a
window resize.
When we do it too, the result is graphical glitches/flashes since our
re-flowed text is rendered in one frame, and the application re-flowed
text soon thereafter.
We can’t avoid rendering some kind of re-flowed frame, since we don’t
know when, or even if, the application will update itself. To avoid
glitches, we need to render, as closely as possible, what the
application itself will render shortly.
This is actually pretty simple; we just need to copy the visible
content over from the old grid to the new grid. We don’t bother with
text re-flow, but simply truncate long lines.
To simplify things, we simply cancel any active selection (since often
times, it will be corrupted anyway when the application redraws
itself).
Since we’re not reflowing text, there’s no need to translate e.g. the
cursor position - we just keep the current position (but bounded to
the new dimensions).
Fun thing: ‘less’ gets corrupted if we don’t leave the cursor at
the (new) bottom row. To handle this, we check if the cursor (before
resize) is at the bottom row, and if so, we move it to the new bottom
row.
Closes #221
2020-11-24 19:00:57 +01:00
|
|
|
const int old_row_idx = (grid->offset + r) & (old_rows - 1);
|
|
|
|
|
const int new_row_idx = (new_offset + r) & (new_rows - 1);
|
|
|
|
|
|
|
|
|
|
const struct row *old_row = old_grid[old_row_idx];
|
|
|
|
|
assert(old_row != NULL);
|
|
|
|
|
|
|
|
|
|
struct row *new_row = grid_row_alloc(new_cols, false);
|
|
|
|
|
new_grid[new_row_idx] = new_row;
|
|
|
|
|
|
|
|
|
|
memcpy(new_row->cells,
|
|
|
|
|
old_row->cells,
|
|
|
|
|
sizeof(struct cell) * min(old_cols, new_cols));
|
|
|
|
|
|
|
|
|
|
new_row->dirty = old_row->dirty;
|
|
|
|
|
new_row->linebreak = false;
|
|
|
|
|
|
|
|
|
|
/* Clear "new" columns */
|
|
|
|
|
if (new_cols > old_cols) {
|
|
|
|
|
memset(&new_row->cells[old_cols], 0,
|
|
|
|
|
sizeof(struct cell) * (new_cols - old_cols));
|
|
|
|
|
new_row->dirty = true;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Map sixels on current "old" row to current "new row" */
|
|
|
|
|
tll_foreach(untranslated_sixels, it) {
|
|
|
|
|
if (it->item.pos.row != old_row_idx)
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
struct sixel sixel = it->item;
|
|
|
|
|
sixel.pos.row = new_row_idx;
|
|
|
|
|
|
|
|
|
|
if (sixel.pos.col < new_cols)
|
|
|
|
|
tll_push_back(grid->sixel_images, sixel);
|
|
|
|
|
else
|
|
|
|
|
sixel_destroy(&it->item);
|
|
|
|
|
tll_remove(untranslated_sixels, it);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Clear "new" lines */
|
|
|
|
|
for (int r = min(old_screen_rows, new_screen_rows); r < new_screen_rows; r++) {
|
|
|
|
|
struct row *new_row = grid_row_alloc(new_cols, false);
|
|
|
|
|
new_grid[(new_offset + r) & (new_rows - 1)] = new_row;
|
|
|
|
|
|
|
|
|
|
memset(new_row->cells, 0, sizeof(struct cell) * new_cols);
|
|
|
|
|
new_row->linebreak = false;
|
|
|
|
|
new_row->dirty = true;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Free old grid */
|
|
|
|
|
for (int r = 0; r < grid->num_rows; r++)
|
|
|
|
|
grid_row_free(old_grid[r]);
|
|
|
|
|
free(grid->rows);
|
|
|
|
|
|
|
|
|
|
grid->rows = new_grid;
|
|
|
|
|
grid->num_rows = new_rows;
|
|
|
|
|
grid->num_cols = new_cols;
|
|
|
|
|
|
|
|
|
|
grid->view = grid->offset = new_offset;
|
|
|
|
|
|
|
|
|
|
/* Keep cursor at current position, but clamp to new dimensions */
|
|
|
|
|
struct coord cursor = grid->cursor.point;
|
|
|
|
|
if (cursor.row == old_screen_rows - 1) {
|
|
|
|
|
/* 'less' breaks if the cursor isn't at the bottom */
|
|
|
|
|
cursor.row = new_screen_rows - 1;
|
|
|
|
|
}
|
|
|
|
|
cursor.row = min(cursor.row, new_screen_rows - 1);
|
|
|
|
|
cursor.col = min(cursor.col, new_cols - 1);
|
|
|
|
|
grid->cursor.point = cursor;
|
|
|
|
|
|
|
|
|
|
struct coord saved_cursor = grid->saved_cursor.point;
|
|
|
|
|
if (saved_cursor.row == old_screen_rows - 1)
|
|
|
|
|
saved_cursor.row = new_screen_rows - 1;
|
|
|
|
|
saved_cursor.row = min(saved_cursor.row, new_screen_rows - 1);
|
|
|
|
|
saved_cursor.col = min(saved_cursor.col, new_cols - 1);
|
|
|
|
|
grid->saved_cursor.point = saved_cursor;
|
|
|
|
|
|
|
|
|
|
grid->cur_row = new_grid[(grid->offset + cursor.row) & (new_rows - 1)];
|
|
|
|
|
grid->cursor.lcf = false;
|
|
|
|
|
grid->saved_cursor.lcf = false;
|
|
|
|
|
|
|
|
|
|
/* Free sixels we failed to "map" to the new grid */
|
|
|
|
|
tll_foreach(untranslated_sixels, it)
|
|
|
|
|
sixel_destroy(&it->item);
|
|
|
|
|
tll_free(untranslated_sixels);
|
|
|
|
|
|
|
|
|
|
#if defined(_DEBUG)
|
|
|
|
|
for (int r = 0; r < new_screen_rows; r++)
|
|
|
|
|
grid_row_in_view(grid, r);
|
|
|
|
|
#endif
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
grid_resize_and_reflow(
|
|
|
|
|
struct grid *grid, int new_rows, int new_cols,
|
|
|
|
|
int old_screen_rows, int new_screen_rows,
|
|
|
|
|
size_t tracking_points_count,
|
|
|
|
|
struct coord *const _tracking_points[static tracking_points_count],
|
|
|
|
|
size_t compose_count, const struct
|
|
|
|
|
composed composed[static compose_count])
|
2020-02-15 22:19:08 +01:00
|
|
|
{
|
|
|
|
|
struct row *const *old_grid = grid->rows;
|
|
|
|
|
const int old_rows = grid->num_rows;
|
|
|
|
|
const int old_cols = grid->num_cols;
|
|
|
|
|
|
2020-09-24 18:35:40 +02:00
|
|
|
/* Is viewpoint tracking current grid offset? */
|
|
|
|
|
const bool view_follows = grid->view == grid->offset;
|
|
|
|
|
|
2020-02-15 22:19:08 +01:00
|
|
|
int new_col_idx = 0;
|
|
|
|
|
int new_row_idx = 0;
|
|
|
|
|
|
2020-08-08 20:34:30 +01:00
|
|
|
struct row **new_grid = xcalloc(new_rows, sizeof(new_grid[0]));
|
2020-02-15 22:19:08 +01:00
|
|
|
struct row *new_row = new_grid[new_row_idx];
|
|
|
|
|
|
|
|
|
|
assert(new_row == NULL);
|
|
|
|
|
new_row = grid_row_alloc(new_cols, true);
|
|
|
|
|
new_grid[new_row_idx] = new_row;
|
|
|
|
|
|
|
|
|
|
/* Start at the beginning of the old grid's scrollback. That is,
|
|
|
|
|
* at the output that is *oldest* */
|
|
|
|
|
int offset = grid->offset + old_screen_rows;
|
|
|
|
|
|
2020-10-03 23:00:34 +02:00
|
|
|
tll(struct sixel) untranslated_sixels = tll_init();
|
2020-06-29 21:59:40 +02:00
|
|
|
tll_foreach(grid->sixel_images, it)
|
2020-10-03 23:00:34 +02:00
|
|
|
tll_push_back(untranslated_sixels, it->item);
|
2020-06-29 21:59:40 +02:00
|
|
|
tll_free(grid->sixel_images);
|
2020-03-13 18:44:23 +01:00
|
|
|
|
2020-04-16 19:38:30 +02:00
|
|
|
/* Turn cursor coordinates into grid absolute coordinates */
|
|
|
|
|
struct coord cursor = grid->cursor.point;
|
|
|
|
|
cursor.row += grid->offset;
|
|
|
|
|
cursor.row &= old_rows - 1;
|
|
|
|
|
|
|
|
|
|
struct coord saved_cursor = grid->saved_cursor.point;
|
|
|
|
|
saved_cursor.row += grid->offset;
|
|
|
|
|
saved_cursor.row &= old_rows - 1;
|
|
|
|
|
|
2020-04-17 21:00:37 +02:00
|
|
|
tll(struct coord *) tracking_points = tll_init();
|
|
|
|
|
tll_push_back(tracking_points, &cursor);
|
|
|
|
|
tll_push_back(tracking_points, &saved_cursor);
|
|
|
|
|
|
2020-09-24 18:35:40 +02:00
|
|
|
struct coord viewport = {0, grid->view};
|
|
|
|
|
if (!view_follows)
|
|
|
|
|
tll_push_back(tracking_points, &viewport);
|
|
|
|
|
|
2020-04-17 21:04:32 +02:00
|
|
|
for (size_t i = 0; i < tracking_points_count; i++)
|
|
|
|
|
tll_push_back(tracking_points, _tracking_points[i]);
|
|
|
|
|
|
2020-02-15 22:19:08 +01:00
|
|
|
/*
|
|
|
|
|
* Walk the old grid
|
|
|
|
|
*/
|
|
|
|
|
for (int r = 0; r < old_rows; r++) {
|
|
|
|
|
|
2020-04-16 19:38:30 +02:00
|
|
|
const size_t old_row_idx = (offset + r) & (old_rows - 1);
|
|
|
|
|
|
2020-02-15 22:19:08 +01:00
|
|
|
/* Unallocated (empty) rows we can simply skip */
|
2020-04-16 19:38:30 +02:00
|
|
|
const struct row *old_row = old_grid[old_row_idx];
|
2020-02-15 22:19:08 +01:00
|
|
|
if (old_row == NULL)
|
|
|
|
|
continue;
|
|
|
|
|
|
2020-06-29 21:59:40 +02:00
|
|
|
/* Map sixels on current "old" row to current "new row" */
|
2020-10-03 23:00:34 +02:00
|
|
|
tll_foreach(untranslated_sixels, it) {
|
2020-06-29 21:59:40 +02:00
|
|
|
if (it->item.pos.row != old_row_idx)
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
struct sixel sixel = it->item;
|
|
|
|
|
sixel.pos.row = new_row_idx;
|
|
|
|
|
|
2020-10-04 13:12:44 +02:00
|
|
|
tll_push_back(grid->sixel_images, sixel);
|
2020-10-03 23:00:34 +02:00
|
|
|
tll_remove(untranslated_sixels, it);
|
2020-03-13 18:44:23 +01:00
|
|
|
}
|
|
|
|
|
|
2020-04-17 20:46:08 +02:00
|
|
|
#define line_wrap() \
|
|
|
|
|
do { \
|
|
|
|
|
new_col_idx = 0; \
|
|
|
|
|
new_row_idx = (new_row_idx + 1) & (new_rows - 1); \
|
|
|
|
|
\
|
|
|
|
|
new_row = new_grid[new_row_idx]; \
|
|
|
|
|
if (new_row == NULL) { \
|
|
|
|
|
new_row = grid_row_alloc(new_cols, true); \
|
|
|
|
|
new_grid[new_row_idx] = new_row; \
|
|
|
|
|
} else { \
|
|
|
|
|
memset(new_row->cells, 0, new_cols * sizeof(new_row->cells[0])); \
|
|
|
|
|
new_row->linebreak = false; \
|
2020-06-29 21:59:40 +02:00
|
|
|
tll_foreach(grid->sixel_images, it) { \
|
|
|
|
|
if (it->item.pos.row == new_row_idx) { \
|
|
|
|
|
sixel_destroy(&it->item); \
|
|
|
|
|
tll_remove(grid->sixel_images, it); \
|
|
|
|
|
} \
|
|
|
|
|
} \
|
2020-04-17 20:46:08 +02:00
|
|
|
} \
|
|
|
|
|
} while(0)
|
|
|
|
|
|
2020-07-14 20:29:59 +02:00
|
|
|
#define print_spacer() \
|
|
|
|
|
do { \
|
|
|
|
|
new_row->cells[new_col_idx].wc = CELL_MULT_COL_SPACER; \
|
|
|
|
|
new_row->cells[new_col_idx].attrs = old_cell->attrs; \
|
|
|
|
|
new_row->cells[new_col_idx].attrs.clean = 1; \
|
|
|
|
|
} while (0)
|
|
|
|
|
|
2020-02-15 22:19:08 +01:00
|
|
|
/*
|
|
|
|
|
* Keep track of empty cells. If the old line ends with a
|
|
|
|
|
* string of empty cells, we don't need to, nor do we want to,
|
|
|
|
|
* add those to the new line. However, if there are non-empty
|
|
|
|
|
* cells *after* the string of empty cells, we need to emit
|
|
|
|
|
* the empty cells too. And that may trigger linebreaks
|
|
|
|
|
*/
|
|
|
|
|
int empty_count = 0;
|
|
|
|
|
|
|
|
|
|
/* Walk current line of the old grid */
|
|
|
|
|
for (int c = 0; c < old_cols; c++) {
|
2020-04-16 19:38:30 +02:00
|
|
|
|
2020-04-17 21:00:37 +02:00
|
|
|
/* Check if this cell is one of the tracked cells */
|
|
|
|
|
bool is_tracking_point = false;
|
|
|
|
|
tll_foreach(tracking_points, it) {
|
|
|
|
|
if (it->item->row == old_row_idx && it->item->col == c) {
|
|
|
|
|
is_tracking_point = true;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (old_row->cells[c].wc == 0 && !is_tracking_point) {
|
2020-02-15 22:19:08 +01:00
|
|
|
empty_count++;
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
|
2020-04-17 21:00:37 +02:00
|
|
|
/* Allow left-adjusted and right-adjusted text, with empty
|
|
|
|
|
* cells in between, to be "pushed together" */
|
2020-02-15 22:19:08 +01:00
|
|
|
int old_cols_left = old_cols - c;
|
|
|
|
|
int cols_needed = empty_count + old_cols_left;
|
|
|
|
|
int new_cols_left = new_cols - new_col_idx;
|
|
|
|
|
if (new_cols_left < cols_needed && new_cols_left >= old_cols_left)
|
|
|
|
|
empty_count = max(0, empty_count - (cols_needed - new_cols_left));
|
|
|
|
|
|
2020-09-06 19:14:46 +02:00
|
|
|
wchar_t wc = old_row->cells[c].wc;
|
|
|
|
|
if (wc >= CELL_COMB_CHARS_LO &&
|
|
|
|
|
wc < (CELL_COMB_CHARS_LO + compose_count))
|
|
|
|
|
{
|
|
|
|
|
wc = composed[wc - CELL_COMB_CHARS_LO].base;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int width = max(1, wcwidth(wc));
|
2020-07-14 12:15:25 +02:00
|
|
|
|
|
|
|
|
/* Multi-column characters are never cut in half */
|
|
|
|
|
assert(c + width <= old_cols);
|
|
|
|
|
|
2020-07-14 17:04:59 +02:00
|
|
|
for (int i = 0; i < empty_count + 1; i++) {
|
2020-02-15 22:19:08 +01:00
|
|
|
const struct cell *old_cell = &old_row->cells[c - empty_count + i];
|
2020-09-06 19:14:46 +02:00
|
|
|
wc = old_cell->wc;
|
2020-02-15 22:19:08 +01:00
|
|
|
|
2020-09-06 19:14:46 +02:00
|
|
|
if (wc == CELL_MULT_COL_SPACER)
|
2020-07-14 17:04:59 +02:00
|
|
|
continue;
|
|
|
|
|
|
2020-09-06 19:14:46 +02:00
|
|
|
if (wc >= CELL_COMB_CHARS_LO &&
|
|
|
|
|
wc < (CELL_COMB_CHARS_LO + compose_count))
|
|
|
|
|
{
|
|
|
|
|
wc = composed[wc - CELL_COMB_CHARS_LO].base;
|
|
|
|
|
}
|
|
|
|
|
|
2020-02-15 22:19:08 +01:00
|
|
|
/* Out of columns on current row in new grid? */
|
2020-09-06 19:14:46 +02:00
|
|
|
if (new_col_idx + max(1, wcwidth(wc)) > new_cols) {
|
2020-07-14 17:04:59 +02:00
|
|
|
/* Pad to end-of-line with spacers, then line-wrap */
|
2020-07-14 20:29:59 +02:00
|
|
|
for (;new_col_idx < new_cols; new_col_idx++)
|
|
|
|
|
print_spacer();
|
2020-04-17 20:46:08 +02:00
|
|
|
line_wrap();
|
2020-07-14 17:04:59 +02:00
|
|
|
}
|
2020-02-15 22:19:08 +01:00
|
|
|
|
|
|
|
|
assert(new_row != NULL);
|
|
|
|
|
assert(new_col_idx >= 0);
|
|
|
|
|
assert(new_col_idx < new_cols);
|
|
|
|
|
|
|
|
|
|
new_row->cells[new_col_idx] = *old_cell;
|
|
|
|
|
new_row->cells[new_col_idx].attrs.clean = 1;
|
2020-04-16 19:38:30 +02:00
|
|
|
|
2020-04-17 21:00:37 +02:00
|
|
|
/* Translate tracking point(s) */
|
|
|
|
|
if (is_tracking_point && i >= empty_count) {
|
|
|
|
|
tll_foreach(tracking_points, it) {
|
|
|
|
|
if (it->item->row == old_row_idx && it->item->col == c) {
|
|
|
|
|
it->item->row = new_row_idx;
|
|
|
|
|
it->item->col = new_col_idx;
|
|
|
|
|
tll_remove(tracking_points, it);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
2020-02-15 22:19:08 +01:00
|
|
|
new_col_idx++;
|
2020-08-04 18:07:54 +02:00
|
|
|
}
|
2020-07-14 17:04:59 +02:00
|
|
|
|
2020-08-04 18:07:54 +02:00
|
|
|
/* For multi-column characters, insert spacers in the
|
|
|
|
|
* subsequent cells */
|
|
|
|
|
const struct cell *old_cell = &old_row->cells[c];
|
|
|
|
|
for (size_t i = 0; i < width - 1; i++) {
|
|
|
|
|
assert(new_col_idx < new_cols);
|
|
|
|
|
print_spacer();
|
|
|
|
|
new_col_idx++;
|
2020-02-15 22:19:08 +01:00
|
|
|
}
|
|
|
|
|
|
2020-07-14 12:15:25 +02:00
|
|
|
c += width - 1;
|
2020-02-15 22:19:08 +01:00
|
|
|
empty_count = 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (old_row->linebreak) {
|
|
|
|
|
new_row->linebreak = true;
|
2020-04-17 20:46:08 +02:00
|
|
|
line_wrap();
|
2020-02-15 22:19:08 +01:00
|
|
|
}
|
2020-04-17 20:46:08 +02:00
|
|
|
|
2020-07-14 20:29:59 +02:00
|
|
|
#undef print_spacer
|
2020-04-17 20:46:08 +02:00
|
|
|
#undef line_wrap
|
2020-02-15 22:19:08 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Set offset such that the last reflowed row is at the bottom */
|
|
|
|
|
grid->offset = new_row_idx - new_screen_rows + 1;
|
|
|
|
|
while (grid->offset < 0)
|
|
|
|
|
grid->offset += new_rows;
|
|
|
|
|
while (new_grid[grid->offset] == NULL)
|
|
|
|
|
grid->offset = (grid->offset + 1) & (new_rows - 1);
|
2020-09-24 18:35:40 +02:00
|
|
|
|
2020-02-15 22:19:08 +01:00
|
|
|
/* Ensure all visible rows have been allocated */
|
|
|
|
|
for (int r = 0; r < new_screen_rows; r++) {
|
|
|
|
|
int idx = (grid->offset + r) & (new_rows - 1);
|
|
|
|
|
if (new_grid[idx] == NULL)
|
|
|
|
|
new_grid[idx] = grid_row_alloc(new_cols, true);
|
|
|
|
|
}
|
|
|
|
|
|
2020-09-24 18:48:41 +02:00
|
|
|
grid->view = view_follows ? grid->offset : viewport.row;
|
|
|
|
|
|
|
|
|
|
/* If enlarging the window, the old viewport may be too far down,
|
|
|
|
|
* with unallocated rows. Make sure this cannot happen */
|
|
|
|
|
while (true) {
|
|
|
|
|
int idx = (grid->view + new_screen_rows - 1) & (new_rows - 1);
|
|
|
|
|
if (new_grid[idx] != NULL)
|
|
|
|
|
break;
|
|
|
|
|
grid->view--;
|
|
|
|
|
if (grid->view < 0)
|
|
|
|
|
grid->view += new_rows;
|
|
|
|
|
}
|
|
|
|
|
for (size_t r = 0; r < new_screen_rows; r++) {
|
2020-09-24 18:53:05 +02:00
|
|
|
int UNUSED idx = (grid->view + r) & (new_rows - 1);
|
2020-09-24 18:48:41 +02:00
|
|
|
assert(new_grid[idx] != NULL);
|
|
|
|
|
}
|
|
|
|
|
|
2020-02-15 22:19:08 +01:00
|
|
|
/* Free old grid */
|
|
|
|
|
for (int r = 0; r < grid->num_rows; r++)
|
|
|
|
|
grid_row_free(old_grid[r]);
|
|
|
|
|
free(grid->rows);
|
|
|
|
|
|
|
|
|
|
grid->rows = new_grid;
|
|
|
|
|
grid->num_rows = new_rows;
|
|
|
|
|
grid->num_cols = new_cols;
|
|
|
|
|
|
2020-04-16 19:38:30 +02:00
|
|
|
/* Convert absolute coordinates to screen relative */
|
2020-04-17 21:00:37 +02:00
|
|
|
cursor.row -= grid->offset;
|
|
|
|
|
while (cursor.row < 0)
|
|
|
|
|
cursor.row += grid->num_rows;
|
2020-09-09 18:40:06 +02:00
|
|
|
cursor.row = min(cursor.row, new_screen_rows - 1);
|
resize: don’t reflow text on alt screen
Alt screen applications normally reflow/readjust themselves on a
window resize.
When we do it too, the result is graphical glitches/flashes since our
re-flowed text is rendered in one frame, and the application re-flowed
text soon thereafter.
We can’t avoid rendering some kind of re-flowed frame, since we don’t
know when, or even if, the application will update itself. To avoid
glitches, we need to render, as closely as possible, what the
application itself will render shortly.
This is actually pretty simple; we just need to copy the visible
content over from the old grid to the new grid. We don’t bother with
text re-flow, but simply truncate long lines.
To simplify things, we simply cancel any active selection (since often
times, it will be corrupted anyway when the application redraws
itself).
Since we’re not reflowing text, there’s no need to translate e.g. the
cursor position - we just keep the current position (but bounded to
the new dimensions).
Fun thing: ‘less’ gets corrupted if we don’t leave the cursor at
the (new) bottom row. To handle this, we check if the cursor (before
resize) is at the bottom row, and if so, we move it to the new bottom
row.
Closes #221
2020-11-24 19:00:57 +01:00
|
|
|
cursor.col = min(cursor.col, new_cols - 1);
|
2020-04-16 19:38:30 +02:00
|
|
|
|
2020-04-17 21:00:37 +02:00
|
|
|
saved_cursor.row -= grid->offset;
|
|
|
|
|
while (saved_cursor.row < 0)
|
|
|
|
|
saved_cursor.row += grid->num_rows;
|
2020-09-09 18:40:06 +02:00
|
|
|
saved_cursor.row = min(saved_cursor.row, new_screen_rows - 1);
|
resize: don’t reflow text on alt screen
Alt screen applications normally reflow/readjust themselves on a
window resize.
When we do it too, the result is graphical glitches/flashes since our
re-flowed text is rendered in one frame, and the application re-flowed
text soon thereafter.
We can’t avoid rendering some kind of re-flowed frame, since we don’t
know when, or even if, the application will update itself. To avoid
glitches, we need to render, as closely as possible, what the
application itself will render shortly.
This is actually pretty simple; we just need to copy the visible
content over from the old grid to the new grid. We don’t bother with
text re-flow, but simply truncate long lines.
To simplify things, we simply cancel any active selection (since often
times, it will be corrupted anyway when the application redraws
itself).
Since we’re not reflowing text, there’s no need to translate e.g. the
cursor position - we just keep the current position (but bounded to
the new dimensions).
Fun thing: ‘less’ gets corrupted if we don’t leave the cursor at
the (new) bottom row. To handle this, we check if the cursor (before
resize) is at the bottom row, and if so, we move it to the new bottom
row.
Closes #221
2020-11-24 19:00:57 +01:00
|
|
|
saved_cursor.col = min(saved_cursor.col, new_cols - 1);
|
2020-04-16 19:38:30 +02:00
|
|
|
|
resize: don’t reflow text on alt screen
Alt screen applications normally reflow/readjust themselves on a
window resize.
When we do it too, the result is graphical glitches/flashes since our
re-flowed text is rendered in one frame, and the application re-flowed
text soon thereafter.
We can’t avoid rendering some kind of re-flowed frame, since we don’t
know when, or even if, the application will update itself. To avoid
glitches, we need to render, as closely as possible, what the
application itself will render shortly.
This is actually pretty simple; we just need to copy the visible
content over from the old grid to the new grid. We don’t bother with
text re-flow, but simply truncate long lines.
To simplify things, we simply cancel any active selection (since often
times, it will be corrupted anyway when the application redraws
itself).
Since we’re not reflowing text, there’s no need to translate e.g. the
cursor position - we just keep the current position (but bounded to
the new dimensions).
Fun thing: ‘less’ gets corrupted if we don’t leave the cursor at
the (new) bottom row. To handle this, we check if the cursor (before
resize) is at the bottom row, and if so, we move it to the new bottom
row.
Closes #221
2020-11-24 19:00:57 +01:00
|
|
|
grid->cur_row = new_grid[(grid->offset + cursor.row) & (new_rows - 1)];
|
2020-04-17 21:00:37 +02:00
|
|
|
grid->cursor.point = cursor;
|
|
|
|
|
grid->saved_cursor.point = saved_cursor;
|
2020-04-16 19:38:30 +02:00
|
|
|
|
|
|
|
|
grid->cursor.lcf = false;
|
|
|
|
|
grid->saved_cursor.lcf = false;
|
|
|
|
|
|
2020-06-29 21:59:40 +02:00
|
|
|
/* Free sixels we failed to "map" to the new grid */
|
2020-10-03 23:00:34 +02:00
|
|
|
tll_foreach(untranslated_sixels, it)
|
2020-03-13 18:44:23 +01:00
|
|
|
sixel_destroy(&it->item);
|
2020-10-03 23:00:34 +02:00
|
|
|
tll_free(untranslated_sixels);
|
|
|
|
|
|
2020-04-17 21:00:37 +02:00
|
|
|
tll_free(tracking_points);
|
2020-02-15 22:19:08 +01:00
|
|
|
}
|