/* $OpenBSD$ */

/*
 * Copyright (c) 2019 Nicholas Marriott <nicholas.marriott@gmail.com>
 * Copyright (c) 2026 Michael Grant <mgrant@grant.org>
 *
 * Permission to use, copy, modify, and distribute this software for any
 * purpose with or without fee is hereby granted, provided that the above
 * copyright notice and this permission notice appear in all copies.
 *
 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
 * WHATSOEVER RESULTING FROM LOSS OF MIND, USE, DATA OR PROFITS, WHETHER
 * IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING
 * OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 */

#include <sys/types.h>

#include <limits.h>
#include <stdlib.h>
#include <string.h>

#include "tmux.h"

#define SIXEL_WIDTH_LIMIT 10000
#define SIXEL_HEIGHT_LIMIT 10000
#define SIXEL_PALETTE_SIZE 256
#define SIXEL_HISTOGRAM_LEVELS 32
#define SIXEL_HISTOGRAM_SIZE (SIXEL_HISTOGRAM_LEVELS * \
	SIXEL_HISTOGRAM_LEVELS * SIXEL_HISTOGRAM_LEVELS)

struct sixel_line {
	/* Number of pixel indexes allocated in this row. */
	u_int		 sx;
	/* Palette index for each pixel in the row. */
	uint16_t	*pixels;
};

struct sixel_image {
	/* Decoded image dimensions in pixels. */
	u_int			 sx;
	u_int			 sy;
	/* Raster extent inside a padded output canvas, if different. */
	u_int			 raster_sx;
	u_int			 raster_sy;

	/* Terminal cell pixel dimensions used for scaling. */
	u_int			 cell_w;
	u_int			 cell_h;

	/* SIXEL raster attributes, if present. */
	u_int			 set_ra;
	u_int			 ra_x;
	u_int			 ra_y;

	/* SIXEL palette and the number of entries used by the image. */
	u_int			*colours;
	u_int			 ncolours;
	u_int			 used_colours;

	/* DCS parameters preserved when the image is emitted again. */
	u_int			 p1;
	u_int			 p2;

	/* Current parser position and colour register. */
	u_int			 dx;
	u_int			 dy;
	u_int			 dc;

	/* Decoded rows of palette indexes. */
	struct sixel_line	*lines;
};

struct sixel_plane {
	/*
	 * A sixel_plane represents a single-colour SIXEL matrix for
	 * the current six-row band. stream contains the six-bit columns
	 * and sixel controls such as repeats and gaps for this colour.
	 */

	/* Position of the next encoded colour plane. */
	u_int	 next_x;
	u_int	 next_y;

	/* State used while encoding SIXEL patterns. */
	u_int	 count;
	char	 pattern;
	char	 next_pattern;

	/* Output buffer and its allocation/used lengths. */
	size_t	 stream_len;
	size_t	 stream_used;
	char	*stream;
};

struct sixel_image_cache {
	/* Image and terminal geometry associated with this entry. */
	u_int			 server_id;
	u_int			 cell_w;
	u_int			 cell_h;
	/* Memory and age used for cache eviction. */
	size_t			 size;
	uint64_t		 age;
	/* Cached decoded/scaled image and next entry. */
	struct sixel_image	*si;
	struct sixel_image_cache	*next;
};

struct sixel_output {
	/* Per-terminal cached images and aggregate cache state. */
	struct sixel_image_cache	*images;
	size_t			 size;
	uint64_t		 age;
};

struct sixel_hgram {
	/* Number of pixels and accumulated RGB values in a colour bin. */
	u_int		 count;
	uint64_t	 red;
	uint64_t	 green;
	uint64_t	 blue;
};

struct sixel_box {
	/* RGB bounds and population of a quantization region. */
	u_int		 red_min;
	u_int		 red_max;
	u_int		 green_min;
	u_int		 green_max;
	u_int		 blue_min;
	u_int		 blue_max;
	u_int		 count;
};

struct sixel_rgb {
	/* One RGB colour in the generated palette. */
	u_char		 red;
	u_char		 green;
	u_char		 blue;
};

struct sixel_source {
	/* Source pixel buffer and row stride. */
	const u_char	*pixels;
	size_t		 stride;
	/* Source image and logical canvas dimensions. */
	u_int		 width;
	u_int		 height;
	u_int		 canvas_width;
	u_int		 canvas_height;
	u_int		 sx;
	u_int		 sy;
};

/* Grow a SIXEL image to contain a line. */
static int
sixel_parse_expand_lines(struct sixel_image *si, u_int y)
{
	if (y <= si->sy)
		return (0);
	if (y > SIXEL_HEIGHT_LIMIT)
		return (1);
	si->lines = xrecallocarray(si->lines, si->sy, y, sizeof *si->lines);
	si->sy = y;
	return (0);
}

/* Grow a SIXEL line to contain a pixel. */
static int
sixel_parse_expand_line(struct sixel_image *si, struct sixel_line *sl, u_int x)
{
	if (x <= sl->sx)
		return (0);
	if (x > SIXEL_WIDTH_LIMIT)
		return (1);
	if (x > si->sx)
		si->sx = x;
	sl->pixels = xrecallocarray(sl->pixels, sl->sx, si->sx,
	    sizeof *sl->pixels);
	sl->sx = si->sx;
	return (0);
}

/* Return a SIXEL palette index at a pixel. */
static u_int
sixel_get_pixel(struct sixel_image *si, u_int x, u_int y)
{
	struct sixel_line	*sl;

	if (y >= si->sy)
		return (0);
	sl = &si->lines[y];
	if (x >= sl->sx)
		return (0);
	return (sl->pixels[x]);
}

/* Set a SIXEL palette index at a pixel. */
static int
sixel_set_pixel(struct sixel_image *si, u_int x, u_int y, u_int c)
{
	struct sixel_line	*sl;

	if (sixel_parse_expand_lines(si, y + 1) != 0)
		return (1);
	sl = &si->lines[y];
	if (sixel_parse_expand_line(si, sl, x + 1) != 0)
		return (1);
	sl->pixels[x] = c;
	return (0);
}

/* Write a SIXEL six-pixel column. */
static int
sixel_parse_write(struct sixel_image *si, u_int ch)
{
	u_int			 i;

	for (i = 0; i < 6; i++) {
		if (ch & (1 << i)) {
			if (sixel_set_pixel(si, si->dx, si->dy + i, si->dc))
				return (1);
		}
	}
	return (0);
}

