Coverage Report

Created: 2025-06-10 07:19

/src/ghostpdl/base/gxclbits.c
Line
Count
Source (jump to first uncovered line)
1
/* Copyright (C) 2001-2023 Artifex Software, Inc.
2
   All Rights Reserved.
3
4
   This software is provided AS-IS with no warranty, either express or
5
   implied.
6
7
   This software is distributed under license and may not be copied,
8
   modified or distributed except as expressly authorized under the terms
9
   of the license contained in the file LICENSE in this distribution.
10
11
   Refer to licensing information at http://www.artifex.com or contact
12
   Artifex Software, Inc.,  39 Mesa Street, Suite 108A, San Francisco,
13
   CA 94129, USA, for further information.
14
*/
15
16
17
/* Halftone and bitmap writing for command lists */
18
#include "memory_.h"
19
#include "gx.h"
20
#include "gpcheck.h"
21
#include "gserrors.h"
22
#include "gsbitops.h"
23
#include "gxdevice.h"
24
#include "gxdevmem.h"   /* must precede gxcldev.h */
25
#include "gdevprn.h"            /* for BLS_force_memory */
26
#include "gxcldev.h"
27
#include "gxfmap.h"
28
#include "gxpcolor.h"   /* for gx_device_is_pattern_clist */
29
30
/*
31
 * Define when, if ever, to write character bitmaps in all bands.
32
 * Set this to:
33
 *      0 to always write in all bands;
34
 *      N to write in all bands when the character has been seen in N+1
35
 *         bands on a page;
36
 *      max_ushort to never write in all bands.
37
 */
38
1.15M
#define CHAR_ALL_BANDS_COUNT max_ushort
39
40
/* ------ Writing ------ */
41
42
/*
43
 * Determine the (possibly unpadded) width in bytes for writing a bitmap,
44
 * per the algorithm in gxcldev.h.  If compression_mask has any of the
45
 * cmd_mask_compress_any bits set, we assume the bitmap will be compressed.
46
 * Return the total size of the bitmap.
47
 */
48
uint
49
clist_bitmap_bytes(uint width_bits, uint height, int compression_mask,
50
                   uint * width_bytes, uint * raster)
51
3.82M
{
52
3.82M
    uint full_raster = *raster = bitmap_raster(width_bits);
53
3.82M
    uint short_raster = (width_bits + 7) >> 3;
54
3.82M
    uint width_bytes_last;
55
56
3.82M
    if (compression_mask & cmd_mask_compress_any)
57
1.46M
        *width_bytes = width_bytes_last = full_raster;
58
2.35M
    else if (short_raster <= cmd_max_short_width_bytes ||
59
2.35M
             height <= 1 ||
60
2.35M
             (compression_mask & decompress_spread) != 0
61
2.35M
        )
62
2.34M
        *width_bytes = width_bytes_last = short_raster;
63
17.1k
    else
64
17.1k
        *width_bytes = full_raster, width_bytes_last = short_raster;
65
3.82M
    return
66
3.82M
        (height == 0 ? 0 : *width_bytes * (height - 1) + width_bytes_last);
67
3.82M
}
68
69
/*
70
 * Compress a bitmap, skipping extra padding bytes at the end of each row if
71
 * necessary.  We require height >= 1, raster >= bitmap_raster(width_bits).
72
 */
73
static int
74
go_process(stream_state * st, stream_cursor_read *pr, stream_cursor_write *pw, bool end)
75
17.5M
{
76
17.5M
    int status = (*st->templat->process) (st, pr, pw, end);
77
17.5M
    if (status)
78
60.6k
        return status;
79
    /* We don't attempt to handle compressors that */
80
    /* require >1 input byte to make progress. */
81
17.5M
    if (pr->ptr != pr->limit)
82
0
        return -1;
83
17.5M
    return 0;
84
17.5M
}
85
static byte zeros[1<<align_bitmap_mod] = { 0, };
86
static int
87
cmd_compress_bitmap(stream_state * st, const byte * data, uint width_bits,
88
                    uint raster, uint height, stream_cursor_write * pw)
