Coverage Report

Created: 2025-06-10 07:27

/src/ghostpdl/pdf/pdf_stack.c
Line
Count
Source (jump to first uncovered line)
1
/* Copyright (C) 2018-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
/* Stack operations for the PDF interpreter */
17
18
#include "ghostpdf.h"
19
#include "pdf_types.h"
20
#include "pdf_int.h"
21
#include "pdf_stack.h"
22
23
int pdfi_pop(pdf_context *ctx, int num)
24
24.7M
{
25
24.7M
    int code = 0;
26
24.7M
    if (num < 0)
27
4.99k
        return_error(gs_error_rangecheck);
28
29
24.7M
    if (pdfi_count_stack(ctx) < num) {
30
693
        code = gs_note_error(gs_error_stackunderflow);
31
693
        num = pdfi_count_stack(ctx);
32
693
        pdfi_set_warning(ctx, 0, NULL, W_PDF_STACKUNDERFLOW, "pdfi_pop", NULL);
33
693
    }
34
63.4M
    while(num) {
35
38.6M
        pdfi_countdown(ctx->stack_top[-1]);
36
38.6M
        ctx->stack_top--;
37
38.6M
        num--;
38
38.6M
    }
39
24.7M
    return code;
40
24.7M
}
41
42
int pdfi_push(pdf_context *ctx, pdf_obj *o)
43
38.6M
{
44
38.6M
    pdf_obj **new_stack;
45
38.6M
    uint32_t entries = 0;
46
47
38.6M
    if (ctx->stack_top < ctx->stack_bot)
48
5.44k
        ctx->stack_top = ctx->stack_bot;
49
50
38.6M
    if (ctx->stack_top >= ctx->stack_limit) {
51
53.7k
        if (ctx->stack_size >= MAX_STACK_SIZE)
52
1.07k
            return_error(gs_error_pdf_stackoverflow);
53
54
52.6k
        new_stack = (pdf_obj **)gs_alloc_bytes(ctx->memory, (ctx->stack_size + INITIAL_STACK_SIZE) * sizeof (pdf_obj *), "pdfi_push_increase_interp_stack");
55
52.6k
        if (new_stack == NULL)
56
0
            return_error(gs_error_VMerror);
57
58
52.6k
        memcpy(new_stack, ctx->stack_bot, ctx->stack_size * sizeof(pdf_obj *));
59
52.6k
        gs_free_object(ctx->memory, ctx->stack_bot, "pdfi_push_increase_interp_stack");
60
61
52.6k
        entries = pdfi_count_total_stack(ctx);
62
63
52.6k
        ctx->stack_bot = new_stack;
64
52.6k
        ctx->stack_top = ctx->stack_bot + entries;
65
52.6k
        ctx->stack_size += INITIAL_STACK_SIZE;
66
52.6k
        ctx->stack_limit = ctx->stack_bot + ctx->stack_size;
67
52.6k
    }
68
69
38.6M
    *ctx->stack_top = o;
70
38.6M
    ctx->stack_top++;
71
38.6M
    pdfi_countup(o);
72
73
38.6M
    return 0;
74
38.6M
}
75
76
int pdfi_mark_stack(pdf_context *ctx, pdf_obj_type type)
77
1.62M
{
78
1.62M
    pdf_obj *o;
79
1.62M
    int code;
80
81
1.62M
    if (type != PDF_ARRAY_MARK && type != PDF_DICT_MARK && type != PDF_PROC_MARK)
82
0
        return_error(gs_error_typecheck);
83
84
1.62M
    code = pdfi_object_alloc(ctx, type, 0, &o);
85
1.62M
    if (code < 0)
86
0
        return code;
87
88
1.62M
    code = pdfi_push(ctx, o);
89
1.62M
    if (code < 0)
90
1
        pdfi_free_object(o);
91
1.62M
    return code;
92
1.62M
}
93
94
void pdfi_clearstack(pdf_context *ctx)
95
1.95M
{
96
1.95M
    pdfi_pop(ctx, pdfi_count_stack(ctx));
97
1.95M
}
98
99
int pdfi_count_to_mark(pdf_context *ctx, uint64_t *count)
100
3.17M
{
101
3.17M
    pdf_obj *o = ctx->stack_top[- 1];
102
3.17M
    int index = -1;
103
3.17M
    pdf_obj **save_bot = NULL;
104
105
3.17M
    save_bot = ctx->stack_bot + ctx->current_stream_save.stack_count;
106
107
3.17M
    *count = 0;
108
18.7M
    while (&ctx->stack_top[index] >= save_bot) {
109
18.7M
        if (pdfi_type_of(o) == PDF_ARRAY_MARK || pdfi_type_of(o) == PDF_DICT_MARK || pdfi_type_of(o) == PDF_PROC_MARK )
110
3.13M
            return 0;
111
15.5M
        o = ctx->stack_top[--index];
112
15.5M
        (*count)++;
113
15.5M
    }
114
3.17M
    return_error(gs_error_unmatchedmark);
115
3.17M
}
116
117
int pdfi_clear_to_mark(pdf_context *ctx)
118
1.58M
{
119
1.58M
    int code;
120
1.58M
    uint64_t count;
121
122
1.58M
    code = pdfi_count_to_mark(ctx, &count);
123
1.58M
    if (code < 0)
124
15.4k
        return code;
125
1.56M
    return pdfi_pop(ctx, count + 1);
126
1.58M
}
127
128
int
129
pdfi_destack_real(pdf_context *ctx, double *d)
130
455k
{
131
455k
    int code;
132
133
455k
    if (pdfi_count_stack(ctx) < 1)
134
750
        return_error(gs_error_stackunderflow);
135
136
454k
    code = pdfi_obj_to_real(ctx, ctx->stack_top[-1], d);
137
454k
    if (code < 0) {
138
1.62k
        pdfi_clearstack(ctx);
139
1.62k
        return code;
140
1.62k
    }
141
452k
    pdfi_pop(ctx, 1);
142
143
452k
    return 0;
144
454k
}
145
146
int
147
pdfi_destack_reals(pdf_context *ctx, double *d, int n)
148
2.05M
{
149
2.05M
    int i, code;
150
151
2.05M
    if (pdfi_count_stack(ctx) < n) {
152
152k
        pdfi_clearstack(ctx);
153
152k
        return_error(gs_error_stackunderflow);
154
152k
    }
155
156
7.74M
    for (i = 0; i < n; i++) {
157
5.85M
        code = pdfi_obj_to_real(ctx, ctx->stack_top[i-n], &d[i]);
158
5.85M
        if (code < 0) {
159
12.8k
            pdfi_clearstack(ctx);
160
12.8k
            return code;
161
12.8k
        }
162
5.85M
    }
163
1.89M
    pdfi_pop(ctx, n);
164
165
1.89M
    return 0;
166
1.90M
}
167
168
int
169
pdfi_destack_floats(pdf_context *ctx, float *d, int n)
170
143k
{
171
143k
    int i, code;
172
173
143k
    if (pdfi_count_stack(ctx) < n) {
174
8.38k
        pdfi_clearstack(ctx);
175
8.38k
        return_error(gs_error_stackunderflow);
176
8.38k
    }
177
178
943k
    for (i = 0; i < n; i++) {
179
809k
        code = pdfi_obj_to_float(ctx, ctx->stack_top[i-n], &d[i]);
180
809k
        if (code < 0) {
181
261
            pdfi_clearstack(ctx);
182
261
            return code;
183
261
        }
184
809k
    }
185
134k
    pdfi_pop(ctx, n);
186
187
134k
    return 0;
188
135k
}
189
190
int
191
pdfi_destack_int(pdf_context *ctx, int64_t *i)
192
202k
{
193
202k
    int code;
194
195
202k
    if (pdfi_count_stack(ctx) < 1)
196
70
        return_error(gs_error_stackunderflow);
197
198
202k
    code = pdfi_obj_to_int(ctx, ctx->stack_top[-1], i);
199
202k
    if (code < 0) {
200
2.20k
        pdfi_clearstack(ctx);
201
2.20k
        return code;
202
2.20k
    }
203
199k
    pdfi_pop(ctx, 1);
204
205
199k
    return 0;
206
202k
}
207
208
int
209
pdfi_destack_ints(pdf_context *ctx, int64_t *i64, int n)
210
0
{
211
0
    int i, code;
212
213
0
    if (pdfi_count_stack(ctx) < n) {
214
0
        pdfi_clearstack(ctx);
215
0
        return_error(gs_error_stackunderflow);
216
0
    }
217
218
0
    for (i = 0; i < n; i++) {
219
0
        code = pdfi_obj_to_int(ctx, ctx->stack_top[i-n], &i64[i]);
220
0
        if (code < 0) {
221
0
            pdfi_clearstack(ctx);
222
0
            return code;
223
0
        }
224
0
    }
225
0
    pdfi_pop(ctx, n);
226
227
0
    return 0;
228
0
}