/* Parse a SIXEL raster attribute sequence. */
static const char *
sixel_parse_attributes(struct sixel_image *si, const char *cp, const char *end)
{
	const char	*last;
	char		*endptr;
	u_int		 x, y;

	last = cp;
	while (last != end) {
		if (*last != ';' && (*last < '0' || *last > '9'))
			break;
		last++;
	}
	strtoul(cp, &endptr, 10);
	if (endptr == last || *endptr != ';')
		return (last);
	strtoul(endptr + 1, &endptr, 10);
	if (endptr == last)
		return (last);
	if (*endptr != ';') {
		log_debug("%s: missing ;", __func__);
		return (NULL);
	}

	x = strtoul(endptr + 1, &endptr, 10);
	if (endptr == last || *endptr != ';') {
		log_debug("%s: missing ;", __func__);
		return (NULL);
	}
	if (x > SIXEL_WIDTH_LIMIT) {
		log_debug("%s: image is too wide", __func__);
		return (NULL);
	}
	y = strtoul(endptr + 1, &endptr, 10);
	if (endptr != last) {
		log_debug("%s: extra ;", __func__);
		return (NULL);
	}
	if (y > SIXEL_HEIGHT_LIMIT) {
		log_debug("%s: image is too tall", __func__);
		return (NULL);
	}

	si->sx = x;
	sixel_parse_expand_lines(si, y);

	si->set_ra = 1;
	si->ra_x = x;
	si->ra_y = y;

	return (last);
}

/* Parse a SIXEL colour register sequence. */
static const char *
sixel_parse_colour(struct sixel_image *si, const char *cp, const char *end)
{
	const char	*last;
	char		*endptr;
	u_int		 c, type, c1, c2, c3;

	last = cp;
	while (last != end) {
		if (*last != ';' && (*last < '0' || *last > '9'))
			break;
		last++;
	}

	c = strtoul(cp, &endptr, 10);
	if (c > SIXEL_COLOUR_REGISTERS) {
		log_debug("%s: too many colours", __func__);
		return (NULL);
	}
	if (si->used_colours <= c)
		si->used_colours = c + 1;
	si->dc = c + 1;
	if (endptr == last || *endptr != ';')
		return (last);

	type = strtoul(endptr + 1, &endptr, 10);
	if (endptr == last || *endptr != ';') {
		log_debug("%s: missing ;", __func__);
		return (NULL);
	}
	c1 = strtoul(endptr + 1, &endptr, 10);
	if (endptr == last || *endptr != ';') {
		log_debug("%s: missing ;", __func__);
		return (NULL);
	}
	c2 = strtoul(endptr + 1, &endptr, 10);
	if (endptr == last || *endptr != ';') {
		log_debug("%s: missing ;", __func__);
		return (NULL);
	}
	c3 = strtoul(endptr + 1, &endptr, 10);
	if (endptr != last) {
		log_debug("%s: missing ;", __func__);
		return (NULL);
	}

	if ((type != 1 && type != 2) ||
	    (type == 1 && (c1 > 360 || c2 > 100 || c3 > 100)) ||
	    (type == 2 && (c1 > 100 || c2 > 100 || c3 > 100))) {
		log_debug("%s: invalid color %u;%u;%u;%u", __func__, type,
		    c1, c2, c3);
		return (NULL);
	}

	if (c + 1 > si->ncolours) {
		si->colours = xrecallocarray(si->colours, si->ncolours, c + 1,
		    sizeof *si->colours);
		si->ncolours = c + 1;
	}
	si->colours[c] = (type << 25) | (c1 << 16) | (c2 << 8) | c3;
	return (last);
}

/* Parse a SIXEL repeat sequence. */
static const char *
sixel_parse_repeat(struct sixel_image *si, const char *cp, const char *end)
{
	const char	*last;
	char		 tmp[32], ch;
	u_int		 n = 0, i;
	const char	*errstr = NULL;

	last = cp;
	while (last != end) {
		if (*last < '0' || *last > '9')
			break;
		tmp[n++] = *last++;
		if (n == (sizeof tmp) - 1) {
			log_debug("%s: repeat not terminated", __func__);
			return (NULL);
		}
	}
	if (n == 0 || last == end) {
		log_debug("%s: repeat not terminated", __func__);
		return (NULL);
	}
	tmp[n] = '\0';

	n = strtonum(tmp, 1, SIXEL_WIDTH_LIMIT, &errstr);
	if (n == 0 || errstr != NULL) {
		log_debug("%s: repeat too wide", __func__);
		return (NULL);
	}

	ch = (*last++) - 0x3f;
	for (i = 0; i < n; i++) {
		if (sixel_parse_write(si, ch) != 0) {
			log_debug("%s: width limit reached", __func__);
			return (NULL);
		}
		si->dx++;
	}
	return (last);
}

/* Parse SIXEL data into an indexed image. */
struct sixel_image *
sixel_parse(const char *buf, size_t len, u_int p1, u_int p2, u_int cell_w,
	u_int cell_h)
{
	struct sixel_image	*si;
	const char		*cp = buf, *end = buf + len;
	char			 ch;

	if (len == 0 || len == 1 || *cp++ != 'q') {
		log_debug("%s: empty image", __func__);
		return (NULL);
	}

	si = xcalloc (1, sizeof *si);
	si->cell_w = cell_w;
	si->cell_h = cell_h;
	si->p1 = p1;
	si->p2 = p2;

	while (cp != end) {
		ch = *cp++;
		switch (ch) {
		case '"':
			cp = sixel_parse_attributes(si, cp, end);
			if (cp == NULL)
				goto bad;
			break;
		case '#':
			cp = sixel_parse_colour(si, cp, end);
			if (cp == NULL)
				goto bad;
			break;
		case '!':
			cp = sixel_parse_repeat(si, cp, end);
			if (cp == NULL)
				goto bad;
			break;
		case '-':
			si->dx = 0;
			si->dy += 6;
			break;
		case '$':
			si->dx = 0;
			break;
		default:
			if (ch < 0x20)
				break;
			if (ch < 0x3f || ch > 0x7e)
				goto bad;
			if (sixel_parse_write(si, ch - 0x3f) != 0) {
				log_debug("%s: width limit reached", __func__);
				goto bad;
			}
			si->dx++;
			break;
		}
	}

	if (si->sx == 0 || si->sy == 0)
		goto bad;
	return (si);

bad:
	sixel_free(si);
	return (NULL);
}

/* Free an indexed SIXEL image. */
void
sixel_free(struct sixel_image *si)
{
	u_int	y;

	for (y = 0; y < si->sy; y++)
		free(si->lines[y].pixels);
	free(si->lines);

	free(si->colours);
	free(si);
}

