Coverage Report

Created: 2026-04-01 07:17

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/ghostpdl/base/gxshade.c
Line
Count
Source
1
/* Copyright (C) 2001-2026 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
/* Shading rendering support */
18
#include "math_.h"
19
#include "gx.h"
20
#include "gserrors.h"
21
#include "gsrect.h"
22
#include "gxcspace.h"
23
#include "gscindex.h"
24
#include "gscie.h"    /* requires gscspace.h */
25
#include "gxdevcli.h"
26
#include "gxgstate.h"
27
#include "gxdht.h"    /* for computing # of different colors */
28
#include "gxpaint.h"
29
#include "gxshade.h"
30
#include "gxshade4.h"
31
#include "gsicc.h"
32
#include "gsicc_cache.h"
33
#include "gxcdevn.h"
34
#include "gximage.h"
35
36
/* Define a maximum smoothness value. */
37
/* smoothness > 0.2 produces severely blocky output. */
38
#define MAX_SMOOTHNESS 0.2
39
40
/* ================ Packed coordinate streams ================ */
41
42
/* Forward references */
43
static int cs_next_packed_value(shade_coord_stream_t *, int, uint *);
44
static int cs_next_array_value(shade_coord_stream_t *, int, uint *);
45
static int cs_next_packed_decoded(shade_coord_stream_t *, int,
46
                                   const float[2], float *);
47
static int cs_next_array_decoded(shade_coord_stream_t *, int,
48
                                  const float[2], float *);
49
static void cs_packed_align(shade_coord_stream_t *cs, int radix);
50
static void cs_array_align(shade_coord_stream_t *cs, int radix);
51
static bool cs_eod(const shade_coord_stream_t * cs);
52
53
/* Initialize a packed value stream. */
54
void
55
shade_next_init(shade_coord_stream_t * cs,
56
                const gs_shading_mesh_params_t * params,
57
                const gs_gstate * pgs)
58
1.54k
{
59
1.54k
    cs->params = params;
60
1.54k
    cs->pctm = &pgs->ctm;
61
1.54k
    if (data_source_is_stream(params->DataSource)) {
62
        /*
63
         * Rewind the data stream iff it is reusable -- either a reusable
64
         * file or a reusable string.
65
         */
66
1.54k
        stream *s = cs->s = params->DataSource.data.strm;
67
68
1.54k
        if ((s->file != 0 && s->file_limit != max_long) ||
69
1.54k
            (s->file == 0 && s->strm == 0)
70
1.54k
            )
71
1.54k
            sseek(s, 0);
72
1.54k
    } else {
73
0
        s_init(&cs->ds, NULL);
74
0
        sread_string(&cs->ds, params->DataSource.data.str.data,
75
0
                     params->DataSource.data.str.size);
76
0
        cs->s = &cs->ds;
77
0
    }
78
1.54k
    if (data_source_is_array(params->DataSource)) {
79
0
        cs->get_value = cs_next_array_value;
80
0
        cs->get_decoded = cs_next_array_decoded;
81
0
        cs->align = cs_array_align;
82
1.54k
    } else {
83
1.54k
        cs->get_value = cs_next_packed_value;
84
1.54k
        cs->get_decoded = cs_next_packed_decoded;
85
1.54k
        cs->align = cs_packed_align;
86
1.54k
    }
87
1.54k
    cs->is_eod = cs_eod;
88
1.54k
    cs->left = 0;
89
1.54k
    cs->ds_EOF = false;
90
1.54k
    cs->first_patch = 1;
91
1.54k
}
92
93
/* Check for the End-Of-Data state form a stream. */
94
static bool
95
cs_eod(const shade_coord_stream_t * cs)
96
627
{
97
627
    return cs->ds_EOF;
98
627
}
99
100
/* Get the next (integer) value from a packed value stream. */
101
/* 1 <= num_bits <= sizeof(uint) * 8. */
102
static int
103
cs_next_packed_value(shade_coord_stream_t * cs, int num_bits, uint * pvalue)
104
27.0M
{
105
27.0M
    uint bits = cs->bits;
106
27.0M
    int left = cs->left;
107
108
27.0M
    if (left >= num_bits) {
109
        /* We can satisfy this request with the current buffered bits. */
110
3
        cs->left = left -= num_bits;
111
3
        *pvalue = (bits >> left) & ((1 << num_bits) - 1);
112
27.0M
    } else {
113
        /* We need more bits. */
114
27.0M
        int needed = num_bits - left;
115
27.0M
        uint value = bits & ((1 << left) - 1);  /* all the remaining bits */
116
117
107M
        for (; needed >= 8; needed -= 8) {
118
80.5M
            int b = sgetc(cs->s);
119
120
80.5M
            if (b < 0) {
121
1.19k
                cs->ds_EOF = true;
122
1.19k
                return_error(gs_error_rangecheck);
123
1.19k
            }
124
80.5M
            value = (value << 8) + b;
125
80.5M
        }
126
27.0M
        if (needed == 0) {
127
27.0M
            cs->left = 0;
128
27.0M
            *pvalue = value;
129
27.0M
        } else {
130
6
            int b = sgetc(cs->s);
131
132
6
            if (b < 0) {
133
0
                cs->ds_EOF = true;
134
0
                return_error(gs_error_rangecheck);
135
0
            }
136
6
            cs->bits = b;
137
6
            cs->left = left = 8 - needed;
138
6
            *pvalue = (value << needed) + (b >> left);
139
6
        }
140
27.0M
    }
141
27.0M
    return 0;
142
27.0M
}
143
144
/*
145
 * Get the next (integer) value from an unpacked array.  Note that
146
 * num_bits may be 0 if we are reading a coordinate or color value.
147
 */
