1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314
|
/*
Copyright (c) 2003 Bruno T. C. de Oliveira
LICENSE INFORMATION:
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
License as published by the Free Software Foundation; either
version 2 of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received a copy of the GNU General Public
License along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
Copyright (c) 2002 Bruno T. C. de Oliveira
INFORMAES DE LICENA:
Este programa um software de livre distribuio; voc pode
redistribu-lo e/ou modific-lo sob os termos da GNU General
Public License, conforme publicado pela Free Software Foundation,
pela verso 2 da licena ou qualquer verso posterior.
Este programa distribudo na esperana de que ele ser til
aos seus usurios, porm, SEM QUAISQUER GARANTIAS; sem sequer
a garantia implcita de COMERCIABILIDADE ou DE ADEQUAO A
QUALQUER FINALIDADE ESPECFICA. Consulte a GNU General Public
License para obter mais detalhes (uma cpia acompanha este
programa, armazenada no arquivo COPYING).
*/
#include "bores/bores.h"
#include <stdlib.h>
#include <string.h>
#include <ncurses.h>
#include "layer.h"
#include "chtr.h"
const Cell BLANK_CELL = { ' ', 0x70 };
Layer *layer_create(const char *layer_name, int width, int height) {
int i, j;
Layer *layer = (Layer *) zalloc(sizeof(Layer));
layer->name = 0;
dstrset(&layer->name, layer_name);
layer->width = width;
layer->height = height;
layer->visible = true;
layer->transp = false;
layer->cells = (Cell**) zalloc(width * sizeof(Cell*));
for (i = 0; i < width; i++) {
layer->cells[i] = (Cell*) zalloc(height * sizeof(Cell));
for (j = 0; j < height; j++) {
layer->cells[i][j].ch = ' ';
layer->cells[i][j].attr = 0x70;
}
}
return layer;
}
void layer_destroy(Layer *layer) {
int i;
if (!layer) return;
dstrset(&layer->name, 0);
for (i = 0; i < layer->width; i++) free(layer->cells[i]);
free(layer->cells);
}
bool is_cell_transp(const Cell *c) {
return c->ch == ' ' && c->attr == 0x70;
}
void layer_blit(Layer *src, int xsrc, int ysrc, int width, int height,
Layer *dst, int xdst, int ydst) {
int dx, dy;
int src_x, src_y, dst_x, dst_y;
/* brace your self to read the most inefficient blit code you have
* ever read in your life. The following algorithm makes bubble-sort
* look blazing fast. */
for (dx = 0; dx < width; dx++) {
for (dy = 0; dy < height; dy++) {
src_x = xsrc + dx;
src_y = ysrc + dy;
dst_x = xdst + dx;
dst_y = ydst + dy;
if (!layer_valid_cell(src, src_x, src_y) ||
!layer_valid_cell(dst, dst_x, dst_y)) continue;
if (src->transp &&
is_cell_transp(&src->cells[src_x][src_y])) continue;
dst->cells[dst_x][dst_y] = src->cells[src_x][src_y];
}
}
}
bool layer_valid_cell(Layer *layer, int x, int y) {
return (x >= 0 && x < layer->width && y >= 0 && y < layer->height);
}
void layer_paint(Layer *layer, int x0, int y0, int xclip, int yclip,
int wclip, int hclip,
void (*modify)(int x, int y, int *ch, int *attr)) {
int x, xi, xf; int y, yi, yf; int ch, attr;
interval_intersect(x0 , x0 + layer->width - 1,
xclip, xclip + wclip - 1, &xi, &xf);
interval_intersect(y0 , y0 + layer->height - 1,
yclip, yclip + hclip - 1, &yi, &yf);
for (x = xi; x <= xf; x++) for (y = yi; y <= yf; y++) {
if (!kurses_move(x, y)) continue;
ch = layer->cells[x - x0][y - y0].ch;
attr = layer->cells[x - x0][y - y0].attr;
if (modify) (*modify)(x - x0, y - y0, &ch, &attr);
if (layer->transp &&
is_cell_transp(&layer->cells[x - x0][y - y0])) continue;
kurses_color(attr >> 4, attr & 0x0F);
addch(chtr_a2c(ch));
}
}
void layer_paint_opaque(Layer *layer, int x0, int y0, int xclip, int yclip,
int wclip, int hclip,
void (*modify)(int x, int y, int *ch, int *attr)) {
bool backup = layer->transp;
layer->transp = false;
layer_paint(layer, x0, y0, xclip, yclip, wclip, hclip, modify);
layer->transp = backup;
/* I agree, this is a monument to sloppiness.
* But it works, and does what is promised by the documentation. */
}
Layer *layer_dup(const char *layer_name, Layer *model) {
Layer *l;
if (!model) return NULL;
l = layer_create(layer_name, model->width, model->height);
l->transp = model->transp;
layer_blit(model, 0, 0, model->width, model->height, l, 0, 0);
return l;
}
/* table is a vector of two strings. If ch is found in table[0] at position n,
* return value is table[1][n]. Else, return value is ch.
* table[0] and table[1] are assumed to be of the same size. */
static char tbl_lookup(char **table, int ch) {
const char *s = table[0], *p = table[1];
while (*s) {
if (*(s++) == ch) return *p;
p++;
}
return ch;
}
void layer_flip_x(Layer *layer, bool flipchars) {
Layer *tmp;
int x, y;
static char *flip_table[2] = {
"`'()/\\<>[]{}\x03\x05\x06\x08\x09\x0b", /* funny hex chars are line */
"'`)(\\/><][}{\x05\x03\x08\x06\x0b\x09" /* drawing chars (see chtr.h) */
};
tmp = layer_dup("tmp", layer);
for (y = 0; y < layer->height; y++) {
for (x = 0; x < layer->width; x++) {
Cell c = tmp->cells[x][y];
if (flipchars) c.ch = tbl_lookup(flip_table, c.ch);
layer->cells[layer->width - x - 1][y] = c;
}
}
layer_destroy(tmp);
}
void layer_flip_y(Layer *layer, bool flipchars) {
Layer *tmp;
int x, y;
static char *flip_table[2] = {
"/\\\x03\x09\x04\x0a\x05\x0b",
"\\/\x09\x03\x0a\x04\x0b\x05"
};
tmp = layer_dup("tmp", layer);
for (y = 0; y < layer->height; y++) {
for (x = 0; x < layer->width; x++) {
Cell c = tmp->cells[x][y];
if (flipchars) c.ch = tbl_lookup(flip_table, c.ch);
layer->cells[x][layer->height - y - 1] = c;
}
}
layer_destroy(tmp);
}
void layer_save(Layer *lyr, AeFile *f) {
int x, y;
char *buf = zalloc(lyr->width * 4 + 1);
aeff_write_header(f, "Layer");
aeff_write_string(f, "name", lyr->name ? lyr->name : "unnamed");
aeff_write_int(f, "width", lyr->width);
aeff_write_int(f, "height", lyr->height);
aeff_write_bool(f, "visible", lyr->visible);
aeff_write_bool(f, "transparent", lyr->transp);
for (y = 0; y < lyr->height; y++) {
/* fill in buf with current line (decoded into hex duplets) */
for (x = 0; x < lyr->width; x++) {
chr2hex(lyr->cells[x][y].ch, &buf[x * 4]);
chr2hex(lyr->cells[x][y].attr, &buf[x * 4 + 2]);
}
/* save line to file */
aeff_write_string(f, "layer-line", buf);
}
aeff_write_footer(f, "Layer");
zfree(&buf);
}
Layer *layer_load(AeFile *f) {
int x, y;
char *buf = 0;
Layer *lyr = NULL;
char *name = 0;
int width, height;
if (!aeff_read_header(f, "Layer")) goto exception;
if (!aeff_read_string(f, "name", &name)) goto exception;
if (!aeff_read_int(f, "width", &width)) goto exception;
if (!aeff_read_int(f, "height", &height)) goto exception;
lyr = layer_create(name, width, height);
zfree(&name);
if (!aeff_read_bool(f, "visible", &lyr->visible)) goto exception;
if (!aeff_read_bool(f, "transparent", &lyr->transp)) goto exception;
for (y = 0; y < lyr->height; y++) {
if (!aeff_read_string(f, "layer-line", &buf)) goto exception;
if (strlen(buf) != lyr->width * 4) {
aeff_set_error("layer-line line has incorrect width");
goto exception;
}
/* interpret buf as width*4 hex duplets specifying char and attribute
* for each cell in the line */
for (x = 0; x < lyr->width; x++) {
lyr->cells[x][y].ch = hex2chr(&buf[x * 4]);
lyr->cells[x][y].attr = hex2chr(&buf[x * 4 + 2]);
}
zfree(&buf);
}
aeff_read_footer(f, "Layer");
return lyr;
exception:
if (lyr) layer_destroy(lyr);
if (buf) zfree(&buf);
return NULL;
}
Layer *layer_load_OLD(FILE *f) {
char *lyr_name;
char signature[3];
int width, height, x, y;
bool v, t;
Layer *l;
signature[0] = fgetc(f);
signature[1] = fgetc(f);
signature[2] = 0;
if (strcmp(signature, "L3")) return NULL; /* unknown format */
if ( !(lyr_name = floadstr(f)) ) return NULL;
fread(&width, sizeof(int), 1, f);
fread(&height, sizeof(int), 1, f);
v = fgetc(f) ? true : false;
t = fgetc(f) ? true : false;
l = layer_create(lyr_name, width, height);
l->visible = v;
l->transp = t;
for (x = 0; x < width; x++) for (y = 0; y < height; y++) {
l->cells[x][y].ch = fgetc(f);
l->cells[x][y].attr = fgetc(f);
}
return l;
}
|