/* Write a SIXEL image to the debug log. */
void
sixel_log(struct sixel_image *si)
{
	struct sixel_line	*sl;
	char			 s[SIXEL_WIDTH_LIMIT + 1];
	u_int			 i, x, y, cx, cy;

	sixel_size_in_cells(si, &cx, &cy);
	log_debug("%s: image %ux%u (%ux%u)", __func__, si->sx, si->sy, cx, cy);
	for (i = 0; i < si->ncolours; i++)
		log_debug("%s: colour %u is %07x", __func__, i, si->colours[i]);
	for (y = 0; y < si->sy; y++) {
		sl = &si->lines[y];
		for (x = 0; x < si->sx; x++) {
			if (x >= sl->sx)
				s[x] = '_';
			else if (sl->pixels[x] != 0)
				s[x] = '0' + (sl->pixels[x] - 1) % 10;
			else
				s[x] = '.';
			}
		s[x] = '\0';
		log_debug("%s: %4u: %s", __func__, y, s);
	}
}

/* Return the cell dimensions occupied by a SIXEL image. */
void
sixel_size_in_cells(struct sixel_image *si, u_int *x, u_int *y)
{
	if (si->cell_w == 0)
		si->cell_w = 8;
	if (si->cell_h == 0)
		si->cell_h = 16;
	image_size_in_cells(si->sx, si->sy, si->cell_w, si->cell_h, x, y);
}

#ifdef ENABLE_IMAGES
/* Convert one HLS component to RGB. */
static double
sixel_hue(double p, double q, double t)
{
	if (t < 0)
		t += 1;
	if (t > 1)
		t -= 1;
	if (t < 1.0 / 6)
		return (p + (q - p) * 6 * t);
	if (t < 1.0 / 2)
		return (q);
	if (t < 2.0 / 3)
		return (p + (q - p) * (2.0 / 3 - t) * 6);
	return (p);
}

/* Convert a SIXEL colour register to RGB. */
static void
sixel_colour_to_rgb(u_int colour, u_char *r, u_char *g, u_char *b)
{
	u_int	type = colour >> 25;
	double	h, l, s, p, q;

	if (type == 2) {
		*r = (((colour >> 16) & 0xff) * 255 + 50) / 100;
		*g = (((colour >> 8) & 0xff) * 255 + 50) / 100;
		*b = ((colour & 0xff) * 255 + 50) / 100;
		return;
	}
	if (type != 1) {
		*r = *g = *b = 0;
		return;
	}

	h = ((colour >> 16) & 0x1ff) / 360.0;
	l = ((colour >> 8) & 0xff) / 100.0;
	s = (colour & 0xff) / 100.0;
	if (s == 0) {
		*r = *g = *b = l * 255 + 0.5;
		return;
	}
	q = l < 0.5 ? l * (1 + s) : l + s - l * s;
	p = 2 * l - q;
	/* SIXEL HLS has blue at 0, red at 120 and green at 240 degrees. */
	*r = sixel_hue(p, q, h) * 255 + 0.5;
	*g = sixel_hue(p, q, h - 1.0 / 3) * 255 + 0.5;
	*b = sixel_hue(p, q, h + 1.0 / 3) * 255 + 0.5;
}

/* Convert decoded SIXEL data into the immutable image. */
struct image *
sixel_to_image(struct sixel_image *si)
{
	u_char	*pixels, *pixel, r, g, b;
	u_int	 x, y, c, sx, sy;
	struct image	*im;

	if ((uint64_t)si->sx * si->sy * 4 > SIZE_MAX)
		return (NULL);
	pixels = xcalloc(si->sx * si->sy, 4);
	for (y = 0; y < si->sy; y++) {
		for (x = 0; x < si->sx; x++) {
			c = sixel_get_pixel(si, x, y);
			pixel = pixels + ((size_t)y * si->sx + x) * 4;
			if (c == 0) {
				pixel[3] = si->p2 == 1 ? 0 : 255;
				continue;
			}
			c--;
			if (c < si->ncolours)
				sixel_colour_to_rgb(si->colours[c], &r, &g, &b);
			else
				r = g = b = 0;
			pixel[0] = r;
			pixel[1] = g;
			pixel[2] = b;
			pixel[3] = 255;
		}
	}
	sixel_size_in_cells(si, &sx, &sy);
	if ((uint64_t)sx * si->cell_w > UINT_MAX ||
	    (uint64_t)sy * si->cell_h > UINT_MAX) {
		free(pixels);
		return (NULL);
	}
	im = image_create(si->sx, si->sy, sx * si->cell_w, sy * si->cell_h,
	    sx, sy, pixels);
	if (im == NULL)
		free(pixels);
	else
		image_set_sixel(im, si);
	return (im);
}
#endif

/* Scale or crop an indexed SIXEL image. */
struct sixel_image *
sixel_scale(struct sixel_image *si, u_int cell_w, u_int cell_h, u_int ox,
    u_int oy, u_int sx, u_int sy, int colours)
{
	struct sixel_image	*new;
	u_int			 cx, cy, raster_sx, raster_sy;
	u_int			 pox, poy, psx, psy, tsx, tsy, px, py;
	uint64_t	 x0, x1, y0, y1, tx0, tx1, ty0, ty1;
	u_int			 x, y, i;

	/*
	 * We want to get the section of the image at ox,oy in image cells and
	 * map it onto the same size in terminal cells.
	 */

	sixel_size_in_cells(si, &cx, &cy);
	if (ox >= cx)
		return (NULL);
	if (oy >= cy)
		return (NULL);
	if (ox + sx >= cx)
		sx = cx - ox;
	if (oy + sy >= cy)
		sy = cy - oy;

	if (cell_w == 0)
		cell_w = si->cell_w;
	if (cell_h == 0)
		cell_h = si->cell_h;
	raster_sx = (si->raster_sx != 0 ? si->raster_sx : si->sx);
	raster_sy = (si->raster_sy != 0 ? si->raster_sy : si->sy);
	if (raster_sx > si->sx)
		raster_sx = si->sx;
	if (raster_sy > si->sy)
		raster_sy = si->sy;

	/*
	 * Map complete source cells at their real pixel boundaries and clamp
	 * only the final partial cell to the raster. Dividing the raster evenly
	 * between cells would stretch every complete cell and squash the last.
	 */
	x0 = (uint64_t)ox * si->cell_w;
	x1 = (uint64_t)(ox + sx) * si->cell_w;
	y0 = (uint64_t)oy * si->cell_h;
	y1 = (uint64_t)(oy + sy) * si->cell_h;
	if (x1 > raster_sx)
		x1 = raster_sx;
	if (y1 > raster_sy)
		y1 = raster_sy;
	if (x1 <= x0 || y1 <= y0)
		return (NULL);
	pox = x0;
	poy = y0;
	psx = x1 - x0;
	psy = y1 - y0;

	/*
	 * Preserve any partial final source cell. The grid still covers whole
	 * cells, but the SIXEL raster must end at the corresponding pixel offset
	 * rather than stretching to the cell boundary.
	 */
	tx1 = ((uint64_t)raster_sx * cell_w + si->cell_w - 1) /
	    si->cell_w;
	ty1 = ((uint64_t)raster_sy * cell_h + si->cell_h - 1) /
	    si->cell_h;
	if (tx1 > UINT_MAX || ty1 > UINT_MAX)
		return (NULL);
	tx0 = (uint64_t)ox * cell_w;
	ty0 = (uint64_t)oy * cell_h;
	if (tx0 >= tx1 || ty0 >= ty1)
		return (NULL);
	if ((uint64_t)(ox + sx) * cell_w < tx1)
		tx1 = (uint64_t)(ox + sx) * cell_w;
	if ((uint64_t)(oy + sy) * cell_h < ty1)
		ty1 = (uint64_t)(oy + sy) * cell_h;
	tsx = tx1 - tx0;
	tsy = ty1 - ty0;
	if (tsx == 0 || tsy == 0)
		return (NULL);

	new = xcalloc (1, sizeof *si);
	new->cell_w = cell_w;
	new->cell_h = cell_h;
	new->p1 = si->p1;
	new->p2 = si->p2;

	new->set_ra = si->set_ra;
	/* The raster attributes describe the scaled output rectangle. */
	new->ra_x = tsx;
	new->ra_y = tsy;

	new->used_colours = si->used_colours;
	for (y = 0; y < tsy; y++) {
		py = poy + ((double)y * psy / tsy);
		for (x = 0; x < tsx; x++) {
			px = pox + ((double)x * psx / tsx);
			sixel_set_pixel(new, x, y, sixel_get_pixel(si, px, py));
		}
	}
	/* Keep transparent edges in the scaled raster canvas as well. */
	if (sixel_parse_expand_lines(new, tsy) != 0) {
		sixel_free(new);
		return (NULL);
	}
	new->sx = tsx;

	if (colours && si->ncolours != 0) {
		new->colours = xmalloc(si->ncolours * sizeof *new->colours);
		for (i = 0; i < si->ncolours; i++)
			new->colours[i] = si->colours[i];
		new->ncolours = si->ncolours;
	}
	return (new);
}