148
static int
149
cs_next_array_value(shade_coord_stream_t * cs, int num_bits, uint * pvalue)
150
0
{
151
0
    float value;
152
0
    uint read;
153
154
0
    if (sgets(cs->s, (byte *)&value, sizeof(float), &read) < 0 ||
155
0
        read != sizeof(float)) {
156
0
        cs->ds_EOF = true;
157
0
        return_error(gs_error_rangecheck);
158
0
    }
159
0
    if (value < 0 || (num_bits != 0 && num_bits < sizeof(uint) * 8 &&
160
0
         value >= (1 << num_bits)) ||
161
0
        value != (uint)value
162
0
        )
163
0
        return_error(gs_error_rangecheck);
164
0
    *pvalue = (uint) value;
165
0
    return 0;
166
0
}
167
168
/* Get the next decoded floating point value. */
169
static int
170
cs_next_packed_decoded(shade_coord_stream_t * cs, int num_bits,
171
                       const float decode[2], float *pvalue)
172
26.4M
{
173
26.4M
    uint value;
174
26.4M
    int code = cs->get_value(cs, num_bits, &value);
175
26.4M
    double max_value = (double)(uint)
176
26.4M
        (num_bits == sizeof(uint) * 8 ? ~0 : ((1 << num_bits) - 1));
177
26.4M
    double dvalue = (double)value;
178
179
26.4M
    if (code < 0)
180
776
        return code;
181
26.4M
    *pvalue =
182
26.4M
        (decode == 0 ? dvalue / max_value :
183
26.4M
         decode[0] + dvalue * (decode[1] - decode[0]) / max_value);
184
26.4M
    return 0;
185
26.4M
}
186
187
/* Get the next floating point value from an array, without decoding. */
188
static int
189
cs_next_array_decoded(shade_coord_stream_t * cs, int num_bits,
190
                      const float decode[2], float *pvalue)
191
0
{
192
0
    float value;
193
0
    uint read;
194
195
0
    if (sgets(cs->s, (byte *)&value, sizeof(float), &read) < 0 ||
196
0
        read != sizeof(float)
197
0
    ) {
198
0
        cs->ds_EOF = true;
199
0
        return_error(gs_error_rangecheck);
200
0
    }
201
0
    *pvalue = value;
202
0
    return 0;
203
0
}
204
205
static void
206
cs_packed_align(shade_coord_stream_t *cs, int radix)
207
2.20M
{
208
2.20M
    cs->left = cs->left / radix * radix;
209
2.20M
}
210
211
static void
212
cs_array_align(shade_coord_stream_t *cs, int radix)
213
0
{
214
0
}
215
216
/* Get the next flag value. */
217
/* Note that this always starts a new data byte. */
218
int
219
shade_next_flag(shade_coord_stream_t * cs, int BitsPerFlag)
220
606k
{
221
606k
    uint flag;
222
606k
    int code;
223
224
606k
    cs->left = 0;   /* start a new byte if packed */
225
606k
    code = cs->get_value(cs, BitsPerFlag, &flag);
226
606k
    return (code < 0 ? code : flag);
227
606k
}
228
229
/* Get one or more coordinate pairs. */
230
int
231
shade_next_coords(shade_coord_stream_t * cs, gs_fixed_point * ppt,
232
                  int num_points)
