aboutsummaryrefslogtreecommitdiff
path: root/grid.h
diff options
context:
space:
mode:
authorDaniel Eklöf <daniel@ekloef.se>2019-07-08 11:57:31 +0000
committerDaniel Eklöf <daniel@ekloef.se>2019-07-08 11:57:31 +0000
commit4e25019ba6bd1bd07925ccafc2936416ef3f7cbe (patch)
tree00c0e30177eb2e966ac021a4d42c3a9f1219f77d /grid.h
parentcell: packing the cell struct seems to help performance (diff)
wip: grid is now represented as a grid, not a linear array
The grid is now represented with an array of row *pointers*. Each row contains an array of cells (the row's columns). The main point of having row pointers is we can now move rows around almost for free. This is useful when scrolling with scroll margins for example, where we previously had to copy the lines in the margins. Now it's just a matter of swapping two pointers.
Diffstat (limited to 'grid.h')
-rw-r--r--grid.h28
1 files changed, 28 insertions, 0 deletions
diff --git a/grid.h b/grid.h
index 11f38506..d6ddabee 100644
--- a/grid.h
+++ b/grid.h
@@ -3,6 +3,34 @@
#include <stddef.h>
#include "terminal.h"
+static inline struct row *
+grid_row(struct grid *grid, int row)
+{
+ assert(grid->offset >= 0);
+ return grid->rows[(grid->offset + row + grid->num_rows) % grid->num_rows];
+}
+
+static inline void
+grid_swap_row(struct grid *grid, int row_a, int row_b)
+{
+ assert(grid->offset >= 0);
+ assert(row_a != row_b);
+ assert(row_a >= 0);
+ assert(row_b >= 0);
+
+ int real_a = (grid->offset + row_a + grid->num_rows) % grid->num_rows;
+ int real_b = (grid->offset + row_b + grid->num_rows) % grid->num_rows;
+
+ struct row *tmp = grid->rows[real_a];
+ grid->rows[real_a] = grid->rows[real_b];
+ grid->rows[real_b] = tmp;
+
+ grid->rows[real_a]->dirty = true;
+ grid->rows[real_b]->dirty = true;
+}
+
+#if 0
struct cell *grid_get_range(struct grid *grid, int start, int *length);
void grid_memclear(struct grid *grid, int start, int length);
void grid_memmove(struct grid *grid, int dst, int src, int length);
+#endif