/* Fit an indexed SIXEL image into a terminal cell canvas. */
static struct sixel_image *
sixel_fit(struct sixel_image *si, u_int cell_w, u_int cell_h, u_int cells_x,
    u_int cells_y)
{
	struct sixel_image	*new;
	uint64_t		 canvas_width, canvas_height;
	u_int			 width, height, x, y, px, py, i;

	if (si->cell_w == 0)
		si->cell_w = 8;
	if (si->cell_h == 0)
		si->cell_h = 16;
	if (cell_w == 0)
		cell_w = si->cell_w;
	if (cell_h == 0)
		cell_h = si->cell_h;

	canvas_width = (uint64_t)cells_x * cell_w;
	canvas_height = (uint64_t)cells_y * cell_h;
	if (si->sx == 0 || si->sy == 0 || canvas_width == 0 ||
	    canvas_height == 0 || canvas_width > SIXEL_WIDTH_LIMIT ||
	    canvas_height > SIXEL_HEIGHT_LIMIT)
		return (NULL);

	/* Use one scale factor so different terminal cell shapes do not distort. */
	if ((uint64_t)cell_w * si->cell_h <=
	    (uint64_t)cell_h * si->cell_w) {
		width = ((uint64_t)si->sx * cell_w + si->cell_w / 2) /
		    si->cell_w;
		height = ((uint64_t)si->sy * cell_w + si->cell_w / 2) /
		    si->cell_w;
	} else {
		width = ((uint64_t)si->sx * cell_h + si->cell_h / 2) /
		    si->cell_h;
		height = ((uint64_t)si->sy * cell_h + si->cell_h / 2) /
		    si->cell_h;
	}
	if (width == 0)
		width = 1;
	if (height == 0)
		height = 1;
	if (width > canvas_width)
		width = canvas_width;
	if (height > canvas_height)
		height = canvas_height;

	new = xcalloc(1, sizeof *new);
	new->cell_w = cell_w;
	new->cell_h = cell_h;
	new->p1 = si->p1;
	new->p2 = si->p2;
	new->set_ra = 1;
	new->ra_x = width;
	new->ra_y = height;
	new->raster_sx = width;
	new->raster_sy = height;
	new->used_colours = si->used_colours;

	for (y = 0; y < height; y++) {
		py = (uint64_t)y * si->sy / height;
		for (x = 0; x < width; x++) {
			px = (uint64_t)x * si->sx / width;
			sixel_set_pixel(new, x, y, sixel_get_pixel(si, px, py));
		}
	}
	/* Keep the unused part of the cell canvas as blank padding. */
	if (sixel_parse_expand_lines(new, canvas_height) != 0) {
		sixel_free(new);
		return (NULL);
	}
	new->sx = canvas_width;

	if (si->ncolours != 0) {
		new->colours = xmalloc(si->ncolours * sizeof *new->colours);
		for (i = 0; i < si->ncolours; i++)
			new->colours[i] = si->colours[i];
		new->ncolours = si->ncolours;
	}
	return (new);
}

/* Append data to a growing SIXEL output buffer. */
static void
sixel_print_add(char **buf, size_t *len, size_t *used, const char *s,
    size_t slen)
{
	while (*used + slen >= *len + 1) {
		*buf = xreallocarray(*buf, 2, *len);
		(*len) *= 2;
	}
	memcpy(*buf + *used, s, slen);
	(*used) += slen;
}

/* Append a SIXEL character repetition to an output buffer. */
static void
sixel_print_repeat(char **buf, size_t *len, size_t *used, u_int count, char ch)
{
	char	tmp[16];
	size_t	tmplen;

	if (count == 1)
		sixel_print_add(buf, len, used, &ch, 1);
	else if (count == 2) {
		sixel_print_add(buf, len, used, &ch, 1);
		sixel_print_add(buf, len, used, &ch, 1);
	} else if (count == 3) {
		sixel_print_add(buf, len, used, &ch, 1);
		sixel_print_add(buf, len, used, &ch, 1);
		sixel_print_add(buf, len, used, &ch, 1);
	} else if (count != 0) {
		tmplen = xsnprintf(tmp, sizeof tmp, "!%u%c", count, ch);
		sixel_print_add(buf, len, used, tmp, tmplen);
	}
}