89
251k
{
90
251k
    uint width_bytes = bitmap_raster(width_bits);
91
251k
    int status = 0;
92
251k
    stream_cursor_read r;
93
251k
    stream_cursor_read r2;
94
251k
    uint whole_bytes = width_bits>>3;
95
251k
    uint mask = (0xff00>>(width_bits & 7)) & 0xff;
96
251k
    uint padding = width_bytes - ((width_bits+7)>>3);
97
98
251k
    if (raster == whole_bytes) {
99
301
        stream_cursor_read_init(&r, data, raster * (size_t)height);
100
301
        status = (*st->templat->process) (st, &r, pw, true);
101
251k
    } else {     /* Compress row-by-row. */
102
251k
        uint y;
103
104
251k
        stream_cursor_read_init(&r, data, whole_bytes);
105
106
6.10M
        for (y = height-1; (r.limit = r.ptr + whole_bytes), y > 0; y--) {
107
5.85M
            status = go_process(st, &r, pw, false);
108
5.85M
            if (status)
109
1.16k
                break;
110
5.85M
            if (mask) {
111
5.38M
                byte b = r.ptr[1] & mask;
112
113
5.38M
                stream_cursor_read_init(&r2, &b, 1);
114
5.38M
                status = go_process(st, &r2, pw, false);
115
5.38M
                if (status)
116
110
                    break;
117
5.38M
            }
118
5.85M
            if (padding) {
119
5.64M
                stream_cursor_read_init(&r2, zeros, padding);
120
5.64M
                status = go_process(st, &r2, pw, false);
121
5.64M
                if (status)
122
5.24k
                    break;
123
5.64M
            }
124
5.84M
            r.ptr += (int)(raster - whole_bytes);
125
5.84M
        }
126
251k
        if (status == 0) {
127
245k
            status = go_process(st, &r, pw, padding == 0 && mask == 0);
128
245k
            if (status == 0 && mask) {
129
227k
                byte b = r.ptr[1] & mask;
130
131
227k
                stream_cursor_read_init(&r2, &b, 1);
132
227k
                status = go_process(st, &r2, pw, padding == 0);
133
227k
            }
134
245k
            if (status == 0 && padding) {
135
236k
                stream_cursor_read_init(&r2, zeros, padding);
136
236k
                status = go_process(st, &r2, pw, true);
137
236k
            }
138
245k
        }
139
251k
    }
140
251k
    if (st->templat->release)
141
219k
        (*st->templat->release) (st);
142
251k
    return status;
143
251k
}
144
145
/*
146
 * Put a bitmap in the buffer, compressing if appropriate.
147
 * pcls == 0 means put the bitmap in all bands.
148
 * Return <0 if error, otherwise the compression method.
149
 * A return value of gs_error_limitcheck means that the bitmap was too big
150
 * to fit in the command reading buffer.
151
 * This won't happen if the compression_mask has allow_large_bitmap set.
152
 * Note that this leaves room for the command and initial arguments,
153
 * but doesn't fill them in.
154
 */
155
int
156
cmd_put_bits(gx_device_clist_writer * cldev, gx_clist_state * pcls,
157
  const byte * data, uint width_bits, uint height, uint raster, int op_size,
158
             int compression_mask, byte ** pdp, uint * psize)
