|
0
|
1 /* Opaque Lisp objects.
|
|
|
2 Copyright (C) 1993, 1994, 1995 Sun Microsystems, Inc.
|
|
|
3 Copyright (C) 1995, 1996 Ben Wing.
|
|
|
4
|
|
|
5 This file is part of XEmacs.
|
|
|
6
|
|
|
7 XEmacs is free software; you can redistribute it and/or modify it
|
|
|
8 under the terms of the GNU General Public License as published by the
|
|
|
9 Free Software Foundation; either version 2, or (at your option) any
|
|
|
10 later version.
|
|
|
11
|
|
|
12 XEmacs is distributed in the hope that it will be useful, but WITHOUT
|
|
|
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
|
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
|
15 for more details.
|
|
|
16
|
|
|
17 You should have received a copy of the GNU General Public License
|
|
|
18 along with XEmacs; see the file COPYING. If not, write to
|
|
|
19 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
|
|
20 Boston, MA 02111-1307, USA. */
|
|
|
21
|
|
|
22 /* Synched up with: Not in FSF. */
|
|
|
23
|
|
|
24 /* Written by Ben Wing, October 1993. */
|
|
|
25
|
|
|
26 /* "Opaque" is used internally to hold keep track of allocated memory
|
|
|
27 so it gets GC'd properly, and to store arbitrary data in places
|
|
|
28 where a Lisp_Object is required and which may get GC'd. (e.g. as
|
|
|
29 the argument to record_unwind_protect()). Once created in C,
|
|
|
30 opaque objects cannot be resized.
|
|
|
31
|
|
|
32 OPAQUE OBJECTS SHOULD NEVER ESCAPE TO THE LISP LEVEL. Some code
|
|
|
33 depends on this. As such, opaque objects are a generalization
|
|
|
34 of the Qunbound marker.
|
|
|
35
|
|
|
36 "Opaque lists" are used to keep track of lots of opaque objects
|
|
|
37 of a particular size so that they can be efficiently "freed" and
|
|
|
38 re-used again without actually entering the Lisp allocation system
|
|
|
39 (and consequently doing a malloc()).
|
|
|
40 */
|
|
|
41
|
|
|
42 #include <config.h>
|
|
|
43 #include "lisp.h"
|
|
|
44 #include "opaque.h"
|
|
|
45
|
|
|
46 Lisp_Object Qopaquep;
|
|
|
47
|
|
|
48 static int in_opaque_list_marking;
|
|
|
49
|
|
|
50 /* Holds freed opaque objects created with make_opaque_ptr().
|
|
|
51 We do this quite often so it's a noticeable win if we don't
|
|
|
52 create GC junk. */
|
|
|
53 Lisp_Object Vopaque_ptr_free_list;
|
|
|
54
|
|
|
55 static Lisp_Object mark_opaque (Lisp_Object, void (*) (Lisp_Object));
|
|
|
56 static unsigned int sizeof_opaque (CONST void *header);
|
|
|
57 static void print_opaque (Lisp_Object obj, Lisp_Object printcharfun,
|
|
|
58 int escapeflag);
|
|
|
59 DEFINE_LRECORD_SEQUENCE_IMPLEMENTATION ("opaque", opaque,
|
|
|
60 mark_opaque, print_opaque, 0, 0, 0,
|
|
|
61 sizeof_opaque, struct Lisp_Opaque);
|
|
|
62
|
|
|
63 static Lisp_Object
|
|
|
64 mark_opaque (Lisp_Object obj, void (*markobj) (Lisp_Object))
|
|
|
65 {
|
|
|
66 #ifdef ERROR_CHECK_GC
|
|
|
67 if (!in_opaque_list_marking)
|
|
|
68 /* size is non-int for objects on an opaque free list. We sure
|
|
|
69 as hell better not be marking any of these objects unless
|
|
|
70 we're marking an opaque list. */
|
|
|
71 assert (INTP (XOPAQUE (obj)->size_or_chain));
|
|
|
72 else
|
|
|
73 /* marking an opaque on the free list doesn't do any recursive
|
|
|
74 markings, so we better not have non-freed opaques on a free
|
|
|
75 list. */
|
|
|
76 assert (!INTP (XOPAQUE (obj)->size_or_chain));
|
|
|
77 #endif
|
|
|
78 if (INTP (XOPAQUE (obj)->size_or_chain) && XOPAQUE_MARKFUN (obj))
|
|
173
|
79 return XOPAQUE_MARKFUN (obj) (obj, markobj);
|
|
0
|
80 else
|
|
|
81 return XOPAQUE (obj)->size_or_chain;
|
|
|
82 }
|
|
|
83
|
|
|
84 /* Should never, ever be called. (except by an external debugger) */
|
|
|
85 static void
|
|
|
86 print_opaque (Lisp_Object obj, Lisp_Object printcharfun, int escapeflag)
|
|
|
87 {
|
|
|
88 char buf[200];
|
|
|
89 if (INTP (XOPAQUE (obj)->size_or_chain))
|
|
173
|
90 sprintf (buf, "#<INTERNAL EMACS BUG (opaque, size=%ld) 0x%p>",
|
|
|
91 (long) XOPAQUE_SIZE (obj), (void *) XPNTR (obj));
|
|
0
|
92 else
|
|
173
|
93 sprintf (buf, "#<INTERNAL EMACS BUG (opaque, freed) 0x%p>",
|
|
|
94 (void *) XPNTR (obj));
|
|
0
|
95 write_c_string (buf, printcharfun);
|
|
|
96 }
|
|
|
97
|
|
|
98 static unsigned int
|
|
|
99 sizeof_opaque (CONST void *header)
|
|
|
100 {
|
|
|
101 CONST struct Lisp_Opaque *p = (CONST struct Lisp_Opaque *) header;
|
|
|
102 if (!INTP (p->size_or_chain))
|
|
|
103 return sizeof (*p);
|
|
|
104 return sizeof (*p) + XINT (p->size_or_chain) - sizeof (int);
|
|
|
105 }
|
|
|
106
|
|
|
107 Lisp_Object
|
|
|
108 make_opaque (int size, CONST void *data)
|
|
|
109 {
|
|
185
|
110 struct Lisp_Opaque *p = (struct Lisp_Opaque *)
|
|
|
111 alloc_lcrecord (sizeof (*p) + size - sizeof (int), lrecord_opaque);
|
|
0
|
112 Lisp_Object val;
|
|
|
113
|
|
|
114 p->markfun = 0;
|
|
|
115 p->size_or_chain = make_int (size);
|
|
|
116 if (data)
|
|
|
117 memcpy (p->data, data, size);
|
|
|
118 else
|
|
|
119 memset (p->data, 0, size);
|
|
|
120 XSETOPAQUE (val, p);
|
|
|
121 return val;
|
|
|
122 }
|
|
|
123
|
|
|
124 static Lisp_Object mark_opaque_list (Lisp_Object, void (*) (Lisp_Object));
|
|
|
125 DEFINE_LRECORD_IMPLEMENTATION ("opaque-list", opaque_list,
|
|
|
126 mark_opaque_list, internal_object_printer,
|
|
|
127 0, 0, 0, struct Lisp_Opaque_List);
|
|
|
128
|
|
|
129 static Lisp_Object
|
|
|
130 mark_opaque_list (Lisp_Object obj, void (*markobj) (Lisp_Object))
|
|
|
131 {
|
|
|
132 in_opaque_list_marking++;
|
|
|
133 (markobj) (XOPAQUE_LIST (obj)->free);
|
|
|
134 in_opaque_list_marking--;
|
|
|
135 return Qnil;
|
|
|
136 }
|
|
|
137
|
|
|
138 Lisp_Object
|
|
|
139 make_opaque_list (int size,
|
|
|
140 Lisp_Object (*markfun) (Lisp_Object obj,
|
|
|
141 void (*markobj) (Lisp_Object)))
|
|
|
142 {
|
|
|
143 Lisp_Object val = Qnil;
|
|
185
|
144 struct Lisp_Opaque_List *p =
|
|
|
145 alloc_lcrecord_type (struct Lisp_Opaque_List, lrecord_opaque_list);
|
|
0
|
146
|
|
|
147 p->markfun = markfun;
|
|
|
148 p->size = size;
|
|
|
149 p->free = Qnil;
|
|
|
150 XSETOPAQUE_LIST (val, p);
|
|
|
151 return val;
|
|
|
152 }
|
|
|
153
|
|
|
154 Lisp_Object
|
|
|
155 allocate_managed_opaque (Lisp_Object opaque_list, CONST void *data)
|
|
|
156 {
|
|
|
157 struct Lisp_Opaque_List *li = XOPAQUE_LIST (opaque_list);
|
|
|
158 Lisp_Object val;
|
|
|
159
|
|
|
160 if (!NILP (li->free))
|
|
|
161 {
|
|
|
162 val = li->free;
|
|
|
163 li->free = XOPAQUE (val)->size_or_chain;
|
|
|
164 #ifdef ERROR_CHECK_GC
|
|
|
165 assert (NILP (li->free) || OPAQUEP (li->free));
|
|
|
166 #endif
|
|
|
167 XOPAQUE (val)->size_or_chain = make_int (li->size);
|
|
|
168 if (data)
|
|
|
169 memcpy (XOPAQUE (val)->data, data, li->size);
|
|
|
170 else
|
|
|
171 memset (XOPAQUE (val)->data, 0, li->size);
|
|
|
172 }
|
|
|
173 else
|
|
|
174 val = make_opaque (li->size, data);
|
|
|
175 XOPAQUE (val)->markfun = li->markfun;
|
|
|
176 return val;
|
|
|
177 }
|
|
|
178
|
|
|
179 void
|
|
|
180 free_managed_opaque (Lisp_Object opaque_list, Lisp_Object opaque)
|
|
|
181 {
|
|
|
182 struct Lisp_Opaque_List *li = XOPAQUE_LIST (opaque_list);
|
|
|
183
|
|
|
184 #ifdef ERROR_CHECK_GC
|
|
|
185 assert (INTP (XOPAQUE (opaque)->size_or_chain));
|
|
|
186 #endif
|
|
|
187 XOPAQUE (opaque)->size_or_chain = li->free;
|
|
|
188 li->free = opaque;
|
|
|
189 }
|
|
|
190
|
|
|
191 /* stuff to handle opaque pointers */
|
|
|
192
|
|
|
193 Lisp_Object
|
|
|
194 make_opaque_ptr (CONST void *val)
|
|
|
195 {
|
|
|
196 return allocate_managed_opaque (Vopaque_ptr_free_list,
|
|
|
197 (CONST void *) &val);
|
|
|
198 }
|
|
|
199
|
|
|
200 /* Be wery wery careful with this. Same admonitions as with
|
|
|
201 free_cons() apply. */
|
|
|
202
|
|
|
203 void
|
|
|
204 free_opaque_ptr (Lisp_Object ptr)
|
|
|
205 {
|
|
|
206 free_managed_opaque (Vopaque_ptr_free_list, ptr);
|
|
|
207 }
|
|
|
208
|
|
|
209 Lisp_Object
|
|
|
210 make_opaque_long (long val)
|
|
|
211 {
|
|
|
212 return make_opaque (sizeof (val), (void *) &val);
|
|
|
213 }
|
|
|
214
|
|
|
215 void
|
|
|
216 init_opaque_once_early (void)
|
|
|
217 {
|
|
|
218 Vopaque_ptr_free_list = make_opaque_list (sizeof (void *), 0);
|
|
|
219 staticpro (&Vopaque_ptr_free_list);
|
|
|
220 }
|
