Coverage Report

Created: 2026-04-01 07:17

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/ghostpdl/pdf/pdf_stack.c
Line
Count
Source
1
/* Copyright (C) 2001-2025 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
347M
{
25
347M
    int code = 0;
26
347M
    if (num < 0)
27
118k
        return_error(gs_error_rangecheck);
28
29
347M
    if (pdfi_count_stack(ctx) < num) {
30
29.2k
        code = gs_note_error(gs_error_stackunderflow);
31
29.2k
        num = pdfi_count_stack(ctx);
32
29.2k
        pdfi_set_warning(ctx, 0, NULL, W_PDF_STACKUNDERFLOW, "pdfi_pop", NULL);
33
29.2k
    }
34
922M
    while(num) {
35
574M
        pdfi_countdown(ctx->stack_top[-1]);
36
574M
        ctx->stack_top--;
37
574M
        num--;
38
574M
    }
39
347M
    return code;
40
347M
}
41
42
int pdfi_push(pdf_context *ctx, pdf_obj *o)
43
574M
{
44
574M
    pdf_obj **new_stack;
45
574M
    uint32_t entries = 0;
46
47
574M
    if (ctx->stack_top < ctx->stack_bot)
48
97.7k
        ctx->stack_top = ctx->stack_bot;
49
50
574M
    if (ctx->stack_top >= ctx->stack_limit) {
51
522k
        if (ctx->stack_size >= MAX_STACK_SIZE)
52
1.07k
            return_error(gs_error_pdf_stackoverflow);
53
54
521k
        new_stack = (pdf_obj **)gs_alloc_bytes(ctx->memory, (size_t)(ctx->stack_size + INITIAL_STACK_SIZE) * sizeof (pdf_obj *), "pdfi_push_increase_interp_stack");
55
521k
        if (new_stack == NULL)
56
0
            return_error(gs_error_VMerror);
57
58
521k
        memcpy(new_stack, ctx->stack_bot, ctx->stack_size * sizeof(pdf_obj *));
59
521k
        gs_free_object(ctx->memory, ctx->stack_bot, "pdfi_push_increase_interp_stack");
60
61
521k
        entries = pdfi_count_total_stack(ctx);
62
63
521k
        ctx->stack_bot = new_stack;
64
521k
        ctx->stack_top = ctx->stack_bot + entries;
65
521k
        ctx->stack_size += INITIAL_STACK_SIZE;
66
521k
        ctx->stack_limit = ctx->stack_bot + ctx->stack_size;
67
521k
    }
68
69
574M
    *ctx->stack_top = o;
70
574M
    ctx->stack_top++;
71
574M
    pdfi_countup(o);
72
73
574M
    return 0;
74
574M
}
75
76
int pdfi_mark_stack(pdf_context *ctx, pdf_obj_type type)
77
24.9M
{
78
24.9M
    pdf_obj *o;
79
24.9M
    int code;
80
81
24.9M
    if (type != PDF_ARRAY_MARK && type != PDF_DICT_MARK && type != PDF_PROC_MARK)
82
0
        return_error(gs_error_typecheck);
83
84
24.9M
    code = pdfi_object_alloc(ctx, type, 0, &o);
85
24.9M
    if (code < 0)
86
0
        return code;
87
88
24.9M
    code = pdfi_push(ctx, o);
89
24.9M
    if (code < 0)
90
1
        pdfi_free_object(o);
91
24.9M
    return code;
92
24.9M
}
93
94
void pdfi_clearstack(pdf_context *ctx)
95
27.1M
{
96
27.1M
    pdfi_pop(ctx, pdfi_count_stack(ctx));
97
27.1M
}
98
99
int pdfi_count_to_mark(pdf_context *ctx, uint64_t *count)
100
47.7M
{
101
47.7M
    pdf_obj *o = ctx->stack_top[- 1];
102
47.7M
    int index = -1;
103
47.7M
    pdf_obj **save_bot = NULL;
104
105
47.7M
    save_bot = ctx->stack_bot + ctx->current_stream_save.stack_count;
106
107
47.7M
    *count = 0;
108
265M
    while (&ctx->stack_top[index] >= save_bot) {
109
265M
        if (pdfi_type_of(o) == PDF_ARRAY_MARK || pdfi_type_of(o) == PDF_DICT_MARK || pdfi_type_of(o) == PDF_PROC_MARK )
110
47.1M
            return 0;
111
218M
        o = ctx->stack_top[--index];
112
218M
        (*count)++;
113
218M
    }
114
47.7M
    return_error(gs_error_unmatchedmark);
115
47.7M
}
116
117
int pdfi_clear_to_mark(pdf_context *ctx)
118
23.9M
{
119
23.9M
    int code;
120
23.9M
    uint64_t count;
121
122
23.9M
    code = pdfi_count_to_mark(ctx, &count);
123
23.9M
    if (code < 0)
124
254k
        return code;
125
23.6M
    return pdfi_pop(ctx, count + 1);
126
23.9M
}
127
128
int
129
pdfi_destack_real(pdf_context *ctx, double *d)
130
5.44M
{
131
5.44M
    int code;
132
133
5.44M
    if (pdfi_count_stack(ctx) < 1)
134
42.2k
        return_error(gs_error_stackunderflow);
135
136
5.40M
    code = pdfi_obj_to_real(ctx, ctx->stack_top[-1], d);
137
5.40M
    if (code < 0) {
138
43.6k
        pdfi_clearstack(ctx);
139
43.6k
        return code;
140
43.6k
    }
141
5.35M
    pdfi_pop(ctx, 1);
142
143
5.35M
    return 0;
144
5.40M
}
145
146
int
147
pdfi_destack_reals(pdf_context *ctx, double *d, int n)
148
34.7M
{
149
34.7M
    int i, code;
150
151
34.7M
    if (pdfi_count_stack(ctx) < n) {
152
1.85M
        pdfi_clearstack(ctx);
153
1.85M
        return_error(gs_error_stackunderflow);
154
1.85M
    }
155
156
150M
    for (i = 0; i < n; i++) {
157
117M
        code = pdfi_obj_to_real(ctx, ctx->stack_top[i-n], &d[i]);
158
117M
        if (code < 0) {
159
180k
            pdfi_clearstack(ctx);
160
180k
            return code;
161
180k
        }
162
117M
    }
163
32.7M
    pdfi_pop(ctx, n);
164
165
32.7M
    return 0;
166
32.8M
}
167
168
int
169
pdfi_destack_floats(pdf_context *ctx, float *d, int n)
170
1.79M
{
171
1.79M
    int i, code;
172
173
1.79M
    if (pdfi_count_stack(ctx) < n) {
174
192k
        pdfi_clearstack(ctx);
175
192k
        return_error(gs_error_stackunderflow);
176
192k
    }
177
178
11.2M
    for (i = 0; i < n; i++) {
179
9.61M
        code = pdfi_obj_to_float(ctx, ctx->stack_top[i-n], &d[i]);
180
9.61M
        if (code < 0) {
181
6.76k
            pdfi_clearstack(ctx);
182
6.76k
            return code;
183
6.76k
        }
184
9.61M
    }
185
1.59M
    pdfi_pop(ctx, n);
186
187
1.59M
    return 0;
188
1.60M
}
189
190
int
191
pdfi_destack_int(pdf_context *ctx, int64_t *i)
192
2.46M
{
193
2.46M
    int code;
194
195
2.46M
    if (pdfi_count_stack(ctx) < 1)
196
3.56k
        return_error(gs_error_stackunderflow);
197
198
2.46M
    code = pdfi_obj_to_int(ctx, ctx->stack_top[-1], i);
199
2.46M
    if (code < 0) {
200
32.6k
        pdfi_clearstack(ctx);
201
32.6k
        return code;
202
32.6k
    }
203
2.43M
    pdfi_pop(ctx, 1);
204
205
2.43M
    return 0;
206
2.46M
}
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
}