/* Build compressed SIXEL output planes for a sixel row. */
static void
sixel_print_compress_colors(struct sixel_image *si, struct sixel_plane *planes,
    u_int y, u_int *active, u_int *nactive)
{
	u_int			 i, x, c, dx, pixels[6];
	struct sixel_plane	*plane = NULL;
	struct sixel_line	*sl;

	for (x = 0; x < si->sx; x++) {
		for (i = 0; i < 6; i++) {
			pixels[i] = 0;
			if (y + i < si->sy) {
				sl = &si->lines[y + i];
				if (x < sl->sx && sl->pixels[x] != 0) {
					pixels[i] = sl->pixels[x];
					c = sl->pixels[x] - 1;
					planes[c].next_pattern |= 1 << i;
				}
			}
		}

		for (i = 0; i < 6; i++) {
			if (pixels[i] == 0)
				continue;

			c = pixels[i] - 1;
			plane = &planes[c];
			if (plane->next_x == x + 1)
				continue;

			if (plane->next_y < y + 1) {
				plane->next_y = y + 1;
				active[(*nactive)++] = c;
			}

			dx = x - plane->next_x;
			if (plane->pattern != plane->next_pattern || dx != 0) {
				sixel_print_repeat(&plane->stream, &plane->stream_len,
				    &plane->stream_used, plane->count,
				    plane->pattern + 0x3f);
				sixel_print_repeat(&plane->stream, &plane->stream_len,
				    &plane->stream_used, dx, '?');
				plane->pattern = plane->next_pattern;
				plane->count = 0;
			}
			plane->count++;
			plane->next_pattern = 0;
			plane->next_x = x + 1;
		}
	}
}

/* Encode an indexed SIXEL image for terminal output. */
char *
sixel_print(struct sixel_image *si, struct sixel_image *map, size_t *size)
{
	char			*buf, tmp[64];
	size_t			 len, used = 0, tmplen;
	u_int			*colours, ncolours, used_colours, i, c, y;
	u_int			*active, nactive;
	struct sixel_plane	*planes, *plane;

	if (map != NULL) {
		colours = map->colours;
		ncolours = map->ncolours;
	} else {
		colours = si->colours;
		ncolours = si->ncolours;
	}

	used_colours = si->used_colours;
	if (used_colours == 0)
		return (NULL);

	len = 8192;
	buf = xmalloc(len);

	tmplen = xsnprintf(tmp, sizeof tmp, "\033P%u;%uq", si->p1, si->p2);
	sixel_print_add(&buf, &len, &used, tmp, tmplen);

	if (si->set_ra) {
		tmplen = xsnprintf(tmp, sizeof tmp, "\"1;1;%u;%u", si->ra_x,
		    si->ra_y);
		sixel_print_add(&buf, &len, &used, tmp, tmplen);
	}

	/* The colour panes in the current sixel-row band. */
	planes = xcalloc(used_colours, sizeof *planes);
	/*
	 * active records which colour planes actually contain pixels
	 * in the current sixel-row band.
	 */
	active = xcalloc(used_colours, sizeof *active);

	for (i = 0; i < ncolours; i++) {
		c = colours[i];
		tmplen = xsnprintf(tmp, sizeof tmp, "#%u;%u;%u;%u;%u",
		    i, c >> 25, (c >> 16) & 0x1ff, (c >> 8) & 0xff, c & 0xff);
		sixel_print_add(&buf, &len, &used, tmp, tmplen);
	}

	for (i = 0; i < used_colours; i++) {
		plane = &planes[i];
		plane->stream_len = 8;
		plane->stream = xmalloc(plane->stream_len);
	}

	for (y = 0; y < si->sy; y += 6) {
		nactive = 0;
		sixel_print_compress_colors(si, planes, y, active, &nactive);

		for (i = 0; i < nactive; i++) {
			c = active[i];
			plane = &planes[c];
			tmplen = xsnprintf(tmp, sizeof tmp, "#%u", c);
			sixel_print_add(&buf, &len, &used, tmp, tmplen);
			sixel_print_add(&buf, &len, &used, plane->stream,
			    plane->stream_used);
			sixel_print_repeat(&buf, &len, &used, plane->count,
			    plane->pattern + 0x3f);
			sixel_print_add(&buf, &len, &used, "$", 1);
			plane->stream_used = plane->next_x = plane->count = 0;
		}

		if (buf[used - 1] == '$')
			used--;
		sixel_print_add(&buf, &len, &used, "-", 1);
	}
	if (buf[used - 1] == '-')
		used--;

	sixel_print_add(&buf, &len, &used, "\033\\", 2);

	buf[used] = '\0';
	if (size != NULL)
		*size = used;

	for (i = 0; i < used_colours; i++)
		free(planes[i].stream);
	free(active);
	free(planes);

	return (buf);
}

/* Split a 5-bit RGB histogram into an adaptive palette using median cut. */
static void
sixel_box_update(struct sixel_box *box, struct sixel_hgram *hg)
{
	struct sixel_hgram	*entry;
	u_int			 red, green, blue, index;
	u_int			 red_min = SIXEL_HISTOGRAM_LEVELS;
	u_int			 green_min = SIXEL_HISTOGRAM_LEVELS;
	u_int			 blue_min = SIXEL_HISTOGRAM_LEVELS;
	u_int			 red_max = 0, green_max = 0, blue_max = 0;
	u_int			 count = 0;

	for (red = box->red_min; red <= box->red_max; red++) {
		for (green = box->green_min; green <= box->green_max; green++) {
			for (blue = box->blue_min; blue <= box->blue_max; blue++) {
				index = (red << 10)|(green << 5)|blue;
				entry = &hg[index];
				if (entry->count == 0)
					continue;
				if (red < red_min)
					red_min = red;
				if (red > red_max)
					red_max = red;
				if (green < green_min)
					green_min = green;
				if (green > green_max)
					green_max = green;
				if (blue < blue_min)
					blue_min = blue;
				if (blue > blue_max)
					blue_max = blue;
				count += entry->count;
			}
		}
	}
	box->count = count;
	if (count == 0)
		return;
	box->red_min = red_min;
	box->red_max = red_max;
	box->green_min = green_min;
	box->green_max = green_max;
	box->blue_min = blue_min;
	box->blue_max = blue_max;
}

/* Split a histogram box at its weighted median. */
static int
sixel_box_split(struct sixel_box *box, struct sixel_box *new,
    struct sixel_hgram *hg)
{
	u_int	 levels[SIXEL_HISTOGRAM_LEVELS] = { 0 };
	u_int	 red, green, blue, index, channel, first, last, level;
	u_int	 red_range, green_range, blue_range, count = 0;

	red_range = box->red_max - box->red_min;
	green_range = box->green_max - box->green_min;
	blue_range = box->blue_max - box->blue_min;
	if (red_range == 0 && green_range == 0 && blue_range == 0)
		return (0);
	if (green_range >= red_range && green_range >= blue_range)
		channel = 1;
	else if (red_range >= blue_range)
		channel = 0;
	else
		channel = 2;

