foot/terminal.c

484 lines
13 KiB
C
Raw Normal View History

2019-06-29 21:03:28 +02:00
#include "terminal.h"
#include <string.h>
#include <unistd.h>
2019-06-29 21:03:28 +02:00
#include <assert.h>
#define LOG_MODULE "terminal"
#define LOG_ENABLE_DBG 0
2019-06-29 21:03:28 +02:00
#include "log.h"
#include "grid.h"
2019-06-29 21:03:28 +02:00
#define min(x, y) ((x) < (y) ? (x) : (y))
#define max(x, y) ((x) > (y) ? (x) : (y))
static bool
damage_merge_range(struct terminal *term, const struct damage *dmg)
{
2019-06-29 21:23:36 +02:00
if (tll_length(term->grid->damage) == 0)
2019-06-29 21:03:28 +02:00
return false;
2019-06-29 21:23:36 +02:00
struct damage *old = &tll_back(term->grid->damage);
2019-06-29 21:03:28 +02:00
if (old->type != dmg->type)
return false;
const int start = dmg->range.start;
const int end = start + dmg->range.length;
const int prev_start = old->range.start;
const int prev_end = prev_start + old->range.length;
if ((start >= prev_start && start <= prev_end) ||
(end >= prev_start && end <= prev_end) ||
(start <= prev_start && end >= prev_end))
{
/* The two damage ranges intersect */
int new_start = min(start, prev_start);
int new_end = max(end, prev_end);
old->range.start = new_start;
old->range.length = new_end - new_start;
return true;
}
return false;
}
static void
term_damage_update_or_erase(struct terminal *term, enum damage_type damage_type,
int start, int length)
{
#if 1
if (tll_length(term->grid->damage) > 1024) {
term_damage_all(term);
return;
}
#endif
2019-06-29 21:03:28 +02:00
struct damage dmg = {
.type = damage_type,
.range = {.start = term->grid->offset + start, .length = length},
2019-06-29 21:03:28 +02:00
};
2019-06-29 21:03:28 +02:00
if (damage_merge_range(term, &dmg))
return;
2019-06-29 21:23:36 +02:00
tll_push_back(term->grid->damage, dmg);
2019-06-29 21:03:28 +02:00
}
void
term_damage_update(struct terminal *term, int start, int length)
{
assert(start + length <= term->rows * term->cols);
2019-06-29 21:03:28 +02:00
term_damage_update_or_erase(term, DAMAGE_UPDATE, start, length);
}
void
term_damage_erase(struct terminal *term, int start, int length)
{
assert(start + length <= term->rows * term->cols);
2019-06-29 21:03:28 +02:00
term_damage_update_or_erase(term, DAMAGE_ERASE, start, length);
}
void
term_damage_all(struct terminal *term)
{
2019-06-29 21:23:36 +02:00
tll_free(term->grid->damage);
tll_free(term->grid->scroll_damage);
term_damage_update(term, 0, term->rows * term->cols);
2019-06-29 21:03:28 +02:00
}
#if 0
2019-06-29 21:03:28 +02:00
static void
damage_adjust_after_scroll(struct terminal *term, enum damage_type damage_type,
struct scroll_region region, int lines)
{
2019-06-29 21:23:36 +02:00
tll_foreach(term->grid->damage, it) {
2019-07-01 19:20:21 +02:00
#if 0
if (it->item.range.start < term->grid->offset) {
int end = it->item.range.start + it->item.range.length;
if (end >= term->grid->offset) {
it->item.range.start = term->grid->offset;
it->item.range.length = end - it->item.range.start;
} else {
tll_remove(term->grid->damage, it);
2019-06-29 21:03:28 +02:00
}
}
2019-07-01 19:20:21 +02:00
#endif
int start = it->item.range.start;
int end = start + it->item.range.length;
if (start -
2019-06-29 21:03:28 +02:00
}
}
#endif
2019-06-29 21:03:28 +02:00
void
term_damage_scroll(struct terminal *term, enum damage_type damage_type,
struct scroll_region region, int lines)
{
//damage_adjust_after_scroll(term, damage_type, region, lines);
if (damage_type == DAMAGE_SCROLL) {
tll_foreach(term->grid->damage, it) {
int start = it->item.range.start;
int length = it->item.range.length;
if (start < term->grid->offset) {
int end = start + length;
if (end >= term->grid->offset) {
it->item.range.start = term->grid->offset;
it->item.range.length = end - it->item.range.start;
} else
tll_remove(term->grid->damage, it);
} else
break;
}
}
2019-06-29 21:03:28 +02:00
2019-06-29 21:23:36 +02:00
if (tll_length(term->grid->scroll_damage) > 0) {
struct damage *dmg = &tll_back(term->grid->scroll_damage);
2019-06-29 21:03:28 +02:00
if (dmg->type == damage_type &&
dmg->scroll.region.start == region.start &&
dmg->scroll.region.end == region.end)
{
dmg->scroll.lines += lines;
return;
}
}
struct damage dmg = {
.type = damage_type,
.scroll = {.region = region, .lines = lines},
};
2019-06-29 21:23:36 +02:00
tll_push_back(term->grid->scroll_damage, dmg);
2019-06-29 21:03:28 +02:00
}
void
term_erase(struct terminal *term, int start, int end)
{
LOG_DBG("erase: %d-%d", start, end);
2019-06-29 21:03:28 +02:00
assert(end >= start);
assert(end <= term->rows * term->cols);
if (term->vt.attrs.have_background) {
int erase_start = start;
int left = end - erase_start;
while (left > 0) {
int len = left;
struct cell *cells = grid_get_range(term->grid, erase_start, &len);
memset(cells, 0, len * sizeof(cells[0]));
for (int i = 0; i < len; i++) {
cells[i].attrs.background = term->vt.attrs.background;
cells[i].attrs.have_background = true;
}
erase_start += len;
left -= len;
}
term_damage_update(term, start, end - start);
} else {
grid_memset(term->grid, start, 0, end - start);
term_damage_erase(term, start, end - start);
}
2019-06-29 21:03:28 +02:00
}
int
term_cursor_linear(const struct terminal *term, int row, int col)
{
return row * term->cols + col;
2019-06-29 21:03:28 +02:00
}
void
term_cursor_to(struct terminal *term, int row, int col)
{
assert(row < term->rows);
assert(col < term->cols);
2019-06-29 21:03:28 +02:00
int new_linear = row * term->cols + col;
assert(new_linear < term->rows * term->cols);
2019-06-29 21:03:28 +02:00
term->print_needs_wrap = false;
2019-06-29 21:03:28 +02:00
term->cursor.linear = new_linear;
term->cursor.col = col;
term->cursor.row = row;
int len = term->cols;
term->grid->cur_line = grid_get_range(
term->grid, term->cursor.linear - col, &len);
assert(len == term->cols);
2019-06-29 21:03:28 +02:00
}
void
term_cursor_left(struct terminal *term, int count)
{
int move_amount = min(term->cursor.col, count);
term->cursor.linear -= move_amount;
term->cursor.col -= move_amount;
term->print_needs_wrap = false;
2019-06-29 21:03:28 +02:00
}
void
term_cursor_right(struct terminal *term, int count)
{
int move_amount = min(term->cols - term->cursor.col - 1, count);
term->cursor.linear += move_amount;
term->cursor.col += move_amount;
term->print_needs_wrap = false;
2019-06-29 21:03:28 +02:00
}
void
term_cursor_up(struct terminal *term, int count)
{
int move_amount = min(term->cursor.row, count);
term_cursor_to(term, term->cursor.row - move_amount, term->cursor.col);
2019-06-29 21:03:28 +02:00
}
void
term_cursor_down(struct terminal *term, int count)
{
int move_amount = min(term->rows - term->cursor.row - 1, count);
term_cursor_to(term, term->cursor.row + move_amount, term->cursor.col);
2019-06-29 21:03:28 +02:00
}
void
term_scroll_partial(struct terminal *term, struct scroll_region region, int rows)
{
LOG_DBG("scroll: %d rows", rows);
2019-06-29 21:03:28 +02:00
2019-07-01 19:20:21 +02:00
if (region.start > 0) {
/* TODO: check if it's worth memoving the scroll area instead,
* under certain circumstances */
2019-06-29 21:03:28 +02:00
2019-07-01 19:20:21 +02:00
grid_memmove(term->grid, rows * term->cols, 0, region.start * term->cols);
2019-06-29 21:03:28 +02:00
2019-07-01 19:20:21 +02:00
tll_foreach(term->grid->damage, it) {
int start = it->item.range.start - term->grid->offset;
int end __attribute__((unused)) = start + it->item.range.length;
2019-06-29 21:03:28 +02:00
if (start < region.start * term->cols) {
assert(end <= region.start * term->cols);
2019-07-01 19:20:21 +02:00
it->item.range.start += rows * term->cols;
}
}
}
2019-06-29 21:03:28 +02:00
2019-07-01 19:20:21 +02:00
if (region.end < term->rows) {
/* Copy scrolled-up bottom region to new bottom region */
grid_memmove(
term->grid,
(region.end + rows) * term->cols,
region.end * term->cols,
(term->rows - region.end) * term->cols);
tll_foreach(term->grid->damage, it) {
int start = it->item.range.start - term->grid->offset;
int end = start + it->item.range.length;
if (end > region.end * term->cols) {
assert(start >= region.end * term->cols);
2019-07-01 19:20:21 +02:00
it->item.range.start += rows * term->cols;
}
}
}
2019-07-01 19:20:21 +02:00
/* Offset grid origin */
term->grid->offset += rows * term->cols;
2019-07-01 19:20:21 +02:00
/* Clear scrolled-in lines */
grid_memset(
term->grid,
max(0, region.end - rows) * term->cols,
0,
min(rows, term->rows) * term->cols);
2019-07-01 19:20:21 +02:00
term_damage_scroll(term, DAMAGE_SCROLL, region, rows);
int len = term->cols;
term->grid->cur_line = grid_get_range(
term->grid, term->cursor.linear - term->cursor.col, &len);
assert(len == term->cols);
2019-06-29 21:03:28 +02:00
}
void
term_scroll(struct terminal *term, int rows)
{
term_scroll_partial(term, term->scroll_region, rows);
2019-06-29 21:03:28 +02:00
}
void
term_scroll_reverse_partial(struct terminal *term,
struct scroll_region region, int rows)
{
if (region.end < term->rows) {
grid_memmove(
term->grid,
(region.end - rows) * term->cols,
region.end * term->cols,
(term->rows - region.end) * term->cols);
tll_foreach(term->grid->damage, it) {
int start = it->item.range.start - term->grid->offset;
int end = start + it->item.range.length;
if (end > region.end * term->cols) {
assert(start >= region.end * term->cols);
it->item.range.start -= rows * term->cols;
}
}
}
if (region.start > 0) {
grid_memmove(
term->grid, -rows * term->cols, 0, region.start * term->cols);
tll_foreach(term->grid->damage, it) {
int start = it->item.range.start - term->grid->offset;
int end __attribute__((unused)) = start + it->item.range.length;
if (start < region.start * term->cols) {
if (end > region.start * term->cols) {
LOG_ERR("region.start = %d, rows = %d, damage.start = %d, damage.end = %d (%s)",
region.start, rows, start, end, it->item.type == DAMAGE_UPDATE ? "UPDATE" : "ERASE");
abort();
}
assert(end <= region.start * term->cols);
it->item.range.start -= rows * term->cols;
}
}
}
2019-06-29 21:03:28 +02:00
term->grid->offset -= rows * term->cols;
2019-06-29 21:03:28 +02:00
grid_memset(term->grid, region.start * term->cols, 0, rows * term->cols);
2019-06-29 21:03:28 +02:00
term_damage_scroll(term, DAMAGE_SCROLL_REVERSE, region, rows);
int len = term->cols;
term->grid->cur_line = grid_get_range(
term->grid, term->cursor.linear - term->cursor.col, &len);
assert(len == term->cols);
2019-06-29 21:03:28 +02:00
}
void
term_scroll_reverse(struct terminal *term, int rows)
{
term_scroll_reverse_partial(term, term->scroll_region, rows);
2019-06-29 21:03:28 +02:00
}
#include <linux/input-event-codes.h>
static int
linux_mouse_button_to_x(int button)
{
switch (button) {
case BTN_LEFT: return 1;
case BTN_RIGHT: return 3;
case BTN_MIDDLE: return 2;
case BTN_SIDE: return 8;
case BTN_EXTRA: return 9;
case BTN_FORWARD: return 4;
case BTN_BACK: return 5;
case BTN_TASK: return -1; /* TODO: ??? */
default:
LOG_WARN("unrecognized mouse button: %d (0x%x)", button, button);
return -1;
}
}
static int
encode_xbutton(int xbutton)
{
switch (xbutton) {
case 1: case 2: case 3:
return xbutton - 1;
case 4: case 5:
/* Like button 1 and 2, but with 64 added */
return xbutton - 4 + 64;
case 6: case 7:
/* Same as 4 and 5. Note: the offset should be something else? */
return xbutton - 6 + 64;
case 8: case 9: case 10: case 11:
/* Similar to 4 and 5, but adding 128 instead of 64 */
return xbutton - 8 + 128;
default:
LOG_ERR("cannot encode X mouse button: %d", xbutton);
return -1;
}
}
static void
report_mouse_click(struct terminal *term, int button, int row, int col,
bool release, bool shift, bool alt, bool ctrl)
{
/* Map libevent button event code to X button number */
int xbutton = linux_mouse_button_to_x(button);
if (xbutton == -1)
return;
if (release && (xbutton == 4 || xbutton == 5)) {
/* No button release events for scroll buttons */
return;
}
int encoded = release ? 3 : encode_xbutton(xbutton);
if (encoded == -1)
return;
encoded += (shift ? 4 : 0) + (alt ? 8 : 0) + (ctrl ? 16 : 0);
char response[16];
snprintf(response, sizeof(response), "\033[M%c%c%c",
32 + encoded, 32 + col + 1, 32 + row + 1);
write(term->ptmx, response, strlen(response));
}
void
term_mouse_down(struct terminal *term, int button, int row, int col,
bool shift, bool alt, bool ctrl)
{
switch (term->mouse_tracking) {
case MOUSE_NONE:
break;
case MOUSE_X10:
case MOUSE_CLICK:
case MOUSE_DRAG:
case MOUSE_MOTION:
report_mouse_click(term, button, row, col, false, shift, alt, ctrl);
break;
}
}
void
term_mouse_up(struct terminal *term, int button, int row, int col,
bool shift, bool alt, bool ctrl)
{
switch (term->mouse_tracking) {
case MOUSE_NONE:
break;
case MOUSE_X10:
case MOUSE_CLICK:
case MOUSE_DRAG:
case MOUSE_MOTION:
report_mouse_click(term, button, row, col, true, shift, alt, ctrl);
break;
}
}