Coverage Report

Created: 2026-02-14 07:09

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
361M
{
25
361M
    int code = 0;
26
361M
    if (num < 0)
27
115k
        return_error(gs_error_rangecheck);
28
29
361M
    if (pdfi_count_stack(ctx) < num) {
30
28.7k
        code = gs_note_error(gs_error_stackunderflow);
31
28.7k
        num = pdfi_count_stack(ctx);
32
28.7k
        pdfi_set_warning(ctx, 0, NULL, W_PDF_STACKUNDERFLOW, "pdfi_pop", NULL);
33
28.7k
    }
34
954M
    while(num) {
35
593M
        pdfi_countdown(ctx->stack_top[-1]);
36
593M
        ctx->stack_top--;
37
593M
        num--;
38
593M
    }
39
361M
    return code;
40
361M
}
41
42
int pdfi_push(pdf_context *ctx, pdf_obj *o)
43
593M
{
44
593M
    pdf_obj **new_stack;
45
593M
    uint32_t entries = 0;
46
47
593M
    if (ctx->stack_top < ctx->stack_bot)
48
103k
        ctx->stack_top = ctx->stack_bot;
49
50
593M
    if (ctx->stack_top >= ctx->stack_limit) {
51
550k
        if (ctx->stack_size >= MAX_STACK_SIZE)
52
1.07k
            return_error(gs_error_pdf_stackoverflow);
53
54
549k
        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
549k
        if (new_stack == NULL)
56
0
            return_error(gs_error_VMerror);
57
58
549k
        memcpy(new_stack, ctx->stack_bot, ctx->stack_size * sizeof(pdf_obj *));
59
549k
        gs_free_object(ctx->memory, ctx->stack_bot, "pdfi_push_increase_interp_stack");
60
61
549k
        entries = pdfi_count_total_stack(ctx);
62
63
549k
        ctx->stack_bot = new_stack;
64
549k
        ctx->stack_top = ctx->stack_bot + entries;
65
549k
        ctx->stack_size += INITIAL_STACK_SIZE;
66
549k
        ctx->stack_limit = ctx->stack_bot + ctx->stack_size;
67
549k
    }
68
69
593M
    *ctx->stack_top = o;
70
593M
    ctx->stack_top++;
71
593M
    pdfi_countup(o);
72
73
593M
    return 0;
74
593M
}
75
76
int pdfi_mark_stack(pdf_context *ctx, pdf_obj_type type)
77
26.1M
{
78
26.1M
    pdf_obj *o;
79
26.1M
    int code;
80
81
26.1M
    if (type != PDF_ARRAY_MARK && type != PDF_DICT_MARK && type != PDF_PROC_MARK)
82
0
        return_error(gs_error_typecheck);
83
84
26.1M
    code = pdfi_object_alloc(ctx, type, 0, &o);
85
26.1M
    if (code < 0)
86
0
        return code;
87
88
26.1M
    code = pdfi_push(ctx, o);
89
26.1M
    if (code < 0)
90
1
        pdfi_free_object(o);
91
26.1M
    return code;
92
26.1M
}
93
94
void pdfi_clearstack(pdf_context *ctx)
95
28.7M
{
96
28.7M
    pdfi_pop(ctx, pdfi_count_stack(ctx));
97
28.7M
}
98
99
int pdfi_count_to_mark(pdf_context *ctx, uint64_t *count)
100
49.9M
{
101
49.9M
    pdf_obj *o = ctx->stack_top[- 1];
102
49.9M
    int index = -1;
103
49.9M
    pdf_obj **save_bot = NULL;
104
105
49.9M
    save_bot = ctx->stack_bot + ctx->current_stream_save.stack_count;
106
107
49.9M
    *count = 0;
108
275M
    while (&ctx->stack_top[index] >= save_bot) {
109
275M
        if (pdfi_type_of(o) == PDF_ARRAY_MARK || pdfi_type_of(o) == PDF_DICT_MARK || pdfi_type_of(o) == PDF_PROC_MARK )
110
49.3M
            return 0;
111
225M
        o = ctx->stack_top[--index];
112
225M
        (*count)++;
113
225M
    }
114
49.9M
    return_error(gs_error_unmatchedmark);
115
49.9M
}
116
117
int pdfi_clear_to_mark(pdf_context *ctx)
118
25.0M
{
119
25.0M
    int code;
120
25.0M
    uint64_t count;
121
122
25.0M
    code = pdfi_count_to_mark(ctx, &count);
123
25.0M
    if (code < 0)
124
279k
        return code;
125
24.7M
    return pdfi_pop(ctx, count + 1);
126
25.0M
}
127
128
int
129
pdfi_destack_real(pdf_context *ctx, double *d)
130
5.79M
{
131
5.79M
    int code;
132
133
5.79M
    if (pdfi_count_stack(ctx) < 1)
134
46.0k
        return_error(gs_error_stackunderflow);
135
136
5.74M
    code = pdfi_obj_to_real(ctx, ctx->stack_top[-1], d);
137
5.74M
    if (code < 0) {
138
45.8k
        pdfi_clearstack(ctx);
139
45.8k
        return code;
140
45.8k
    }
141
5.70M
    pdfi_pop(ctx, 1);
142
143
5.70M
    return 0;
144
5.74M
}
145
146
int
147
pdfi_destack_reals(pdf_context *ctx, double *d, int n)
148
35.0M
{
149
35.0M
    int i, code;
150
151
35.0M
    if (pdfi_count_stack(ctx) < n) {
152
1.97M
        pdfi_clearstack(ctx);
153
1.97M
        return_error(gs_error_stackunderflow);
154
1.97M
    }
155
156
151M
    for (i = 0; i < n; i++) {
157
118M
        code = pdfi_obj_to_real(ctx, ctx->stack_top[i-n], &d[i]);
158
118M
        if (code < 0) {
159
200k
            pdfi_clearstack(ctx);
160
200k
            return code;
161
200k
        }
162
118M
    }
163
32.9M
    pdfi_pop(ctx, n);
164
165
32.9M
    return 0;
166
33.1M
}
167
168
int
169
pdfi_destack_floats(pdf_context *ctx, float *d, int n)
170
1.85M
{
171
1.85M
    int i, code;
172
173
1.85M
    if (pdfi_count_stack(ctx) < n) {
174
198k
        pdfi_clearstack(ctx);
175
198k
        return_error(gs_error_stackunderflow);
176
198k
    }
177
178
11.5M
    for (i = 0; i < n; i++) {
179
9.91M
        code = pdfi_obj_to_float(ctx, ctx->stack_top[i-n], &d[i]);
180
9.91M
        if (code < 0) {
181
7.11k
            pdfi_clearstack(ctx);
182
7.11k
            return code;
183
7.11k
        }
184
9.91M
    }
185
1.64M
    pdfi_pop(ctx, n);
186
187
1.64M
    return 0;
188
1.65M
}
189
190
int
191
pdfi_destack_int(pdf_context *ctx, int64_t *i)
192
2.66M
{
193
2.66M
    int code;
194
195
2.66M
    if (pdfi_count_stack(ctx) < 1)
196
3.36k
        return_error(gs_error_stackunderflow);
197
198
2.66M
    code = pdfi_obj_to_int(ctx, ctx->stack_top[-1], i);
199
2.66M
    if (code < 0) {
200
35.8k
        pdfi_clearstack(ctx);
201
35.8k
        return code;
202
35.8k
    }
203
2.62M
    pdfi_pop(ctx, 1);
204
205
2.62M
    return 0;
206
2.66M
}
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
}