159
1.28M
{
160
1.28M
    uint short_raster, full_raster;
161
1.28M
    uint short_size = clist_bitmap_bytes(width_bits, height,
162
1.28M
                          compression_mask & ~cmd_mask_compress_any,
163
1.28M
                          &short_raster, &full_raster);
164
1.28M
    uint uncompressed_raster;
165
1.28M
    uint uncompressed_size = clist_bitmap_bytes(width_bits, height, compression_mask,
166
1.28M
                       &uncompressed_raster, &full_raster);
167
1.28M
    uint max_size = (compression_mask & allow_large_bitmap) ? 0x7fffffff :
168
1.28M
                        data_bits_size - op_size;
169
1.28M
    gs_memory_t *mem = cldev->memory;
170
1.28M
    byte *dp;
171
1.28M
    int compress = 0;
172
1.28M
    int code;
173
174
    /*
175
     * See if compressing the bits is possible and worthwhile.
176
     * Currently we can't compress if the compressed data won't fit in
177
     * the command reading buffer, or if the decompressed data won't fit
178
     * in the buffer and decompress_elsewhere isn't set.
179
     */
180
1.28M
    if (short_size >= 50 &&
181
1.28M
        (compression_mask & ((1<<cmd_compress_rle) | (1<<cmd_compress_cfe))) != 0 &&
182
1.28M
        (uncompressed_size <= max_size ||
183
253k
         (compression_mask & decompress_elsewhere) != 0)
184
1.28M
        ) {
185
251k
        union ss_ {
186
251k
            stream_state ss;
187
251k
            stream_CFE_state cf;
188
251k
            stream_RLE_state rl;
189
251k
        } sstate;
190
251k
        int try_size = op_size + min(uncompressed_size, max_size);
191
192
251k
        *psize = try_size;
193
251k
        code = (pcls != 0 ?
194
251k
                set_cmd_put_op(&dp, cldev, pcls, 0, try_size) :
195
251k
                set_cmd_put_all_op(&dp, cldev, 0, try_size));
196
251k
        if (code < 0)
197
0
            return code;
198
251k
        cmd_uncount_op(0, try_size);
199
        /*
200
         * Note that we currently keep all the padding if we are
201
         * compressing.  This is ridiculous, but it's too hard to
202
         * change right now.
203
         */
204
251k
        if (compression_mask & (1 << cmd_compress_cfe)) {
205
            /* Try CCITTFax compression. */
206
219k
            clist_cfe_init(&sstate.cf,
207
219k
                           uncompressed_raster << 3 /*width_bits*/,
208
219k
                           mem);
209
219k
            compress = cmd_compress_cfe;
210
219k
        } else if (compression_mask & (1 << cmd_compress_rle)) {
211
            /* Try RLE compression. */
212
32.3k
            clist_rle_init(&sstate.rl);
213
32.3k
            compress = cmd_compress_rle;
214
32.3k
        }
215
251k
        if (compress) {
216
251k
            byte *wbase = dp + (op_size - 1);
217
251k
            stream_cursor_write w;
218
219
            /*
220
             * We can give up on compressing if we generate too much
221
             * output to fit in the command reading buffer, or too
222
             * much to make compression worthwhile.
223
             */
224
251k
            uint wmax = min(uncompressed_size, max_size);
225
251k
            int status;
226
227
251k
            w.ptr = wbase;
228
251k
            w.limit = w.ptr + min(wmax, short_size >> 1);
229
251k
            status = cmd_compress_bitmap((stream_state *) & sstate, data,
230
251k
                                  width_bits, /* was uncompressed_raster << 3, but this overruns. */
231
251k
                                         raster, height, &w);
232
251k
            if (status == 0) { /* Use compressed representation. */
233
191k
                uint wcount = w.ptr - wbase;
234
235
191k
                cmd_shorten_list_op(cldev,
236
191k
                             (pcls ? &pcls->list : cldev->band_range_list),
237
191k
                                    try_size - (op_size + wcount));
238
191k
                *psize = op_size + wcount;
239
191k
                goto out;
240
191k
            }
241
251k
        }
242
60.7k
        if (uncompressed_size > max_size) {
243
            /* Shorten to zero, erasing the operation altogether */
244
0
            if_debug1m('L', cldev->memory,
245
0
                       "[L]Uncompressed bits %u too large for buffer\n",
246
0
                       uncompressed_size);
247
0
            cmd_shorten_list_op(cldev,
248
0
                             (pcls ? &pcls->list : cldev->band_range_list),
249
0
                                try_size);
250
0
            return_error(gs_error_limitcheck);
251
0
        }
252
60.7k
        if (uncompressed_size != short_size) {
253
59.5k
            if_debug2m('L',cldev->memory,"[L]Shortening bits from %u to %u\n",
254
59.5k
                       try_size, op_size + short_size);
255
59.5k
            cmd_shorten_list_op(cldev,
256
59.5k
                             (pcls ? &pcls->list : cldev->band_range_list),
257
59.5k
                                try_size - (op_size + short_size));
258
59.5k
            *psize = op_size + short_size;
259
59.5k
        }
260
60.7k
        compress = 0;
261
1.02M
    } else if (uncompressed_size > max_size)
262
1.36k
        return_error(gs_error_limitcheck);
263
1.02M
    else {
264
1.02M
        *psize = op_size + short_size;
265
1.02M
        code = (pcls != 0 ?
266
1.02M
                set_cmd_put_op(&dp, cldev, pcls, 0, *psize) :
267
1.02M
                set_cmd_put_all_op(&dp, cldev, 0, *psize));
268
1.02M
        if (code < 0)
269
0
            return code;
270
1.02M
        cmd_uncount_op(0, *psize);
271
1.02M
    }
272
1.08M
    if ((compression_mask & (1 << cmd_compress_const)) &&
273
1.08M
        (code = bytes_rectangle_is_const(data, raster, uncompressed_raster << 3, height)) >= 0) {
274
0
        cmd_shorten_list_op(cldev,
275
0
                            (pcls ? &pcls->list : cldev->band_range_list),
276
0
                            *psize - (op_size + 1));
277
0
        *psize = op_size + 1;
278
0
        dp[op_size] = code;
279
0
        compress = cmd_compress_const;
280
1.08M
    } else {
281
1.08M
        uint copy_bytes = (width_bits + 7) >> 3;
282
1.08M
        bytes_copy_rectangle_zero_padding_last_short(
283
1.08M
                             dp + op_size, short_raster, data, raster,
284
1.08M
                             copy_bytes, height);
285
1.08M
    }
286
1.27M
out:
287
1.27M
    *pdp = dp;
288
1.27M
    return compress;
289
1.08M
}
290
291
/* Add a command to set the tile size and depth. */
292
static uint
293
cmd_size_tile_params(const gx_strip_bitmap * tile, bool for_pattern)
294
359
{
295
359
    return 2 + (for_pattern ? cmd_size_w(tile->id) : 0) +
296
359
        cmd_size_w(tile->rep_width) + cmd_size_w(tile->rep_height) +
297
359
        (tile->rep_width == tile->size.x ? 0 :
298
359
         cmd_size_w(tile->size.x / tile->rep_width)) +
299
359
        (tile->rep_height == tile->size.y ? 0 :
300
359
         cmd_size_w(tile->size.y / tile->rep_height)) +
301
359
        (tile->rep_shift == 0 ? 0 : cmd_size_w(tile->rep_shift)) +
302
359
        (tile->num_planes == 1 ? 0 : 1);
303
359
}
304
static void
305
cmd_store_tile_params(byte * dp, const gx_strip_bitmap * tile, int depth,
306
                      uint csize, bool for_pattern, const gs_memory_t *mem)
307
359
{
308
359
    byte *p = dp + 2;
309
359
    byte bd = cmd_depth_to_code(depth);
310
311
359
    *dp = cmd_count_op(cmd_opv_set_tile_size, csize, mem);
312
359
    if (for_pattern)
313
0
        p = cmd_put_w(tile->id, p);
314
359
    p = cmd_put_w(tile->rep_width, p);
315
359
    p = cmd_put_w(tile->rep_height, p);
316
359
    if (tile->rep_width != tile->size.x) {
317
359
        p = cmd_put_w(tile->size.x / tile->rep_width, p);
318
359
        bd |= 0x20;
319
359
    }
320
359
    if (tile->rep_height != tile->size.y) {
321
0
        p = cmd_put_w(tile->size.y / tile->rep_height, p);
322
0
        bd |= 0x40;
323
0
    }
324
359
    if (tile->rep_shift != 0) {
325
0
        p = cmd_put_w(tile->rep_shift, p);
326
0
        bd |= 0x80;
327
0
    }
328
359
    if (tile->num_planes != 1) {
329
0
        *p++ = (byte)tile->num_planes;
330
0
        bd |= 0x10;
331
0
    }
332
359
    dp[1] = bd;
333
359
}
334
335
/* Add a command to set the tile index. */
336
/* This is a relatively high-frequency operation, so we declare it `inline'. */
337
static inline int
338
cmd_put_tile_index(gx_device_clist_writer *cldev, gx_clist_state *pcls,
339
                   uint indx)