	for (red = box->red_min; red <= box->red_max; red++) {
		for (green = box->green_min; green <= box->green_max; green++) {
			for (blue = box->blue_min; blue <= box->blue_max; blue++) {
				index = (red << 10)|(green << 5)|blue;
				if (channel == 0)
					levels[red] += hg[index].count;
				else if (channel == 1)
					levels[green] += hg[index].count;
				else
					levels[blue] += hg[index].count;
			}
		}
	}
	if (channel == 0) {
		first = box->red_min;
		last = box->red_max;
	} else if (channel == 1) {
		first = box->green_min;
		last = box->green_max;
	} else {
		first = box->blue_min;
		last = box->blue_max;
	}
	for (level = first; level < last; level++) {
		count += levels[level];
		if (count >= box->count / 2)
			break;
	}
	/* Keep the maximum occupied level in the new box. */
	if (level == last)
		level--;
	memcpy(new, box, sizeof *new);
	if (channel == 0) {
		box->red_max = level;
		new->red_min = level + 1;
	} else if (channel == 1) {
		box->green_max = level;
		new->green_min = level + 1;
	} else {
		box->blue_max = level;
		new->blue_min = level + 1;
	}
	sixel_box_update(box, hg);
	sixel_box_update(new, hg);
	return (box->count != 0 && new->count != 0);
}

/* Build an adaptive palette from an RGB histogram. */
static u_int
sixel_make_palette(struct sixel_hgram *hg,
    struct sixel_rgb *palette)
{
	struct sixel_box	 boxes[SIXEL_PALETTE_SIZE], new;
	struct sixel_box	*box;
	uint64_t	 best_score, score, red, green, blue, count;
	u_int		 i, nboxes = 1, best, r, g, b, index;
	u_int		 red_range, green_range, blue_range;

	memset(&boxes[0], 0, sizeof boxes[0]);
	boxes[0].red_max = boxes[0].green_max = boxes[0].blue_max =
	    SIXEL_HISTOGRAM_LEVELS - 1;
	sixel_box_update(&boxes[0], hg);
	if (boxes[0].count == 0)
		return (0);

	while (nboxes < SIXEL_PALETTE_SIZE) {
		best = nboxes;
		best_score = 0;
		for (i = 0; i < nboxes; i++) {
			box = &boxes[i];
			red_range = box->red_max - box->red_min;
			green_range = box->green_max - box->green_min;
			blue_range = box->blue_max - box->blue_min;
			score = (uint64_t)box->count *
			    (red_range * red_range + green_range * green_range +
			    blue_range * blue_range);
			if (score > best_score) {
				best = i;
				best_score = score;
			}
		}
		if (best == nboxes ||
		    !sixel_box_split(&boxes[best], &new, hg))
			break;
		memcpy(&boxes[nboxes++], &new, sizeof new);
	}

	for (i = 0; i < nboxes; i++) {
		box = &boxes[i];
		red = green = blue = count = 0;
		for (r = box->red_min; r <= box->red_max; r++) {
			for (g = box->green_min; g <= box->green_max; g++) {
				for (b = box->blue_min; b <= box->blue_max; b++) {
					index = (r << 10)|(g << 5)|b;
					red += hg[index].red;
					green += hg[index].green;
					blue += hg[index].blue;
					count += hg[index].count;
				}
			}
		}
		palette[i].red = (red + count / 2) / count;
		palette[i].green = (green + count / 2) / count;
		palette[i].blue = (blue + count / 2) / count;
	}
	return (nboxes);
}

/* Find the closest adaptive palette entry for an RGB colour. */
static u_int
sixel_nearest_colour(struct sixel_rgb *palette, u_int ncolours,
    uint16_t *cache, u_int red, u_int green, u_int blue)
{
	uint64_t	 distance, best_distance = UINT64_MAX;
	int		 dr, dg, db;
	u_int		 i, best = 0, index;

	index = ((red >> 3) << 10)|((green >> 3) << 5)|(blue >> 3);
	if (cache[index] != UINT16_MAX)
		return (cache[index]);
	for (i = 0; i < ncolours; i++) {
		dr = (int)red - palette[i].red;
		dg = (int)green - palette[i].green;
		db = (int)blue - palette[i].blue;
		distance = 3ULL * dr * dr + 6ULL * dg * dg + db * db;
		if (distance < best_distance) {
			best = i;
			best_distance = distance;
		}
	}
	cache[index] = best;
	return (best);
}

/* Clamp an RGB component to the valid range. */
static u_int
sixel_clamp_colour(int colour)
{
	if (colour < 0)
		return (0);
	if (colour > 255)
		return (255);
	return (colour);
}

/* Return a source pixel mapped to an output SIXEL pixel. */
static const u_char *
sixel_from_image_pixel(const struct sixel_source *source, u_int sourcex0,
    u_int sourcey0,
    u_int sourcewidth, u_int sourceheight, u_int sx, u_int sy, u_int x,
    u_int y)
{
	u_int	 sourcex, sourcey;

	sourcex = sourcex0 + (uint64_t)x * sourcewidth / sx;
	sourcey = sourcey0 + (uint64_t)y * sourceheight / sy;
	if (sourcex >= source->width)
		sourcex = source->width - 1;
	if (sourcey >= source->height)
		sourcey = source->height - 1;
	return (source->pixels + sourcey * source->stride + sourcex * 4);
}

