Coverage Report

Created: 2025-11-16 07:40

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
192k
{
43
192k
    gs_imemory.reclaim = ireclaim;
44
192k
    return 0;
45
192k
}
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
401k
{
52
401k
    bool global;
53
401k
    gs_ref_memory_t *mem = NULL;
54
401k
    int code;
55
56
401k
    if (space < 0) {
57
        /* Determine which allocator exceeded the limit. */
58
16.3k
        int i;
59
60
65.1k
        for (i = 0; i < countof(dmem->spaces_indexed); i++) {
61
65.1k
            mem = dmem->spaces_indexed[i];
62
65.1k
            if (mem == 0)
63
16.3k
                continue;
64
48.7k
            if (mem->gc_status.requested > 0 ||
65
33.2k
                ((gs_ref_memory_t *)mem->stable_memory)->gc_status.requested > 0
66
48.7k
                )
67
16.3k
                break;
68
48.7k
        }
69
16.3k
        if (!mem) {
70
0
            mem = dmem->space_global; /* just in case */
71
0
        }
72
385k
    } else {
73
385k
        mem = dmem->spaces_indexed[space >> r_space_shift];
74
385k
    }
75
401k
    if_debug3m('0', (gs_memory_t *)mem, "[0]GC called, space=%d, requestor=%d, requested=%ld\n",
76
401k
               space, mem->space, (long)mem->gc_status.requested);
77
401k
    global = mem->space != avm_local;
78
    /* Since dmem may move, reset the request now. */
79
401k
    ialloc_reset_requested(dmem);
80
401k
    code = gs_vmreclaim(dmem, global);
81
401k
    if (code < 0)
82
1
        return code;
83
401k
    ialloc_set_limit(mem);
84
401k
    if (space < 0) {
85
16.3k
        gs_memory_status_t stats;
86
16.3k
        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
16.3k
        gs_memory_status((gs_memory_t *) mem, &stats);
91
16.3k
        allocated = stats.allocated;
92
16.3k
        if (mem->stable_memory != (gs_memory_t *)mem) {
93
16.3k
            gs_memory_status(mem->stable_memory, &stats);
94
16.3k
            allocated += stats.allocated;
95
16.3k
        }
96
16.3k
        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
16.3k
    }
101
401k
    return 0;
102
401k
}
103
104
/* Interpreter entry to garbage collector. */
105
static int
106
gs_vmreclaim(gs_dual_memory_t *dmem, bool global)
107
401k
{
108
    /* HACK: we know the gs_dual_memory_t is embedded in a context state. */
109
401k
    i_ctx_t *i_ctx_p =
110
401k
        (i_ctx_t *)((char *)dmem - offset_of(i_ctx_t, memory));
111
401k
    gs_ref_memory_t *lmem = dmem->space_local;
112
401k
    int code = context_state_store(i_ctx_p);
113
401k
    gs_ref_memory_t *memories[5];
114
401k
    gs_ref_memory_t *mem;
115
401k
    int nmem, i;
116
117
401k
    if (code < 0)
118
0
        return code;
119
120
401k
    memories[0] = dmem->space_system;
121
401k
    memories[1] = mem = dmem->space_global;
122
401k
    nmem = 2;
123
401k
    if (lmem != dmem->space_global)
124
401k
        memories[nmem++] = lmem;
125
1.60M
    for (i = nmem; --i >= 0;) {
126
1.20M
        mem = memories[i];
127
1.20M
        if (mem->stable_memory != (gs_memory_t *)mem)
128
803k
            memories[nmem++] = (gs_ref_memory_t *)mem->stable_memory;
129
1.20M
    }
130
131
    /****** ABORT IF code < 0 ******/
132
2.41M
    for (i = nmem; --i >= 0; )
133
2.00M
        alloc_close_clump(memories[i]);
134
135
    /* Prune the file list so it won't retain potentially collectible */
136
    /* files. */
137
138
401k
    for (i = (global ? i_vm_system : i_vm_local);
139
1.57M
         i < countof(dmem->spaces_indexed);
140
1.17M
         ++i
141
1.17M
         ) {
142
1.17M
        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
1.17M
        if (mem == 0 || (mem == dmem->spaces_indexed[i - 1]))
147
0
            continue;
148
1.17M
        if (mem->stable_memory != (gs_memory_t *)mem)
149
787k
            ialloc_gc_prepare((gs_ref_memory_t *)mem->stable_memory);
150
7.15M
        for (;; mem = &mem->saved->state) {
151
7.15M
            ialloc_gc_prepare(mem);
152
7.15M
            if (mem->saved == 0)
153
1.17M
                break;
154
7.15M
        }
155
1.17M
    }
156
157
    /* Do the actual collection. */
158
159
401k
    {
160
401k
        void *ctxp = i_ctx_p;
161
401k
        gs_gc_root_t context_root, *r = &context_root;
162
163
401k
        gs_register_struct_root((gs_memory_t *)lmem, &r,
164
401k
                                &ctxp, "i_ctx_p root");
165
401k
        GS_RECLAIM(&dmem->spaces, global);
166
401k
        gs_unregister_root((gs_memory_t *)lmem, r, "i_ctx_p root");
167
401k
        i_ctx_p = ctxp;
168
401k
        dmem = &i_ctx_p->memory;
169
401k
    }
170
171
    /* Update caches not handled by context_state_load. */
172
173
401k
    *systemdict = *ref_stack_index(&d_stack, ref_stack_count(&d_stack) - 1);
174
175
    /* Update the cached value pointers in names. */
176
177
401k
    dicts_gc_cleanup();
178
179
    /* Reopen the active clumps. */
180
181
2.41M
    for (i = 0; i < nmem; ++i)
182
2.00M
        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
401k
    code = context_state_load(i_ctx_p);
191
401k
    return code;
192
401k
}
193
194
/* ------ Initialization procedure ------ */
195
196
const op_def ireclaim_l2_op_defs[] =
197
{
198
    op_def_end(ireclaim_init)
199
};