340
3.27M
{
341
3.27M
    int idelta = indx - pcls->tile_index + 8;
342
3.27M
    byte *dp;
343
3.27M
    int code;
344
345
3.27M
    if (!(idelta & ~15)) {
346
1.06M
        code = set_cmd_put_op(&dp, cldev, pcls,
347
1.06M
                              cmd_op_delta_tile_index + idelta, 1);
348
1.06M
        if (code < 0)
349
0
            return code;
350
2.20M
    } else {
351
2.20M
        code = set_cmd_put_op(&dp, cldev, pcls,
352
2.20M
                              cmd_op_set_tile_index + (indx >> 8), 2);
353
2.20M
        if (code < 0)
354
0
            return code;
355
2.20M
        dp[1] = indx & 0xff;
356
2.20M
    }
357
3.27M
    if_debug2m('L', cldev->memory, "[L]writing index=%u, offset=%lu\n",
358
3.27M
               indx, cldev->tile_table[indx].offset);
359
3.27M
    return 0;
360
3.27M
}
361
362
/* If necessary, write out data for a single color map. */
363
int
364
cmd_put_color_map(gx_device_clist_writer * cldev, cmd_map_index map_index,
365
        int comp_num, const gx_transfer_map * map, gs_id * pid)
366
74.7k
{
367
74.7k
    byte *dp;
368
74.7k
    int code;
369
370
74.7k
    if (map == 0) {
371
0
        if (pid && *pid == gs_no_id)
372
0
            return 0; /* no need to write */
373
0
        code = set_cmd_put_all_op(&dp, cldev, cmd_opv_set_misc, 3);
374
0
        if (code < 0)
375
0
            return code;
376
0
        dp[1] = cmd_set_misc_map + (cmd_map_none << 4) + map_index;
377
0
        dp[2] = comp_num;
378
0
        if (pid)
379
0
            *pid = gs_no_id;
380
74.7k
    } else {
381
74.7k
        if (pid && map->id == *pid)
382
70.5k
            return 0;  /* no need to write */
383
4.23k
        if (map->proc == gs_identity_transfer) {
384
0
            code = set_cmd_put_all_op(&dp, cldev, cmd_opv_set_misc, 3);
385
0
            if (code < 0)
386
0
                return code;
387
0
            dp[1] = cmd_set_misc_map + (cmd_map_identity << 4) + map_index;
388
0
            dp[2] = comp_num;
389
4.23k
        } else {
390
4.23k
            code = set_cmd_put_all_op(&dp, cldev, cmd_opv_set_misc,
391
4.23k
                                      3 + sizeof(map->values));
392
4.23k
            if (code < 0)
393
0
                return code;
394
4.23k
            dp[1] = cmd_set_misc_map + (cmd_map_other << 4) + map_index;
395
4.23k
            dp[2] = comp_num;
396
4.23k
            memcpy(dp + 3, map->values, sizeof(map->values));
397
4.23k
        }
398
4.23k
        if (pid)
399
4.23k
            *pid = map->id;
400
4.23k
    }
401
4.23k
    return 0;
402
74.7k
}
403
404
/* ------ Tile cache management ------ */
405
406
/* We want consecutive ids to map to consecutive hash slots if possible, */
407
/* so we can use a delta representation when setting the index. */
408
/* NB that we cannot emit 'delta' style tile indices if VM error recovery */
409
/* is in effect, since reader & writer's tile indices may get out of phase */
410
/* as a consequence of error recovery occurring. */
411
5.40M
#define tile_id_hash(id) (id)
412
178k
#define tile_hash_next(index) ((index) + 413)  /* arbitrary large odd # */
413
typedef struct tile_loc_s {
414
    uint index;
415
    tile_slot *tile;
416
} tile_loc;
417
418
/* Look up a tile or character in the cache.  If found, set the index and */
419
/* pointer; if not, set the index to the insertion point. */
420
static bool
421
clist_find_bits(gx_device_clist_writer * cldev, gx_bitmap_id id, tile_loc * ploc)
422
5.40M
{
423
5.40M
    uint index = tile_id_hash(id);
424
5.40M
    const tile_hash *table = cldev->tile_table;
425
5.40M
    uint mask = cldev->tile_hash_mask;
426
5.40M
    ulong offset;
427
428
5.42M
    for (; (offset = table[index &= mask].offset) != 0;
429
5.40M
         index = tile_hash_next(index)
430
5.40M
        ) {
431
4.49M
        tile_slot *tile = (tile_slot *) (cldev->data + offset);
432
433
4.49M
        if (tile->id == id) {
434
4.47M
            ploc->index = index;
435
4.47M
            ploc->tile = tile;
436
4.47M
            return true;
437
4.47M
        }
438
4.49M
    }
439
928k
    ploc->index = index;
440
928k
    return false;
441
5.40M
}
442
443
/* Delete a tile from the cache. */
444
static void
445
clist_delete_tile(gx_device_clist_writer * cldev, tile_slot * slot)
446
104k
{
447
104k
    tile_hash *table = cldev->tile_table;
448
104k
    uint mask = cldev->tile_hash_mask;
449
104k
    uint index = slot->index;
450
104k
    ulong offset;
451
452
104k
    if_debug2m('L', cldev->memory, "[L]deleting index=%u, offset=%lu\n",
453
104k
               index, (ulong) ((byte *) slot - cldev->data));
454
104k
    gx_bits_cache_free(&cldev->bits, (gx_cached_bits_head *) slot,
455
104k
                       cldev->cache_chunk);
456
104k
    table[index].offset = 0;
457
    /* Delete the entry from the hash table. */
458
    /* We'd like to move up any later entries, so that we don't need */
459
    /* a deleted mark, but it's too difficult to note this in the */
460
    /* band list, so instead, we just delete any entries that */
461
    /* would need to be moved. */
462
155k
    while ((offset = table[index = tile_hash_next(index) & mask].offset) != 0) {
463
50.4k
        tile_slot *tile = (tile_slot *) (cldev->data + offset);
464
50.4k
        tile_loc loc;
465
466
50.4k
        if (!clist_find_bits(cldev, tile->id, &loc)) { /* We didn't find it, so it should be moved into a slot */
467
            /* that we just vacated; instead, delete it. */
468
1.56k
            if_debug2m('L', cldev->memory,
469
1.56k
                       "[L]move-deleting index=%u, offset=%lu\n",
470
1.56k
                       index, offset);
471
1.56k
            gx_bits_cache_free(&cldev->bits,
472
1.56k
                             (gx_cached_bits_head *) (cldev->data + offset),
473
1.56k
                               cldev->cache_chunk);
474
1.56k
            table[index].offset = 0;
475
1.56k
        }
476
50.4k
    }
477
104k
}
478
479
/* Add a tile to the cache. */
480
/* tile->raster holds the raster for the replicated tile; */
481
/* we pass the raster of the actual data separately. */
482
static int
483
clist_add_tile(gx_device_clist_writer * cldev, const gx_strip_bitmap * tiles,
484
               uint sraster, int depth)