/* Render an image rectangle as an indexed SIXEL image. */
static struct sixel_image *
sixel_from_image(struct image *im, u_int ox, u_int oy, u_int cells_x,
	u_int cells_y, u_int cell_w, u_int cell_h)
{
	struct sixel_image	*si;
	struct sixel_hgram	*hg, *entry;
	struct sixel_rgb	 palette[SIXEL_PALETTE_SIZE];
	struct sixel_source	 source;
	const u_char		*pixel;
	uint16_t		*cache;
	int			*current, *next, *tmp;
	int			 red_error, green_error, blue_error, alpha_error;
	u_int			 x, y, sx, sy, index, error_index;
	u_int			 sourcex0, sourcey0, sourcewidth, sourceheight;
	u_int			 red, green, blue, alpha, colour, i, ncolours;
	uint64_t		 destination_width, destination_height;
	uint64_t		 content_width, content_height, x0, x1, y0, y1;

	/* Work out the requested cell crop in destination pixel coordinates. */
	source.pixels = image_get_pixels(im, &source.stride, NULL);
	image_get_size(im, &source.width, &source.height);
	image_get_canvas_size(im, &source.canvas_width,
	    &source.canvas_height);
	image_get_size_in_cells(im, &source.sx, &source.sy);
	destination_width = (uint64_t)source.sx * cell_w;
	destination_height = (uint64_t)source.sy * cell_h;
	if (destination_width > UINT_MAX || destination_height > UINT_MAX)
		return (NULL);
	content_width = ((uint64_t)source.width * destination_width +
	    source.canvas_width - 1) / source.canvas_width;
	content_height = ((uint64_t)source.height * destination_height +
	    source.canvas_height - 1) / source.canvas_height;

	/* Convert the requested cell rectangle to clipped output pixel bounds. */
	x0 = (uint64_t)ox * cell_w;
	y0 = (uint64_t)oy * cell_h;
	x1 = ((uint64_t)ox + cells_x) * cell_w;
	y1 = ((uint64_t)oy + cells_y) * cell_h;
	if (x1 > content_width)
		x1 = content_width;
	if (y1 > content_height)
		y1 = content_height;
	if (x1 <= x0 || y1 <= y0)
		return (NULL);

	/* The clipped output bounds determine the SIXEL image dimensions. */
	sx = x1 - x0;
	sy = y1 - y0;
	if (sx == 0 || sy == 0 || sx > SIXEL_WIDTH_LIMIT ||
	    sy > SIXEL_HEIGHT_LIMIT)
		return (NULL);

	/* Map the requested cell crop to the source image's pixel rectangle. */
	image_get_pixel_rect(im, ox, oy, cells_x, cells_y, &sourcex0,
	    &sourcey0, &sourcewidth, &sourceheight);
	if (sourcewidth == 0 || sourceheight == 0)
		return (NULL);

	/* Build an adaptive palette from the visible nontransparent pixels. */
	hg = xcalloc(SIXEL_HISTOGRAM_SIZE, sizeof *hg);
	for (y = 0; y < sy; y++) {
		for (x = 0; x < sx; x++) {
			pixel = sixel_from_image_pixel(&source, sourcex0, sourcey0,
			    sourcewidth, sourceheight, sx, sy, x, y);
			if (pixel[3] == 0)
				continue;

			/* Add this opaque pixel to its 5-bit RGB histogram bucket. */
			index = ((pixel[0] >> 3) << 10)|
			    ((pixel[1] >> 3) << 5)|(pixel[2] >> 3);
			entry = &hg[index];
			entry->count++;
			entry->red += pixel[0];
			entry->green += pixel[1];
			entry->blue += pixel[2];
		}
	}
	ncolours = sixel_make_palette(hg, palette);
	free(hg);
	if (ncolours == 0)
		return (NULL);

	/* Create the indexed SIXEL image and convert its palette to SIXEL RGB. */
	si = xcalloc(1, sizeof *si);
	si->cell_w = cell_w;
	si->cell_h = cell_h;
	si->p1 = 9;
	si->p2 = 1;
	si->set_ra = 1;
	si->ra_x = sx;
	si->ra_y = sy;
	si->ncolours = si->used_colours = ncolours;
	si->colours = xcalloc(si->ncolours, sizeof *si->colours);
	for (i = 0; i < si->ncolours; i++) {
		red = (palette[i].red * 100 + 127) / 255;
		green = (palette[i].green * 100 + 127) / 255;
		blue = (palette[i].blue * 100 + 127) / 255;
		si->colours[i] = (2U << 25)|(red << 16)|(green << 8)|blue;
	}

	/* Floyd-Steinberg dither colour and alpha into the indexed image. */
	cache = xmalloc(SIXEL_HISTOGRAM_SIZE * sizeof *cache);
	memset(cache, 0xff, SIXEL_HISTOGRAM_SIZE * sizeof *cache);
	current = xcalloc(((size_t)sx + 2) * 4, sizeof *current);
	next = xcalloc(((size_t)sx + 2) * 4, sizeof *next);
	for (y = 0; y < sy; y++) {
		for (x = 0; x < sx; x++) {
			pixel = sixel_from_image_pixel(&source, sourcex0, sourcey0,
			    sourcewidth, sourceheight, sx, sy, x, y);
			error_index = (x + 1) * 4;
			/* SIXEL pixels are binary, so dither alpha separately. */
			alpha = sixel_clamp_colour((int)pixel[3] +
			    current[error_index + 3] / 16);
			alpha_error = (int)alpha;
			if (alpha >= 128) {
				alpha_error -= 255;
				red = sixel_clamp_colour((int)pixel[0] +
				    current[error_index] / 16);
				green = sixel_clamp_colour((int)pixel[1] +
				    current[error_index + 1] / 16);
				blue = sixel_clamp_colour((int)pixel[2] +
				    current[error_index + 2] / 16);
				colour = sixel_nearest_colour(palette, ncolours, cache,
				    red, green, blue);
				if (sixel_set_pixel(si, x, y, colour + 1) != 0)
					goto fail;

				/* Calculate the RGB error introduced by palette quantization. */
				red_error = (int)red - palette[colour].red;
				green_error = (int)green - palette[colour].green;
				blue_error = (int)blue - palette[colour].blue;
				/*
				 * Diffuse the error with the Floyd-Steinberg 7/16, 3/16,
				 * 5/16, 1/16 kernel; the accumulated error is divided by 16.
				 */
				current[error_index + 4] += red_error * 7;
				current[error_index + 5] += green_error * 7;
				current[error_index + 6] += blue_error * 7;
				next[error_index - 4] += red_error * 3;
				next[error_index - 3] += green_error * 3;
				next[error_index - 2] += blue_error * 3;
				next[error_index] += red_error * 5;
				next[error_index + 1] += green_error * 5;
				next[error_index + 2] += blue_error * 5;
				next[error_index + 4] += red_error;
				next[error_index + 5] += green_error;
				next[error_index + 6] += blue_error;
			}
			/* Diffuse alpha independently using the same kernel. */
			current[error_index + 7] += alpha_error * 7;
			next[error_index - 1] += alpha_error * 3;
			next[error_index + 3] += alpha_error * 5;
			next[error_index + 7] += alpha_error;
		}
		/* Advance to the next output row's accumulated error. */
		tmp = current;
		current = next;
		next = tmp;

		/* Reuse the old row buffer to accumulate the row after that. */
		memset(next, 0, ((size_t)sx + 2) * 4 * sizeof *next);
	}

	free(current);
	free(next);
	free(cache);
	return (si);

fail:
	/* Discard a partially built image after an allocation or size failure. */
	free(current);
	free(next);
	free(cache);
	sixel_free(si);
	return (NULL);
}

/* Return the SIXEL output cache for a terminal. */
static struct sixel_output *
sixel_get_output(struct tty *tty)
{
	struct sixel_output	*so = tty->image_data;

	if (so == NULL) {
		so = xcalloc(1, sizeof *so);
		tty->image_data = so;
	}
	return (so);
}

/* Return the memory used by an indexed SIXEL image. */
static size_t
sixel_image_size(struct sixel_image *si)
{
	uint64_t	 size;

	if ((uint64_t)si->sx * si->sy > SIZE_MAX / sizeof(uint16_t))
		return (0);
	size = (uint64_t)si->sx * si->sy * sizeof(uint16_t);
	if ((uint64_t)si->ncolours * sizeof *si->colours > SIZE_MAX - size)
		return (0);
	size += (uint64_t)si->ncolours * sizeof *si->colours;
	if (size > SIZE_MAX)
		return (0);
	return (size);
}

