/src/ghostpdl/pdf/pdf_stack.c
Line | Count | Source (jump to first uncovered line) |
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 | 504M | { |
25 | 504M | int code = 0; |
26 | 504M | if (num < 0) |
27 | 119k | return_error(gs_error_rangecheck); |
28 | | |
29 | 504M | if (pdfi_count_stack(ctx) < num) { |
30 | 35.0k | code = gs_note_error(gs_error_stackunderflow); |
31 | 35.0k | num = pdfi_count_stack(ctx); |
32 | 35.0k | pdfi_set_warning(ctx, 0, NULL, W_PDF_STACKUNDERFLOW, "pdfi_pop", NULL); |
33 | 35.0k | } |
34 | 1.33G | while(num) { |
35 | 830M | pdfi_countdown(ctx->stack_top[-1]); |
36 | 830M | ctx->stack_top--; |
37 | 830M | num--; |
38 | 830M | } |
39 | 504M | return code; |
40 | 504M | } |
41 | | |
42 | | int pdfi_push(pdf_context *ctx, pdf_obj *o) |
43 | 830M | { |
44 | 830M | pdf_obj **new_stack; |
45 | 830M | uint32_t entries = 0; |
46 | | |
47 | 830M | if (ctx->stack_top < ctx->stack_bot) |
48 | 107k | ctx->stack_top = ctx->stack_bot; |
49 | | |
50 | 830M | if (ctx->stack_top >= ctx->stack_limit) { |
51 | 631k | if (ctx->stack_size >= MAX_STACK_SIZE) |
52 | 1.07k | return_error(gs_error_pdf_stackoverflow); |
53 | | |
54 | 630k | 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 | 630k | if (new_stack == NULL) |
56 | 0 | return_error(gs_error_VMerror); |
57 | | |
58 | 630k | memcpy(new_stack, ctx->stack_bot, ctx->stack_size * sizeof(pdf_obj *)); |
59 | 630k | gs_free_object(ctx->memory, ctx->stack_bot, "pdfi_push_increase_interp_stack"); |
60 | | |
61 | 630k | entries = pdfi_count_total_stack(ctx); |
62 | | |
63 | 630k | ctx->stack_bot = new_stack; |
64 | 630k | ctx->stack_top = ctx->stack_bot + entries; |
65 | 630k | ctx->stack_size += INITIAL_STACK_SIZE; |
66 | 630k | ctx->stack_limit = ctx->stack_bot + ctx->stack_size; |
67 | 630k | } |
68 | | |
69 | 830M | *ctx->stack_top = o; |
70 | 830M | ctx->stack_top++; |
71 | 830M | pdfi_countup(o); |
72 | | |
73 | 830M | return 0; |
74 | 830M | } |
75 | | |
76 | | int pdfi_mark_stack(pdf_context *ctx, pdf_obj_type type) |
77 | 34.6M | { |
78 | 34.6M | pdf_obj *o; |
79 | 34.6M | int code; |
80 | | |
81 | 34.6M | if (type != PDF_ARRAY_MARK && type != PDF_DICT_MARK && type != PDF_PROC_MARK) |
82 | 0 | return_error(gs_error_typecheck); |
83 | | |
84 | 34.6M | code = pdfi_object_alloc(ctx, type, 0, &o); |
85 | 34.6M | if (code < 0) |
86 | 0 | return code; |
87 | | |
88 | 34.6M | code = pdfi_push(ctx, o); |
89 | 34.6M | if (code < 0) |
90 | 1 | pdfi_free_object(o); |
91 | 34.6M | return code; |
92 | 34.6M | } |
93 | | |
94 | | void pdfi_clearstack(pdf_context *ctx) |
95 | 35.9M | { |
96 | 35.9M | pdfi_pop(ctx, pdfi_count_stack(ctx)); |
97 | 35.9M | } |
98 | | |
99 | | int pdfi_count_to_mark(pdf_context *ctx, uint64_t *count) |
100 | 66.7M | { |
101 | 66.7M | pdf_obj *o = ctx->stack_top[- 1]; |
102 | 66.7M | int index = -1; |
103 | 66.7M | pdf_obj **save_bot = NULL; |
104 | | |
105 | 66.7M | save_bot = ctx->stack_bot + ctx->current_stream_save.stack_count; |
106 | | |
107 | 66.7M | *count = 0; |
108 | 376M | while (&ctx->stack_top[index] >= save_bot) { |
109 | 376M | if (pdfi_type_of(o) == PDF_ARRAY_MARK || pdfi_type_of(o) == PDF_DICT_MARK || pdfi_type_of(o) == PDF_PROC_MARK ) |
110 | 65.9M | return 0; |
111 | 310M | o = ctx->stack_top[--index]; |
112 | 310M | (*count)++; |
113 | 310M | } |
114 | 66.7M | return_error(gs_error_unmatchedmark); |
115 | 66.7M | } |
116 | | |
117 | | int pdfi_clear_to_mark(pdf_context *ctx) |
118 | 33.4M | { |
119 | 33.4M | int code; |
120 | 33.4M | uint64_t count; |
121 | | |
122 | 33.4M | code = pdfi_count_to_mark(ctx, &count); |
123 | 33.4M | if (code < 0) |
124 | 301k | return code; |
125 | 33.1M | return pdfi_pop(ctx, count + 1); |
126 | 33.4M | } |
127 | | |
128 | | int |
129 | | pdfi_destack_real(pdf_context *ctx, double *d) |
130 | 7.78M | { |
131 | 7.78M | int code; |
132 | | |
133 | 7.78M | if (pdfi_count_stack(ctx) < 1) |
134 | 55.2k | return_error(gs_error_stackunderflow); |
135 | | |
136 | 7.73M | code = pdfi_obj_to_real(ctx, ctx->stack_top[-1], d); |
137 | 7.73M | if (code < 0) { |
138 | 52.7k | pdfi_clearstack(ctx); |
139 | 52.7k | return code; |
140 | 52.7k | } |
141 | 7.67M | pdfi_pop(ctx, 1); |
142 | | |
143 | 7.67M | return 0; |
144 | 7.73M | } |
145 | | |
146 | | int |
147 | | pdfi_destack_reals(pdf_context *ctx, double *d, int n) |
148 | 53.1M | { |
149 | 53.1M | int i, code; |
150 | | |
151 | 53.1M | if (pdfi_count_stack(ctx) < n) { |
152 | 2.54M | pdfi_clearstack(ctx); |
153 | 2.54M | return_error(gs_error_stackunderflow); |
154 | 2.54M | } |
155 | | |
156 | 230M | for (i = 0; i < n; i++) { |
157 | 180M | code = pdfi_obj_to_real(ctx, ctx->stack_top[i-n], &d[i]); |
158 | 180M | if (code < 0) { |
159 | 251k | pdfi_clearstack(ctx); |
160 | 251k | return code; |
161 | 251k | } |
162 | 180M | } |
163 | 50.3M | pdfi_pop(ctx, n); |
164 | | |
165 | 50.3M | return 0; |
166 | 50.6M | } |
167 | | |
168 | | int |
169 | | pdfi_destack_floats(pdf_context *ctx, float *d, int n) |
170 | 2.67M | { |
171 | 2.67M | int i, code; |
172 | | |
173 | 2.67M | if (pdfi_count_stack(ctx) < n) { |
174 | 222k | pdfi_clearstack(ctx); |
175 | 222k | return_error(gs_error_stackunderflow); |
176 | 222k | } |
177 | | |
178 | 17.1M | for (i = 0; i < n; i++) { |
179 | 14.7M | code = pdfi_obj_to_float(ctx, ctx->stack_top[i-n], &d[i]); |
180 | 14.7M | if (code < 0) { |
181 | 7.10k | pdfi_clearstack(ctx); |
182 | 7.10k | return code; |
183 | 7.10k | } |
184 | 14.7M | } |
185 | 2.44M | pdfi_pop(ctx, n); |
186 | | |
187 | 2.44M | return 0; |
188 | 2.45M | } |
189 | | |
190 | | int |
191 | | pdfi_destack_int(pdf_context *ctx, int64_t *i) |
192 | 3.17M | { |
193 | 3.17M | int code; |
194 | | |
195 | 3.17M | if (pdfi_count_stack(ctx) < 1) |
196 | 2.83k | return_error(gs_error_stackunderflow); |
197 | | |
198 | 3.16M | code = pdfi_obj_to_int(ctx, ctx->stack_top[-1], i); |
199 | 3.16M | if (code < 0) { |
200 | 42.0k | pdfi_clearstack(ctx); |
201 | 42.0k | return code; |
202 | 42.0k | } |
203 | 3.12M | pdfi_pop(ctx, 1); |
204 | | |
205 | 3.12M | return 0; |
206 | 3.16M | } |
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 | } |