233
5.65M
{
234
5.65M
    int num_bits = cs->params->BitsPerCoordinate;
235
5.65M
    const float *decode = cs->params->Decode;
236
5.65M
    int code = 0;
237
5.65M
    int i;
238
239
14.8M
    for (i = 0; i < num_points; ++i) {
240
9.17M
        float x, y;
241
242
9.17M
        if ((code = cs->get_decoded(cs, num_bits, decode, &x)) < 0 ||
243
9.16M
            (code = cs->get_decoded(cs, num_bits, decode + 2, &y)) < 0 ||
244
9.16M
            (code = gs_point_transform2fixed(cs->pctm, x, y, &ppt[i])) < 0
245
9.17M
            )
246
614
            break;
247
9.17M
    }
248
5.65M
    return code;
249
5.65M
}
250
251
/* Get a color.  Currently all this does is look up Indexed colors. */
252
int
253
shade_next_color(shade_coord_stream_t * cs, float *pc)
254
3.23M
{
255
3.23M
    const float *decode = cs->params->Decode + 4; /* skip coord decode */
256
3.23M
    const gs_color_space *pcs = cs->params->ColorSpace;
257
3.23M
    gs_color_space_index index = gs_color_space_get_index(pcs);
258
3.23M
    int num_bits = cs->params->BitsPerComponent;
259
260
3.23M
    if (index == gs_color_space_index_Indexed) {
261
0
        int ncomp = gs_color_space_num_components(gs_cspace_base_space(pcs));
262
0
        int ci;
263
0
        float cf;
264
0
        int code = cs->get_decoded(cs, num_bits, decode, &cf);
265
0
        gs_client_color cc;
266
0
        int i;
267
268
0
        if (code < 0)
269
0
            return code;
270
0
        if (cf < 0)
271
0
            return_error(gs_error_rangecheck);
272
0
        ci = (int)cf;
273
0
        if (ci >= gs_cspace_indexed_num_entries(pcs))
274
0
            return_error(gs_error_rangecheck);
275
0
        code = gs_cspace_indexed_lookup(pcs, ci, &cc);
276
0
        if (code < 0)
277
0
            return code;
278
0
        for (i = 0; i < ncomp; ++i)
279
0
            pc[i] = cc.paint.values[i];
280
3.23M
    } else {
281
3.23M
        int i, code;
282
3.23M
        int ncomp = (cs->params->Function != 0 ? 1 :
283
3.23M
                     gs_color_space_num_components(pcs));
284
285
11.3M
        for (i = 0; i < ncomp; ++i) {
286
8.10M
            if ((code = cs->get_decoded(cs, num_bits, decode + i * 2, &pc[i])) < 0)
287
172
                return code;
288
8.10M
            if (cs->params->Function) {
289
1.57M
                gs_function_params_t *params = &cs->params->Function->params;
290
291
1.57M
                if (pc[i] < params->Domain[i + i])
292
0
                    pc[i] = params->Domain[i + i];
293
1.57M
                else if (pc[i] > params->Domain[i + i + 1])
294
42
                    pc[i] = params->Domain[i + i + 1];
295
1.57M
            }
296
8.10M
        }
297
3.23M
    }
298
3.22M
    return 0;
299
3.23M
}
300
301
/* Get the next vertex for a mesh element. */
302
int
303
shade_next_vertex(shade_coord_stream_t * cs, shading_vertex_t * vertex, patch_color_t *c)
304
1.63M
{   /* Assuming p->c == c, provides a non-const access. */
305
1.63M
    int code = shade_next_coords(cs, &vertex->p, 1);
306
307
1.63M
    if (code >= 0)
308
1.63M
        code = shade_next_color(cs, c->cc.paint.values);
309
1.63M
    if (code >= 0)
310
1.63M
        cs->align(cs, 8); /* CET 09-47J.PS SpecialTestI04Test01. */
311
1.63M
    return code;
312
1.63M
}
313
314
/* ================ Shading rendering ================ */
315
316
/* Initialize the common parts of the recursion state. */
317
int
318
shade_init_fill_state(shading_fill_state_t * pfs, const gs_shading_t * psh,
319
                      gx_device * dev, gs_gstate * pgs)