/* Remove an image from the SIXEL output cache. */
static void
sixel_remove_cache(struct sixel_output *so, struct sixel_image_cache **pp)
{
	struct sixel_image_cache	*cache = *pp;

	*pp = cache->next;
	so->size -= cache->size;
	sixel_free(cache->si);
	free(cache);
}

/* Drop SIXEL cache entries whose source images have gone away. */
static void
sixel_collect_images(struct sixel_output *so)
{
	struct sixel_image_cache	**pp, *cache;

	for (pp = &so->images; (cache = *pp) != NULL; ) {
		if (image_find(cache->server_id) == NULL)
			sixel_remove_cache(so, pp);
		else
			pp = &cache->next;
	}
}

/* Free SIXEL output state for a terminal. */
void
sixel_free_output(struct tty *tty, __unused int send)
{
	struct sixel_output		*so = tty->image_data;
	struct sixel_image_cache	*cache, *next;

	if (so == NULL)
		return;
	for (cache = so->images; cache != NULL; cache = next) {
		next = cache->next;
		sixel_free(cache->si);
		free(cache);
	}
	free(so);
	tty->image_data = NULL;
}

/* Render an image at a terminal's current pixel geometry. */
static struct sixel_image *
sixel_render_image(struct image *im, u_int cell_w, u_int cell_h)
{
	struct sixel_image	*original;
	u_int			 sx, sy;

	image_get_size_in_cells(im, &sx, &sy);
	/* Preserve SIXEL's original palette and indexed pixels when possible. */
	original = image_get_sixel(im);
	if (original != NULL)
		return (sixel_fit(original, cell_w, cell_h, sx, sy));
	return (sixel_from_image(im, 0, 0, sx, sy, cell_w, cell_h));
}

/* Return a rendered image from the SIXEL output cache. */
static struct sixel_image *
sixel_get_image(struct tty *tty, struct image *im)
{
	struct sixel_output		*so = sixel_get_output(tty);
	struct sixel_image_cache	**pp, *cache, **oldest;
	struct sixel_image		*si;
	size_t			 size;

	sixel_collect_images(so);
	for (cache = so->images; cache != NULL; cache = cache->next) {
		if (cache->server_id != image_get_id(im) ||
		    cache->cell_w != tty->xpixel ||
		    cache->cell_h != tty->ypixel)
			continue;
		cache->age = ++so->age;
		return (cache->si);
	}

	si = sixel_render_image(im, tty->xpixel, tty->ypixel);
	if (si == NULL)
		return (NULL);
	size = sixel_image_size(si);
	if (size == 0 || size > IMAGE_SIZE_LIMIT) {
		/* The renderer still has a usable image, but it is not cacheable. */
		return (si);
	}
	while (so->size > IMAGE_SIZE_LIMIT - size) {
		oldest = NULL;
		for (pp = &so->images; (cache = *pp) != NULL;
		    pp = &cache->next) {
			if (oldest == NULL || cache->age < (*oldest)->age)
				oldest = pp;
		}
		if (oldest == NULL)
			break;
		sixel_remove_cache(so, oldest);
	}
	cache = xcalloc(1, sizeof *cache);
	cache->server_id = image_get_id(im);
	cache->cell_w = tty->xpixel;
	cache->cell_h = tty->ypixel;
	cache->size = size;
	cache->age = ++so->age;
	cache->si = si;
	cache->next = so->images;
	so->images = cache;
	so->size += size;
	return (si);
}

/* Return if a SIXEL image is held by the output cache. */
static int
sixel_image_is_cached(struct tty *tty, struct sixel_image *si)
{
	struct sixel_output		*so = tty->image_data;
	struct sixel_image_cache	*cache;

	if (so == NULL)
		return (0);
	for (cache = so->images; cache != NULL; cache = cache->next) {
		if (cache->si == si)
			return (1);
	}
	return (0);
}

/* Draw an image rectangle with SIXEL output. */
void
sixel_draw_rect(struct tty *tty, const struct image_rect *rectangle,
    __unused const struct tty_style_ctx *style_ctx)
{
	struct sixel_image	*si, *crop;
	char			*data;
	size_t			 size;
	u_int			 source_x, source_y, width, height;
	u_int			 destination_x, destination_y;

	si = sixel_get_image(tty, image_rect_get_image(rectangle));
	if (si == NULL)
		return;
	image_rect_get_coords(rectangle, &source_x, &source_y, &width,
	    &height, &destination_x, &destination_y);
	crop = sixel_scale(si, tty->xpixel, tty->ypixel,
	    source_x, source_y, width, height, 1);
	if (!sixel_image_is_cached(tty, si))
		sixel_free(si);
	if (crop == NULL)
		return;
	data = sixel_print(crop, NULL, &size);
	sixel_free(crop);
	if (data == NULL)
		return;
	tty_region_off(tty);
	tty_margin_off(tty);
	tty_cursor(tty, destination_x, destination_y);
	tty->flags |= TTY_NOBLOCK;
	tty_putn(tty, data, size, 0);
	/* SIXEL moves the cursor, but does not change terminal attributes. */
	tty->cx = tty->cy = UINT_MAX;
	free(data);
}

/* Remove old SIXEL pixels before replaying a dirty image area. */
void
sixel_redraw_start(struct tty *tty, u_int x, u_int y, u_int sx, u_int sy)
{
	u_int	yy;

	for (yy = y; yy < y + sy; yy++) {
		tty_cursor(tty, x, yy);
		if (tty_term_has(tty->term, TTYC_ECH))
			tty_putcode_i(tty, TTYC_ECH, sx);
		else
			tty_repeat_space(tty, sx);
	}
}

/* Convert a SIXEL image to a fallback screen. */
struct screen *
sixel_to_screen(struct sixel_image *si)
{
	struct screen		*s;
	struct screen_write_ctx	 ctx;
	struct grid_cell	 gc;
	u_int			 x, y, sx, sy;

	sixel_size_in_cells(si, &sx, &sy);

	s = xmalloc(sizeof *s);
	screen_init(s, sx, sy, 0);

	memcpy(&gc, &grid_default_cell, sizeof gc);
	gc.attr |= (GRID_ATTR_CHARSET|GRID_ATTR_DIM);
	utf8_set(&gc.data, '~');

	screen_write_start(&ctx, s);
	if (sx == 1 || sy == 1) {
		for (y = 0; y < sy; y++) {
			for (x = 0; x < sx; x++)
				grid_view_set_cell(s->grid, x, y, &gc);
		}
	} else {
		screen_write_box(&ctx, sx, sy, BOX_LINES_DEFAULT, NULL, NULL);
		for (y = 1; y < sy - 1; y++) {
			for (x = 1; x < sx - 1; x++)
				grid_view_set_cell(s->grid, x, y, &gc);
		}
	}
	screen_write_stop(&ctx);
	return (s);
}