485
463k
{
486
463k
    uint raster = tiles->raster;
487
463k
    uint size_bytes = raster * tiles->size.y * tiles->num_planes;
488
463k
    uint tsize =
489
463k
    sizeof(tile_slot) + cldev->tile_band_mask_size + size_bytes;
490
463k
    tile_slot *slot;
491
492
463k
    if (cldev->bits.csize == cldev->tile_max_count) { /* Don't let the hash table get too full: delete an entry. */
493
        /* Since gx_bits_cache_alloc returns an entry to delete when */
494
        /* it fails, just force it to fail. */
495
0
        gx_bits_cache_alloc(&cldev->bits, (ulong) cldev->cache_chunk->size,
496
0
                            (gx_cached_bits_head **)&slot);
497
0
        if (slot == NULL) { /* Wrap around and retry. */
498
0
            cldev->bits.cnext = 0;
499
0
            gx_bits_cache_alloc(&cldev->bits, (ulong) cldev->cache_chunk->size,
500
0
                                (gx_cached_bits_head **)&slot);
501
#ifdef DEBUG
502
            if (slot == NULL) {
503
                lprintf("No entry to delete!\n");
504
                return_error(gs_error_Fatal);
505
            }
506
#endif
507
0
        }
508
0
        clist_delete_tile(cldev, slot);
509
0
    }
510
    /* Allocate the space for the new entry, deleting entries as needed. */
511
568k
    while (gx_bits_cache_alloc(&cldev->bits, (ulong) tsize, (gx_cached_bits_head **)&slot) < 0) {
512
105k
        if (slot == NULL) { /* Wrap around. */
513
424
            if (cldev->bits.cnext == 0) { /* Too big to fit.  We should probably detect this */
514
                /* sooner, since if we get here, we've cleared the */
515
                /* cache. */
516
0
                return_error(gs_error_limitcheck);
517
0
            }
518
424
            cldev->bits.cnext = 0;
519
424
        } else
520
104k
            clist_delete_tile(cldev, slot);
521
105k
    }
522
    /* Fill in the entry. */
523
463k
    slot->head.depth = depth;
524
463k
    slot->raster = raster;
525
463k
    slot->width = tiles->rep_width;
526
463k
    slot->height = tiles->rep_height;
527
463k
    slot->shift = slot->rep_shift = tiles->rep_shift;
528
463k
    slot->x_reps = slot->y_reps = 1;
529
463k
    slot->id = tiles->id;
530
463k
    slot->num_planes = (byte)tiles->num_planes;
531
463k
    if (slot->num_planes != 1)
532
0
        depth /= slot->num_planes;
533
463k
    memset(ts_mask(slot), 0, cldev->tile_band_mask_size);
534
463k
    bytes_copy_rectangle_zero_padding(ts_bits(cldev, slot), raster,
535
463k
                                      tiles->data, sraster,
536
463k
                                      (tiles->rep_width * depth + 7) >> 3,
537
463k
                                      tiles->rep_height * slot->num_planes);
538
    /* Make the hash table entry. */
539
463k
    {
540
463k
        tile_loc loc;
541
542
#ifdef DEBUG
543
        if (clist_find_bits(cldev, tiles->id, &loc))
544
            lprintf1("clist_find_bits(0x%lx) should have failed!\n",
545
                     (ulong) tiles->id);
546
#else
547
463k
        clist_find_bits(cldev, tiles->id, &loc);  /* always fails */
548
463k
#endif
549
463k
        slot->index = loc.index;
550
463k
        cldev->tile_table[loc.index].offset =
551
463k
            (byte *) slot - cldev->data;
552
463k
        if_debug2m('L', cldev->memory, "[L]adding index=%u, offset=%lu\n",
553
463k
                   loc.index, cldev->tile_table[loc.index].offset);
554
463k
    }
555
463k
    slot->num_bands = 0;
556
463k
    return 0;
557
463k
}
558
559
/* ------ Driver procedure support ------ */
560
561
/* Change the tile parameters (size and depth). */
562
/* Currently we do this for all bands at once. */
563
static void
564
clist_new_tile_params(gx_strip_bitmap * new_tile, const gx_strip_bitmap * tiles,
565
                      int depth, const gx_device_clist_writer * cldev)
