|
428
|
1 /* Markers: examining, setting and killing.
|
|
|
2 Copyright (C) 1985, 1992, 1993, 1994, 1995 Free Software Foundation, Inc.
|
|
|
3
|
|
|
4 This file is part of XEmacs.
|
|
|
5
|
|
|
6 XEmacs is free software; you can redistribute it and/or modify it
|
|
|
7 under the terms of the GNU General Public License as published by the
|
|
|
8 Free Software Foundation; either version 2, or (at your option) any
|
|
|
9 later version.
|
|
|
10
|
|
|
11 XEmacs is distributed in the hope that it will be useful, but WITHOUT
|
|
|
12 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
|
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
|
14 for more details.
|
|
|
15
|
|
|
16 You should have received a copy of the GNU General Public License
|
|
|
17 along with XEmacs; see the file COPYING. If not, write to
|
|
|
18 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
|
|
19 Boston, MA 02111-1307, USA. */
|
|
|
20
|
|
|
21 /* Synched up with: FSF 19.30. */
|
|
|
22
|
|
|
23 /* This file has been Mule-ized. */
|
|
|
24
|
|
|
25 /* Note that markers are currently kept in an unordered list.
|
|
|
26 This means that marker operations may be inefficient if
|
|
|
27 there are a bunch of markers in the buffer. This probably
|
|
|
28 won't have a significant impact on redisplay (which uses
|
|
|
29 markers), but if it does, it wouldn't be too hard to change
|
|
|
30 to an ordered gap array. (Just copy the code from extents.c.)
|
|
|
31 */
|
|
|
32
|
|
|
33 #include <config.h>
|
|
|
34 #include "lisp.h"
|
|
|
35
|
|
|
36 #include "buffer.h"
|
|
|
37
|
|
|
38 static Lisp_Object
|
|
|
39 mark_marker (Lisp_Object obj)
|
|
|
40 {
|
|
440
|
41 Lisp_Marker *marker = XMARKER (obj);
|
|
428
|
42 Lisp_Object buf;
|
|
|
43 /* DO NOT mark through the marker's chain.
|
|
|
44 The buffer's markers chain does not preserve markers from gc;
|
|
|
45 Instead, markers are removed from the chain when they are freed
|
|
|
46 by gc.
|
|
|
47 */
|
|
|
48 if (!marker->buffer)
|
|
|
49 return (Qnil);
|
|
|
50
|
|
793
|
51 buf = wrap_buffer (marker->buffer);
|
|
428
|
52 return (buf);
|
|
|
53 }
|
|
|
54
|
|
|
55 static void
|
|
|
56 print_marker (Lisp_Object obj, Lisp_Object printcharfun, int escapeflag)
|
|
|
57 {
|
|
440
|
58 Lisp_Marker *marker = XMARKER (obj);
|
|
428
|
59 char buf[200];
|
|
|
60
|
|
|
61 if (print_readably)
|
|
563
|
62 printing_unreadable_object ("#<marker 0x%lx>", (long) marker);
|
|
428
|
63
|
|
|
64 write_c_string (GETTEXT ("#<marker "), printcharfun);
|
|
|
65 if (!marker->buffer)
|
|
|
66 write_c_string (GETTEXT ("in no buffer"), printcharfun);
|
|
|
67 else
|
|
|
68 {
|
|
|
69 sprintf (buf, "at %ld in ", (long) marker_position (obj));
|
|
|
70 write_c_string (buf, printcharfun);
|
|
|
71 print_internal (marker->buffer->name, printcharfun, 0);
|
|
|
72 }
|
|
|
73 sprintf (buf, " 0x%lx>", (long) marker);
|
|
|
74 write_c_string (buf, printcharfun);
|
|
|
75 }
|
|
|
76
|
|
|
77 static int
|
|
|
78 marker_equal (Lisp_Object obj1, Lisp_Object obj2, int depth)
|
|
|
79 {
|
|
440
|
80 Lisp_Marker *marker1 = XMARKER (obj1);
|
|
|
81 Lisp_Marker *marker2 = XMARKER (obj2);
|
|
428
|
82
|
|
|
83 return ((marker1->buffer == marker2->buffer) &&
|
|
665
|
84 (marker1->membpos == marker2->membpos ||
|
|
428
|
85 /* All markers pointing nowhere are equal */
|
|
|
86 !marker1->buffer));
|
|
|
87 }
|
|
|
88
|
|
|
89 static unsigned long
|
|
|
90 marker_hash (Lisp_Object obj, int depth)
|
|
|
91 {
|
|
|
92 unsigned long hash = (unsigned long) XMARKER (obj)->buffer;
|
|
|
93 if (hash)
|
|
665
|
94 hash = HASH2 (hash, XMARKER (obj)->membpos);
|
|
428
|
95 return hash;
|
|
|
96 }
|
|
|
97
|
|
|
98 static const struct lrecord_description marker_description[] = {
|
|
440
|
99 { XD_LISP_OBJECT, offsetof (Lisp_Marker, next) },
|
|
|
100 { XD_LISP_OBJECT, offsetof (Lisp_Marker, prev) },
|
|
|
101 { XD_LISP_OBJECT, offsetof (Lisp_Marker, buffer) },
|
|
428
|
102 { XD_END }
|
|
|
103 };
|
|
|
104
|
|
|
105 DEFINE_BASIC_LRECORD_IMPLEMENTATION ("marker", marker,
|
|
|
106 mark_marker, print_marker, 0,
|
|
|
107 marker_equal, marker_hash, marker_description,
|
|
440
|
108 Lisp_Marker);
|
|
428
|
109
|
|
|
110 /* Operations on markers. */
|
|
|
111
|
|
|
112 DEFUN ("marker-buffer", Fmarker_buffer, 1, 1, 0, /*
|
|
|
113 Return the buffer that MARKER points into, or nil if none.
|
|
|
114 Return nil if MARKER points into a dead buffer or doesn't point anywhere.
|
|
|
115 */
|
|
|
116 (marker))
|
|
|
117 {
|
|
|
118 struct buffer *buf;
|
|
|
119 CHECK_MARKER (marker);
|
|
|
120 /* Return marker's buffer only if it is not dead. */
|
|
|
121 if ((buf = XMARKER (marker)->buffer) && BUFFER_LIVE_P (buf))
|
|
|
122 {
|
|
793
|
123 return wrap_buffer (buf);
|
|
428
|
124 }
|
|
|
125 return Qnil;
|
|
|
126 }
|
|
|
127
|
|
|
128 DEFUN ("marker-position", Fmarker_position, 1, 1, 0, /*
|
|
|
129 Return the position MARKER points at, as a character number.
|
|
|
130 Return `nil' if marker doesn't point anywhere.
|
|
|
131 */
|
|
|
132 (marker))
|
|
|
133 {
|
|
|
134 CHECK_MARKER (marker);
|
|
|
135 return XMARKER (marker)->buffer ? make_int (marker_position (marker)) : Qnil;
|
|
|
136 }
|
|
|
137
|
|
|
138 #if 0 /* useful debugging function */
|
|
|
139
|
|
|
140 static void
|
|
|
141 check_marker_circularities (struct buffer *buf)
|
|
|
142 {
|
|
440
|
143 Lisp_Marker *tortoise, *hare;
|
|
428
|
144
|
|
|
145 tortoise = BUF_MARKERS (buf);
|
|
|
146 hare = tortoise;
|
|
|
147
|
|
|
148 if (!tortoise)
|
|
|
149 return;
|
|
|
150
|
|
|
151 while (1)
|
|
|
152 {
|
|
|
153 assert (hare->buffer == buf);
|
|
|
154 hare = hare->next;
|
|
|
155 if (!hare)
|
|
|
156 return;
|
|
|
157 assert (hare->buffer == buf);
|
|
|
158 hare = hare->next;
|
|
|
159 if (!hare)
|
|
|
160 return;
|
|
|
161 tortoise = tortoise->next;
|
|
|
162 assert (tortoise != hare);
|
|
|
163 }
|
|
|
164 }
|
|
|
165
|
|
|
166 #endif
|
|
|
167
|
|
|
168 static Lisp_Object
|
|
444
|
169 set_marker_internal (Lisp_Object marker, Lisp_Object position,
|
|
|
170 Lisp_Object buffer, int restricted_p)
|
|
428
|
171 {
|
|
665
|
172 Charbpos charno;
|
|
428
|
173 struct buffer *b;
|
|
440
|
174 Lisp_Marker *m;
|
|
428
|
175 int point_p;
|
|
|
176
|
|
|
177 CHECK_MARKER (marker);
|
|
|
178
|
|
|
179 point_p = POINT_MARKER_P (marker);
|
|
|
180
|
|
|
181 /* If position is nil or a marker that points nowhere,
|
|
|
182 make this marker point nowhere. */
|
|
444
|
183 if (NILP (position) ||
|
|
|
184 (MARKERP (position) && !XMARKER (position)->buffer))
|
|
428
|
185 {
|
|
|
186 if (point_p)
|
|
563
|
187 invalid_operation ("Can't make point-marker point nowhere",
|
|
|
188 marker);
|
|
428
|
189 if (XMARKER (marker)->buffer)
|
|
|
190 unchain_marker (marker);
|
|
|
191 return marker;
|
|
|
192 }
|
|
|
193
|
|
444
|
194 CHECK_INT_COERCE_MARKER (position);
|
|
428
|
195 if (NILP (buffer))
|
|
|
196 b = current_buffer;
|
|
|
197 else
|
|
|
198 {
|
|
|
199 CHECK_BUFFER (buffer);
|
|
|
200 b = XBUFFER (buffer);
|
|
|
201 /* If buffer is dead, set marker to point nowhere. */
|
|
|
202 if (!BUFFER_LIVE_P (XBUFFER (buffer)))
|
|
|
203 {
|
|
|
204 if (point_p)
|
|
563
|
205 invalid_operation
|
|
428
|
206 ("Can't move point-marker in a killed buffer", marker);
|
|
|
207 if (XMARKER (marker)->buffer)
|
|
|
208 unchain_marker (marker);
|
|
|
209 return marker;
|
|
|
210 }
|
|
|
211 }
|
|
|
212
|
|
444
|
213 charno = XINT (position);
|
|
428
|
214 m = XMARKER (marker);
|
|
|
215
|
|
|
216 if (restricted_p)
|
|
|
217 {
|
|
|
218 if (charno < BUF_BEGV (b)) charno = BUF_BEGV (b);
|
|
|
219 if (charno > BUF_ZV (b)) charno = BUF_ZV (b);
|
|
|
220 }
|
|
|
221 else
|
|
|
222 {
|
|
|
223 if (charno < BUF_BEG (b)) charno = BUF_BEG (b);
|
|
|
224 if (charno > BUF_Z (b)) charno = BUF_Z (b);
|
|
|
225 }
|
|
|
226
|
|
|
227 if (point_p)
|
|
|
228 {
|
|
|
229 #ifndef moving_point_by_moving_its_marker_is_a_bug
|
|
|
230 BUF_SET_PT (b, charno); /* this will move the marker */
|
|
|
231 #else /* It's not a feature, so it must be a bug */
|
|
563
|
232 invalid_operation ("DEBUG: attempt to move point via point-marker",
|
|
|
233 marker);
|
|
428
|
234 #endif
|
|
|
235 }
|
|
|
236 else
|
|
|
237 {
|
|
665
|
238 m->membpos = charbpos_to_membpos (b, charno);
|
|
428
|
239 }
|
|
|
240
|
|
|
241 if (m->buffer != b)
|
|
|
242 {
|
|
|
243 if (point_p)
|
|
563
|
244 invalid_operation ("Can't change buffer of point-marker", marker);
|
|
428
|
245 if (m->buffer != 0)
|
|
|
246 unchain_marker (marker);
|
|
|
247 m->buffer = b;
|
|
|
248 marker_next (m) = BUF_MARKERS (b);
|
|
|
249 marker_prev (m) = 0;
|
|
|
250 if (BUF_MARKERS (b))
|
|
|
251 marker_prev (BUF_MARKERS (b)) = m;
|
|
|
252 BUF_MARKERS (b) = m;
|
|
|
253 }
|
|
|
254
|
|
|
255 return marker;
|
|
|
256 }
|
|
|
257
|
|
|
258
|
|
|
259 DEFUN ("set-marker", Fset_marker, 2, 3, 0, /*
|
|
444
|
260 Move MARKER to position POSITION in BUFFER.
|
|
|
261 POSITION can be a marker, an integer or nil. If POSITION is an
|
|
|
262 integer, make MARKER point before the POSITIONth character in BUFFER.
|
|
|
263 If POSITION is nil, makes MARKER point nowhere. Then it no longer
|
|
|
264 slows down editing in any buffer. If POSITION is less than 1, move
|
|
|
265 MARKER to the beginning of BUFFER. If POSITION is greater than the
|
|
|
266 size of BUFFER, move MARKER to the end of BUFFER.
|
|
428
|
267 BUFFER defaults to the current buffer.
|
|
444
|
268 If this marker was returned by (point-marker t), then changing its
|
|
|
269 position moves point. You cannot change its buffer or make it point
|
|
|
270 nowhere.
|
|
|
271 The return value is MARKER.
|
|
428
|
272 */
|
|
444
|
273 (marker, position, buffer))
|
|
428
|
274 {
|
|
444
|
275 return set_marker_internal (marker, position, buffer, 0);
|
|
428
|
276 }
|
|
|
277
|
|
|
278
|
|
|
279 /* This version of Fset_marker won't let the position
|
|
|
280 be outside the visible part. */
|
|
|
281 Lisp_Object
|
|
444
|
282 set_marker_restricted (Lisp_Object marker, Lisp_Object position,
|
|
|
283 Lisp_Object buffer)
|
|
428
|
284 {
|
|
444
|
285 return set_marker_internal (marker, position, buffer, 1);
|
|
428
|
286 }
|
|
|
287
|
|
|
288
|
|
|
289 /* This is called during garbage collection,
|
|
|
290 so we must be careful to ignore and preserve mark bits,
|
|
|
291 including those in chain fields of markers. */
|
|
|
292
|
|
|
293 void
|
|
|
294 unchain_marker (Lisp_Object m)
|
|
|
295 {
|
|
440
|
296 Lisp_Marker *marker = XMARKER (m);
|
|
428
|
297 struct buffer *b = marker->buffer;
|
|
|
298
|
|
|
299 if (b == 0)
|
|
|
300 return;
|
|
|
301
|
|
|
302 #ifdef ERROR_CHECK_GC
|
|
|
303 assert (BUFFER_LIVE_P (b));
|
|
|
304 #endif
|
|
|
305
|
|
|
306 if (marker_next (marker))
|
|
|
307 marker_prev (marker_next (marker)) = marker_prev (marker);
|
|
|
308 if (marker_prev (marker))
|
|
|
309 marker_next (marker_prev (marker)) = marker_next (marker);
|
|
|
310 else
|
|
|
311 BUF_MARKERS (b) = marker_next (marker);
|
|
|
312
|
|
|
313 #ifdef ERROR_CHECK_GC
|
|
|
314 assert (marker != XMARKER (b->point_marker));
|
|
|
315 #endif
|
|
|
316
|
|
|
317 marker->buffer = 0;
|
|
|
318 }
|
|
|
319
|
|
665
|
320 Bytebpos
|
|
428
|
321 bi_marker_position (Lisp_Object marker)
|
|
|
322 {
|
|
440
|
323 Lisp_Marker *m = XMARKER (marker);
|
|
428
|
324 struct buffer *buf = m->buffer;
|
|
665
|
325 Bytebpos pos;
|
|
428
|
326
|
|
|
327 if (!buf)
|
|
563
|
328 invalid_argument ("Marker does not point anywhere", Qunbound);
|
|
428
|
329
|
|
|
330 /* FSF claims that marker indices could end up denormalized, i.e.
|
|
|
331 in the gap. This is way bogus if it ever happens, and means
|
|
|
332 something fucked up elsewhere. Since I've overhauled all this
|
|
|
333 shit, I don't think this can happen. In any case, the following
|
|
|
334 macro has an assert() in it that will catch these denormalized
|
|
|
335 positions. */
|
|
665
|
336 pos = membpos_to_bytebpos (buf, m->membpos);
|
|
428
|
337
|
|
665
|
338 #ifdef ERROR_CHECK_CHARBPOS
|
|
428
|
339 if (pos < BI_BUF_BEG (buf) || pos > BI_BUF_Z (buf))
|
|
|
340 abort ();
|
|
|
341 #endif
|
|
|
342
|
|
|
343 return pos;
|
|
|
344 }
|
|
|
345
|
|
665
|
346 Charbpos
|
|
428
|
347 marker_position (Lisp_Object marker)
|
|
|
348 {
|
|
|
349 struct buffer *buf = XMARKER (marker)->buffer;
|
|
|
350
|
|
|
351 if (!buf)
|
|
563
|
352 invalid_argument ("Marker does not point anywhere", Qunbound);
|
|
428
|
353
|
|
665
|
354 return bytebpos_to_charbpos (buf, bi_marker_position (marker));
|
|
428
|
355 }
|
|
|
356
|
|
|
357 void
|
|
665
|
358 set_bi_marker_position (Lisp_Object marker, Bytebpos pos)
|
|
428
|
359 {
|
|
440
|
360 Lisp_Marker *m = XMARKER (marker);
|
|
428
|
361 struct buffer *buf = m->buffer;
|
|
|
362
|
|
|
363 if (!buf)
|
|
563
|
364 invalid_argument ("Marker does not point anywhere", Qunbound);
|
|
428
|
365
|
|
665
|
366 #ifdef ERROR_CHECK_CHARBPOS
|
|
428
|
367 if (pos < BI_BUF_BEG (buf) || pos > BI_BUF_Z (buf))
|
|
|
368 abort ();
|
|
|
369 #endif
|
|
|
370
|
|
665
|
371 m->membpos = bytebpos_to_membpos (buf, pos);
|
|
428
|
372 }
|
|
|
373
|
|
|
374 void
|
|
665
|
375 set_marker_position (Lisp_Object marker, Charbpos pos)
|
|
428
|
376 {
|
|
|
377 struct buffer *buf = XMARKER (marker)->buffer;
|
|
|
378
|
|
|
379 if (!buf)
|
|
563
|
380 invalid_argument ("Marker does not point anywhere", Qunbound);
|
|
428
|
381
|
|
665
|
382 set_bi_marker_position (marker, charbpos_to_bytebpos (buf, pos));
|
|
428
|
383 }
|
|
|
384
|
|
|
385 static Lisp_Object
|
|
|
386 copy_marker_1 (Lisp_Object marker, Lisp_Object type, int noseeum)
|
|
|
387 {
|
|
|
388 REGISTER Lisp_Object new;
|
|
|
389
|
|
|
390 while (1)
|
|
|
391 {
|
|
|
392 if (INTP (marker) || MARKERP (marker))
|
|
|
393 {
|
|
|
394 if (noseeum)
|
|
|
395 new = noseeum_make_marker ();
|
|
|
396 else
|
|
|
397 new = Fmake_marker ();
|
|
|
398 Fset_marker (new, marker,
|
|
|
399 (MARKERP (marker) ? Fmarker_buffer (marker) : Qnil));
|
|
|
400 XMARKER (new)->insertion_type = !NILP (type);
|
|
|
401 return new;
|
|
|
402 }
|
|
|
403 else
|
|
|
404 marker = wrong_type_argument (Qinteger_or_marker_p, marker);
|
|
|
405 }
|
|
|
406
|
|
|
407 RETURN_NOT_REACHED (Qnil) /* not reached */
|
|
|
408 }
|
|
|
409
|
|
|
410 DEFUN ("copy-marker", Fcopy_marker, 1, 2, 0, /*
|
|
444
|
411 Return a new marker pointing at the same place as MARKER-OR-INTEGER.
|
|
|
412 If MARKER-OR-INTEGER is an integer, return a new marker pointing
|
|
428
|
413 at that position in the current buffer.
|
|
444
|
414 Optional argument MARKER-TYPE specifies the insertion type of the new
|
|
|
415 marker; see `marker-insertion-type'.
|
|
428
|
416 */
|
|
444
|
417 (marker_or_integer, marker_type))
|
|
428
|
418 {
|
|
444
|
419 return copy_marker_1 (marker_or_integer, marker_type, 0);
|
|
428
|
420 }
|
|
|
421
|
|
|
422 Lisp_Object
|
|
444
|
423 noseeum_copy_marker (Lisp_Object marker, Lisp_Object marker_type)
|
|
428
|
424 {
|
|
444
|
425 return copy_marker_1 (marker, marker_type, 1);
|
|
428
|
426 }
|
|
|
427
|
|
|
428 DEFUN ("marker-insertion-type", Fmarker_insertion_type, 1, 1, 0, /*
|
|
|
429 Return insertion type of MARKER: t if it stays after inserted text.
|
|
|
430 nil means the marker stays before text inserted there.
|
|
|
431 */
|
|
|
432 (marker))
|
|
|
433 {
|
|
|
434 CHECK_MARKER (marker);
|
|
|
435 return XMARKER (marker)->insertion_type ? Qt : Qnil;
|
|
|
436 }
|
|
|
437
|
|
|
438 DEFUN ("set-marker-insertion-type", Fset_marker_insertion_type, 2, 2, 0, /*
|
|
|
439 Set the insertion-type of MARKER to TYPE.
|
|
|
440 If TYPE is t, it means the marker advances when you insert text at it.
|
|
|
441 If TYPE is nil, it means the marker stays behind when you insert text at it.
|
|
|
442 */
|
|
|
443 (marker, type))
|
|
|
444 {
|
|
|
445 CHECK_MARKER (marker);
|
|
|
446
|
|
|
447 XMARKER (marker)->insertion_type = ! NILP (type);
|
|
|
448 return type;
|
|
|
449 }
|
|
|
450
|
|
|
451 /* #### What is the possible use of this? It looks quite useless to
|
|
|
452 me, because there is no way to find *which* markers are positioned
|
|
|
453 at POSITION. Additional bogosity bonus: (buffer-has-markers-at
|
|
|
454 (point)) will always return t because of the `point-marker'. The
|
|
|
455 same goes for the position of mark. Bletch!
|
|
|
456
|
|
|
457 Someone should discuss this with Stallman, but I don't have the
|
|
|
458 stomach. In fact, this function sucks so badly that I'm disabling
|
|
|
459 it by default (although I've debugged it). If you want to use it,
|
|
|
460 use extents instead. --hniksic */
|
|
|
461 #if 0
|
|
|
462 xxDEFUN ("buffer-has-markers-at", Fbuffer_has_markers_at, 1, 1, 0, /*
|
|
|
463 Return t if there are markers pointing at POSITION in the current buffer.
|
|
|
464 */
|
|
|
465 (position))
|
|
|
466 {
|
|
440
|
467 Lisp_Marker *marker;
|
|
665
|
468 Membpos pos;
|
|
428
|
469
|
|
665
|
470 /* A small optimization trick: convert POS to membpos now, rather
|
|
|
471 than converting every marker's memory index to charbpos. */
|
|
|
472 pos = bytebpos_to_membpos (current_buffer,
|
|
428
|
473 get_buffer_pos_byte (current_buffer, position,
|
|
|
474 GB_COERCE_RANGE));
|
|
|
475
|
|
|
476 for (marker = BUF_MARKERS (current_buffer);
|
|
|
477 marker;
|
|
|
478 marker = marker_next (marker))
|
|
|
479 {
|
|
665
|
480 /* We use marker->membpos, so we don't have to go through the
|
|
428
|
481 unwieldy operation of creating a Lisp_Object for
|
|
|
482 marker_position() every time around. */
|
|
665
|
483 if (marker->membpos == pos)
|
|
428
|
484 return Qt;
|
|
|
485 }
|
|
|
486
|
|
|
487 return Qnil;
|
|
|
488 }
|
|
|
489 #endif /* 0 */
|
|
|
490
|
|
|
491 #ifdef MEMORY_USAGE_STATS
|
|
|
492
|
|
|
493 int
|
|
|
494 compute_buffer_marker_usage (struct buffer *b, struct overhead_stats *ovstats)
|
|
|
495 {
|
|
440
|
496 Lisp_Marker *m;
|
|
428
|
497 int total = 0;
|
|
|
498 int overhead;
|
|
|
499
|
|
|
500 for (m = BUF_MARKERS (b); m; m = m->next)
|
|
440
|
501 total += sizeof (Lisp_Marker);
|
|
428
|
502 ovstats->was_requested += total;
|
|
|
503 overhead = fixed_type_block_overhead (total);
|
|
|
504 /* #### claiming this is all malloc overhead is not really right,
|
|
|
505 but it has to go somewhere. */
|
|
|
506 ovstats->malloc_overhead += overhead;
|
|
|
507 return total + overhead;
|
|
|
508 }
|
|
|
509
|
|
|
510 #endif /* MEMORY_USAGE_STATS */
|
|
|
511
|
|
|
512
|
|
|
513 void
|
|
|
514 syms_of_marker (void)
|
|
|
515 {
|
|
442
|
516 INIT_LRECORD_IMPLEMENTATION (marker);
|
|
|
517
|
|
428
|
518 DEFSUBR (Fmarker_position);
|
|
|
519 DEFSUBR (Fmarker_buffer);
|
|
|
520 DEFSUBR (Fset_marker);
|
|
|
521 DEFSUBR (Fcopy_marker);
|
|
|
522 DEFSUBR (Fmarker_insertion_type);
|
|
|
523 DEFSUBR (Fset_marker_insertion_type);
|
|
|
524 #if 0 /* FSFmacs crock */
|
|
|
525 DEFSUBR (Fbuffer_has_markers_at);
|
|
|
526 #endif
|
|
|
527 }
|
|
|
528
|
|
|
529 void
|
|
|
530 init_buffer_markers (struct buffer *b)
|
|
|
531 {
|
|
793
|
532 Lisp_Object buf = wrap_buffer (b);
|
|
428
|
533
|
|
|
534 b->mark = Fmake_marker ();
|
|
|
535 BUF_MARKERS (b) = 0;
|
|
|
536 b->point_marker = Fmake_marker ();
|
|
|
537 Fset_marker (b->point_marker,
|
|
|
538 /* For indirect buffers, point is already set. */
|
|
|
539 b->base_buffer ? make_int (BUF_PT (b)) : make_int (1),
|
|
|
540 buf);
|
|
|
541 }
|
|
|
542
|
|
|
543 void
|
|
|
544 uninit_buffer_markers (struct buffer *b)
|
|
|
545 {
|
|
|
546 /* Unchain all markers of this buffer
|
|
|
547 and leave them pointing nowhere. */
|
|
440
|
548 REGISTER Lisp_Marker *m, *next;
|
|
428
|
549 for (m = BUF_MARKERS (b); m; m = next)
|
|
|
550 {
|
|
|
551 m->buffer = 0;
|
|
|
552 next = marker_next (m);
|
|
|
553 marker_next (m) = 0;
|
|
|
554 marker_prev (m) = 0;
|
|
|
555 }
|
|
|
556 BUF_MARKERS (b) = 0;
|
|
|
557 }
|