320
28.5k
{
321
28.5k
    const gs_color_space *pcs = psh->params.ColorSpace;
322
28.5k
    float max_error = min(pgs->smoothness, MAX_SMOOTHNESS);
323
28.5k
    bool is_lab;
324
28.5k
    bool cs_lin_test;
325
28.5k
    int code;
326
327
    /*
328
     * There's no point in trying to achieve smoothness beyond what
329
     * the device can implement, i.e., the number of representable
330
     * colors times the number of halftone levels.
331
     */
332
28.5k
    long num_colors =
333
28.5k
        max(dev->color_info.max_gray, dev->color_info.max_color) + 1;
334
28.5k
    const gs_range *ranges = 0;
335
28.5k
    int ci;
336
28.5k
    gsicc_rendering_param_t rendering_params;
337
338
28.5k
    pfs->cs_always_linear = false;
339
28.5k
    pfs->dev = dev;
340
28.5k
    pfs->pgs = pgs;
341
28.5k
top:
342
28.5k
    pfs->direct_space = pcs;
343
28.5k
    pfs->num_components = gs_color_space_num_components(pcs);
344
28.5k
    switch ( gs_color_space_get_index(pcs) )
345
28.5k
        {
346
0
        case gs_color_space_index_Indexed:
347
0
            pcs = gs_cspace_base_space(pcs);
348
0
            goto top;
349
0
        case gs_color_space_index_CIEDEFG:
350
0
            ranges = pcs->params.defg->RangeDEFG.ranges;
351
0
            break;
352
0
        case gs_color_space_index_CIEDEF:
353
0
            ranges = pcs->params.def->RangeDEF.ranges;
354
0
            break;
355
0
        case gs_color_space_index_CIEABC:
356
0
            ranges = pcs->params.abc->RangeABC.ranges;
357
0
            break;
358
0
        case gs_color_space_index_CIEA:
359
0
            ranges = &pcs->params.a->RangeA;
360
0
            break;
361
27.1k
        case gs_color_space_index_ICC:
362
27.1k
            ranges = pcs->cmm_icc_profile_data->Range.ranges;
363
27.1k
            break;
364
1.34k
        default:
365
1.34k
            break;
366
28.5k
        }
367
28.5k
    if (num_colors <= 32) {
368
        /****** WRONG FOR MULTI-PLANE HALFTONES ******/
369
3.25k
        num_colors *= pgs->dev_ht[HT_OBJTYPE_DEFAULT]->components[0].corder.num_levels;
370
3.25k
    }
371
28.5k
    if (psh->head.type == 2 || psh->head.type == 3) {
372
27.0k
        max_error *= 0.25;
373
27.0k
        num_colors *= 2;
374
27.0k
    }
375
28.5k
    if (max_error < 1.0 / num_colors)
376
3.25k
        max_error = 1.0 / num_colors;
377
113k
    for (ci = 0; ci < pfs->num_components; ++ci)
378
84.6k
        pfs->cc_max_error[ci] =
379
84.6k
            (ranges == 0 ? max_error :
380
84.6k
             max_error * (ranges[ci].rmax - ranges[ci].rmin));
381
28.5k
    if (pgs->has_transparency && pgs->trans_device != NULL) {
382
7.31k
        pfs->trans_device = pgs->trans_device;
383
21.2k
    } else {
384
21.2k
        pfs->trans_device = dev;
385
21.2k
    }
386
    /* If the CS is PS based and we have not yet converted to the ICC form
387
       then go ahead and do that now */
388
28.5k
    if (gs_color_space_is_PSCIE(pcs) && pcs->icc_equivalent == NULL) {
389
0
        code = gs_colorspace_set_icc_equivalent((gs_color_space *)pcs, &(is_lab), pgs->memory);
390
0
        if (code < 0)
391
0
            return code;
392
0
    }
393
28.5k
    rendering_params.black_point_comp = pgs->blackptcomp;
394
28.5k
    rendering_params.graphics_type_tag = GS_VECTOR_TAG;
395
28.5k
    rendering_params.override_icc = false;
396
28.5k
    rendering_params.preserve_black = gsBKPRESNOTSPECIFIED;
397
28.5k
    rendering_params.rendering_intent = pgs->renderingintent;
398
28.5k
    rendering_params.cmm = gsCMM_DEFAULT;
399
    /* Grab the icc link transform that we need now */
400
28.5k
    if (pcs->cmm_icc_profile_data != NULL) {
401
27.1k
        pfs->icclink = gsicc_get_link(pgs, pgs->trans_device, pcs, NULL,
402
27.1k
                                      &rendering_params, pgs->memory);
403
27.1k
        if (pfs->icclink == NULL)
404
42
            return_error(gs_error_VMerror);
405
27.1k
    } else {
406
1.34k
        if (pcs->icc_equivalent != NULL ) {
407
            /* We have a PS equivalent ICC profile.  We may need to go
408
               through special range adjustments in this case */
409
0
            pfs->icclink = gsicc_get_link(pgs, pgs->trans_device,
410
0
                                          pcs->icc_equivalent, NULL,
411
0
                                          &rendering_params, pgs->memory);
412
0
            if (pfs->icclink == NULL)
413
0
                return_error(gs_error_VMerror);
414
1.34k
        } else {
415
1.34k
            pfs->icclink = NULL;
416
1.34k
        }
417
1.34k
    }
418
    /* Two possible cases of interest here for performance.  One is that the
419
    * icclink is NULL, which could occur if the source space were DeviceN or
420
    * a separation color space, while at the same time, the output device
421
    * supports these colorants (e.g. a separation device).   The other case is
422
    * that the icclink is the identity.  This could happen for example if the
423
    * source space were CMYK and we are going out to a CMYK device. For both
424
    * of these cases we can avoid going through the standard
425
    * color mappings to determine linearity. This is true, provided that the
426
    * transfer function is linear.  It is likely that we can improve
427
    * things even in cases where the transfer function is nonlinear, but for
428
    * now, we will punt on those and let them go through the longer processing
429
    * steps */
430
28.4k
    if (pfs->icclink == NULL)
431
1.34k
            cs_lin_test = !(using_alt_color_space((gs_gstate*)pgs));
432
27.1k
    else
433
27.1k
        cs_lin_test = pfs->icclink->is_identity;
434
435
28.4k
    if (cs_lin_test && !gx_has_transfer(pgs, dev->color_info.num_components)) {
436
19.7k
        pfs->cs_always_linear = true;
437
19.7k
    }
438
28.4k
    pfs->ShadingType = psh->head.type;
439
440
#ifdef IGNORE_SPEC_MATCH_ADOBE_SHADINGS
441
    /* Per the spec. If the source space is DeviceN or Separation and the
442
       colorants are not supported (i.e. if we are using the alternate tint
443
       transform) the interpolation should occur in the source space to
444
       accommodate non-linear tint transform functions.
445
       e.g. We had a case where the transform function
446
       was an increasing staircase. Including that function in the
447
       gradient smoothness calculation gave us severe quantization. AR on
448
       the other hand is doing the interpolation in device color space
449
       and has a smooth result for that case. So AR is not following the spec. The
450
       bit below solves the issues for Type 4 and Type 5 shadings as
451
       this will avoid interpolations in source space. Type 6 and Type 7 will still
452
       have interpolations in the source space even if pfs->cs_always_linear == true.
453
       So the approach below does not solve those issues. To do that
454
       without changing the shading code, we could make a linear
455
       approximation to the alternate tint transform, which would
456
       ensure smoothness like what AR provides.
457
    */
458
    if ((gs_color_space_get_index(pcs) == gs_color_space_index_DeviceN ||
459
        gs_color_space_get_index(pcs) == gs_color_space_index_Separation) &&
460
        using_alt_color_space((gs_gstate*)pgs) && (psh->head.type == 4 ||
461
        psh->head.type == 5)) {
462
        pfs->cs_always_linear = true;
463
    }
464
#endif
465
466
28.4k
    return 0;
467
28.5k
}
468
469
/* Fill one piece of a shading. */
470
int
471
shade_fill_path(const shading_fill_state_t * pfs, gx_path * ppath,
472
                gx_device_color * pdevc, const gs_fixed_point *fill_adjust)
473
0
{
474
0
    gx_fill_params params;
475
476
0
    params.rule = -1;   /* irrelevant */
477
0
    params.adjust = *fill_adjust;
478
0
    params.flatness = 0;  /* irrelevant */
479
0
    return (*dev_proc(pfs->dev, fill_path)) (pfs->dev, pfs->pgs, ppath,
480
                                             &params, pdevc, NULL);
481
0
}