566
548
{       /*
567
                                 * Adjust the replication factors.  If we can, we replicate
568
                                 * the tile in X up to 32 bytes, and then in Y up to 4 copies,
569
                                 * as long as we don't exceed a total tile size of 256 bytes,
570
                                 * or more than 255 repetitions in X or Y, or make the tile so
571
                                 * large that not all possible tiles will fit in the cache.
572
                                 * Also, don't attempt Y replication if shifting is required,
573
                                 * or if num_planes != 1.
574
                                 */
575
548
#define max_tile_reps_x 255
576
548
#define max_tile_bytes_x 32
577
548
#define max_tile_reps_y 4
578
1.09k
#define max_tile_bytes 256
579
548
    uint rep_width = tiles->rep_width;
580
548
    uint rep_height = tiles->rep_height;
581
548
    uint rep_width_bits;
582
548
    uint tile_overhead =
583
548
    sizeof(tile_slot) + cldev->tile_band_mask_size;
584
548
    uint max_bytes;
585
586
548
    if (tiles->num_planes != 1)
587
0
        depth /= tiles->num_planes;
588
548
    rep_width_bits = rep_width * depth;
589
548
    max_bytes = cldev->cache_chunk->size / (rep_width_bits * rep_height);
590
591
548
    max_bytes -= min(max_bytes, tile_overhead);
592
548
    if (max_bytes > max_tile_bytes)
593
548
        max_bytes = max_tile_bytes;
594
548
    *new_tile = *tiles;
595
548
    {
596
548
        uint max_bits_x = max_bytes * 8 / rep_height;
597
548
        uint reps_x =
598
548
        min(max_bits_x, max_tile_bytes_x * 8) / rep_width_bits;
599
548
        uint reps_y;
600
601
548
        while (reps_x > max_tile_reps_x)
602
0
            reps_x >>= 1;
603
548
        new_tile->size.x = max(reps_x, 1) * rep_width;
604
548
        new_tile->raster = bitmap_raster(new_tile->size.x * depth);
605
548
        if (tiles->shift != 0 || tiles->num_planes != 1)
606
0
            reps_y = 1;
607
548
        else {
608
548
            reps_y = max_bytes / (new_tile->raster * rep_height);
609
548
            if (reps_y > max_tile_reps_y)
610
0
                reps_y = max_tile_reps_y;
611
548
            else if (reps_y < 1)
612
4
                reps_y = 1;
613
548
        }
614
548
        new_tile->size.y = reps_y * rep_height;
615
548
    }
616
548
#undef max_tile_reps_x
617
548
#undef max_tile_bytes_x
618
548
#undef max_tile_reps_y
619
548
#undef max_tile_bytes
620
548
}
621
622
extern dev_proc_open_device(pattern_clist_open_device);
623
624
/* Change tile for clist_tile_rectangle. */
625
int
626
clist_change_tile(gx_device_clist_writer * cldev, gx_clist_state * pcls,
627
                  const gx_strip_bitmap * tiles, int depth)
