#include "grid.h" #include #include #define LOG_MODULE "grid" #define LOG_ENABLE_DBG 0 #include "log.h" #include "sixel.h" #include "util.h" void grid_swap_row(struct grid *grid, int row_a, int row_b) { assert(grid->offset >= 0); assert(row_a != row_b); 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]; grid->rows[real_a] = b; grid->rows[real_b] = a; } struct row * grid_row_alloc(int cols, bool initialize) { struct row *row = malloc(sizeof(*row)); row->dirty = false; row->linebreak = false; if (initialize) { row->cells = calloc(cols, sizeof(row->cells[0])); for (size_t c = 0; c < cols; c++) row->cells[c].attrs.clean = 1; } else row->cells = malloc(cols * sizeof(row->cells[0])); return row; } void grid_row_free(struct row *row) { if (row == NULL) return; free(row->cells); free(row); } void grid_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]) { struct row *const *old_grid = grid->rows; const int old_rows = grid->num_rows; const int old_cols = grid->num_cols; int new_col_idx = 0; int new_row_idx = 0; struct row **new_grid = calloc(new_rows, sizeof(new_grid[0])); 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; tll(struct sixel) old_sixels = tll_init(); tll_foreach(grid->sixel_images, it) tll_push_back(old_sixels, it->item); tll_free(grid->sixel_images); /* 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; tll(struct coord *) tracking_points = tll_init(); tll_push_back(tracking_points, &cursor); tll_push_back(tracking_points, &saved_cursor); for (size_t i = 0; i < tracking_points_count; i++) tll_push_back(tracking_points, _tracking_points[i]); /* * Walk the old grid */ for (int r = 0; r < old_rows; r++) { const size_t old_row_idx = (offset + r) & (old_rows - 1); /* Unallocated (empty) rows we can simply skip */ const struct row *old_row = old_grid[old_row_idx]; if (old_row == NULL) continue; /* Map sixels on current "old" row to current "new row" */ tll_foreach(old_sixels, it) { if (it->item.pos.row != old_row_idx) continue; struct sixel sixel = it->item; sixel.pos.row = new_row_idx; /* Make sure it doesn't cross the wrap-around after being re-based */ int end = (sixel.pos.row + sixel.rows - 1) & (new_rows - 1); if (end < sixel.pos.row) { /* TODO: split instead of destroying */ sixel_destroy(&it->item); } else { /* Insert sixel into the *sorted* list. */ /* Based on rebase_row() in sixel.c */ /* Uses 'old' offset to ensure old sixels are treated as such */ #define rebase_row(t, row) \ (((row) - (grid->offset + new_screen_rows) + new_rows) & (new_rows - 1)) int end_row = rebase_row(term, sixel.pos.row + sixel.rows - 1); /* * TODO: this is basically sixel_insert(), except we * cannot use it since: * * a) we don't have a 'term' reference * b) the grid hasn't been fully * updated yet * (e.g. grid->num_rows is invalid etc). */ bool inserted = false; tll_foreach(grid->sixel_images, it2) { const struct sixel *s = &it2->item; if (rebase_row(term, s->pos.row + s->rows - 1) < end_row) { tll_insert_before(grid->sixel_images, it2, sixel); inserted = true; break; } } if (!inserted) tll_push_back(grid->sixel_images, sixel); } /* Sixel has been either re-mapped, or destroyed */ tll_remove(old_sixels, it); #undef rebase_row } #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; \ tll_foreach(grid->sixel_images, it) { \ if (it->item.pos.row == new_row_idx) { \ sixel_destroy(&it->item); \ tll_remove(grid->sixel_images, it); \ } \ } \ } \ } while(0) /* * 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++) { /* 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) { empty_count++; continue; } /* Allow left-adjusted and right-adjusted text, with empty * cells in between, to be "pushed together" */ 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)); for (int i = 0; i < empty_count + 1; i++) { const struct cell *old_cell = &old_row->cells[c - empty_count + i]; /* Out of columns on current row in new grid? */ if (new_col_idx + max(1, wcwidth(old_cell->wc)) > new_cols) line_wrap(); 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; /* 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); } } } new_col_idx++; } empty_count = 0; } if (old_row->linebreak) { new_row->linebreak = true; line_wrap(); } #undef line_wrap } /* 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); grid->view = grid->offset; /* 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); } /* Free old grid */ for (int r = 0; r < grid->num_rows; r++) grid_row_free(old_grid[r]); free(grid->rows); grid->cur_row = new_grid[cursor.row]; grid->rows = new_grid; grid->num_rows = new_rows; grid->num_cols = new_cols; /* Convert absolute coordinates to screen relative */ cursor.row -= grid->offset; while (cursor.row < 0) cursor.row += grid->num_rows; assert(cursor.row >= 0); assert(cursor.row < grid->num_rows); saved_cursor.row -= grid->offset; while (saved_cursor.row < 0) saved_cursor.row += grid->num_rows; assert(saved_cursor.row >= 0); assert(saved_cursor.row < grid->num_rows); grid->cursor.point = cursor; grid->saved_cursor.point = saved_cursor; grid->cursor.lcf = false; grid->saved_cursor.lcf = false; /* Free sixels we failed to "map" to the new grid */ tll_foreach(old_sixels, it) sixel_destroy(&it->item); tll_free(old_sixels); tll_free(tracking_points); }