Coverage Report

Created: 2026-10-28 08:05

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/ghostpdl/psi/ireclaim.c
Line
Count
Source
1
/* Copyright (C) 2001-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
17
/* Interpreter's interface to garbage collector */
18
#include "ghost.h"
19
#include "ierrors.h"
20
#include "gsstruct.h"
21
#include "iastate.h"
22
#include "icontext.h"
23
#include "interp.h"
24
#include "isave.h"    /* for isstate.h */
25
#include "isstate.h"    /* for mem->saved->state */
26
#include "dstack.h"   /* for dsbot, dsp, dict_set_top */
27
#include "estack.h"   /* for esbot, esp */
28
#include "ostack.h"   /* for osbot, osp */
29
#include "opdef.h"    /* for defining init procedure */
30
#include "store.h"    /* for make_array */
31
32
/* Import preparation and cleanup routines. */
33
extern void ialloc_gc_prepare(gs_ref_memory_t *);
34
35
/* Forward references */
36
static int gs_vmreclaim(gs_dual_memory_t *, bool);
37
38
/* Initialize the GC hook in the allocator. */
39
static int ireclaim(gs_dual_memory_t *, int);
40
static int
41
ireclaim_init(i_ctx_t *i_ctx_p)
42
162k
{
43
162k
    gs_imemory.reclaim = ireclaim;
44
162k
    return 0;
45
162k
}
46
47
/* GC hook called when the allocator signals a GC is needed (space = -1), */
48
/* or for vmreclaim (space = the space to collect). */
49
static int
50
ireclaim(gs_dual_memory_t * dmem, int space)
51
333k
{
52
333k
    bool global;
53
333k
    gs_ref_memory_t *mem = NULL;
54
333k
    int code;
55
56
333k
    if (space < 0) {
57
        /* Determine which allocator exceeded the limit. */
58
9.85k
        int i;
59
60
39.2k
        for (i = 0; i < countof(dmem->spaces_indexed); i++) {
61
39.2k
            mem = dmem->spaces_indexed[i];
62
39.2k
            if (mem == 0)
63
9.85k
                continue;
64
29.4k
            if (mem->gc_status.requested > 0 ||
65
19.9k
                ((gs_ref_memory_t *)mem->stable_memory)->gc_status.requested > 0
66
29.4k
                )
67
9.85k
                break;
68
29.4k
        }
69
9.85k
        if (!mem) {
70
0
            mem = dmem->space_global; /* just in case */
71
0
        }
72
323k
    } else {
73
323k
        mem = dmem->spaces_indexed[space >> r_space_shift];
74
323k
    }
75
333k
    if_debug3m('0', (gs_memory_t *)mem, "[0]GC called, space=%d, requestor=%d, requested=%ld\n",
76
333k
               space, mem->space, (long)mem->gc_status.requested);
77
333k
    global = mem->space != avm_local;
78
    /* Since dmem may move, reset the request now. */
79
333k
    ialloc_reset_requested(dmem);
80
333k
    code = gs_vmreclaim(dmem, global);
81
333k
    if (code < 0)
82
0
        return code;
83
333k
    ialloc_set_limit(mem);
84
333k
    if (space < 0) {
85
9.85k
        gs_memory_status_t stats;
86
9.85k
        size_t allocated;
87
88
        /* If the ammount still allocated after the GC is complete */
89
        /* exceeds the max_vm setting, then return a VMerror       */
90
9.85k
        gs_memory_status((gs_memory_t *) mem, &stats);
91
9.85k
        allocated = stats.allocated;
92
9.85k
        if (mem->stable_memory != (gs_memory_t *)mem) {
93
9.85k
            gs_memory_status(mem->stable_memory, &stats);
94
9.85k
            allocated += stats.allocated;
95
9.85k
        }
96
9.85k
        if (allocated >= mem->gc_status.max_vm) {
97
            /* We can't satisfy this request within max_vm. */
98
0
            return_error(gs_error_VMerror);
99
0
        }
100
9.85k
    }
101
333k
    return 0;
102
333k
}
103
104
/* Interpreter entry to garbage collector. */
105
static int
106
gs_vmreclaim(gs_dual_memory_t *dmem, bool global)
107
333k
{
108
    /* HACK: we know the gs_dual_memory_t is embedded in a context state. */
109
333k
    i_ctx_t *i_ctx_p =
110
333k
        (i_ctx_t *)((char *)dmem - offset_of(i_ctx_t, memory));
111
333k
    gs_ref_memory_t *lmem = dmem->space_local;
112
333k
    int code = context_state_store(i_ctx_p);
113
333k
    gs_ref_memory_t *memories[5];
114
333k
    gs_ref_memory_t *mem;
115
333k
    int nmem, i;
116
117
333k
    if (code < 0)
118
0
        return code;
119
120
333k
    memories[0] = dmem->space_system;
121
333k
    memories[1] = mem = dmem->space_global;
122
333k
    nmem = 2;
123
333k
    if (lmem != dmem->space_global)
124
333k
        memories[nmem++] = lmem;
125
1.33M
    for (i = nmem; --i >= 0;) {
126
1.00M
        mem = memories[i];
127
1.00M
        if (mem->stable_memory != (gs_memory_t *)mem)
128
667k
            memories[nmem++] = (gs_ref_memory_t *)mem->stable_memory;
129
1.00M
    }
130
131
    /****** ABORT IF code < 0 ******/
132
2.00M
    for (i = nmem; --i >= 0; )
133
1.66M
        alloc_close_clump(memories[i]);
134
135
    /* Prune the file list so it won't retain potentially collectible */
136
    /* files. */
137
138
333k
    for (i = (global ? i_vm_system : i_vm_local);
139
1.31M
         i < countof(dmem->spaces_indexed);
140
981k
         ++i
141
981k
         ) {
142
981k
        gs_ref_memory_t *mem = dmem->spaces_indexed[i];
143
144
        /* Always safe to substract 1 from i here, as i is always at
145
         * least i_vm_system (1) or i_vm_local (2). */
146
981k
        if (mem == 0 || (mem == dmem->spaces_indexed[i - 1]))
147
0
            continue;
148
981k
        if (mem->stable_memory != (gs_memory_t *)mem)
149
657k
            ialloc_gc_prepare((gs_ref_memory_t *)mem->stable_memory);
150
16.1M
        for (;; mem = &mem->saved->state) {
151
16.1M
            ialloc_gc_prepare(mem);
152
16.1M
            if (mem->saved == 0)
153
981k
                break;
154
16.1M
        }
155
981k
    }
156
157
    /* Do the actual collection. */
158
159
333k
    {
160
333k
        void *ctxp = i_ctx_p;
161
333k
        gs_gc_root_t context_root, *r = &context_root;
162
163
333k
        gs_register_struct_root((gs_memory_t *)lmem, &r,
164
333k
                                &ctxp, "i_ctx_p root");
165
333k
        GS_RECLAIM(&dmem->spaces, global);
166
333k
        gs_unregister_root((gs_memory_t *)lmem, r, "i_ctx_p root");
167
333k
        i_ctx_p = ctxp;
168
333k
        dmem = &i_ctx_p->memory;
169
333k
    }
170
171
    /* Update caches not handled by context_state_load. */
172
173
333k
    *systemdict = *ref_stack_index(&d_stack, ref_stack_count(&d_stack) - 1);
174
175
    /* Update the cached value pointers in names. */
176
177
333k
    dicts_gc_cleanup();
178
179
    /* Reopen the active clumps. */
180
181
2.00M
    for (i = 0; i < nmem; ++i)
182
1.66M
        alloc_open_clump(memories[i]);
183
184
    /* Reload the context state.  Note this should be done
185
       AFTER the clumps are reopened, since the context state
186
       load could do allocations that must remain.
187
       If it were done while the clumps were still closed,
188
       we would lose those allocations when the clumps were opened */
189
190
333k
    code = context_state_load(i_ctx_p);
191
333k
    return code;
192
333k
}
193
194
/* ------ Initialization procedure ------ */
195
196
const op_def ireclaim_l2_op_defs[] =
197
{
198
    op_def_end(ireclaim_init)
199
};