628
75.3k
{
629
75.3k
    tile_loc loc;
630
75.3k
    int code;
631
632
75.3k
#define tile_params_differ(cldev, tiles, depth)\
633
75.3k
  ((tiles)->rep_width != (cldev)->tile_params.rep_width ||\
634
2.38k
   (tiles)->rep_height != (cldev)->tile_params.rep_height ||\
635
2.38k
   (tiles)->rep_shift != (cldev)->tile_params.rep_shift ||\
636
3.65k
   (depth) != (cldev)->tile_depth)
637
638
76.4k
  top:if (clist_find_bits(cldev, tiles->id, &loc)) { /* The bitmap is in the cache.  Check whether this band */
639
        /* knows about it. */
640
75.3k
        int band_index = pcls - cldev->states;
641
75.3k
        byte *bptr = ts_mask(loc.tile) + (band_index >> 3);
642
75.3k
        byte bmask = 1 << (band_index & 7);
643
75.3k
        bool for_pattern = gx_device_is_pattern_clist((gx_device *)cldev);
644
645
75.3k
        if (*bptr & bmask) { /* Already known.  Just set the index. */
646
74.0k
            if (pcls->tile_index == loc.index)
647
0
                return 0;
648
74.0k
            if ((code = cmd_put_tile_index(cldev, pcls, loc.index)) < 0)
649
0
                return code;
650
74.0k
        } else {
651
1.27k
            uint extra = 0;
652
653
1.27k
            if (tile_params_differ(cldev, tiles, depth) ||
654
1.27k
                for_pattern) {     /*
655
                                                 * We have a cached tile whose parameters differ from
656
                                                 * the current ones.  Because of the way tile IDs are
657
                                                 * managed, this is currently only possible when mixing
658
                                                 * Patterns and halftones, but if we didn't generate new
659
                                                 * IDs each time the main halftone cache needed to be
660
                                                 * refreshed, this could also happen simply from
661
                                                 * switching screens.
662
                                                 */
663
274
                int band;
664
665
274
                clist_new_tile_params(&cldev->tile_params, tiles, depth,
666
274
                                      cldev);
667
274
                cldev->tile_depth = depth;
668
                /* No band knows about the new parameters. */
669
274
                for (band = cldev->tile_known_min;
670
274
                     band <= cldev->tile_known_max;
671
274
                     ++band
672
274
                    )
673
0
                    cldev->states[band].known &= ~tile_params_known;
674
274
                cldev->tile_known_min = cldev->nbands;
675
274
                cldev->tile_known_max = -1;
676
274
                }
677
1.27k
            if (!(pcls->known & tile_params_known)) { /* We're going to have to write the tile parameters. */
678
359
                extra = cmd_size_tile_params(&cldev->tile_params, for_pattern);
679
359
            } {      /*
680
                                 * This band doesn't know this tile yet, so output the
681
                                 * bits.  Note that the offset we write is the one used by
682
                                 * the reading phase, not the writing phase.  Note also
683
                                 * that the size of the cached and written tile may differ
684
                                 * from that of the client's tile.  Finally, note that
685
                                 * this tile's size parameters are guaranteed to be
686
                                 * compatible with those stored in the device
687
                                 * (cldev->tile_params).
688
                                 */
689
1.27k
                ulong offset = (byte *) loc.tile - cldev->cache_chunk->data;
690
1.27k
                uint rsize =
691
1.27k
                    extra + 1 + cmd_size_w(loc.index) + cmd_size_w(offset);
692
1.27k
                byte *dp;
693
1.27k
                uint csize;
694
1.27k
                int code;
695
1.27k
                int pdepth = depth;
696
1.27k
                if (tiles->num_planes != 1)
697
0
                    pdepth /= tiles->num_planes;
698
699
                /* put the bits, but don't restrict to a single buffer */
700
1.27k
                code = cmd_put_bits(cldev, pcls, ts_bits(cldev, loc.tile),
701
1.27k
                                    tiles->rep_width * pdepth,
702
1.27k
                                    tiles->rep_height * tiles->num_planes,
703
1.27k
                                    loc.tile->raster, rsize,
704
1.27k
                                    allow_large_bitmap |
705
1.27k
                                        (cldev->tile_params.size.x > tiles->rep_width ?
706
1.27k
                                             decompress_elsewhere | decompress_spread :
707
1.27k
                                             decompress_elsewhere),
708
1.27k
                                    &dp, &csize);
709
710
1.27k
                if (code < 0)
711
0
                    return code;
712
1.27k
                if (extra) { /* Write the tile parameters before writing the bits. */
713
359
                    if_debug1m('L', cldev->memory,
714
359
                               "[L] fake end_run: really set_tile_size[%d]\n", extra);
715
359
                    cmd_store_tile_params(dp, &cldev->tile_params, depth,
716
359
                                          extra, for_pattern, cldev->memory);
717
359
                    dp += extra;
718
                    /* This band now knows the parameters. */
719
359
                    pcls->known |= tile_params_known;
720
359
                    if (band_index < cldev->tile_known_min)
721
317
                        cldev->tile_known_min = band_index;
722
359
                    if (band_index > cldev->tile_known_max)
723
316
                        cldev->tile_known_max = band_index;
724
359
                }
725
1.27k
                if_debug1m('L', cldev->memory,
726
1.27k
                           "[L] fake end_run: really set_tile_bits[%d]\n", csize-extra);
727
1.27k
                *dp = cmd_count_op(cmd_opv_set_tile_bits, csize - extra, cldev->memory);
728
1.27k
                dp++;
729
1.27k
                dp = cmd_put_w(loc.index, dp);
730
1.27k
                cmd_put_w(offset, dp);
731
1.27k
                *bptr |= bmask;
732
1.27k
                loc.tile->num_bands++;
733
1.27k
            }
734
1.27k
        }
735
75.3k
        pcls->tile_index = loc.index;
736
75.3k
        pcls->tile_id = loc.tile->id;
737
75.3k
        return 0;
738
75.3k
    }
739
    /* The tile is not in the cache, add it. */
740
1.11k
    {
741
1.11k
        gx_strip_bitmap new_tile;
742
1.11k
        gx_strip_bitmap *ptile;
743
744
        /* Ensure that the tile size is compatible. */
745
1.11k
        if (tile_params_differ(cldev, tiles, depth)) { /* We'll reset cldev->tile_params when we write the bits. */
746
274
            clist_new_tile_params(&new_tile, tiles, depth, cldev);
747
274
            ptile = &new_tile;
748
836
        } else {
749
836
            cldev->tile_params.id = tiles->id;
750
836
            cldev->tile_params.data = tiles->data;
751
836
            ptile = &cldev->tile_params;
752
836
        }
753
1.11k
        code = clist_add_tile(cldev, ptile, tiles->raster, depth);
754
1.11k
        if (code < 0)
755
0
            return code;
756
1.11k
    }
757
1.11k
    goto top;
758
1.11k
#undef tile_params_differ
759
1.11k
}
760
761
/* Change "tile" for clist_copy_*.  tiles->[rep_]shift must be zero. */
762
int
763
clist_change_bits(gx_device_clist_writer * cldev, gx_clist_state * pcls,
764
                  const gx_strip_bitmap * tiles, int depth)
765
4.35M
{
766
4.35M
    tile_loc loc;
767
4.35M
    int code;
768
4.35M
    uint band_index = pcls - cldev->states;
769
4.35M
    byte bmask = 1 << (band_index & 7);
770
4.35M
    byte *bptr;
771
772
4.81M
    while (!clist_find_bits(cldev, tiles->id, &loc)) {
773
        /* The tile is not in the cache. */
774
462k
        code = clist_add_tile(cldev, tiles, tiles->raster, depth);
775
462k
        if (code < 0)
776
0
            return code;
777
462k
    }
778
779
    /* The bitmap is in the cache.  Check whether this band */
780
    /* knows about it. */
781
4.35M
    bptr = ts_mask(loc.tile) + (band_index >> 3);
782
783
4.35M
    if (*bptr & bmask) { /* Already known.  Just set the index. */
784
3.19M
        if (pcls->tile_index == loc.index)
785
0
            return 0;
786
3.19M
        cmd_put_tile_index(cldev, pcls, loc.index);
787
3.19M
    } else {   /* Not known yet.  Output the bits. */
788
        /* Note that the offset we write is the one used by */
789
        /* the reading phase, not the writing phase. */
790
1.15M
        ulong offset = (byte *) loc.tile - cldev->cache_chunk->data;
791
1.15M
        uint rsize = 2 + cmd_size_w(loc.tile->width) +
792
1.15M
                     cmd_size_w(loc.tile->height) +
793
1.15M
                     (loc.tile->num_planes > 1 ? 1 : 0) +
794
1.15M
                     cmd_size_w(loc.index) +
795
1.15M
                     cmd_size_w(offset);
796
1.15M
        byte *dp;
797
1.15M
        uint csize;
798
1.15M
        gx_clist_state *bit_pcls = pcls;
799
1.15M
        int pdepth = depth;
800
801
1.15M
        if (tiles->num_planes != 1)
802
0
            pdepth /= loc.tile->num_planes;
803
1.15M
        if (loc.tile->num_bands == CHAR_ALL_BANDS_COUNT)
804
0
            bit_pcls = NULL;
805
        /* put the bits, but don't restrict to a single buffer */
806
1.15M
        code = cmd_put_bits(cldev, bit_pcls, ts_bits(cldev, loc.tile),
807
1.15M
                            loc.tile->width * pdepth,
808
1.15M
                            loc.tile->height * loc.tile->num_planes, loc.tile->raster,
809
1.15M
                            rsize,
810
1.15M
                            decompress_elsewhere |
811
1.15M
                                (cldev->target->BLS_force_memory ? (1 << cmd_compress_cfe) : 0),
812
1.15M
                            &dp, &csize);
813
814
1.15M
        if (code < 0)
815
0
            return code;
816
1.15M
        if_debug1m('L', cldev->memory,
817
1.15M
                   "[L] fake end_run: really set_bits[%d]\n", csize);
818
1.15M
        *dp = cmd_count_op(loc.tile->num_planes > 1 ? cmd_opv_set_bits_planar : cmd_opv_set_bits,
819
1.15M
                           csize, cldev->memory);
820
1.15M
        dp[1] = (depth << 2) + code;
821
1.15M
        dp += 2;
822
1.15M
        dp = cmd_put_w(loc.tile->width, dp);
823
1.15M
        dp = cmd_put_w(loc.tile->height, dp);
824
1.15M
        if (loc.tile->num_planes > 1)
825
0
            *dp++ = loc.tile->num_planes;
826
1.15M
        dp = cmd_put_w(loc.index, dp);
827
1.15M
        cmd_put_w(offset, dp);
828
1.15M
        if_debug7m('L', cldev->memory, " compress=%d depth=%d size=(%d,%d) planes=%d index=%d offset=%ld\n",
829
1.15M
                   code, depth, loc.tile->width, loc.tile->height, loc.tile->num_planes, loc.index, offset);
830
1.15M
        if (bit_pcls == NULL) {
831
0
            memset(ts_mask(loc.tile), 0xff,
832
0
                   cldev->tile_band_mask_size);
833
0
            loc.tile->num_bands = cldev->nbands;
834
1.15M
        } else {
835
1.15M
            *bptr |= bmask;
836
1.15M
            loc.tile->num_bands++;
837
1.15M
        }
838
1.15M
    }
839
4.35M
    pcls->tile_index = loc.index;
840
4.35M
    pcls->tile_id = loc.tile->id;
841
4.35M
    return 0;
842
4.35M
}