428
|
1 /* Copyright (c) 1994, 1995 Free Software Foundation, Inc.
|
|
2 Copyright (c) 1995 Sun Microsystems, Inc.
|
2506
|
3 Copyright (c) 1995, 1996, 2000, 2002, 2003, 2004, 2005 Ben Wing.
|
428
|
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 /* This file has been Mule-ized. */
|
|
25
|
|
26 /* Written by Ben Wing <ben@xemacs.org>.
|
|
27
|
|
28 [Originally written by some people at Lucid.
|
|
29 Hacked on by jwz.
|
|
30 Start/end-open stuff added by John Rose (john.rose@eng.sun.com).
|
|
31 Rewritten from scratch by Ben Wing, December 1994.] */
|
|
32
|
|
33 /* Commentary:
|
|
34
|
|
35 Extents are regions over a buffer, with a start and an end position
|
|
36 denoting the region of the buffer included in the extent. In
|
|
37 addition, either end can be closed or open, meaning that the endpoint
|
|
38 is or is not logically included in the extent. Insertion of a character
|
|
39 at a closed endpoint causes the character to go inside the extent;
|
|
40 insertion at an open endpoint causes the character to go outside.
|
|
41
|
|
42 Extent endpoints are stored using memory indices (see insdel.c),
|
|
43 to minimize the amount of adjusting that needs to be done when
|
|
44 characters are inserted or deleted.
|
|
45
|
|
46 (Formerly, extent endpoints at the gap could be either before or
|
|
47 after the gap, depending on the open/closedness of the endpoint.
|
|
48 The intent of this was to make it so that insertions would
|
|
49 automatically go inside or out of extents as necessary with no
|
|
50 further work needing to be done. It didn't work out that way,
|
|
51 however, and just ended up complexifying and buggifying all the
|
|
52 rest of the code.)
|
|
53
|
|
54 Extents are compared using memory indices. There are two orderings
|
|
55 for extents and both orders are kept current at all times. The normal
|
|
56 or "display" order is as follows:
|
|
57
|
|
58 Extent A is "less than" extent B, that is, earlier in the display order,
|
|
59 if: A-start < B-start,
|
|
60 or if: A-start = B-start, and A-end > B-end
|
|
61
|
|
62 So if two extents begin at the same position, the larger of them is the
|
|
63 earlier one in the display order (EXTENT_LESS is true).
|
|
64
|
|
65 For the e-order, the same thing holds: Extent A is "less than" extent B
|
|
66 in e-order, that is, later in the buffer,
|
|
67 if: A-end < B-end,
|
|
68 or if: A-end = B-end, and A-start > B-start
|
|
69
|
|
70 So if two extents end at the same position, the smaller of them is the
|
|
71 earlier one in the e-order (EXTENT_E_LESS is true).
|
|
72
|
|
73 The display order and the e-order are complementary orders: any
|
|
74 theorem about the display order also applies to the e-order if you
|
|
75 swap all occurrences of "display order" and "e-order", "less than"
|
|
76 and "greater than", and "extent start" and "extent end".
|
|
77
|
|
78 Extents can be zero-length, and will end up that way if their endpoints
|
|
79 are explicitly set that way or if their detachable property is nil
|
|
80 and all the text in the extent is deleted. (The exception is open-open
|
|
81 zero-length extents, which are barred from existing because there is
|
|
82 no sensible way to define their properties. Deletion of the text in
|
|
83 an open-open extent causes it to be converted into a closed-open
|
|
84 extent.) Zero-length extents are primarily used to represent
|
|
85 annotations, and behave as follows:
|
|
86
|
|
87 1) Insertion at the position of a zero-length extent expands the extent
|
|
88 if both endpoints are closed; goes after the extent if it is closed-open;
|
|
89 and goes before the extent if it is open-closed.
|
|
90
|
|
91 2) Deletion of a character on a side of a zero-length extent whose
|
|
92 corresponding endpoint is closed causes the extent to be detached if
|
|
93 it is detachable; if the extent is not detachable or the corresponding
|
|
94 endpoint is open, the extent remains in the buffer, moving as necessary.
|
|
95
|
|
96 Note that closed-open, non-detachable zero-length extents behave exactly
|
|
97 like markers and that open-closed, non-detachable zero-length extents
|
|
98 behave like the "point-type" marker in Mule.
|
|
99
|
|
100
|
|
101 #### The following information is wrong in places.
|
|
102
|
|
103 More about the different orders:
|
|
104 --------------------------------
|
|
105
|
|
106 The extents in a buffer are ordered by "display order" because that
|
|
107 is that order that the redisplay mechanism needs to process them in.
|
|
108 The e-order is an auxiliary ordering used to facilitate operations
|
|
109 over extents. The operations that can be performed on the ordered
|
|
110 list of extents in a buffer are
|
|
111
|
|
112 1) Locate where an extent would go if inserted into the list.
|
|
113 2) Insert an extent into the list.
|
|
114 3) Remove an extent from the list.
|
|
115 4) Map over all the extents that overlap a range.
|
|
116
|
|
117 (4) requires being able to determine the first and last extents
|
|
118 that overlap a range.
|
|
119
|
|
120 NOTE: "overlap" is used as follows:
|
|
121
|
|
122 -- two ranges overlap if they have at least one point in common.
|
|
123 Whether the endpoints are open or closed makes a difference here.
|
|
124 -- a point overlaps a range if the point is contained within the
|
|
125 range; this is equivalent to treating a point P as the range
|
|
126 [P, P].
|
|
127 -- In the case of an *extent* overlapping a point or range, the
|
|
128 extent is normally treated as having closed endpoints. This
|
|
129 applies consistently in the discussion of stacks of extents
|
|
130 and such below. Note that this definition of overlap is not
|
|
131 necessarily consistent with the extents that `map-extents'
|
|
132 maps over, since `map-extents' sometimes pays attention to
|
|
133 whether the endpoints of an extents are open or closed.
|
|
134 But for our purposes, it greatly simplifies things to treat
|
|
135 all extents as having closed endpoints.
|
|
136
|
|
137 First, define >, <, <=, etc. as applied to extents to mean
|
|
138 comparison according to the display order. Comparison between an
|
|
139 extent E and an index I means comparison between E and the range
|
|
140 [I, I].
|
|
141 Also define e>, e<, e<=, etc. to mean comparison according to the
|
|
142 e-order.
|
|
143 For any range R, define R(0) to be the starting index of the range
|
|
144 and R(1) to be the ending index of the range.
|
|
145 For any extent E, define E(next) to be the extent directly following
|
|
146 E, and E(prev) to be the extent directly preceding E. Assume
|
|
147 E(next) and E(prev) can be determined from E in constant time.
|
|
148 (This is because we store the extent list as a doubly linked
|
|
149 list.)
|
|
150 Similarly, define E(e-next) and E(e-prev) to be the extents
|
|
151 directly following and preceding E in the e-order.
|
|
152
|
|
153 Now:
|
|
154
|
|
155 Let R be a range.
|
|
156 Let F be the first extent overlapping R.
|
|
157 Let L be the last extent overlapping R.
|
|
158
|
|
159 Theorem 1: R(1) lies between L and L(next), i.e. L <= R(1) < L(next).
|
|
160
|
|
161 This follows easily from the definition of display order. The
|
|
162 basic reason that this theorem applies is that the display order
|
|
163 sorts by increasing starting index.
|
|
164
|
|
165 Therefore, we can determine L just by looking at where we would
|
|
166 insert R(1) into the list, and if we know F and are moving forward
|
|
167 over extents, we can easily determine when we've hit L by comparing
|
|
168 the extent we're at to R(1).
|
|
169
|
|
170 Theorem 2: F(e-prev) e< [1, R(0)] e<= F.
|
|
171
|
|
172 This is the analog of Theorem 1, and applies because the e-order
|
|
173 sorts by increasing ending index.
|
|
174
|
|
175 Therefore, F can be found in the same amount of time as operation (1),
|
|
176 i.e. the time that it takes to locate where an extent would go if
|
|
177 inserted into the e-order list.
|
|
178
|
|
179 If the lists were stored as balanced binary trees, then operation (1)
|
|
180 would take logarithmic time, which is usually quite fast. However,
|
|
181 currently they're stored as simple doubly-linked lists, and instead
|
|
182 we do some caching to try to speed things up.
|
|
183
|
|
184 Define a "stack of extents" (or "SOE") as the set of extents
|
|
185 (ordered in the display order) that overlap an index I, together with
|
|
186 the SOE's "previous" extent, which is an extent that precedes I in
|
|
187 the e-order. (Hopefully there will not be very many extents between
|
|
188 I and the previous extent.)
|
|
189
|
|
190 Now:
|
|
191
|
|
192 Let I be an index, let S be the stack of extents on I, let F be
|
|
193 the first extent in S, and let P be S's previous extent.
|
|
194
|
|
195 Theorem 3: The first extent in S is the first extent that overlaps
|
|
196 any range [I, J].
|
|
197
|
|
198 Proof: Any extent that overlaps [I, J] but does not include I must
|
|
199 have a start index > I, and thus be greater than any extent in S.
|
|
200
|
|
201 Therefore, finding the first extent that overlaps a range R is the
|
|
202 same as finding the first extent that overlaps R(0).
|
|
203
|
|
204 Theorem 4: Let I2 be an index such that I2 > I, and let F2 be the
|
|
205 first extent that overlaps I2. Then, either F2 is in S or F2 is
|
|
206 greater than any extent in S.
|
|
207
|
|
208 Proof: If F2 does not include I then its start index is greater
|
|
209 than I and thus it is greater than any extent in S, including F.
|
|
210 Otherwise, F2 includes I and thus is in S, and thus F2 >= F.
|
|
211
|
|
212 */
|
|
213
|
|
214 #include <config.h>
|
|
215 #include "lisp.h"
|
|
216
|
|
217 #include "buffer.h"
|
|
218 #include "debug.h"
|
|
219 #include "device.h"
|
|
220 #include "elhash.h"
|
872
|
221 #include "extents-impl.h"
|
428
|
222 #include "faces.h"
|
|
223 #include "frame.h"
|
|
224 #include "glyphs.h"
|
|
225 #include "insdel.h"
|
|
226 #include "keymap.h"
|
|
227 #include "opaque.h"
|
|
228 #include "process.h"
|
1292
|
229 #include "profile.h"
|
428
|
230 #include "redisplay.h"
|
442
|
231 #include "gutter.h"
|
428
|
232
|
|
233 /* ------------------------------- */
|
|
234 /* gap array */
|
|
235 /* ------------------------------- */
|
|
236
|
|
237 /* Note that this object is not extent-specific and should perhaps be
|
|
238 moved into another file. */
|
|
239
|
|
240 /* Holds a marker that moves as elements in the array are inserted and
|
|
241 deleted, similar to standard markers. */
|
|
242
|
|
243 typedef struct gap_array_marker
|
|
244 {
|
3092
|
245 #ifdef NEW_GC
|
|
246 struct lrecord_header header;
|
|
247 #endif /* NEW_GC */
|
428
|
248 int pos;
|
|
249 struct gap_array_marker *next;
|
|
250 } Gap_Array_Marker;
|
|
251
|
1204
|
252
|
428
|
253 /* Holds a "gap array", which is an array of elements with a gap located
|
|
254 in it. Insertions and deletions with a high degree of locality
|
|
255 are very fast, essentially in constant time. Array positions as
|
|
256 used and returned in the gap array functions are independent of
|
|
257 the gap. */
|
|
258
|
1204
|
259 /* Layout of gap array:
|
|
260
|
|
261 <------ gap ------><---- gapsize ----><----- numels - gap ---->
|
|
262 <---------------------- numels + gapsize --------------------->
|
|
263
|
|
264 For marking purposes, we use two extra variables computed from
|
|
265 the others -- the offset to the data past the gap, plus the number
|
|
266 of elements in that data:
|
|
267
|
|
268 offset_past_gap = elsize * (gap + gapsize)
|
|
269 els_past_gap = numels - gap
|
|
270 */
|
|
271
|
|
272
|
428
|
273 typedef struct gap_array
|
|
274 {
|
3092
|
275 #ifdef NEW_GC
|
|
276 struct lrecord_header header;
|
|
277 #endif /* NEW_GC */
|
1204
|
278 Elemcount gap;
|
|
279 Elemcount gapsize;
|
|
280 Elemcount numels;
|
|
281 Bytecount elsize;
|
|
282 /* Redundant numbers computed from the others, for marking purposes */
|
|
283 Bytecount offset_past_gap;
|
|
284 Elemcount els_past_gap;
|
428
|
285 Gap_Array_Marker *markers;
|
1204
|
286 /* this is a stretchy array */
|
|
287 char array[1];
|
428
|
288 } Gap_Array;
|
|
289
|
3092
|
290 #ifndef NEW_GC
|
428
|
291 static Gap_Array_Marker *gap_array_marker_freelist;
|
3092
|
292 #endif /* not NEW_GC */
|
428
|
293
|
|
294 /* Convert a "memory position" (i.e. taking the gap into account) into
|
|
295 the address of the element at (i.e. after) that position. "Memory
|
826
|
296 positions" are only used internally and are of type Memxpos.
|
428
|
297 "Array positions" are used externally and are of type int. */
|
|
298 #define GAP_ARRAY_MEMEL_ADDR(ga, memel) ((ga)->array + (ga)->elsize*(memel))
|
|
299
|
|
300 /* Number of elements currently in a gap array */
|
|
301 #define GAP_ARRAY_NUM_ELS(ga) ((ga)->numels)
|
|
302
|
|
303 #define GAP_ARRAY_ARRAY_TO_MEMORY_POS(ga, pos) \
|
|
304 ((pos) <= (ga)->gap ? (pos) : (pos) + (ga)->gapsize)
|
|
305
|
|
306 #define GAP_ARRAY_MEMORY_TO_ARRAY_POS(ga, pos) \
|
|
307 ((pos) <= (ga)->gap ? (pos) : (pos) - (ga)->gapsize)
|
|
308
|
|
309 /* Convert an array position into the address of the element at
|
|
310 (i.e. after) that position. */
|
|
311 #define GAP_ARRAY_EL_ADDR(ga, pos) ((pos) < (ga)->gap ? \
|
|
312 GAP_ARRAY_MEMEL_ADDR(ga, pos) : \
|
|
313 GAP_ARRAY_MEMEL_ADDR(ga, (pos) + (ga)->gapsize))
|
|
314
|
|
315 /* ------------------------------- */
|
|
316 /* extent list */
|
|
317 /* ------------------------------- */
|
|
318
|
|
319 typedef struct extent_list_marker
|
|
320 {
|
3092
|
321 #ifdef NEW_GC
|
|
322 struct lrecord_header header;
|
|
323 #endif /* NEW_GC */
|
428
|
324 Gap_Array_Marker *m;
|
|
325 int endp;
|
|
326 struct extent_list_marker *next;
|
|
327 } Extent_List_Marker;
|
|
328
|
|
329 typedef struct extent_list
|
|
330 {
|
3092
|
331 #ifdef NEW_GC
|
|
332 struct lrecord_header header;
|
|
333 #endif /* NEW_GC */
|
428
|
334 Gap_Array *start;
|
|
335 Gap_Array *end;
|
|
336 Extent_List_Marker *markers;
|
|
337 } Extent_List;
|
|
338
|
3092
|
339 #ifndef NEW_GC
|
428
|
340 static Extent_List_Marker *extent_list_marker_freelist;
|
3092
|
341 #endif /* not NEW_GC */
|
428
|
342
|
|
343 #define EXTENT_LESS_VALS(e,st,nd) ((extent_start (e) < (st)) || \
|
|
344 ((extent_start (e) == (st)) && \
|
|
345 (extent_end (e) > (nd))))
|
|
346
|
|
347 #define EXTENT_EQUAL_VALS(e,st,nd) ((extent_start (e) == (st)) && \
|
|
348 (extent_end (e) == (nd)))
|
|
349
|
|
350 #define EXTENT_LESS_EQUAL_VALS(e,st,nd) ((extent_start (e) < (st)) || \
|
|
351 ((extent_start (e) == (st)) && \
|
|
352 (extent_end (e) >= (nd))))
|
|
353
|
|
354 /* Is extent E1 less than extent E2 in the display order? */
|
|
355 #define EXTENT_LESS(e1,e2) \
|
|
356 EXTENT_LESS_VALS (e1, extent_start (e2), extent_end (e2))
|
|
357
|
|
358 /* Is extent E1 equal to extent E2? */
|
|
359 #define EXTENT_EQUAL(e1,e2) \
|
|
360 EXTENT_EQUAL_VALS (e1, extent_start (e2), extent_end (e2))
|
|
361
|
|
362 /* Is extent E1 less than or equal to extent E2 in the display order? */
|
|
363 #define EXTENT_LESS_EQUAL(e1,e2) \
|
|
364 EXTENT_LESS_EQUAL_VALS (e1, extent_start (e2), extent_end (e2))
|
|
365
|
|
366 #define EXTENT_E_LESS_VALS(e,st,nd) ((extent_end (e) < (nd)) || \
|
|
367 ((extent_end (e) == (nd)) && \
|
|
368 (extent_start (e) > (st))))
|
|
369
|
|
370 #define EXTENT_E_LESS_EQUAL_VALS(e,st,nd) ((extent_end (e) < (nd)) || \
|
|
371 ((extent_end (e) == (nd)) && \
|
|
372 (extent_start (e) >= (st))))
|
|
373
|
|
374 /* Is extent E1 less than extent E2 in the e-order? */
|
|
375 #define EXTENT_E_LESS(e1,e2) \
|
|
376 EXTENT_E_LESS_VALS(e1, extent_start (e2), extent_end (e2))
|
|
377
|
|
378 /* Is extent E1 less than or equal to extent E2 in the e-order? */
|
|
379 #define EXTENT_E_LESS_EQUAL(e1,e2) \
|
|
380 EXTENT_E_LESS_EQUAL_VALS (e1, extent_start (e2), extent_end (e2))
|
|
381
|
|
382 #define EXTENT_GAP_ARRAY_AT(ga, pos) (* (EXTENT *) GAP_ARRAY_EL_ADDR(ga, pos))
|
|
383
|
|
384 /* ------------------------------- */
|
|
385 /* auxiliary extent structure */
|
|
386 /* ------------------------------- */
|
|
387
|
|
388 struct extent_auxiliary extent_auxiliary_defaults;
|
|
389
|
|
390 /* ------------------------------- */
|
|
391 /* buffer-extent primitives */
|
|
392 /* ------------------------------- */
|
|
393
|
|
394 typedef struct stack_of_extents
|
|
395 {
|
3092
|
396 #ifdef NEW_GC
|
|
397 struct lrecord_header header;
|
|
398 #endif /* NEW_GC */
|
428
|
399 Extent_List *extents;
|
826
|
400 Memxpos pos; /* Position of stack of extents. EXTENTS is the list of
|
428
|
401 all extents that overlap this position. This position
|
|
402 can be -1 if the stack of extents is invalid (this
|
|
403 happens when a buffer is first created or a string's
|
|
404 stack of extents is created [a string's stack of extents
|
|
405 is nuked when a GC occurs, to conserve memory]). */
|
|
406 } Stack_Of_Extents;
|
|
407
|
|
408 /* ------------------------------- */
|
|
409 /* map-extents */
|
|
410 /* ------------------------------- */
|
|
411
|
826
|
412 typedef int (*map_extents_fun) (EXTENT extent, void *arg);
|
|
413
|
428
|
414 typedef int Endpoint_Index;
|
|
415
|
826
|
416 #define memxpos_to_startind(x, start_open) \
|
428
|
417 ((Endpoint_Index) (((x) << 1) + !!(start_open)))
|
826
|
418 #define memxpos_to_endind(x, end_open) \
|
428
|
419 ((Endpoint_Index) (((x) << 1) - !!(end_open)))
|
|
420
|
|
421 /* ------------------------------- */
|
|
422 /* buffer-or-string primitives */
|
|
423 /* ------------------------------- */
|
|
424
|
826
|
425 /* Similar for Bytebpos's and start/end indices. */
|
|
426
|
|
427 #define buffer_or_string_bytexpos_to_startind(obj, ind, start_open) \
|
|
428 memxpos_to_startind (buffer_or_string_bytexpos_to_memxpos (obj, ind), \
|
428
|
429 start_open)
|
|
430
|
826
|
431 #define buffer_or_string_bytexpos_to_endind(obj, ind, end_open) \
|
|
432 memxpos_to_endind (buffer_or_string_bytexpos_to_memxpos (obj, ind), \
|
428
|
433 end_open)
|
|
434
|
|
435 /* ------------------------------- */
|
|
436 /* Lisp-level functions */
|
|
437 /* ------------------------------- */
|
|
438
|
|
439 /* flags for decode_extent() */
|
|
440 #define DE_MUST_HAVE_BUFFER 1
|
|
441 #define DE_MUST_BE_ATTACHED 2
|
|
442
|
|
443 Lisp_Object Vlast_highlighted_extent;
|
1292
|
444
|
|
445 Lisp_Object QSin_map_extents_internal;
|
|
446
|
458
|
447 Fixnum mouse_highlight_priority;
|
428
|
448
|
|
449 Lisp_Object Qextentp;
|
|
450 Lisp_Object Qextent_live_p;
|
|
451
|
|
452 Lisp_Object Qall_extents_closed;
|
|
453 Lisp_Object Qall_extents_open;
|
|
454 Lisp_Object Qall_extents_closed_open;
|
|
455 Lisp_Object Qall_extents_open_closed;
|
|
456 Lisp_Object Qstart_in_region;
|
|
457 Lisp_Object Qend_in_region;
|
|
458 Lisp_Object Qstart_and_end_in_region;
|
|
459 Lisp_Object Qstart_or_end_in_region;
|
|
460 Lisp_Object Qnegate_in_region;
|
|
461
|
|
462 Lisp_Object Qdetached;
|
|
463 Lisp_Object Qdestroyed;
|
|
464 Lisp_Object Qbegin_glyph;
|
|
465 Lisp_Object Qend_glyph;
|
|
466 Lisp_Object Qstart_open;
|
|
467 Lisp_Object Qend_open;
|
|
468 Lisp_Object Qstart_closed;
|
|
469 Lisp_Object Qend_closed;
|
|
470 Lisp_Object Qread_only;
|
|
471 /* Qhighlight defined in general.c */
|
|
472 Lisp_Object Qunique;
|
|
473 Lisp_Object Qduplicable;
|
|
474 Lisp_Object Qdetachable;
|
|
475 Lisp_Object Qpriority;
|
|
476 Lisp_Object Qmouse_face;
|
|
477 Lisp_Object Qinitial_redisplay_function;
|
|
478
|
|
479 Lisp_Object Qglyph_layout; /* This exists only for backwards compatibility. */
|
|
480 Lisp_Object Qbegin_glyph_layout, Qend_glyph_layout;
|
|
481 Lisp_Object Qoutside_margin;
|
|
482 Lisp_Object Qinside_margin;
|
|
483 Lisp_Object Qwhitespace;
|
|
484 /* Qtext defined in general.c */
|
|
485
|
|
486 Lisp_Object Qcopy_function;
|
|
487 Lisp_Object Qpaste_function;
|
|
488
|
|
489 static Lisp_Object canonicalize_extent_property (Lisp_Object prop,
|
|
490 Lisp_Object value);
|
826
|
491
|
|
492 typedef struct
|
|
493 {
|
|
494 Lisp_Object key, value;
|
|
495 } Lisp_Object_pair;
|
|
496 typedef struct
|
|
497 {
|
|
498 Dynarr_declare (Lisp_Object_pair);
|
|
499 } Lisp_Object_pair_dynarr;
|
|
500
|
|
501 static void extent_properties (EXTENT e, Lisp_Object_pair_dynarr *props);
|
|
502
|
428
|
503 Lisp_Object Vextent_face_memoize_hash_table;
|
|
504 Lisp_Object Vextent_face_reverse_memoize_hash_table;
|
|
505 Lisp_Object Vextent_face_reusable_list;
|
|
506 /* FSFmacs bogosity */
|
|
507 Lisp_Object Vdefault_text_properties;
|
|
508
|
442
|
509 /* if true, we don't want to set any redisplay flags on modeline extent
|
|
510 changes */
|
|
511 int in_modeline_generation;
|
|
512
|
428
|
513
|
|
514 /************************************************************************/
|
|
515 /* Generalized gap array */
|
|
516 /************************************************************************/
|
|
517
|
|
518 /* This generalizes the "array with a gap" model used to store buffer
|
|
519 characters. This is based on the stuff in insdel.c and should
|
|
520 probably be merged with it. This is not extent-specific and should
|
|
521 perhaps be moved into a separate file. */
|
|
522
|
|
523 /* ------------------------------- */
|
|
524 /* internal functions */
|
|
525 /* ------------------------------- */
|
|
526
|
|
527 /* Adjust the gap array markers in the range (FROM, TO]. Parallel to
|
|
528 adjust_markers() in insdel.c. */
|
|
529
|
|
530 static void
|
826
|
531 gap_array_adjust_markers (Gap_Array *ga, Memxpos from,
|
1204
|
532 Memxpos to, Elemcount amount)
|
428
|
533 {
|
|
534 Gap_Array_Marker *m;
|
|
535
|
|
536 for (m = ga->markers; m; m = m->next)
|
|
537 m->pos = do_marker_adjustment (m->pos, from, to, amount);
|
|
538 }
|
|
539
|
1204
|
540 static void
|
|
541 gap_array_recompute_derived_values (Gap_Array *ga)
|
|
542 {
|
|
543 ga->offset_past_gap = ga->elsize * (ga->gap + ga->gapsize);
|
|
544 ga->els_past_gap = ga->numels - ga->gap;
|
|
545 }
|
|
546
|
428
|
547 /* Move the gap to array position POS. Parallel to move_gap() in
|
|
548 insdel.c but somewhat simplified. */
|
|
549
|
|
550 static void
|
1204
|
551 gap_array_move_gap (Gap_Array *ga, Elemcount pos)
|
|
552 {
|
|
553 Elemcount gap = ga->gap;
|
|
554 Elemcount gapsize = ga->gapsize;
|
|
555
|
428
|
556 if (pos < gap)
|
|
557 {
|
|
558 memmove (GAP_ARRAY_MEMEL_ADDR (ga, pos + gapsize),
|
|
559 GAP_ARRAY_MEMEL_ADDR (ga, pos),
|
|
560 (gap - pos)*ga->elsize);
|
826
|
561 gap_array_adjust_markers (ga, (Memxpos) pos, (Memxpos) gap,
|
428
|
562 gapsize);
|
|
563 }
|
|
564 else if (pos > gap)
|
|
565 {
|
|
566 memmove (GAP_ARRAY_MEMEL_ADDR (ga, gap),
|
|
567 GAP_ARRAY_MEMEL_ADDR (ga, gap + gapsize),
|
|
568 (pos - gap)*ga->elsize);
|
826
|
569 gap_array_adjust_markers (ga, (Memxpos) (gap + gapsize),
|
|
570 (Memxpos) (pos + gapsize), - gapsize);
|
428
|
571 }
|
|
572 ga->gap = pos;
|
1204
|
573
|
|
574 gap_array_recompute_derived_values (ga);
|
428
|
575 }
|
|
576
|
|
577 /* Make the gap INCREMENT characters longer. Parallel to make_gap() in
|
1204
|
578 insdel.c. The gap array may be moved, so assign the return value back
|
|
579 to the array pointer. */
|
|
580
|
|
581 static Gap_Array *
|
|
582 gap_array_make_gap (Gap_Array *ga, Elemcount increment)
|
|
583 {
|
|
584 Elemcount real_gap_loc;
|
|
585 Elemcount old_gap_size;
|
428
|
586
|
|
587 /* If we have to get more space, get enough to last a while. We use
|
|
588 a geometric progression that saves on realloc space. */
|
|
589 increment += 100 + ga->numels / 8;
|
|
590
|
3092
|
591 #ifdef NEW_GC
|
|
592 ga = (Gap_Array *) mc_realloc (ga,
|
|
593 offsetof (Gap_Array, array) +
|
|
594 (ga->numels + ga->gapsize + increment) *
|
|
595 ga->elsize);
|
|
596 #else /* not NEW_GC */
|
1204
|
597 ga = (Gap_Array *) xrealloc (ga,
|
|
598 offsetof (Gap_Array, array) +
|
|
599 (ga->numels + ga->gapsize + increment) *
|
|
600 ga->elsize);
|
3092
|
601 #endif /* not NEW_GC */
|
1204
|
602 if (ga == 0)
|
428
|
603 memory_full ();
|
|
604
|
|
605 real_gap_loc = ga->gap;
|
|
606 old_gap_size = ga->gapsize;
|
|
607
|
|
608 /* Call the newly allocated space a gap at the end of the whole space. */
|
|
609 ga->gap = ga->numels + ga->gapsize;
|
|
610 ga->gapsize = increment;
|
|
611
|
|
612 /* Move the new gap down to be consecutive with the end of the old one.
|
|
613 This adjusts the markers properly too. */
|
|
614 gap_array_move_gap (ga, real_gap_loc + old_gap_size);
|
|
615
|
|
616 /* Now combine the two into one large gap. */
|
|
617 ga->gapsize += old_gap_size;
|
|
618 ga->gap = real_gap_loc;
|
1204
|
619
|
|
620 gap_array_recompute_derived_values (ga);
|
|
621
|
|
622 return ga;
|
428
|
623 }
|
|
624
|
|
625 /* ------------------------------- */
|
|
626 /* external functions */
|
|
627 /* ------------------------------- */
|
|
628
|
|
629 /* Insert NUMELS elements (pointed to by ELPTR) into the specified
|
1204
|
630 gap array at POS. The gap array may be moved, so assign the
|
|
631 return value back to the array pointer. */
|
|
632
|
|
633 static Gap_Array *
|
|
634 gap_array_insert_els (Gap_Array *ga, Elemcount pos, void *elptr,
|
|
635 Elemcount numels)
|
428
|
636 {
|
|
637 assert (pos >= 0 && pos <= ga->numels);
|
|
638 if (ga->gapsize < numels)
|
1204
|
639 ga = gap_array_make_gap (ga, numels - ga->gapsize);
|
428
|
640 if (pos != ga->gap)
|
|
641 gap_array_move_gap (ga, pos);
|
|
642
|
|
643 memcpy (GAP_ARRAY_MEMEL_ADDR (ga, ga->gap), (char *) elptr,
|
|
644 numels*ga->elsize);
|
|
645 ga->gapsize -= numels;
|
|
646 ga->gap += numels;
|
|
647 ga->numels += numels;
|
1204
|
648 gap_array_recompute_derived_values (ga);
|
428
|
649 /* This is the equivalent of insert-before-markers.
|
|
650
|
|
651 #### Should only happen if marker is "moves forward at insert" type.
|
|
652 */
|
|
653
|
|
654 gap_array_adjust_markers (ga, pos - 1, pos, numels);
|
1204
|
655 return ga;
|
428
|
656 }
|
|
657
|
|
658 /* Delete NUMELS elements from the specified gap array, starting at FROM. */
|
|
659
|
|
660 static void
|
1204
|
661 gap_array_delete_els (Gap_Array *ga, Elemcount from, Elemcount numdel)
|
|
662 {
|
|
663 Elemcount to = from + numdel;
|
|
664 Elemcount gapsize = ga->gapsize;
|
428
|
665
|
|
666 assert (from >= 0);
|
|
667 assert (numdel >= 0);
|
|
668 assert (to <= ga->numels);
|
|
669
|
|
670 /* Make sure the gap is somewhere in or next to what we are deleting. */
|
|
671 if (to < ga->gap)
|
|
672 gap_array_move_gap (ga, to);
|
|
673 if (from > ga->gap)
|
|
674 gap_array_move_gap (ga, from);
|
|
675
|
|
676 /* Relocate all markers pointing into the new, larger gap
|
|
677 to point at the end of the text before the gap. */
|
|
678 gap_array_adjust_markers (ga, to + gapsize, to + gapsize,
|
|
679 - numdel - gapsize);
|
|
680
|
|
681 ga->gapsize += numdel;
|
|
682 ga->numels -= numdel;
|
|
683 ga->gap = from;
|
1204
|
684 gap_array_recompute_derived_values (ga);
|
428
|
685 }
|
|
686
|
|
687 static Gap_Array_Marker *
|
1204
|
688 gap_array_make_marker (Gap_Array *ga, Elemcount pos)
|
428
|
689 {
|
|
690 Gap_Array_Marker *m;
|
|
691
|
|
692 assert (pos >= 0 && pos <= ga->numels);
|
3092
|
693 #ifdef NEW_GC
|
|
694 m = alloc_lrecord_type (Gap_Array_Marker, &lrecord_gap_array_marker);
|
|
695 #else /* not NEW_GC */
|
428
|
696 if (gap_array_marker_freelist)
|
|
697 {
|
|
698 m = gap_array_marker_freelist;
|
|
699 gap_array_marker_freelist = gap_array_marker_freelist->next;
|
|
700 }
|
|
701 else
|
|
702 m = xnew (Gap_Array_Marker);
|
3092
|
703 #endif /* not NEW_GC */
|
428
|
704
|
|
705 m->pos = GAP_ARRAY_ARRAY_TO_MEMORY_POS (ga, pos);
|
|
706 m->next = ga->markers;
|
|
707 ga->markers = m;
|
|
708 return m;
|
|
709 }
|
|
710
|
|
711 static void
|
|
712 gap_array_delete_marker (Gap_Array *ga, Gap_Array_Marker *m)
|
|
713 {
|
|
714 Gap_Array_Marker *p, *prev;
|
|
715
|
|
716 for (prev = 0, p = ga->markers; p && p != m; prev = p, p = p->next)
|
|
717 ;
|
|
718 assert (p);
|
|
719 if (prev)
|
|
720 prev->next = p->next;
|
|
721 else
|
|
722 ga->markers = p->next;
|
3092
|
723 #ifdef NEW_GC
|
|
724 mc_free (m);
|
|
725 #else /* not NEW_GC */
|
428
|
726 m->next = gap_array_marker_freelist;
|
1204
|
727 m->pos = 0xDEADBEEF; /* -559038737 base 10 */
|
428
|
728 gap_array_marker_freelist = m;
|
3092
|
729 #endif /* not NEW_GC */
|
|
730 }
|
|
731
|
|
732 #ifndef NEW_GC
|
428
|
733 static void
|
|
734 gap_array_delete_all_markers (Gap_Array *ga)
|
|
735 {
|
|
736 Gap_Array_Marker *p, *next;
|
|
737
|
|
738 for (p = ga->markers; p; p = next)
|
|
739 {
|
|
740 next = p->next;
|
|
741 p->next = gap_array_marker_freelist;
|
|
742 p->pos = 0xDEADBEEF; /* -559038737 as an int */
|
|
743 gap_array_marker_freelist = p;
|
|
744 }
|
|
745 }
|
3092
|
746 #endif /* not NEW_GC */
|
428
|
747
|
|
748 static void
|
1204
|
749 gap_array_move_marker (Gap_Array *ga, Gap_Array_Marker *m, Elemcount pos)
|
428
|
750 {
|
|
751 assert (pos >= 0 && pos <= ga->numels);
|
|
752 m->pos = GAP_ARRAY_ARRAY_TO_MEMORY_POS (ga, pos);
|
|
753 }
|
|
754
|
|
755 #define gap_array_marker_pos(ga, m) \
|
|
756 GAP_ARRAY_MEMORY_TO_ARRAY_POS (ga, (m)->pos)
|
|
757
|
|
758 static Gap_Array *
|
1204
|
759 make_gap_array (Elemcount elsize)
|
428
|
760 {
|
3092
|
761 #ifdef NEW_GC
|
|
762 Gap_Array *ga = alloc_lrecord_type (Gap_Array, &lrecord_gap_array);
|
|
763 #else /* not NEW_GC */
|
428
|
764 Gap_Array *ga = xnew_and_zero (Gap_Array);
|
3092
|
765 #endif /* not NEW_GC */
|
428
|
766 ga->elsize = elsize;
|
|
767 return ga;
|
|
768 }
|
|
769
|
3092
|
770 #ifndef NEW_GC
|
428
|
771 static void
|
|
772 free_gap_array (Gap_Array *ga)
|
|
773 {
|
|
774 gap_array_delete_all_markers (ga);
|
1726
|
775 xfree (ga, Gap_Array *);
|
428
|
776 }
|
3092
|
777 #endif /* not NEW_GC */
|
428
|
778
|
|
779
|
|
780 /************************************************************************/
|
|
781 /* Extent list primitives */
|
|
782 /************************************************************************/
|
|
783
|
|
784 /* A list of extents is maintained as a double gap array: one gap array
|
|
785 is ordered by start index (the "display order") and the other is
|
|
786 ordered by end index (the "e-order"). Note that positions in an
|
|
787 extent list should logically be conceived of as referring *to*
|
|
788 a particular extent (as is the norm in programs) rather than
|
|
789 sitting between two extents. Note also that callers of these
|
|
790 functions should not be aware of the fact that the extent list is
|
|
791 implemented as an array, except for the fact that positions are
|
|
792 integers (this should be generalized to handle integers and linked
|
|
793 list equally well).
|
|
794 */
|
|
795
|
|
796 /* Number of elements in an extent list */
|
1204
|
797 #define extent_list_num_els(el) GAP_ARRAY_NUM_ELS (el->start)
|
428
|
798
|
|
799 /* Return the position at which EXTENT is located in the specified extent
|
|
800 list (in the display order if ENDP is 0, in the e-order otherwise).
|
|
801 If the extent is not found, the position where the extent would
|
|
802 be inserted is returned. If ENDP is 0, the insertion would go after
|
|
803 all other equal extents. If ENDP is not 0, the insertion would go
|
|
804 before all other equal extents. If FOUNDP is not 0, then whether
|
|
805 the extent was found will get written into it. */
|
|
806
|
|
807 static int
|
|
808 extent_list_locate (Extent_List *el, EXTENT extent, int endp, int *foundp)
|
|
809 {
|
|
810 Gap_Array *ga = endp ? el->end : el->start;
|
|
811 int left = 0, right = GAP_ARRAY_NUM_ELS (ga);
|
|
812 int oldfoundpos, foundpos;
|
|
813 int found;
|
|
814
|
|
815 while (left != right)
|
|
816 {
|
|
817 /* RIGHT might not point to a valid extent (i.e. it's at the end
|
|
818 of the list), so NEWPOS must round down. */
|
647
|
819 int newpos = (left + right) >> 1;
|
428
|
820 EXTENT e = EXTENT_GAP_ARRAY_AT (ga, (int) newpos);
|
|
821
|
|
822 if (endp ? EXTENT_E_LESS (e, extent) : EXTENT_LESS (e, extent))
|
647
|
823 left = newpos + 1;
|
428
|
824 else
|
|
825 right = newpos;
|
|
826 }
|
|
827
|
|
828 /* Now we're at the beginning of all equal extents. */
|
|
829 found = 0;
|
|
830 oldfoundpos = foundpos = left;
|
|
831 while (foundpos < GAP_ARRAY_NUM_ELS (ga))
|
|
832 {
|
|
833 EXTENT e = EXTENT_GAP_ARRAY_AT (ga, foundpos);
|
|
834 if (e == extent)
|
|
835 {
|
|
836 found = 1;
|
|
837 break;
|
|
838 }
|
|
839 if (!EXTENT_EQUAL (e, extent))
|
|
840 break;
|
|
841 foundpos++;
|
|
842 }
|
|
843 if (foundp)
|
|
844 *foundp = found;
|
|
845 if (found || !endp)
|
|
846 return foundpos;
|
|
847 else
|
|
848 return oldfoundpos;
|
|
849 }
|
|
850
|
|
851 /* Return the position of the first extent that begins at or after POS
|
|
852 (or ends at or after POS, if ENDP is not 0).
|
|
853
|
|
854 An out-of-range value for POS is allowed, and guarantees that the
|
|
855 position at the beginning or end of the extent list is returned. */
|
|
856
|
|
857 static int
|
826
|
858 extent_list_locate_from_pos (Extent_List *el, Memxpos pos, int endp)
|
428
|
859 {
|
|
860 struct extent fake_extent;
|
|
861 /*
|
|
862
|
|
863 Note that if we search for [POS, POS], then we get the following:
|
|
864
|
|
865 -- if ENDP is 0, then all extents whose start position is <= POS
|
|
866 lie before the returned position, and all extents whose start
|
|
867 position is > POS lie at or after the returned position.
|
|
868
|
|
869 -- if ENDP is not 0, then all extents whose end position is < POS
|
|
870 lie before the returned position, and all extents whose end
|
|
871 position is >= POS lie at or after the returned position.
|
|
872
|
|
873 */
|
|
874 set_extent_start (&fake_extent, endp ? pos : pos-1);
|
|
875 set_extent_end (&fake_extent, endp ? pos : pos-1);
|
|
876 return extent_list_locate (el, &fake_extent, endp, 0);
|
|
877 }
|
|
878
|
|
879 /* Return the extent at POS. */
|
|
880
|
|
881 static EXTENT
|
826
|
882 extent_list_at (Extent_List *el, Memxpos pos, int endp)
|
428
|
883 {
|
|
884 Gap_Array *ga = endp ? el->end : el->start;
|
|
885
|
|
886 assert (pos >= 0 && pos < GAP_ARRAY_NUM_ELS (ga));
|
|
887 return EXTENT_GAP_ARRAY_AT (ga, pos);
|
|
888 }
|
|
889
|
|
890 /* Insert an extent into an extent list. */
|
|
891
|
|
892 static void
|
|
893 extent_list_insert (Extent_List *el, EXTENT extent)
|
|
894 {
|
|
895 int pos, foundp;
|
|
896
|
|
897 pos = extent_list_locate (el, extent, 0, &foundp);
|
|
898 assert (!foundp);
|
1204
|
899 el->start = gap_array_insert_els (el->start, pos, &extent, 1);
|
428
|
900 pos = extent_list_locate (el, extent, 1, &foundp);
|
|
901 assert (!foundp);
|
1204
|
902 el->end = gap_array_insert_els (el->end, pos, &extent, 1);
|
428
|
903 }
|
|
904
|
|
905 /* Delete an extent from an extent list. */
|
|
906
|
|
907 static void
|
|
908 extent_list_delete (Extent_List *el, EXTENT extent)
|
|
909 {
|
|
910 int pos, foundp;
|
|
911
|
|
912 pos = extent_list_locate (el, extent, 0, &foundp);
|
|
913 assert (foundp);
|
|
914 gap_array_delete_els (el->start, pos, 1);
|
|
915 pos = extent_list_locate (el, extent, 1, &foundp);
|
|
916 assert (foundp);
|
|
917 gap_array_delete_els (el->end, pos, 1);
|
|
918 }
|
|
919
|
|
920 static void
|
|
921 extent_list_delete_all (Extent_List *el)
|
|
922 {
|
|
923 gap_array_delete_els (el->start, 0, GAP_ARRAY_NUM_ELS (el->start));
|
|
924 gap_array_delete_els (el->end, 0, GAP_ARRAY_NUM_ELS (el->end));
|
|
925 }
|
|
926
|
|
927 static Extent_List_Marker *
|
|
928 extent_list_make_marker (Extent_List *el, int pos, int endp)
|
|
929 {
|
|
930 Extent_List_Marker *m;
|
|
931
|
3092
|
932 #ifdef NEW_GC
|
|
933 m = alloc_lrecord_type (Extent_List_Marker, &lrecord_extent_list_marker);
|
|
934 #else /* not NEW_GC */
|
428
|
935 if (extent_list_marker_freelist)
|
|
936 {
|
|
937 m = extent_list_marker_freelist;
|
|
938 extent_list_marker_freelist = extent_list_marker_freelist->next;
|
|
939 }
|
|
940 else
|
|
941 m = xnew (Extent_List_Marker);
|
3092
|
942 #endif /* not NEW_GC */
|
428
|
943
|
|
944 m->m = gap_array_make_marker (endp ? el->end : el->start, pos);
|
|
945 m->endp = endp;
|
|
946 m->next = el->markers;
|
|
947 el->markers = m;
|
|
948 return m;
|
|
949 }
|
|
950
|
|
951 #define extent_list_move_marker(el, mkr, pos) \
|
|
952 gap_array_move_marker((mkr)->endp ? (el)->end : (el)->start, (mkr)->m, pos)
|
|
953
|
|
954 static void
|
|
955 extent_list_delete_marker (Extent_List *el, Extent_List_Marker *m)
|
|
956 {
|
|
957 Extent_List_Marker *p, *prev;
|
|
958
|
|
959 for (prev = 0, p = el->markers; p && p != m; prev = p, p = p->next)
|
|
960 ;
|
|
961 assert (p);
|
|
962 if (prev)
|
|
963 prev->next = p->next;
|
|
964 else
|
|
965 el->markers = p->next;
|
3092
|
966 #ifdef NEW_GC
|
|
967 gap_array_delete_marker (m->endp ? el->end : el->start, m->m);
|
|
968 #else /* not NEW_GC */
|
428
|
969 m->next = extent_list_marker_freelist;
|
|
970 extent_list_marker_freelist = m;
|
|
971 gap_array_delete_marker (m->endp ? el->end : el->start, m->m);
|
3092
|
972 #endif /* not NEW_GC */
|
428
|
973 }
|
|
974
|
|
975 #define extent_list_marker_pos(el, mkr) \
|
|
976 gap_array_marker_pos ((mkr)->endp ? (el)->end : (el)->start, (mkr)->m)
|
|
977
|
|
978 static Extent_List *
|
|
979 allocate_extent_list (void)
|
|
980 {
|
3092
|
981 #ifdef NEW_GC
|
|
982 Extent_List *el = alloc_lrecord_type (Extent_List, &lrecord_extent_list);
|
|
983 #else /* not NEW_GC */
|
428
|
984 Extent_List *el = xnew (Extent_List);
|
3092
|
985 #endif /* not NEW_GC */
|
440
|
986 el->start = make_gap_array (sizeof (EXTENT));
|
|
987 el->end = make_gap_array (sizeof (EXTENT));
|
428
|
988 el->markers = 0;
|
|
989 return el;
|
|
990 }
|
|
991
|
3092
|
992 #ifndef NEW_GC
|
428
|
993 static void
|
|
994 free_extent_list (Extent_List *el)
|
|
995 {
|
|
996 free_gap_array (el->start);
|
|
997 free_gap_array (el->end);
|
1726
|
998 xfree (el, Extent_List *);
|
428
|
999 }
|
3092
|
1000 #endif /* not NEW_GC */
|
428
|
1001
|
|
1002
|
|
1003 /************************************************************************/
|
|
1004 /* Auxiliary extent structure */
|
|
1005 /************************************************************************/
|
|
1006
|
1204
|
1007 static const struct memory_description extent_auxiliary_description[] ={
|
934
|
1008 { XD_LISP_OBJECT, offsetof (struct extent_auxiliary, begin_glyph) },
|
|
1009 { XD_LISP_OBJECT, offsetof (struct extent_auxiliary, end_glyph) },
|
|
1010 { XD_LISP_OBJECT, offsetof (struct extent_auxiliary, parent) },
|
|
1011 { XD_LISP_OBJECT, offsetof (struct extent_auxiliary, children) },
|
|
1012 { XD_LISP_OBJECT, offsetof (struct extent_auxiliary, invisible) },
|
|
1013 { XD_LISP_OBJECT, offsetof (struct extent_auxiliary, read_only) },
|
|
1014 { XD_LISP_OBJECT, offsetof (struct extent_auxiliary, mouse_face) },
|
|
1015 { XD_LISP_OBJECT, offsetof (struct extent_auxiliary, initial_redisplay_function) },
|
|
1016 { XD_LISP_OBJECT, offsetof (struct extent_auxiliary, before_change_functions) },
|
|
1017 { XD_LISP_OBJECT, offsetof (struct extent_auxiliary, after_change_functions) },
|
|
1018 { XD_END }
|
|
1019 };
|
428
|
1020 static Lisp_Object
|
|
1021 mark_extent_auxiliary (Lisp_Object obj)
|
|
1022 {
|
|
1023 struct extent_auxiliary *data = XEXTENT_AUXILIARY (obj);
|
|
1024 mark_object (data->begin_glyph);
|
|
1025 mark_object (data->end_glyph);
|
|
1026 mark_object (data->invisible);
|
|
1027 mark_object (data->children);
|
|
1028 mark_object (data->read_only);
|
|
1029 mark_object (data->mouse_face);
|
|
1030 mark_object (data->initial_redisplay_function);
|
|
1031 mark_object (data->before_change_functions);
|
|
1032 mark_object (data->after_change_functions);
|
|
1033 return data->parent;
|
|
1034 }
|
|
1035
|
934
|
1036 DEFINE_LRECORD_IMPLEMENTATION ("extent-auxiliary", extent_auxiliary,
|
|
1037 0, /*dumpable-flag*/
|
|
1038 mark_extent_auxiliary, internal_object_printer,
|
1204
|
1039 0, 0, 0, extent_auxiliary_description,
|
|
1040 struct extent_auxiliary);
|
428
|
1041 void
|
|
1042 allocate_extent_auxiliary (EXTENT ext)
|
|
1043 {
|
|
1044 Lisp_Object extent_aux;
|
2720
|
1045 struct extent_auxiliary *data =
|
3017
|
1046 ALLOC_LCRECORD_TYPE (struct extent_auxiliary, &lrecord_extent_auxiliary);
|
|
1047 COPY_LCRECORD (data, &extent_auxiliary_defaults);
|
793
|
1048 extent_aux = wrap_extent_auxiliary (data);
|
428
|
1049 ext->plist = Fcons (extent_aux, ext->plist);
|
|
1050 ext->flags.has_aux = 1;
|
|
1051 }
|
|
1052
|
|
1053
|
|
1054 /************************************************************************/
|
|
1055 /* Extent info structure */
|
|
1056 /************************************************************************/
|
|
1057
|
|
1058 /* An extent-info structure consists of a list of the buffer or string's
|
|
1059 extents and a "stack of extents" that lists all of the extents over
|
|
1060 a particular position. The stack-of-extents info is used for
|
|
1061 optimization purposes -- it basically caches some info that might
|
|
1062 be expensive to compute. Certain otherwise hard computations are easy
|
|
1063 given the stack of extents over a particular position, and if the
|
|
1064 stack of extents over a nearby position is known (because it was
|
|
1065 calculated at some prior point in time), it's easy to move the stack
|
|
1066 of extents to the proper position.
|
|
1067
|
|
1068 Given that the stack of extents is an optimization, and given that
|
|
1069 it requires memory, a string's stack of extents is wiped out each
|
|
1070 time a garbage collection occurs. Therefore, any time you retrieve
|
|
1071 the stack of extents, it might not be there. If you need it to
|
|
1072 be there, use the _force version.
|
|
1073
|
|
1074 Similarly, a string may or may not have an extent_info structure.
|
|
1075 (Generally it won't if there haven't been any extents added to the
|
|
1076 string.) So use the _force version if you need the extent_info
|
|
1077 structure to be there. */
|
|
1078
|
|
1079 static struct stack_of_extents *allocate_soe (void);
|
3092
|
1080 #ifndef NEW_GC
|
428
|
1081 static void free_soe (struct stack_of_extents *soe);
|
3092
|
1082 #endif /* not NEW_GC */
|
428
|
1083 static void soe_invalidate (Lisp_Object obj);
|
|
1084
|
1204
|
1085 extern const struct sized_memory_description gap_array_marker_description;
|
|
1086
|
|
1087 static const struct memory_description gap_array_marker_description_1[] = {
|
3092
|
1088 #ifdef NEW_GC
|
|
1089 { XD_LISP_OBJECT, offsetof (Gap_Array_Marker, next) },
|
|
1090 #else /* not NEW_GC */
|
2367
|
1091 { XD_BLOCK_PTR, offsetof (Gap_Array_Marker, next), 1,
|
2551
|
1092 { &gap_array_marker_description } },
|
3092
|
1093 #endif /* not NEW_GC */
|
1204
|
1094 { XD_END }
|
|
1095 };
|
|
1096
|
3092
|
1097 #ifdef NEW_GC
|
|
1098 DEFINE_LRECORD_IMPLEMENTATION ("gap-array-marker", gap_array_marker,
|
|
1099 0, /*dumpable-flag*/
|
|
1100 0, 0, 0, 0, 0,
|
|
1101 gap_array_marker_description_1,
|
|
1102 struct gap_array_marker);
|
|
1103 #else /* not NEW_GC */
|
1204
|
1104 const struct sized_memory_description gap_array_marker_description = {
|
|
1105 sizeof (Gap_Array_Marker),
|
|
1106 gap_array_marker_description_1
|
934
|
1107 };
|
3092
|
1108 #endif /* not NEW_GC */
|
934
|
1109
|
1204
|
1110 static const struct memory_description lispobj_gap_array_description_1[] = {
|
2881
|
1111 { XD_ELEMCOUNT, offsetof (Gap_Array, gap) },
|
|
1112 { XD_BYTECOUNT, offsetof (Gap_Array, offset_past_gap) },
|
|
1113 { XD_ELEMCOUNT, offsetof (Gap_Array, els_past_gap) },
|
3092
|
1114 #ifdef NEW_GC
|
|
1115 { XD_LISP_OBJECT, offsetof (Gap_Array, markers) },
|
|
1116 #else /* not NEW_GC */
|
2367
|
1117 { XD_BLOCK_PTR, offsetof (Gap_Array, markers), 1,
|
2551
|
1118 { &gap_array_marker_description }, XD_FLAG_NO_KKCC },
|
3092
|
1119 #endif /* not NEW_GC */
|
2367
|
1120 { XD_BLOCK_ARRAY, offsetof (Gap_Array, array), XD_INDIRECT (0, 0),
|
2551
|
1121 { &lisp_object_description } },
|
2367
|
1122 { XD_BLOCK_ARRAY, XD_INDIRECT (1, offsetof (Gap_Array, array)),
|
2551
|
1123 XD_INDIRECT (2, 0), { &lisp_object_description } },
|
934
|
1124 { XD_END }
|
|
1125 };
|
1204
|
1126
|
3092
|
1127 #ifdef NEW_GC
|
|
1128
|
|
1129 static Bytecount
|
|
1130 size_gap_array (const void *lheader)
|
|
1131 {
|
|
1132 Gap_Array *ga = (Gap_Array *) lheader;
|
|
1133 return offsetof (Gap_Array, array) + (ga->numels + ga->gapsize) * ga->elsize;
|
|
1134 }
|
|
1135
|
|
1136 DEFINE_LRECORD_SEQUENCE_IMPLEMENTATION ("gap-array", gap_array,
|
|
1137 0, /*dumpable-flag*/
|
|
1138 0, 0, 0, 0, 0,
|
|
1139 lispobj_gap_array_description_1,
|
|
1140 size_gap_array,
|
|
1141 struct gap_array);
|
|
1142 #else /* not NEW_GC */
|
1204
|
1143 static const struct sized_memory_description lispobj_gap_array_description = {
|
|
1144 sizeof (Gap_Array),
|
|
1145 lispobj_gap_array_description_1
|
|
1146 };
|
|
1147
|
|
1148 extern const struct sized_memory_description extent_list_marker_description;
|
3092
|
1149 #endif /* not NEW_GC */
|
1204
|
1150
|
|
1151 static const struct memory_description extent_list_marker_description_1[] = {
|
3092
|
1152 #ifdef NEW_GC
|
|
1153 { XD_LISP_OBJECT, offsetof (Extent_List_Marker, m) },
|
|
1154 { XD_LISP_OBJECT, offsetof (Extent_List_Marker, next) },
|
|
1155 #else /* not NEW_GC */
|
2367
|
1156 { XD_BLOCK_PTR, offsetof (Extent_List_Marker, m), 1,
|
2551
|
1157 { &gap_array_marker_description } },
|
2367
|
1158 { XD_BLOCK_PTR, offsetof (Extent_List_Marker, next), 1,
|
2551
|
1159 { &extent_list_marker_description } },
|
3092
|
1160 #endif /* not NEW_GC */
|
1204
|
1161 { XD_END }
|
|
1162 };
|
|
1163
|
3092
|
1164 #ifdef NEW_GC
|
|
1165 DEFINE_LRECORD_IMPLEMENTATION ("extent-list-marker", extent_list_marker,
|
|
1166 0, /*dumpable-flag*/
|
|
1167 0, 0, 0, 0, 0,
|
|
1168 extent_list_marker_description_1,
|
|
1169 struct extent_list_marker);
|
|
1170 #else /* not NEW_GC */
|
1204
|
1171 const struct sized_memory_description extent_list_marker_description = {
|
|
1172 sizeof (Extent_List_Marker),
|
|
1173 extent_list_marker_description_1
|
|
1174 };
|
3092
|
1175 #endif /* not NEW_GC */
|
1204
|
1176
|
|
1177 static const struct memory_description extent_list_description_1[] = {
|
3092
|
1178 #ifdef NEW_GC
|
|
1179 { XD_LISP_OBJECT, offsetof (Extent_List, start) },
|
|
1180 { XD_LISP_OBJECT, offsetof (Extent_List, end) },
|
|
1181 { XD_LISP_OBJECT, offsetof (Extent_List, markers) },
|
|
1182 #else /* not NEW_GC */
|
2551
|
1183 { XD_BLOCK_PTR, offsetof (Extent_List, start), 1,
|
|
1184 { &lispobj_gap_array_description } },
|
|
1185 { XD_BLOCK_PTR, offsetof (Extent_List, end), 1,
|
|
1186 { &lispobj_gap_array_description }, XD_FLAG_NO_KKCC },
|
|
1187 { XD_BLOCK_PTR, offsetof (Extent_List, markers), 1,
|
|
1188 { &extent_list_marker_description }, XD_FLAG_NO_KKCC },
|
3092
|
1189 #endif /* not NEW_GC */
|
1204
|
1190 { XD_END }
|
|
1191 };
|
|
1192
|
3092
|
1193 #ifdef NEW_GC
|
|
1194 DEFINE_LRECORD_IMPLEMENTATION ("extent-list", extent_list,
|
|
1195 0, /*dumpable-flag*/
|
|
1196 0, 0, 0, 0, 0,
|
|
1197 extent_list_description_1,
|
|
1198 struct extent_list);
|
|
1199 #else /* not NEW_GC */
|
1204
|
1200 static const struct sized_memory_description extent_list_description = {
|
|
1201 sizeof (Extent_List),
|
|
1202 extent_list_description_1
|
|
1203 };
|
3092
|
1204 #endif /* not NEW_GC */
|
1204
|
1205
|
|
1206 static const struct memory_description stack_of_extents_description_1[] = {
|
3092
|
1207 #ifdef NEW_GC
|
|
1208 { XD_LISP_OBJECT, offsetof (Stack_Of_Extents, extents) },
|
|
1209 #else /* not NEW_GC */
|
2551
|
1210 { XD_BLOCK_PTR, offsetof (Stack_Of_Extents, extents), 1,
|
|
1211 { &extent_list_description } },
|
3092
|
1212 #endif /* not NEW_GC */
|
1204
|
1213 { XD_END }
|
|
1214 };
|
|
1215
|
3092
|
1216 #ifdef NEW_GC
|
|
1217 DEFINE_LRECORD_IMPLEMENTATION ("stack-of-extents", stack_of_extents,
|
|
1218 0, /*dumpable-flag*/
|
|
1219 0, 0, 0, 0, 0,
|
|
1220 stack_of_extents_description_1,
|
|
1221 struct stack_of_extents);
|
|
1222 #else /* not NEW_GC */
|
1204
|
1223 static const struct sized_memory_description stack_of_extents_description = {
|
|
1224 sizeof (Stack_Of_Extents),
|
|
1225 stack_of_extents_description_1
|
|
1226 };
|
3092
|
1227 #endif /* not NEW_GC */
|
1204
|
1228
|
|
1229 static const struct memory_description extent_info_description [] = {
|
3092
|
1230 #ifdef NEW_GC
|
|
1231 { XD_LISP_OBJECT, offsetof (struct extent_info, extents) },
|
|
1232 { XD_LISP_OBJECT, offsetof (struct extent_info, soe) },
|
|
1233 #else /* not NEW_GC */
|
2367
|
1234 { XD_BLOCK_PTR, offsetof (struct extent_info, extents), 1,
|
2551
|
1235 { &extent_list_description } },
|
2367
|
1236 { XD_BLOCK_PTR, offsetof (struct extent_info, soe), 1,
|
2551
|
1237 { &stack_of_extents_description }, XD_FLAG_NO_KKCC },
|
3092
|
1238 #endif /* not NEW_GC */
|
1204
|
1239 { XD_END }
|
|
1240 };
|
934
|
1241
|
428
|
1242 static Lisp_Object
|
|
1243 mark_extent_info (Lisp_Object obj)
|
|
1244 {
|
|
1245 struct extent_info *data = (struct extent_info *) XEXTENT_INFO (obj);
|
|
1246 int i;
|
|
1247 Extent_List *list = data->extents;
|
|
1248
|
|
1249 /* Vbuffer_defaults and Vbuffer_local_symbols are buffer-like
|
|
1250 objects that are created specially and never have their extent
|
|
1251 list initialized (or rather, it is set to zero in
|
|
1252 nuke_all_buffer_slots()). However, these objects get
|
|
1253 garbage-collected so we have to deal.
|
|
1254
|
|
1255 (Also the list can be zero when we're dealing with a destroyed
|
|
1256 buffer.) */
|
|
1257
|
|
1258 if (list)
|
|
1259 {
|
|
1260 for (i = 0; i < extent_list_num_els (list); i++)
|
|
1261 {
|
|
1262 struct extent *extent = extent_list_at (list, i, 0);
|
793
|
1263 Lisp_Object exobj = wrap_extent (extent);
|
|
1264
|
428
|
1265 mark_object (exobj);
|
|
1266 }
|
|
1267 }
|
|
1268
|
|
1269 return Qnil;
|
|
1270 }
|
|
1271
|
3263
|
1272 #ifdef NEW_GC
|
|
1273 DEFINE_LRECORD_IMPLEMENTATION ("extent-info", extent_info,
|
|
1274 0, /*dumpable-flag*/
|
|
1275 mark_extent_info, internal_object_printer,
|
|
1276 0, 0, 0,
|
|
1277 extent_info_description,
|
|
1278 struct extent_info);
|
|
1279 #else /* not NEW_GC */
|
428
|
1280 static void
|
|
1281 finalize_extent_info (void *header, int for_disksave)
|
|
1282 {
|
|
1283 struct extent_info *data = (struct extent_info *) header;
|
|
1284
|
|
1285 if (for_disksave)
|
|
1286 return;
|
|
1287
|
3092
|
1288 data->soe = 0;
|
|
1289 data->extents = 0;
|
428
|
1290 if (data->soe)
|
|
1291 {
|
|
1292 free_soe (data->soe);
|
|
1293 data->soe = 0;
|
|
1294 }
|
|
1295 if (data->extents)
|
|
1296 {
|
|
1297 free_extent_list (data->extents);
|
|
1298 data->extents = 0;
|
|
1299 }
|
|
1300 }
|
|
1301
|
934
|
1302 DEFINE_LRECORD_IMPLEMENTATION ("extent-info", extent_info,
|
|
1303 0, /*dumpable-flag*/
|
|
1304 mark_extent_info, internal_object_printer,
|
|
1305 finalize_extent_info, 0, 0,
|
1204
|
1306 extent_info_description,
|
934
|
1307 struct extent_info);
|
3263
|
1308 #endif /* not NEW_GC */
|
428
|
1309
|
|
1310 static Lisp_Object
|
|
1311 allocate_extent_info (void)
|
|
1312 {
|
|
1313 Lisp_Object extent_info;
|
|
1314 struct extent_info *data =
|
3017
|
1315 ALLOC_LCRECORD_TYPE (struct extent_info, &lrecord_extent_info);
|
428
|
1316
|
793
|
1317 extent_info = wrap_extent_info (data);
|
428
|
1318 data->extents = allocate_extent_list ();
|
|
1319 data->soe = 0;
|
|
1320 return extent_info;
|
|
1321 }
|
|
1322
|
|
1323 void
|
|
1324 flush_cached_extent_info (Lisp_Object extent_info)
|
|
1325 {
|
|
1326 struct extent_info *data = XEXTENT_INFO (extent_info);
|
|
1327
|
|
1328 if (data->soe)
|
|
1329 {
|
3092
|
1330 #ifndef NEW_GC
|
428
|
1331 free_soe (data->soe);
|
3092
|
1332 #endif /* not NEW_GC */
|
428
|
1333 data->soe = 0;
|
|
1334 }
|
|
1335 }
|
|
1336
|
|
1337
|
|
1338 /************************************************************************/
|
|
1339 /* Buffer/string extent primitives */
|
|
1340 /************************************************************************/
|
|
1341
|
|
1342 /* The functions in this section are the ONLY ones that should know
|
|
1343 about the internal implementation of the extent lists. Other functions
|
|
1344 should only know that there are two orderings on extents, the "display"
|
|
1345 order (sorted by start position, basically) and the e-order (sorted
|
|
1346 by end position, basically), and that certain operations are provided
|
|
1347 to manipulate the list. */
|
|
1348
|
|
1349 /* ------------------------------- */
|
|
1350 /* basic primitives */
|
|
1351 /* ------------------------------- */
|
|
1352
|
|
1353 static Lisp_Object
|
|
1354 decode_buffer_or_string (Lisp_Object object)
|
|
1355 {
|
|
1356 if (NILP (object))
|
793
|
1357 object = wrap_buffer (current_buffer);
|
428
|
1358 else if (BUFFERP (object))
|
|
1359 CHECK_LIVE_BUFFER (object);
|
|
1360 else if (STRINGP (object))
|
|
1361 ;
|
|
1362 else
|
|
1363 dead_wrong_type_argument (Qbuffer_or_string_p, object);
|
|
1364
|
|
1365 return object;
|
|
1366 }
|
|
1367
|
|
1368 EXTENT
|
|
1369 extent_ancestor_1 (EXTENT e)
|
|
1370 {
|
|
1371 while (e->flags.has_parent)
|
|
1372 {
|
|
1373 /* There should be no circularities except in case of a logic
|
|
1374 error somewhere in the extent code */
|
|
1375 e = XEXTENT (XEXTENT_AUXILIARY (XCAR (e->plist))->parent);
|
|
1376 }
|
|
1377 return e;
|
|
1378 }
|
|
1379
|
|
1380 /* Given an extent object (string or buffer or nil), return its extent info.
|
|
1381 This may be 0 for a string. */
|
|
1382
|
|
1383 static struct extent_info *
|
|
1384 buffer_or_string_extent_info (Lisp_Object object)
|
|
1385 {
|
|
1386 if (STRINGP (object))
|
|
1387 {
|
793
|
1388 Lisp_Object plist = XSTRING_PLIST (object);
|
428
|
1389 if (!CONSP (plist) || !EXTENT_INFOP (XCAR (plist)))
|
|
1390 return 0;
|
|
1391 return XEXTENT_INFO (XCAR (plist));
|
|
1392 }
|
|
1393 else if (NILP (object))
|
|
1394 return 0;
|
|
1395 else
|
|
1396 return XEXTENT_INFO (XBUFFER (object)->extent_info);
|
|
1397 }
|
|
1398
|
|
1399 /* Given a string or buffer, return its extent list. This may be
|
|
1400 0 for a string. */
|
|
1401
|
|
1402 static Extent_List *
|
|
1403 buffer_or_string_extent_list (Lisp_Object object)
|
|
1404 {
|
|
1405 struct extent_info *info = buffer_or_string_extent_info (object);
|
|
1406
|
|
1407 if (!info)
|
|
1408 return 0;
|
|
1409 return info->extents;
|
|
1410 }
|
|
1411
|
|
1412 /* Given a string or buffer, return its extent info. If it's not there,
|
|
1413 create it. */
|
|
1414
|
|
1415 static struct extent_info *
|
|
1416 buffer_or_string_extent_info_force (Lisp_Object object)
|
|
1417 {
|
|
1418 struct extent_info *info = buffer_or_string_extent_info (object);
|
|
1419
|
|
1420 if (!info)
|
|
1421 {
|
|
1422 Lisp_Object extent_info;
|
|
1423
|
|
1424 assert (STRINGP (object)); /* should never happen for buffers --
|
|
1425 the only buffers without an extent
|
|
1426 info are those after finalization,
|
|
1427 destroyed buffers, or special
|
|
1428 Lisp-inaccessible buffer objects. */
|
|
1429 extent_info = allocate_extent_info ();
|
793
|
1430 XSTRING_PLIST (object) = Fcons (extent_info, XSTRING_PLIST (object));
|
428
|
1431 return XEXTENT_INFO (extent_info);
|
|
1432 }
|
|
1433
|
|
1434 return info;
|
|
1435 }
|
|
1436
|
|
1437 /* Detach all the extents in OBJECT. Called from redisplay. */
|
|
1438
|
|
1439 void
|
|
1440 detach_all_extents (Lisp_Object object)
|
|
1441 {
|
|
1442 struct extent_info *data = buffer_or_string_extent_info (object);
|
|
1443
|
|
1444 if (data)
|
|
1445 {
|
|
1446 if (data->extents)
|
|
1447 {
|
|
1448 int i;
|
|
1449
|
|
1450 for (i = 0; i < extent_list_num_els (data->extents); i++)
|
|
1451 {
|
|
1452 EXTENT e = extent_list_at (data->extents, i, 0);
|
|
1453 /* No need to do detach_extent(). Just nuke the damn things,
|
|
1454 which results in the equivalent but faster. */
|
|
1455 set_extent_start (e, -1);
|
|
1456 set_extent_end (e, -1);
|
|
1457 }
|
3466
|
1458
|
|
1459 /* But we need to clear all the lists containing extents or
|
|
1460 havoc will result. */
|
|
1461 extent_list_delete_all (data->extents);
|
428
|
1462 }
|
|
1463 soe_invalidate (object);
|
|
1464 }
|
|
1465 }
|
|
1466
|
|
1467
|
|
1468 void
|
|
1469 init_buffer_extents (struct buffer *b)
|
|
1470 {
|
|
1471 b->extent_info = allocate_extent_info ();
|
|
1472 }
|
|
1473
|
|
1474 void
|
|
1475 uninit_buffer_extents (struct buffer *b)
|
|
1476 {
|
3092
|
1477 #ifndef NEW_GC
|
428
|
1478 struct extent_info *data = XEXTENT_INFO (b->extent_info);
|
3092
|
1479 #endif /* not NEW_GC */
|
428
|
1480
|
|
1481 /* Don't destroy the extents here -- there may still be children
|
|
1482 extents pointing to the extents. */
|
771
|
1483 detach_all_extents (wrap_buffer (b));
|
3092
|
1484 #ifndef NEW_GC
|
428
|
1485 finalize_extent_info (data, 0);
|
3092
|
1486 #endif /* not NEW_GC */
|
428
|
1487 }
|
|
1488
|
|
1489 /* Retrieve the extent list that an extent is a member of; the
|
|
1490 return value will never be 0 except in destroyed buffers (in which
|
|
1491 case the only extents that can refer to this buffer are detached
|
|
1492 ones). */
|
|
1493
|
|
1494 #define extent_extent_list(e) buffer_or_string_extent_list (extent_object (e))
|
|
1495
|
|
1496 /* ------------------------------- */
|
|
1497 /* stack of extents */
|
|
1498 /* ------------------------------- */
|
|
1499
|
|
1500 #ifdef ERROR_CHECK_EXTENTS
|
|
1501
|
771
|
1502 /* See unicode.c for more about sledgehammer checks */
|
|
1503
|
428
|
1504 void
|
|
1505 sledgehammer_extent_check (Lisp_Object object)
|
|
1506 {
|
|
1507 int i;
|
|
1508 int endp;
|
|
1509 Extent_List *el = buffer_or_string_extent_list (object);
|
|
1510 struct buffer *buf = 0;
|
|
1511
|
|
1512 if (!el)
|
|
1513 return;
|
|
1514
|
|
1515 if (BUFFERP (object))
|
|
1516 buf = XBUFFER (object);
|
|
1517
|
|
1518 for (endp = 0; endp < 2; endp++)
|
|
1519 for (i = 1; i < extent_list_num_els (el); i++)
|
|
1520 {
|
|
1521 EXTENT e1 = extent_list_at (el, i-1, endp);
|
|
1522 EXTENT e2 = extent_list_at (el, i, endp);
|
|
1523 if (buf)
|
|
1524 {
|
|
1525 assert (extent_start (e1) <= buf->text->gpt ||
|
|
1526 extent_start (e1) > buf->text->gpt + buf->text->gap_size);
|
|
1527 assert (extent_end (e1) <= buf->text->gpt ||
|
|
1528 extent_end (e1) > buf->text->gpt + buf->text->gap_size);
|
|
1529 }
|
|
1530 assert (extent_start (e1) <= extent_end (e1));
|
|
1531 assert (endp ? (EXTENT_E_LESS_EQUAL (e1, e2)) :
|
|
1532 (EXTENT_LESS_EQUAL (e1, e2)));
|
|
1533 }
|
|
1534 }
|
|
1535
|
|
1536 #endif
|
|
1537
|
|
1538 static Stack_Of_Extents *
|
|
1539 buffer_or_string_stack_of_extents (Lisp_Object object)
|
|
1540 {
|
|
1541 struct extent_info *info = buffer_or_string_extent_info (object);
|
|
1542 if (!info)
|
|
1543 return 0;
|
|
1544 return info->soe;
|
|
1545 }
|
|
1546
|
|
1547 static Stack_Of_Extents *
|
|
1548 buffer_or_string_stack_of_extents_force (Lisp_Object object)
|
|
1549 {
|
|
1550 struct extent_info *info = buffer_or_string_extent_info_force (object);
|
|
1551 if (!info->soe)
|
|
1552 info->soe = allocate_soe ();
|
|
1553 return info->soe;
|
|
1554 }
|
|
1555
|
983
|
1556 /* #### don't even think of #define'ing this, the prototype of
|
|
1557 print_extent_1 has changed! */
|
428
|
1558 /* #define SOE_DEBUG */
|
|
1559
|
|
1560 #ifdef SOE_DEBUG
|
|
1561
|
|
1562 static void print_extent_1 (char *buf, Lisp_Object extent);
|
|
1563
|
|
1564 static void
|
|
1565 print_extent_2 (EXTENT e)
|
|
1566 {
|
|
1567 Lisp_Object extent;
|
|
1568 char buf[200];
|
|
1569
|
793
|
1570 extent = wrap_extent (e);
|
428
|
1571 print_extent_1 (buf, extent);
|
|
1572 fputs (buf, stdout);
|
|
1573 }
|
|
1574
|
|
1575 static void
|
|
1576 soe_dump (Lisp_Object obj)
|
|
1577 {
|
|
1578 int i;
|
|
1579 Stack_Of_Extents *soe = buffer_or_string_stack_of_extents (obj);
|
|
1580 Extent_List *sel;
|
|
1581 int endp;
|
|
1582
|
|
1583 if (!soe)
|
|
1584 {
|
|
1585 printf ("No SOE");
|
|
1586 return;
|
|
1587 }
|
|
1588 sel = soe->extents;
|
826
|
1589 printf ("SOE pos is %d (memxpos %d)\n",
|
428
|
1590 soe->pos < 0 ? soe->pos :
|
826
|
1591 buffer_or_string_memxpos_to_bytexpos (obj, soe->pos),
|
428
|
1592 soe->pos);
|
|
1593 for (endp = 0; endp < 2; endp++)
|
|
1594 {
|
|
1595 printf (endp ? "SOE end:" : "SOE start:");
|
|
1596 for (i = 0; i < extent_list_num_els (sel); i++)
|
|
1597 {
|
|
1598 EXTENT e = extent_list_at (sel, i, endp);
|
|
1599 putchar ('\t');
|
|
1600 print_extent_2 (e);
|
|
1601 }
|
|
1602 putchar ('\n');
|
|
1603 }
|
|
1604 putchar ('\n');
|
|
1605 }
|
|
1606
|
|
1607 #endif
|
|
1608
|
|
1609 /* Insert EXTENT into OBJ's stack of extents, if necessary. */
|
|
1610
|
|
1611 static void
|
|
1612 soe_insert (Lisp_Object obj, EXTENT extent)
|
|
1613 {
|
|
1614 Stack_Of_Extents *soe = buffer_or_string_stack_of_extents (obj);
|
|
1615
|
|
1616 #ifdef SOE_DEBUG
|
|
1617 printf ("Inserting into SOE: ");
|
|
1618 print_extent_2 (extent);
|
|
1619 putchar ('\n');
|
|
1620 #endif
|
|
1621 if (!soe || soe->pos < extent_start (extent) ||
|
|
1622 soe->pos > extent_end (extent))
|
|
1623 {
|
|
1624 #ifdef SOE_DEBUG
|
|
1625 printf ("(not needed)\n\n");
|
|
1626 #endif
|
|
1627 return;
|
|
1628 }
|
|
1629 extent_list_insert (soe->extents, extent);
|
|
1630 #ifdef SOE_DEBUG
|
|
1631 puts ("SOE afterwards is:");
|
|
1632 soe_dump (obj);
|
|
1633 #endif
|
|
1634 }
|
|
1635
|
|
1636 /* Delete EXTENT from OBJ's stack of extents, if necessary. */
|
|
1637
|
|
1638 static void
|
|
1639 soe_delete (Lisp_Object obj, EXTENT extent)
|
|
1640 {
|
|
1641 Stack_Of_Extents *soe = buffer_or_string_stack_of_extents (obj);
|
|
1642
|
|
1643 #ifdef SOE_DEBUG
|
|
1644 printf ("Deleting from SOE: ");
|
|
1645 print_extent_2 (extent);
|
|
1646 putchar ('\n');
|
|
1647 #endif
|
|
1648 if (!soe || soe->pos < extent_start (extent) ||
|
|
1649 soe->pos > extent_end (extent))
|
|
1650 {
|
|
1651 #ifdef SOE_DEBUG
|
|
1652 puts ("(not needed)\n");
|
|
1653 #endif
|
|
1654 return;
|
|
1655 }
|
|
1656 extent_list_delete (soe->extents, extent);
|
|
1657 #ifdef SOE_DEBUG
|
|
1658 puts ("SOE afterwards is:");
|
|
1659 soe_dump (obj);
|
|
1660 #endif
|
|
1661 }
|
|
1662
|
|
1663 /* Move OBJ's stack of extents to lie over the specified position. */
|
|
1664
|
|
1665 static void
|
826
|
1666 soe_move (Lisp_Object obj, Memxpos pos)
|
428
|
1667 {
|
|
1668 Stack_Of_Extents *soe = buffer_or_string_stack_of_extents_force (obj);
|
|
1669 Extent_List *sel = soe->extents;
|
|
1670 int numsoe = extent_list_num_els (sel);
|
|
1671 Extent_List *bel = buffer_or_string_extent_list (obj);
|
|
1672 int direction;
|
|
1673 int endp;
|
|
1674
|
|
1675 #ifdef ERROR_CHECK_EXTENTS
|
|
1676 assert (bel);
|
|
1677 #endif
|
|
1678
|
|
1679 #ifdef SOE_DEBUG
|
826
|
1680 printf ("Moving SOE from %d (memxpos %d) to %d (memxpos %d)\n",
|
428
|
1681 soe->pos < 0 ? soe->pos :
|
826
|
1682 buffer_or_string_memxpos_to_bytexpos (obj, soe->pos), soe->pos,
|
|
1683 buffer_or_string_memxpos_to_bytexpos (obj, pos), pos);
|
428
|
1684 #endif
|
|
1685 if (soe->pos < pos)
|
|
1686 {
|
|
1687 direction = 1;
|
|
1688 endp = 0;
|
|
1689 }
|
|
1690 else if (soe->pos > pos)
|
|
1691 {
|
|
1692 direction = -1;
|
|
1693 endp = 1;
|
|
1694 }
|
|
1695 else
|
|
1696 {
|
|
1697 #ifdef SOE_DEBUG
|
|
1698 puts ("(not needed)\n");
|
|
1699 #endif
|
|
1700 return;
|
|
1701 }
|
|
1702
|
|
1703 /* For DIRECTION = 1: Any extent that overlaps POS is either in the
|
|
1704 SOE (if the extent starts at or before SOE->POS) or is greater
|
|
1705 (in the display order) than any extent in the SOE (if it starts
|
|
1706 after SOE->POS).
|
|
1707
|
|
1708 For DIRECTION = -1: Any extent that overlaps POS is either in the
|
|
1709 SOE (if the extent ends at or after SOE->POS) or is less (in the
|
|
1710 e-order) than any extent in the SOE (if it ends before SOE->POS).
|
|
1711
|
|
1712 We proceed in two stages:
|
|
1713
|
|
1714 1) delete all extents in the SOE that don't overlap POS.
|
|
1715 2) insert all extents into the SOE that start (or end, when
|
|
1716 DIRECTION = -1) in (SOE->POS, POS] and that overlap
|
|
1717 POS. (Don't include SOE->POS in the range because those
|
|
1718 extents would already be in the SOE.)
|
|
1719 */
|
|
1720
|
|
1721 /* STAGE 1. */
|
|
1722
|
|
1723 if (numsoe > 0)
|
|
1724 {
|
|
1725 /* Delete all extents in the SOE that don't overlap POS.
|
|
1726 This is all extents that end before (or start after,
|
|
1727 if DIRECTION = -1) POS.
|
|
1728 */
|
|
1729
|
|
1730 /* Deleting extents from the SOE is tricky because it changes
|
|
1731 the positions of extents. If we are deleting in the forward
|
|
1732 direction we have to call extent_list_at() on the same position
|
|
1733 over and over again because positions after the deleted element
|
|
1734 get shifted back by 1. To make life simplest, we delete forward
|
|
1735 irrespective of DIRECTION.
|
|
1736 */
|
|
1737 int start, end;
|
|
1738 int i;
|
|
1739
|
|
1740 if (direction > 0)
|
|
1741 {
|
|
1742 start = 0;
|
|
1743 end = extent_list_locate_from_pos (sel, pos, 1);
|
|
1744 }
|
|
1745 else
|
|
1746 {
|
|
1747 start = extent_list_locate_from_pos (sel, pos+1, 0);
|
|
1748 end = numsoe;
|
|
1749 }
|
|
1750
|
|
1751 for (i = start; i < end; i++)
|
|
1752 extent_list_delete (sel, extent_list_at (sel, start /* see above */,
|
|
1753 !endp));
|
|
1754 }
|
|
1755
|
|
1756 /* STAGE 2. */
|
|
1757
|
|
1758 {
|
|
1759 int start_pos;
|
|
1760
|
|
1761 if (direction < 0)
|
|
1762 start_pos = extent_list_locate_from_pos (bel, soe->pos, endp) - 1;
|
|
1763 else
|
|
1764 start_pos = extent_list_locate_from_pos (bel, soe->pos + 1, endp);
|
|
1765
|
|
1766 for (; start_pos >= 0 && start_pos < extent_list_num_els (bel);
|
|
1767 start_pos += direction)
|
|
1768 {
|
|
1769 EXTENT e = extent_list_at (bel, start_pos, endp);
|
|
1770 if ((direction > 0) ?
|
|
1771 (extent_start (e) > pos) :
|
|
1772 (extent_end (e) < pos))
|
|
1773 break; /* All further extents lie on the far side of POS
|
|
1774 and thus can't overlap. */
|
|
1775 if ((direction > 0) ?
|
|
1776 (extent_end (e) >= pos) :
|
|
1777 (extent_start (e) <= pos))
|
|
1778 extent_list_insert (sel, e);
|
|
1779 }
|
|
1780 }
|
|
1781
|
|
1782 soe->pos = pos;
|
|
1783 #ifdef SOE_DEBUG
|
|
1784 puts ("SOE afterwards is:");
|
|
1785 soe_dump (obj);
|
|
1786 #endif
|
|
1787 }
|
|
1788
|
|
1789 static void
|
|
1790 soe_invalidate (Lisp_Object obj)
|
|
1791 {
|
|
1792 Stack_Of_Extents *soe = buffer_or_string_stack_of_extents (obj);
|
|
1793
|
|
1794 if (soe)
|
|
1795 {
|
|
1796 extent_list_delete_all (soe->extents);
|
|
1797 soe->pos = -1;
|
|
1798 }
|
|
1799 }
|
|
1800
|
|
1801 static struct stack_of_extents *
|
|
1802 allocate_soe (void)
|
|
1803 {
|
3092
|
1804 #ifdef NEW_GC
|
|
1805 struct stack_of_extents *soe =
|
|
1806 alloc_lrecord_type (struct stack_of_extents, &lrecord_stack_of_extents);
|
|
1807 #else /* not NEW_GC */
|
428
|
1808 struct stack_of_extents *soe = xnew_and_zero (struct stack_of_extents);
|
3092
|
1809 #endif /* not NEW_GC */
|
428
|
1810 soe->extents = allocate_extent_list ();
|
|
1811 soe->pos = -1;
|
|
1812 return soe;
|
|
1813 }
|
|
1814
|
3092
|
1815 #ifndef NEW_GC
|
428
|
1816 static void
|
|
1817 free_soe (struct stack_of_extents *soe)
|
|
1818 {
|
|
1819 free_extent_list (soe->extents);
|
1726
|
1820 xfree (soe, struct stack_of_extents *);
|
428
|
1821 }
|
3092
|
1822 #endif /* not NEW_GC */
|
428
|
1823
|
|
1824 /* ------------------------------- */
|
|
1825 /* other primitives */
|
|
1826 /* ------------------------------- */
|
|
1827
|
|
1828 /* Return the start (endp == 0) or end (endp == 1) of an extent as
|
|
1829 a byte index. If you want the value as a memory index, use
|
|
1830 extent_endpoint(). If you want the value as a buffer position,
|
826
|
1831 use extent_endpoint_char(). */
|
|
1832
|
|
1833 Bytexpos
|
|
1834 extent_endpoint_byte (EXTENT extent, int endp)
|
|
1835 {
|
|
1836 assert (EXTENT_LIVE_P (extent));
|
|
1837 assert (!extent_detached_p (extent));
|
|
1838 {
|
|
1839 Memxpos i = endp ? extent_end (extent) : extent_start (extent);
|
|
1840 Lisp_Object obj = extent_object (extent);
|
|
1841 return buffer_or_string_memxpos_to_bytexpos (obj, i);
|
|
1842 }
|
|
1843 }
|
|
1844
|
|
1845 Charxpos
|
|
1846 extent_endpoint_char (EXTENT extent, int endp)
|
428
|
1847 {
|
|
1848 assert (EXTENT_LIVE_P (extent));
|
|
1849 assert (!extent_detached_p (extent));
|
|
1850 {
|
826
|
1851 Memxpos i = endp ? extent_end (extent) : extent_start (extent);
|
428
|
1852 Lisp_Object obj = extent_object (extent);
|
826
|
1853 return buffer_or_string_memxpos_to_charxpos (obj, i);
|
428
|
1854 }
|
|
1855 }
|
|
1856
|
|
1857 static void
|
826
|
1858 signal_single_extent_changed (EXTENT extent, Lisp_Object property,
|
2286
|
1859 Bytexpos UNUSED (old_start),
|
|
1860 Bytexpos UNUSED (old_end))
|
826
|
1861 {
|
|
1862 EXTENT anc = extent_ancestor (extent);
|
|
1863 /* Redisplay checks */
|
|
1864 if (NILP (property) ?
|
|
1865 (!NILP (extent_face (anc)) ||
|
|
1866 !NILP (extent_begin_glyph (anc)) ||
|
|
1867 !NILP (extent_end_glyph (anc)) ||
|
|
1868 !NILP (extent_mouse_face (anc)) ||
|
|
1869 !NILP (extent_invisible (anc)) ||
|
|
1870 !NILP (extent_initial_redisplay_function (anc))) :
|
|
1871 EQ (property, Qface) ||
|
|
1872 EQ (property, Qmouse_face) ||
|
|
1873 EQ (property, Qbegin_glyph) ||
|
|
1874 EQ (property, Qend_glyph) ||
|
|
1875 EQ (property, Qbegin_glyph_layout) ||
|
|
1876 EQ (property, Qend_glyph_layout) ||
|
|
1877 EQ (property, Qinvisible) ||
|
|
1878 EQ (property, Qinitial_redisplay_function) ||
|
|
1879 EQ (property, Qpriority))
|
|
1880 {
|
|
1881 Lisp_Object object = extent_object (extent);
|
|
1882
|
|
1883 if (extent_detached_p (extent))
|
|
1884 return;
|
|
1885
|
|
1886 else if (STRINGP (object))
|
|
1887 {
|
|
1888 /* #### Changes to string extents can affect redisplay if they are
|
|
1889 in the modeline or in the gutters.
|
|
1890
|
|
1891 If the extent is in some generated-modeline-string: when we
|
|
1892 change an extent in generated-modeline-string, this changes its
|
|
1893 parent, which is in `modeline-format', so we should force the
|
|
1894 modeline to be updated. But how to determine whether a string
|
|
1895 is a `generated-modeline-string'? Looping through all buffers
|
|
1896 is not very efficient. Should we add all
|
|
1897 `generated-modeline-string' strings to a hash table? Maybe
|
|
1898 efficiency is not the greatest concern here and there's no big
|
|
1899 loss in looping over the buffers.
|
|
1900
|
|
1901 If the extent is in a gutter we mark the gutter as
|
|
1902 changed. This means (a) we can update extents in the gutters
|
|
1903 when we need it. (b) we don't have to update the gutters when
|
|
1904 only extents attached to buffers have changed. */
|
|
1905
|
|
1906 if (!in_modeline_generation)
|
|
1907 MARK_EXTENTS_CHANGED;
|
|
1908 gutter_extent_signal_changed_region_maybe
|
|
1909 (object, extent_endpoint_char (extent, 0),
|
|
1910 extent_endpoint_char (extent, 1));
|
|
1911 }
|
|
1912 else if (BUFFERP (object))
|
|
1913 {
|
|
1914 struct buffer *b;
|
|
1915 b = XBUFFER (object);
|
|
1916 BUF_FACECHANGE (b)++;
|
|
1917 MARK_EXTENTS_CHANGED;
|
|
1918 if (NILP (property) ? !NILP (extent_invisible (anc)) :
|
|
1919 EQ (property, Qinvisible))
|
|
1920 MARK_CLIP_CHANGED;
|
|
1921 buffer_extent_signal_changed_region
|
|
1922 (b, extent_endpoint_char (extent, 0),
|
|
1923 extent_endpoint_char (extent, 1));
|
|
1924 }
|
|
1925 }
|
|
1926
|
|
1927 /* Check for syntax table property change */
|
|
1928 if (NILP (property) ? !NILP (Fextent_property (wrap_extent (extent),
|
|
1929 Qsyntax_table, Qnil)) :
|
|
1930 EQ (property, Qsyntax_table))
|
3250
|
1931 signal_syntax_cache_extent_changed (extent);
|
826
|
1932 }
|
|
1933
|
|
1934 /* Make note that a change has happened in EXTENT. The change was either
|
|
1935 to a property or to the endpoints (but not both at once). If PROPERTY
|
|
1936 is non-nil, the change happened to that property; otherwise, the change
|
|
1937 happened to the endpoints, and the old ones are given. Currently, all
|
|
1938 endpoints changes are in the form of two signals, a detach followed by
|
|
1939 an attach, and when detaching, we are signalled before the extent is
|
|
1940 detached. (You can distinguish a detach from an attach because the
|
|
1941 latter has old_start == -1 and old_end == -1.) (#### We don't currently
|
|
1942 give the old property. If someone needs that, this will have to
|
|
1943 change.) KLUDGE: If PROPERTY is Qt, all properties may have changed
|
|
1944 because the parent was changed. #### We need to handle this properly, by
|
|
1945 mapping over properties. */
|
|
1946
|
|
1947 static void
|
|
1948 signal_extent_changed (EXTENT extent, Lisp_Object property,
|
|
1949 Bytexpos old_start, Bytexpos old_end,
|
|
1950 int descendants_too)
|
|
1951 {
|
428
|
1952 /* we could easily encounter a detached extent while traversing the
|
|
1953 children, but we should never be able to encounter a dead extent. */
|
|
1954 assert (EXTENT_LIVE_P (extent));
|
|
1955
|
|
1956 if (descendants_too)
|
|
1957 {
|
|
1958 Lisp_Object children = extent_children (extent);
|
|
1959
|
|
1960 if (!NILP (children))
|
|
1961 {
|
826
|
1962 /* first process all of the extent's children. We will lose
|
|
1963 big-time if there are any circularities here, so we sure as
|
|
1964 hell better ensure that there aren't. */
|
831
|
1965 LIST_LOOP_2 (child, XWEAK_LIST_LIST (children))
|
|
1966 signal_extent_changed (XEXTENT (child), property, old_start,
|
840
|
1967 old_end, descendants_too);
|
428
|
1968 }
|
|
1969 }
|
|
1970
|
826
|
1971 /* now process the extent itself. */
|
|
1972 signal_single_extent_changed (extent, property, old_start, old_end);
|
|
1973 }
|
428
|
1974
|
|
1975 static void
|
826
|
1976 signal_extent_property_changed (EXTENT extent, Lisp_Object property,
|
|
1977 int descendants_too)
|
|
1978 {
|
|
1979 signal_extent_changed (extent, property, 0, 0, descendants_too);
|
428
|
1980 }
|
|
1981
|
|
1982 static EXTENT
|
|
1983 make_extent_detached (Lisp_Object object)
|
|
1984 {
|
|
1985 EXTENT extent = allocate_extent ();
|
|
1986
|
|
1987 assert (NILP (object) || STRINGP (object) ||
|
|
1988 (BUFFERP (object) && BUFFER_LIVE_P (XBUFFER (object))));
|
|
1989 extent_object (extent) = object;
|
|
1990 /* Now make sure the extent info exists. */
|
|
1991 if (!NILP (object))
|
|
1992 buffer_or_string_extent_info_force (object);
|
|
1993 return extent;
|
|
1994 }
|
|
1995
|
|
1996 /* A "real" extent is any extent other than the internal (not-user-visible)
|
|
1997 extents used by `map-extents'. */
|
|
1998
|
|
1999 static EXTENT
|
|
2000 real_extent_at_forward (Extent_List *el, int pos, int endp)
|
|
2001 {
|
|
2002 for (; pos < extent_list_num_els (el); pos++)
|
|
2003 {
|
|
2004 EXTENT e = extent_list_at (el, pos, endp);
|
|
2005 if (!extent_internal_p (e))
|
|
2006 return e;
|
|
2007 }
|
|
2008 return 0;
|
|
2009 }
|
|
2010
|
|
2011 static EXTENT
|
|
2012 real_extent_at_backward (Extent_List *el, int pos, int endp)
|
|
2013 {
|
|
2014 for (; pos >= 0; pos--)
|
|
2015 {
|
|
2016 EXTENT e = extent_list_at (el, pos, endp);
|
|
2017 if (!extent_internal_p (e))
|
|
2018 return e;
|
|
2019 }
|
|
2020 return 0;
|
|
2021 }
|
|
2022
|
|
2023 static EXTENT
|
|
2024 extent_first (Lisp_Object obj)
|
|
2025 {
|
|
2026 Extent_List *el = buffer_or_string_extent_list (obj);
|
|
2027
|
|
2028 if (!el)
|
|
2029 return 0;
|
|
2030 return real_extent_at_forward (el, 0, 0);
|
|
2031 }
|
|
2032
|
|
2033 #ifdef DEBUG_XEMACS
|
|
2034 static EXTENT
|
|
2035 extent_e_first (Lisp_Object obj)
|
|
2036 {
|
|
2037 Extent_List *el = buffer_or_string_extent_list (obj);
|
|
2038
|
|
2039 if (!el)
|
|
2040 return 0;
|
|
2041 return real_extent_at_forward (el, 0, 1);
|
|
2042 }
|
|
2043 #endif
|
|
2044
|
|
2045 static EXTENT
|
|
2046 extent_next (EXTENT e)
|
|
2047 {
|
|
2048 Extent_List *el = extent_extent_list (e);
|
|
2049 int foundp;
|
|
2050 int pos = extent_list_locate (el, e, 0, &foundp);
|
|
2051 assert (foundp);
|
|
2052 return real_extent_at_forward (el, pos+1, 0);
|
|
2053 }
|
|
2054
|
|
2055 #ifdef DEBUG_XEMACS
|
|
2056 static EXTENT
|
|
2057 extent_e_next (EXTENT e)
|
|
2058 {
|
|
2059 Extent_List *el = extent_extent_list (e);
|
|
2060 int foundp;
|
|
2061 int pos = extent_list_locate (el, e, 1, &foundp);
|
|
2062 assert (foundp);
|
|
2063 return real_extent_at_forward (el, pos+1, 1);
|
|
2064 }
|
|
2065 #endif
|
|
2066
|
|
2067 static EXTENT
|
|
2068 extent_last (Lisp_Object obj)
|
|
2069 {
|
|
2070 Extent_List *el = buffer_or_string_extent_list (obj);
|
|
2071
|
|
2072 if (!el)
|
|
2073 return 0;
|
|
2074 return real_extent_at_backward (el, extent_list_num_els (el) - 1, 0);
|
|
2075 }
|
|
2076
|
|
2077 #ifdef DEBUG_XEMACS
|
|
2078 static EXTENT
|
|
2079 extent_e_last (Lisp_Object obj)
|
|
2080 {
|
|
2081 Extent_List *el = buffer_or_string_extent_list (obj);
|
|
2082
|
|
2083 if (!el)
|
|
2084 return 0;
|
|
2085 return real_extent_at_backward (el, extent_list_num_els (el) - 1, 1);
|
|
2086 }
|
|
2087 #endif
|
|
2088
|
|
2089 static EXTENT
|
|
2090 extent_previous (EXTENT e)
|
|
2091 {
|
|
2092 Extent_List *el = extent_extent_list (e);
|
|
2093 int foundp;
|
|
2094 int pos = extent_list_locate (el, e, 0, &foundp);
|
|
2095 assert (foundp);
|
|
2096 return real_extent_at_backward (el, pos-1, 0);
|
|
2097 }
|
|
2098
|
|
2099 #ifdef DEBUG_XEMACS
|
|
2100 static EXTENT
|
|
2101 extent_e_previous (EXTENT e)
|
|
2102 {
|
|
2103 Extent_List *el = extent_extent_list (e);
|
|
2104 int foundp;
|
|
2105 int pos = extent_list_locate (el, e, 1, &foundp);
|
|
2106 assert (foundp);
|
|
2107 return real_extent_at_backward (el, pos-1, 1);
|
|
2108 }
|
|
2109 #endif
|
|
2110
|
|
2111 static void
|
|
2112 extent_attach (EXTENT extent)
|
|
2113 {
|
|
2114 Extent_List *el = extent_extent_list (extent);
|
|
2115
|
|
2116 extent_list_insert (el, extent);
|
|
2117 soe_insert (extent_object (extent), extent);
|
|
2118 /* only this extent changed */
|
826
|
2119 signal_extent_changed (extent, Qnil, -1, -1, 0);
|
428
|
2120 }
|
|
2121
|
|
2122 static void
|
|
2123 extent_detach (EXTENT extent)
|
|
2124 {
|
|
2125 Extent_List *el;
|
|
2126
|
|
2127 if (extent_detached_p (extent))
|
|
2128 return;
|
|
2129 el = extent_extent_list (extent);
|
|
2130
|
|
2131 /* call this before messing with the extent. */
|
826
|
2132 signal_extent_changed (extent, Qnil,
|
|
2133 extent_endpoint_byte (extent, 0),
|
|
2134 extent_endpoint_char (extent, 0),
|
|
2135 0);
|
428
|
2136 extent_list_delete (el, extent);
|
|
2137 soe_delete (extent_object (extent), extent);
|
|
2138 set_extent_start (extent, -1);
|
|
2139 set_extent_end (extent, -1);
|
|
2140 }
|
|
2141
|
|
2142 /* ------------------------------- */
|
|
2143 /* map-extents et al. */
|
|
2144 /* ------------------------------- */
|
|
2145
|
|
2146 /* Returns true iff map_extents() would visit the given extent.
|
|
2147 See the comments at map_extents() for info on the overlap rule.
|
|
2148 Assumes that all validation on the extent and buffer positions has
|
|
2149 already been performed (see Fextent_in_region_p ()).
|
|
2150 */
|
|
2151 static int
|
826
|
2152 extent_in_region_p (EXTENT extent, Bytexpos from, Bytexpos to,
|
428
|
2153 unsigned int flags)
|
|
2154 {
|
|
2155 Lisp_Object obj = extent_object (extent);
|
|
2156 Endpoint_Index start, end, exs, exe;
|
|
2157 int start_open, end_open;
|
|
2158 unsigned int all_extents_flags = flags & ME_ALL_EXTENTS_MASK;
|
|
2159 unsigned int in_region_flags = flags & ME_IN_REGION_MASK;
|
|
2160 int retval;
|
|
2161
|
|
2162 /* A zero-length region is treated as closed-closed. */
|
|
2163 if (from == to)
|
|
2164 {
|
|
2165 flags |= ME_END_CLOSED;
|
|
2166 flags &= ~ME_START_OPEN;
|
|
2167 }
|
|
2168
|
|
2169 /* So is a zero-length extent. */
|
|
2170 if (extent_start (extent) == extent_end (extent))
|
|
2171 start_open = 0, end_open = 0;
|
|
2172 /* `all_extents_flags' will almost always be zero. */
|
|
2173 else if (all_extents_flags == 0)
|
|
2174 {
|
|
2175 start_open = extent_start_open_p (extent);
|
|
2176 end_open = extent_end_open_p (extent);
|
|
2177 }
|
|
2178 else
|
|
2179 switch (all_extents_flags)
|
|
2180 {
|
|
2181 case ME_ALL_EXTENTS_CLOSED: start_open = 0, end_open = 0; break;
|
|
2182 case ME_ALL_EXTENTS_OPEN: start_open = 1, end_open = 1; break;
|
|
2183 case ME_ALL_EXTENTS_CLOSED_OPEN: start_open = 0, end_open = 1; break;
|
|
2184 case ME_ALL_EXTENTS_OPEN_CLOSED: start_open = 1, end_open = 0; break;
|
2500
|
2185 default: ABORT(); return 0;
|
428
|
2186 }
|
|
2187
|
826
|
2188 start = buffer_or_string_bytexpos_to_startind (obj, from,
|
428
|
2189 flags & ME_START_OPEN);
|
826
|
2190 end = buffer_or_string_bytexpos_to_endind (obj, to,
|
|
2191 ! (flags & ME_END_CLOSED));
|
|
2192 exs = memxpos_to_startind (extent_start (extent), start_open);
|
|
2193 exe = memxpos_to_endind (extent_end (extent), end_open);
|
428
|
2194
|
|
2195 /* It's easy to determine whether an extent lies *outside* the
|
|
2196 region -- just determine whether it's completely before
|
|
2197 or completely after the region. Reject all such extents, so
|
|
2198 we're now left with only the extents that overlap the region.
|
|
2199 */
|
|
2200
|
|
2201 if (exs > end || exe < start)
|
|
2202 return 0;
|
|
2203
|
|
2204 /* See if any further restrictions are called for. */
|
|
2205 /* in_region_flags will almost always be zero. */
|
|
2206 if (in_region_flags == 0)
|
|
2207 retval = 1;
|
|
2208 else
|
|
2209 switch (in_region_flags)
|
|
2210 {
|
|
2211 case ME_START_IN_REGION:
|
|
2212 retval = start <= exs && exs <= end; break;
|
|
2213 case ME_END_IN_REGION:
|
|
2214 retval = start <= exe && exe <= end; break;
|
|
2215 case ME_START_AND_END_IN_REGION:
|
|
2216 retval = start <= exs && exe <= end; break;
|
|
2217 case ME_START_OR_END_IN_REGION:
|
|
2218 retval = (start <= exs && exs <= end) || (start <= exe && exe <= end);
|
|
2219 break;
|
|
2220 default:
|
2500
|
2221 ABORT(); return 0;
|
428
|
2222 }
|
|
2223 return flags & ME_NEGATE_IN_REGION ? !retval : retval;
|
|
2224 }
|
|
2225
|
|
2226 struct map_extents_struct
|
|
2227 {
|
|
2228 Extent_List *el;
|
|
2229 Extent_List_Marker *mkr;
|
|
2230 EXTENT range;
|
|
2231 };
|
|
2232
|
|
2233 static Lisp_Object
|
|
2234 map_extents_unwind (Lisp_Object obj)
|
|
2235 {
|
|
2236 struct map_extents_struct *closure =
|
|
2237 (struct map_extents_struct *) get_opaque_ptr (obj);
|
|
2238 free_opaque_ptr (obj);
|
|
2239 if (closure->range)
|
|
2240 extent_detach (closure->range);
|
|
2241 if (closure->mkr)
|
|
2242 extent_list_delete_marker (closure->el, closure->mkr);
|
|
2243 return Qnil;
|
|
2244 }
|
|
2245
|
|
2246 /* This is the guts of `map-extents' and the other functions that
|
|
2247 map over extents. In theory the operation of this function is
|
|
2248 simple: just figure out what extents we're mapping over, and
|
|
2249 call the function on each one of them in the range. Unfortunately
|
|
2250 there are a wide variety of things that the mapping function
|
|
2251 might do, and we have to be very tricky to avoid getting messed
|
|
2252 up. Furthermore, this function needs to be very fast (it is
|
|
2253 called multiple times every time text is inserted or deleted
|
|
2254 from a buffer), and so we can't always afford the overhead of
|
|
2255 dealing with all the possible things that the mapping function
|
|
2256 might do; thus, there are many flags that can be specified
|
|
2257 indicating what the mapping function might or might not do.
|
|
2258
|
|
2259 The result of all this is that this is the most complicated
|
|
2260 function in this file. Change it at your own risk!
|
|
2261
|
|
2262 A potential simplification to the logic below is to determine
|
|
2263 all the extents that the mapping function should be called on
|
|
2264 before any calls are actually made and save them in an array.
|
|
2265 That introduces its own complications, however (the array
|
|
2266 needs to be marked for garbage-collection, and a static array
|
|
2267 cannot be used because map_extents() needs to be reentrant).
|
|
2268 Furthermore, the results might be a little less sensible than
|
|
2269 the logic below. */
|
|
2270
|
|
2271
|
|
2272 static void
|
826
|
2273 map_extents (Bytexpos from, Bytexpos to, map_extents_fun fn,
|
|
2274 void *arg, Lisp_Object obj, EXTENT after,
|
|
2275 unsigned int flags)
|
|
2276 {
|
|
2277 Memxpos st, en; /* range we're mapping over */
|
428
|
2278 EXTENT range = 0; /* extent for this, if ME_MIGHT_MODIFY_TEXT */
|
|
2279 Extent_List *el = 0; /* extent list we're iterating over */
|
|
2280 Extent_List_Marker *posm = 0; /* marker for extent list,
|
|
2281 if ME_MIGHT_MODIFY_EXTENTS */
|
|
2282 /* count and struct for unwind-protect, if ME_MIGHT_THROW */
|
1292
|
2283 int count = specpdl_depth ();
|
428
|
2284 struct map_extents_struct closure;
|
1292
|
2285 PROFILE_DECLARE ();
|
428
|
2286
|
|
2287 #ifdef ERROR_CHECK_EXTENTS
|
|
2288 assert (from <= to);
|
|
2289 assert (from >= buffer_or_string_absolute_begin_byte (obj) &&
|
|
2290 from <= buffer_or_string_absolute_end_byte (obj) &&
|
|
2291 to >= buffer_or_string_absolute_begin_byte (obj) &&
|
|
2292 to <= buffer_or_string_absolute_end_byte (obj));
|
|
2293 #endif
|
|
2294
|
|
2295 if (after)
|
|
2296 {
|
|
2297 assert (EQ (obj, extent_object (after)));
|
|
2298 assert (!extent_detached_p (after));
|
|
2299 }
|
|
2300
|
|
2301 el = buffer_or_string_extent_list (obj);
|
1292
|
2302 if (!el || !extent_list_num_els (el))
|
428
|
2303 return;
|
|
2304 el = 0;
|
|
2305
|
1292
|
2306 PROFILE_RECORD_ENTERING_SECTION (QSin_map_extents_internal);
|
|
2307
|
826
|
2308 st = buffer_or_string_bytexpos_to_memxpos (obj, from);
|
|
2309 en = buffer_or_string_bytexpos_to_memxpos (obj, to);
|
428
|
2310
|
|
2311 if (flags & ME_MIGHT_MODIFY_TEXT)
|
|
2312 {
|
|
2313 /* The mapping function might change the text in the buffer,
|
|
2314 so make an internal extent to hold the range we're mapping
|
|
2315 over. */
|
|
2316 range = make_extent_detached (obj);
|
|
2317 set_extent_start (range, st);
|
|
2318 set_extent_end (range, en);
|
|
2319 range->flags.start_open = flags & ME_START_OPEN;
|
|
2320 range->flags.end_open = !(flags & ME_END_CLOSED);
|
|
2321 range->flags.internal = 1;
|
|
2322 range->flags.detachable = 0;
|
|
2323 extent_attach (range);
|
|
2324 }
|
|
2325
|
|
2326 if (flags & ME_MIGHT_THROW)
|
|
2327 {
|
|
2328 /* The mapping function might throw past us so we need to use an
|
|
2329 unwind_protect() to eliminate the internal extent and range
|
|
2330 that we use. */
|
|
2331 closure.range = range;
|
|
2332 closure.mkr = 0;
|
|
2333 record_unwind_protect (map_extents_unwind,
|
|
2334 make_opaque_ptr (&closure));
|
|
2335 }
|
|
2336
|
|
2337 /* ---------- Figure out where we start and what direction
|
|
2338 we move in. This is the trickiest part of this
|
|
2339 function. ---------- */
|
|
2340
|
|
2341 /* If ME_START_IN_REGION, ME_END_IN_REGION or ME_START_AND_END_IN_REGION
|
|
2342 was specified and ME_NEGATE_IN_REGION was not specified, our job
|
|
2343 is simple because of the presence of the display order and e-order.
|
|
2344 (Note that theoretically do something similar for
|
|
2345 ME_START_OR_END_IN_REGION, but that would require more trickiness
|
|
2346 than it's worth to avoid hitting the same extent twice.)
|
|
2347
|
|
2348 In the general case, all the extents that overlap a range can be
|
|
2349 divided into two classes: those whose start position lies within
|
|
2350 the range (including the range's end but not including the
|
|
2351 range's start), and those that overlap the start position,
|
|
2352 i.e. those in the SOE for the start position. Or equivalently,
|
|
2353 the extents can be divided into those whose end position lies
|
|
2354 within the range and those in the SOE for the end position. Note
|
|
2355 that for this purpose we treat both the range and all extents in
|
|
2356 the buffer as closed on both ends. If this is not what the ME_
|
|
2357 flags specified, then we've mapped over a few too many extents,
|
|
2358 but no big deal because extent_in_region_p() will filter them
|
|
2359 out. Ideally, we could move the SOE to the closer of the range's
|
|
2360 two ends and work forwards or backwards from there. However, in
|
|
2361 order to make the semantics of the AFTER argument work out, we
|
|
2362 have to always go in the same direction; so we choose to always
|
|
2363 move the SOE to the start position.
|
|
2364
|
|
2365 When it comes time to do the SOE stage, we first call soe_move()
|
|
2366 so that the SOE gets set up. Note that the SOE might get
|
|
2367 changed while we are mapping over its contents. If we can
|
|
2368 guarantee that the SOE won't get moved to a new position, we
|
|
2369 simply need to put a marker in the SOE and we will track deletions
|
|
2370 and insertions of extents in the SOE. If the SOE might get moved,
|
|
2371 however (this would happen as a result of a recursive invocation
|
|
2372 of map-extents or a call to a redisplay-type function), then
|
|
2373 trying to track its changes is hopeless, so we just keep a
|
|
2374 marker to the first (or last) extent in the SOE and use that as
|
|
2375 our bound.
|
|
2376
|
|
2377 Finally, if DONT_USE_SOE is defined, we don't use the SOE at all
|
|
2378 and instead just map from the beginning of the buffer. This is
|
|
2379 used for testing purposes and allows the SOE to be calculated
|
|
2380 using map_extents() instead of the other way around. */
|
|
2381
|
|
2382 {
|
|
2383 int range_flag; /* ME_*_IN_REGION subset of flags */
|
|
2384 int do_soe_stage = 0; /* Are we mapping over the SOE? */
|
|
2385 /* Does the range stage map over start or end positions? */
|
|
2386 int range_endp;
|
|
2387 /* If type == 0, we include the start position in the range stage mapping.
|
|
2388 If type == 1, we exclude the start position in the range stage mapping.
|
|
2389 If type == 2, we begin at range_start_pos, an extent-list position.
|
|
2390 */
|
|
2391 int range_start_type = 0;
|
|
2392 int range_start_pos = 0;
|
|
2393 int stage;
|
|
2394
|
|
2395 range_flag = flags & ME_IN_REGION_MASK;
|
|
2396 if ((range_flag == ME_START_IN_REGION ||
|
|
2397 range_flag == ME_START_AND_END_IN_REGION) &&
|
|
2398 !(flags & ME_NEGATE_IN_REGION))
|
|
2399 {
|
|
2400 /* map over start position in [range-start, range-end]. No SOE
|
|
2401 stage. */
|
|
2402 range_endp = 0;
|
|
2403 }
|
|
2404 else if (range_flag == ME_END_IN_REGION && !(flags & ME_NEGATE_IN_REGION))
|
|
2405 {
|
|
2406 /* map over end position in [range-start, range-end]. No SOE
|
|
2407 stage. */
|
|
2408 range_endp = 1;
|
|
2409 }
|
|
2410 else
|
|
2411 {
|
|
2412 /* Need to include the SOE extents. */
|
|
2413 #ifdef DONT_USE_SOE
|
|
2414 /* Just brute-force it: start from the beginning. */
|
|
2415 range_endp = 0;
|
|
2416 range_start_type = 2;
|
|
2417 range_start_pos = 0;
|
|
2418 #else
|
|
2419 Stack_Of_Extents *soe = buffer_or_string_stack_of_extents_force (obj);
|
|
2420 int numsoe;
|
|
2421
|
|
2422 /* Move the SOE to the closer end of the range. This dictates
|
|
2423 whether we map over start positions or end positions. */
|
|
2424 range_endp = 0;
|
|
2425 soe_move (obj, st);
|
|
2426 numsoe = extent_list_num_els (soe->extents);
|
|
2427 if (numsoe)
|
|
2428 {
|
|
2429 if (flags & ME_MIGHT_MOVE_SOE)
|
|
2430 {
|
|
2431 int foundp;
|
|
2432 /* Can't map over SOE, so just extend range to cover the
|
|
2433 SOE. */
|
|
2434 EXTENT e = extent_list_at (soe->extents, 0, 0);
|
|
2435 range_start_pos =
|
|
2436 extent_list_locate (buffer_or_string_extent_list (obj), e, 0,
|
|
2437 &foundp);
|
|
2438 assert (foundp);
|
|
2439 range_start_type = 2;
|
|
2440 }
|
|
2441 else
|
|
2442 {
|
|
2443 /* We can map over the SOE. */
|
|
2444 do_soe_stage = 1;
|
|
2445 range_start_type = 1;
|
|
2446 }
|
|
2447 }
|
|
2448 else
|
|
2449 {
|
|
2450 /* No extents in the SOE to map over, so we act just as if
|
|
2451 ME_START_IN_REGION or ME_END_IN_REGION was specified.
|
|
2452 RANGE_ENDP already specified so no need to do anything else. */
|
|
2453 }
|
|
2454 }
|
|
2455 #endif
|
|
2456
|
|
2457 /* ---------- Now loop over the extents. ---------- */
|
|
2458
|
|
2459 /* We combine the code for the two stages because much of it
|
|
2460 overlaps. */
|
|
2461 for (stage = 0; stage < 2; stage++)
|
|
2462 {
|
|
2463 int pos = 0; /* Position in extent list */
|
|
2464
|
|
2465 /* First set up start conditions */
|
|
2466 if (stage == 0)
|
|
2467 { /* The SOE stage */
|
|
2468 if (!do_soe_stage)
|
|
2469 continue;
|
|
2470 el = buffer_or_string_stack_of_extents_force (obj)->extents;
|
|
2471 /* We will always be looping over start extents here. */
|
|
2472 assert (!range_endp);
|
|
2473 pos = 0;
|
|
2474 }
|
|
2475 else
|
|
2476 { /* The range stage */
|
|
2477 el = buffer_or_string_extent_list (obj);
|
|
2478 switch (range_start_type)
|
|
2479 {
|
|
2480 case 0:
|
|
2481 pos = extent_list_locate_from_pos (el, st, range_endp);
|
|
2482 break;
|
|
2483 case 1:
|
|
2484 pos = extent_list_locate_from_pos (el, st + 1, range_endp);
|
|
2485 break;
|
|
2486 case 2:
|
|
2487 pos = range_start_pos;
|
|
2488 break;
|
|
2489 }
|
|
2490 }
|
|
2491
|
|
2492 if (flags & ME_MIGHT_MODIFY_EXTENTS)
|
|
2493 {
|
|
2494 /* Create a marker to track changes to the extent list */
|
|
2495 if (posm)
|
|
2496 /* Delete the marker used in the SOE stage. */
|
|
2497 extent_list_delete_marker
|
|
2498 (buffer_or_string_stack_of_extents_force (obj)->extents, posm);
|
|
2499 posm = extent_list_make_marker (el, pos, range_endp);
|
|
2500 /* tell the unwind function about the marker. */
|
|
2501 closure.el = el;
|
|
2502 closure.mkr = posm;
|
|
2503 }
|
|
2504
|
|
2505 /* Now loop! */
|
|
2506 for (;;)
|
|
2507 {
|
|
2508 EXTENT e;
|
|
2509 Lisp_Object obj2;
|
|
2510
|
|
2511 /* ----- update position in extent list
|
|
2512 and fetch next extent ----- */
|
|
2513
|
|
2514 if (posm)
|
|
2515 /* fetch POS again to track extent insertions or deletions */
|
|
2516 pos = extent_list_marker_pos (el, posm);
|
|
2517 if (pos >= extent_list_num_els (el))
|
|
2518 break;
|
|
2519 e = extent_list_at (el, pos, range_endp);
|
|
2520 pos++;
|
|
2521 if (posm)
|
|
2522 /* now point the marker to the next one we're going to process.
|
|
2523 This ensures graceful behavior if this extent is deleted. */
|
|
2524 extent_list_move_marker (el, posm, pos);
|
|
2525
|
|
2526 /* ----- deal with internal extents ----- */
|
|
2527
|
|
2528 if (extent_internal_p (e))
|
|
2529 {
|
|
2530 if (!(flags & ME_INCLUDE_INTERNAL))
|
|
2531 continue;
|
|
2532 else if (e == range)
|
|
2533 {
|
|
2534 /* We're processing internal extents and we've
|
|
2535 come across our own special range extent.
|
|
2536 (This happens only in adjust_extents*() and
|
|
2537 process_extents*(), which handle text
|
|
2538 insertion and deletion.) We need to omit
|
|
2539 processing of this extent; otherwise
|
|
2540 we will probably end up prematurely
|
|
2541 terminating this loop. */
|
|
2542 continue;
|
|
2543 }
|
|
2544 }
|
|
2545
|
|
2546 /* ----- deal with AFTER condition ----- */
|
|
2547
|
|
2548 if (after)
|
|
2549 {
|
|
2550 /* if e > after, then we can stop skipping extents. */
|
|
2551 if (EXTENT_LESS (after, e))
|
|
2552 after = 0;
|
|
2553 else /* otherwise, skip this extent. */
|
|
2554 continue;
|
|
2555 }
|
|
2556
|
|
2557 /* ----- stop if we're completely outside the range ----- */
|
|
2558
|
|
2559 /* fetch ST and EN again to track text insertions or deletions */
|
|
2560 if (range)
|
|
2561 {
|
|
2562 st = extent_start (range);
|
|
2563 en = extent_end (range);
|
|
2564 }
|
|
2565 if (extent_endpoint (e, range_endp) > en)
|
|
2566 {
|
|
2567 /* Can't be mapping over SOE because all extents in
|
|
2568 there should overlap ST */
|
|
2569 assert (stage == 1);
|
|
2570 break;
|
|
2571 }
|
|
2572
|
|
2573 /* ----- Now actually call the function ----- */
|
|
2574
|
|
2575 obj2 = extent_object (e);
|
|
2576 if (extent_in_region_p (e,
|
826
|
2577 buffer_or_string_memxpos_to_bytexpos (obj2,
|
|
2578 st),
|
|
2579 buffer_or_string_memxpos_to_bytexpos (obj2,
|
|
2580 en),
|
428
|
2581 flags))
|
|
2582 {
|
|
2583 if ((*fn)(e, arg))
|
|
2584 {
|
|
2585 /* Function wants us to stop mapping. */
|
|
2586 stage = 1; /* so outer for loop will terminate */
|
|
2587 break;
|
|
2588 }
|
|
2589 }
|
|
2590 }
|
|
2591 }
|
|
2592 /* ---------- Finished looping. ---------- */
|
|
2593 }
|
|
2594
|
1292
|
2595 if (!(flags & ME_MIGHT_THROW))
|
428
|
2596 {
|
|
2597 /* Delete them ourselves */
|
|
2598 if (range)
|
|
2599 extent_detach (range);
|
|
2600 if (posm)
|
|
2601 extent_list_delete_marker (el, posm);
|
|
2602 }
|
1292
|
2603
|
|
2604 /* This deletes the range extent and frees the marker, if ME_MIGHT_THROW. */
|
|
2605 unbind_to (count);
|
|
2606
|
|
2607 PROFILE_RECORD_EXITING_SECTION (QSin_map_extents_internal);
|
428
|
2608 }
|
|
2609
|
|
2610 /* ------------------------------- */
|
|
2611 /* adjust_extents() */
|
|
2612 /* ------------------------------- */
|
|
2613
|
|
2614 /* Add AMOUNT to all extent endpoints in the range (FROM, TO]. This
|
|
2615 happens whenever the gap is moved or (under Mule) a character in a
|
|
2616 string is substituted for a different-length one. The reason for
|
|
2617 this is that extent endpoints behave just like markers (all memory
|
|
2618 indices do) and this adjustment correct for markers -- see
|
|
2619 adjust_markers(). Note that it is important that we visit all
|
|
2620 extent endpoints in the range, irrespective of whether the
|
|
2621 endpoints are open or closed.
|
|
2622
|
|
2623 We could use map_extents() for this (and in fact the function
|
|
2624 was originally written that way), but the gap is in an incoherent
|
|
2625 state when this function is called and this function plays
|
|
2626 around with extent endpoints without detaching and reattaching
|
|
2627 the extents (this is provably correct and saves lots of time),
|
|
2628 so for safety we make it just look at the extent lists directly. */
|
|
2629
|
|
2630 void
|
826
|
2631 adjust_extents (Lisp_Object obj, Memxpos from, Memxpos to, int amount)
|
428
|
2632 {
|
|
2633 int endp;
|
|
2634 int pos;
|
|
2635 int startpos[2];
|
|
2636 Extent_List *el;
|
|
2637 Stack_Of_Extents *soe;
|
|
2638
|
|
2639 #ifdef ERROR_CHECK_EXTENTS
|
|
2640 sledgehammer_extent_check (obj);
|
|
2641 #endif
|
|
2642 el = buffer_or_string_extent_list (obj);
|
|
2643
|
|
2644 if (!el || !extent_list_num_els(el))
|
|
2645 return;
|
|
2646
|
|
2647 /* IMPORTANT! Compute the starting positions of the extents to
|
|
2648 modify BEFORE doing any modification! Otherwise the starting
|
|
2649 position for the second time through the loop might get
|
|
2650 incorrectly calculated (I got bit by this bug real bad). */
|
|
2651 startpos[0] = extent_list_locate_from_pos (el, from+1, 0);
|
|
2652 startpos[1] = extent_list_locate_from_pos (el, from+1, 1);
|
|
2653 for (endp = 0; endp < 2; endp++)
|
|
2654 {
|
|
2655 for (pos = startpos[endp]; pos < extent_list_num_els (el);
|
|
2656 pos++)
|
|
2657 {
|
|
2658 EXTENT e = extent_list_at (el, pos, endp);
|
|
2659 if (extent_endpoint (e, endp) > to)
|
|
2660 break;
|
|
2661 set_extent_endpoint (e,
|
|
2662 do_marker_adjustment (extent_endpoint (e, endp),
|
|
2663 from, to, amount),
|
|
2664 endp);
|
|
2665 }
|
|
2666 }
|
|
2667
|
|
2668 /* The index for the buffer's SOE is a memory index and thus
|
|
2669 needs to be adjusted like a marker. */
|
|
2670 soe = buffer_or_string_stack_of_extents (obj);
|
|
2671 if (soe && soe->pos >= 0)
|
|
2672 soe->pos = do_marker_adjustment (soe->pos, from, to, amount);
|
|
2673 }
|
|
2674
|
|
2675 /* ------------------------------- */
|
|
2676 /* adjust_extents_for_deletion() */
|
|
2677 /* ------------------------------- */
|
|
2678
|
|
2679 struct adjust_extents_for_deletion_arg
|
|
2680 {
|
|
2681 EXTENT_dynarr *list;
|
|
2682 };
|
|
2683
|
|
2684 static int
|
|
2685 adjust_extents_for_deletion_mapper (EXTENT extent, void *arg)
|
|
2686 {
|
|
2687 struct adjust_extents_for_deletion_arg *closure =
|
|
2688 (struct adjust_extents_for_deletion_arg *) arg;
|
|
2689
|
|
2690 Dynarr_add (closure->list, extent);
|
|
2691 return 0; /* continue mapping */
|
|
2692 }
|
|
2693
|
|
2694 /* For all extent endpoints in the range (FROM, TO], move them to the beginning
|
|
2695 of the new gap. Note that it is important that we visit all extent
|
|
2696 endpoints in the range, irrespective of whether the endpoints are open or
|
|
2697 closed.
|
|
2698
|
|
2699 This function deals with weird stuff such as the fact that extents
|
|
2700 may get reordered.
|
|
2701
|
|
2702 There is no string correspondent for this because you can't
|
|
2703 delete characters from a string.
|
|
2704 */
|
|
2705
|
|
2706 void
|
826
|
2707 adjust_extents_for_deletion (Lisp_Object object, Bytexpos from,
|
|
2708 Bytexpos to, int gapsize, int numdel,
|
428
|
2709 int movegapsize)
|
|
2710 {
|
|
2711 struct adjust_extents_for_deletion_arg closure;
|
|
2712 int i;
|
826
|
2713 Memxpos adjust_to = (Memxpos) (to + gapsize);
|
428
|
2714 Bytecount amount = - numdel - movegapsize;
|
826
|
2715 Memxpos oldsoe = 0, newsoe = 0;
|
428
|
2716 Stack_Of_Extents *soe = buffer_or_string_stack_of_extents (object);
|
|
2717
|
|
2718 #ifdef ERROR_CHECK_EXTENTS
|
|
2719 sledgehammer_extent_check (object);
|
|
2720 #endif
|
|
2721 closure.list = Dynarr_new (EXTENT);
|
|
2722
|
|
2723 /* We're going to be playing weird games below with extents and the SOE
|
|
2724 and such, so compute the list now of all the extents that we're going
|
|
2725 to muck with. If we do the mapping and adjusting together, things can
|
|
2726 get all screwed up. */
|
|
2727
|
826
|
2728 map_extents (from, to, adjust_extents_for_deletion_mapper,
|
|
2729 (void *) &closure, object, 0,
|
|
2730 /* extent endpoints move like markers regardless
|
|
2731 of their open/closeness. */
|
|
2732 ME_ALL_EXTENTS_CLOSED | ME_END_CLOSED |
|
|
2733 ME_START_OR_END_IN_REGION | ME_INCLUDE_INTERNAL);
|
428
|
2734
|
|
2735 /*
|
|
2736 Old and new values for the SOE's position. (It gets adjusted
|
|
2737 like a marker, just like extent endpoints.)
|
|
2738 */
|
|
2739
|
|
2740 if (soe)
|
|
2741 {
|
|
2742 oldsoe = soe->pos;
|
|
2743 if (soe->pos >= 0)
|
|
2744 newsoe = do_marker_adjustment (soe->pos,
|
|
2745 adjust_to, adjust_to,
|
|
2746 amount);
|
|
2747 else
|
|
2748 newsoe = soe->pos;
|
|
2749 }
|
|
2750
|
|
2751 for (i = 0; i < Dynarr_length (closure.list); i++)
|
|
2752 {
|
|
2753 EXTENT extent = Dynarr_at (closure.list, i);
|
826
|
2754 Memxpos new_start = extent_start (extent);
|
|
2755 Memxpos new_end = extent_end (extent);
|
428
|
2756
|
|
2757 /* do_marker_adjustment() will not adjust values that should not be
|
|
2758 adjusted. We're passing the same funky arguments to
|
|
2759 do_marker_adjustment() as buffer_delete_range() does. */
|
|
2760 new_start =
|
|
2761 do_marker_adjustment (new_start,
|
|
2762 adjust_to, adjust_to,
|
|
2763 amount);
|
|
2764 new_end =
|
|
2765 do_marker_adjustment (new_end,
|
|
2766 adjust_to, adjust_to,
|
|
2767 amount);
|
|
2768
|
|
2769 /* We need to be very careful here so that the SOE doesn't get
|
|
2770 corrupted. We are shrinking extents out of the deleted region
|
|
2771 and simultaneously moving the SOE's pos out of the deleted
|
|
2772 region, so the SOE should contain the same extents at the end
|
|
2773 as at the beginning. However, extents may get reordered
|
|
2774 by this process, so we have to operate by pulling the extents
|
|
2775 out of the buffer and SOE, changing their bounds, and then
|
|
2776 reinserting them. In order for the SOE not to get screwed up,
|
|
2777 we have to make sure that the SOE's pos points to its old
|
|
2778 location whenever we pull an extent out, and points to its
|
|
2779 new location whenever we put the extent back in.
|
|
2780 */
|
|
2781
|
|
2782 if (new_start != extent_start (extent) ||
|
|
2783 new_end != extent_end (extent))
|
|
2784 {
|
|
2785 extent_detach (extent);
|
|
2786 set_extent_start (extent, new_start);
|
|
2787 set_extent_end (extent, new_end);
|
|
2788 if (soe)
|
|
2789 soe->pos = newsoe;
|
|
2790 extent_attach (extent);
|
|
2791 if (soe)
|
|
2792 soe->pos = oldsoe;
|
|
2793 }
|
|
2794 }
|
|
2795
|
|
2796 if (soe)
|
|
2797 soe->pos = newsoe;
|
|
2798
|
|
2799 #ifdef ERROR_CHECK_EXTENTS
|
|
2800 sledgehammer_extent_check (object);
|
|
2801 #endif
|
|
2802 Dynarr_free (closure.list);
|
|
2803 }
|
|
2804
|
|
2805 /* ------------------------------- */
|
|
2806 /* extent fragments */
|
|
2807 /* ------------------------------- */
|
|
2808
|
|
2809 /* Imagine that the buffer is divided up into contiguous,
|
|
2810 nonoverlapping "runs" of text such that no extent
|
|
2811 starts or ends within a run (extents that abut the
|
|
2812 run don't count).
|
|
2813
|
|
2814 An extent fragment is a structure that holds data about
|
|
2815 the run that contains a particular buffer position (if
|
|
2816 the buffer position is at the junction of two runs, the
|
|
2817 run after the position is used) -- the beginning and
|
|
2818 end of the run, a list of all of the extents in that
|
|
2819 run, the "merged face" that results from merging all of
|
|
2820 the faces corresponding to those extents, the begin and
|
|
2821 end glyphs at the beginning of the run, etc. This is
|
|
2822 the information that redisplay needs in order to
|
|
2823 display this run.
|
|
2824
|
|
2825 Extent fragments have to be very quick to update to
|
|
2826 a new buffer position when moving linearly through
|
|
2827 the buffer. They rely on the stack-of-extents code,
|
|
2828 which does the heavy-duty algorithmic work of determining
|
|
2829 which extents overly a particular position. */
|
|
2830
|
|
2831 /* This function returns the position of the beginning of
|
|
2832 the first run that begins after POS, or returns POS if
|
|
2833 there are no such runs. */
|
|
2834
|
826
|
2835 static Bytexpos
|
|
2836 extent_find_end_of_run (Lisp_Object obj, Bytexpos pos, int outside_accessible)
|
428
|
2837 {
|
|
2838 Extent_List *sel;
|
|
2839 Extent_List *bel = buffer_or_string_extent_list (obj);
|
826
|
2840 Bytexpos pos1, pos2;
|
428
|
2841 int elind1, elind2;
|
826
|
2842 Memxpos mempos = buffer_or_string_bytexpos_to_memxpos (obj, pos);
|
|
2843 Bytexpos limit = outside_accessible ?
|
428
|
2844 buffer_or_string_absolute_end_byte (obj) :
|
826
|
2845 buffer_or_string_accessible_end_byte (obj);
|
|
2846
|
|
2847 if (!bel || !extent_list_num_els (bel))
|
428
|
2848 return limit;
|
|
2849
|
|
2850 sel = buffer_or_string_stack_of_extents_force (obj)->extents;
|
|
2851 soe_move (obj, mempos);
|
|
2852
|
|
2853 /* Find the first start position after POS. */
|
|
2854 elind1 = extent_list_locate_from_pos (bel, mempos+1, 0);
|
|
2855 if (elind1 < extent_list_num_els (bel))
|
826
|
2856 pos1 = buffer_or_string_memxpos_to_bytexpos
|
428
|
2857 (obj, extent_start (extent_list_at (bel, elind1, 0)));
|
|
2858 else
|
|
2859 pos1 = limit;
|
|
2860
|
|
2861 /* Find the first end position after POS. The extent corresponding
|
|
2862 to this position is either in the SOE or is greater than or
|
|
2863 equal to POS1, so we just have to look in the SOE. */
|
|
2864 elind2 = extent_list_locate_from_pos (sel, mempos+1, 1);
|
|
2865 if (elind2 < extent_list_num_els (sel))
|
826
|
2866 pos2 = buffer_or_string_memxpos_to_bytexpos
|
428
|
2867 (obj, extent_end (extent_list_at (sel, elind2, 1)));
|
|
2868 else
|
|
2869 pos2 = limit;
|
|
2870
|
|
2871 return min (min (pos1, pos2), limit);
|
|
2872 }
|
|
2873
|
826
|
2874 static Bytexpos
|
|
2875 extent_find_beginning_of_run (Lisp_Object obj, Bytexpos pos,
|
428
|
2876 int outside_accessible)
|
|
2877 {
|
|
2878 Extent_List *sel;
|
|
2879 Extent_List *bel = buffer_or_string_extent_list (obj);
|
826
|
2880 Bytexpos pos1, pos2;
|
428
|
2881 int elind1, elind2;
|
826
|
2882 Memxpos mempos = buffer_or_string_bytexpos_to_memxpos (obj, pos);
|
|
2883 Bytexpos limit = outside_accessible ?
|
428
|
2884 buffer_or_string_absolute_begin_byte (obj) :
|
826
|
2885 buffer_or_string_accessible_begin_byte (obj);
|
428
|
2886
|
|
2887 if (!bel || !extent_list_num_els(bel))
|
|
2888 return limit;
|
|
2889
|
|
2890 sel = buffer_or_string_stack_of_extents_force (obj)->extents;
|
|
2891 soe_move (obj, mempos);
|
|
2892
|
|
2893 /* Find the first end position before POS. */
|
|
2894 elind1 = extent_list_locate_from_pos (bel, mempos, 1);
|
|
2895 if (elind1 > 0)
|
826
|
2896 pos1 = buffer_or_string_memxpos_to_bytexpos
|
428
|
2897 (obj, extent_end (extent_list_at (bel, elind1 - 1, 1)));
|
|
2898 else
|
|
2899 pos1 = limit;
|
|
2900
|
|
2901 /* Find the first start position before POS. The extent corresponding
|
|
2902 to this position is either in the SOE or is less than or
|
|
2903 equal to POS1, so we just have to look in the SOE. */
|
|
2904 elind2 = extent_list_locate_from_pos (sel, mempos, 0);
|
|
2905 if (elind2 > 0)
|
826
|
2906 pos2 = buffer_or_string_memxpos_to_bytexpos
|
428
|
2907 (obj, extent_start (extent_list_at (sel, elind2 - 1, 0)));
|
|
2908 else
|
|
2909 pos2 = limit;
|
|
2910
|
|
2911 return max (max (pos1, pos2), limit);
|
|
2912 }
|
|
2913
|
|
2914 struct extent_fragment *
|
|
2915 extent_fragment_new (Lisp_Object buffer_or_string, struct frame *frm)
|
|
2916 {
|
|
2917 struct extent_fragment *ef = xnew_and_zero (struct extent_fragment);
|
|
2918
|
|
2919 ef->object = buffer_or_string;
|
|
2920 ef->frm = frm;
|
|
2921 ef->extents = Dynarr_new (EXTENT);
|
|
2922 ef->begin_glyphs = Dynarr_new (glyph_block);
|
|
2923 ef->end_glyphs = Dynarr_new (glyph_block);
|
|
2924
|
|
2925 return ef;
|
|
2926 }
|
|
2927
|
|
2928 void
|
|
2929 extent_fragment_delete (struct extent_fragment *ef)
|
|
2930 {
|
|
2931 Dynarr_free (ef->extents);
|
|
2932 Dynarr_free (ef->begin_glyphs);
|
|
2933 Dynarr_free (ef->end_glyphs);
|
1726
|
2934 xfree (ef, struct extent_fragment *);
|
428
|
2935 }
|
|
2936
|
|
2937 static int
|
|
2938 extent_priority_sort_function (const void *humpty, const void *dumpty)
|
|
2939 {
|
442
|
2940 const EXTENT foo = * (const EXTENT *) humpty;
|
|
2941 const EXTENT bar = * (const EXTENT *) dumpty;
|
428
|
2942 if (extent_priority (foo) < extent_priority (bar))
|
|
2943 return -1;
|
|
2944 return extent_priority (foo) > extent_priority (bar);
|
|
2945 }
|
|
2946
|
|
2947 static void
|
|
2948 extent_fragment_sort_by_priority (EXTENT_dynarr *extarr)
|
|
2949 {
|
|
2950 int i;
|
|
2951
|
|
2952 /* Sort our copy of the stack by extent_priority. We use a bubble
|
|
2953 sort here because it's going to be faster than qsort() for small
|
|
2954 numbers of extents (less than 10 or so), and 99.999% of the time
|
|
2955 there won't ever be more extents than this in the stack. */
|
|
2956 if (Dynarr_length (extarr) < 10)
|
|
2957 {
|
|
2958 for (i = 1; i < Dynarr_length (extarr); i++)
|
|
2959 {
|
|
2960 int j = i - 1;
|
|
2961 while (j >= 0 &&
|
|
2962 (extent_priority (Dynarr_at (extarr, j)) >
|
|
2963 extent_priority (Dynarr_at (extarr, j+1))))
|
|
2964 {
|
|
2965 EXTENT tmp = Dynarr_at (extarr, j);
|
|
2966 Dynarr_at (extarr, j) = Dynarr_at (extarr, j+1);
|
|
2967 Dynarr_at (extarr, j+1) = tmp;
|
|
2968 j--;
|
|
2969 }
|
|
2970 }
|
|
2971 }
|
|
2972 else
|
|
2973 /* But some loser programs mess up and may create a large number
|
|
2974 of extents overlapping the same spot. This will result in
|
|
2975 catastrophic behavior if we use the bubble sort above. */
|
|
2976 qsort (Dynarr_atp (extarr, 0), Dynarr_length (extarr),
|
|
2977 sizeof (EXTENT), extent_priority_sort_function);
|
|
2978 }
|
|
2979
|
|
2980 /* If PROP is the `invisible' property of an extent,
|
|
2981 this is 1 if the extent should be treated as invisible. */
|
|
2982
|
|
2983 #define EXTENT_PROP_MEANS_INVISIBLE(buf, prop) \
|
|
2984 (EQ (buf->invisibility_spec, Qt) \
|
|
2985 ? ! NILP (prop) \
|
|
2986 : invisible_p (prop, buf->invisibility_spec))
|
|
2987
|
|
2988 /* If PROP is the `invisible' property of a extent,
|
|
2989 this is 1 if the extent should be treated as invisible
|
|
2990 and should have an ellipsis. */
|
|
2991
|
|
2992 #define EXTENT_PROP_MEANS_INVISIBLE_WITH_ELLIPSIS(buf, prop) \
|
|
2993 (EQ (buf->invisibility_spec, Qt) \
|
|
2994 ? 0 \
|
|
2995 : invisible_ellipsis_p (prop, buf->invisibility_spec))
|
|
2996
|
|
2997 /* This is like a combination of memq and assq.
|
|
2998 Return 1 if PROPVAL appears as an element of LIST
|
|
2999 or as the car of an element of LIST.
|
|
3000 If PROPVAL is a list, compare each element against LIST
|
|
3001 in that way, and return 1 if any element of PROPVAL is found in LIST.
|
|
3002 Otherwise return 0.
|
|
3003 This function cannot quit. */
|
|
3004
|
|
3005 static int
|
|
3006 invisible_p (REGISTER Lisp_Object propval, Lisp_Object list)
|
|
3007 {
|
|
3008 REGISTER Lisp_Object tail, proptail;
|
|
3009 for (tail = list; CONSP (tail); tail = XCDR (tail))
|
|
3010 {
|
|
3011 REGISTER Lisp_Object tem;
|
|
3012 tem = XCAR (tail);
|
|
3013 if (EQ (propval, tem))
|
|
3014 return 1;
|
|
3015 if (CONSP (tem) && EQ (propval, XCAR (tem)))
|
|
3016 return 1;
|
|
3017 }
|
|
3018 if (CONSP (propval))
|
|
3019 for (proptail = propval; CONSP (proptail);
|
|
3020 proptail = XCDR (proptail))
|
|
3021 {
|
|
3022 Lisp_Object propelt;
|
|
3023 propelt = XCAR (proptail);
|
|
3024 for (tail = list; CONSP (tail); tail = XCDR (tail))
|
|
3025 {
|
|
3026 REGISTER Lisp_Object tem;
|
|
3027 tem = XCAR (tail);
|
|
3028 if (EQ (propelt, tem))
|
|
3029 return 1;
|
|
3030 if (CONSP (tem) && EQ (propelt, XCAR (tem)))
|
|
3031 return 1;
|
|
3032 }
|
|
3033 }
|
|
3034 return 0;
|
|
3035 }
|
|
3036
|
|
3037 /* Return 1 if PROPVAL appears as the car of an element of LIST
|
|
3038 and the cdr of that element is non-nil.
|
|
3039 If PROPVAL is a list, check each element of PROPVAL in that way,
|
|
3040 and the first time some element is found,
|
|
3041 return 1 if the cdr of that element is non-nil.
|
|
3042 Otherwise return 0.
|
|
3043 This function cannot quit. */
|
|
3044
|
|
3045 static int
|
|
3046 invisible_ellipsis_p (REGISTER Lisp_Object propval, Lisp_Object list)
|
|
3047 {
|
|
3048 REGISTER Lisp_Object tail, proptail;
|
|
3049 for (tail = list; CONSP (tail); tail = XCDR (tail))
|
|
3050 {
|
|
3051 REGISTER Lisp_Object tem;
|
|
3052 tem = XCAR (tail);
|
|
3053 if (CONSP (tem) && EQ (propval, XCAR (tem)))
|
|
3054 return ! NILP (XCDR (tem));
|
|
3055 }
|
|
3056 if (CONSP (propval))
|
|
3057 for (proptail = propval; CONSP (proptail);
|
|
3058 proptail = XCDR (proptail))
|
|
3059 {
|
|
3060 Lisp_Object propelt;
|
|
3061 propelt = XCAR (proptail);
|
|
3062 for (tail = list; CONSP (tail); tail = XCDR (tail))
|
|
3063 {
|
|
3064 REGISTER Lisp_Object tem;
|
|
3065 tem = XCAR (tail);
|
|
3066 if (CONSP (tem) && EQ (propelt, XCAR (tem)))
|
|
3067 return ! NILP (XCDR (tem));
|
|
3068 }
|
|
3069 }
|
|
3070 return 0;
|
|
3071 }
|
|
3072
|
|
3073 face_index
|
|
3074 extent_fragment_update (struct window *w, struct extent_fragment *ef,
|
826
|
3075 Bytexpos pos, Lisp_Object last_glyph)
|
428
|
3076 {
|
|
3077 int i;
|
819
|
3078 int seen_glyph = NILP (last_glyph) ? 1 : 0;
|
428
|
3079 Extent_List *sel =
|
|
3080 buffer_or_string_stack_of_extents_force (ef->object)->extents;
|
|
3081 EXTENT lhe = 0;
|
|
3082 struct extent dummy_lhe_extent;
|
826
|
3083 Memxpos mempos = buffer_or_string_bytexpos_to_memxpos (ef->object, pos);
|
428
|
3084
|
|
3085 #ifdef ERROR_CHECK_EXTENTS
|
|
3086 assert (pos >= buffer_or_string_accessible_begin_byte (ef->object)
|
|
3087 && pos <= buffer_or_string_accessible_end_byte (ef->object));
|
|
3088 #endif
|
|
3089
|
|
3090 Dynarr_reset (ef->extents);
|
|
3091 Dynarr_reset (ef->begin_glyphs);
|
|
3092 Dynarr_reset (ef->end_glyphs);
|
|
3093
|
|
3094 ef->previously_invisible = ef->invisible;
|
|
3095 if (ef->invisible)
|
|
3096 {
|
|
3097 if (ef->invisible_ellipses)
|
|
3098 ef->invisible_ellipses_already_displayed = 1;
|
|
3099 }
|
|
3100 else
|
|
3101 ef->invisible_ellipses_already_displayed = 0;
|
|
3102 ef->invisible = 0;
|
|
3103 ef->invisible_ellipses = 0;
|
|
3104
|
|
3105 /* Set up the begin and end positions. */
|
|
3106 ef->pos = pos;
|
|
3107 ef->end = extent_find_end_of_run (ef->object, pos, 0);
|
|
3108
|
|
3109 /* Note that extent_find_end_of_run() already moved the SOE for us. */
|
|
3110 /* soe_move (ef->object, mempos); */
|
|
3111
|
|
3112 /* Determine the begin glyphs at POS. */
|
|
3113 for (i = 0; i < extent_list_num_els (sel); i++)
|
|
3114 {
|
|
3115 EXTENT e = extent_list_at (sel, i, 0);
|
|
3116 if (extent_start (e) == mempos && !NILP (extent_begin_glyph (e)))
|
|
3117 {
|
|
3118 Lisp_Object glyph = extent_begin_glyph (e);
|
819
|
3119 if (seen_glyph) {
|
|
3120 struct glyph_block gb;
|
|
3121
|
|
3122 gb.glyph = glyph;
|
|
3123 gb.extent = wrap_extent (e);
|
|
3124 Dynarr_add (ef->begin_glyphs, gb);
|
|
3125 }
|
|
3126 else if (EQ (glyph, last_glyph))
|
|
3127 seen_glyph = 1;
|
428
|
3128 }
|
|
3129 }
|
|
3130
|
|
3131 /* Determine the end glyphs at POS. */
|
|
3132 for (i = 0; i < extent_list_num_els (sel); i++)
|
|
3133 {
|
|
3134 EXTENT e = extent_list_at (sel, i, 1);
|
|
3135 if (extent_end (e) == mempos && !NILP (extent_end_glyph (e)))
|
|
3136 {
|
|
3137 Lisp_Object glyph = extent_end_glyph (e);
|
819
|
3138 if (seen_glyph) {
|
|
3139 struct glyph_block gb;
|
|
3140
|
|
3141 gb.glyph = glyph;
|
|
3142 gb.extent = wrap_extent (e);
|
|
3143 Dynarr_add (ef->end_glyphs, gb);
|
|
3144 }
|
|
3145 else if (EQ (glyph, last_glyph))
|
|
3146 seen_glyph = 1;
|
428
|
3147 }
|
|
3148 }
|
|
3149
|
|
3150 /* We tried determining all the charsets used in the run here,
|
|
3151 but that fails even if we only do the current line -- display
|
|
3152 tables or non-printable characters might cause other charsets
|
|
3153 to be used. */
|
|
3154
|
|
3155 /* Determine whether the last-highlighted-extent is present. */
|
|
3156 if (EXTENTP (Vlast_highlighted_extent))
|
|
3157 lhe = XEXTENT (Vlast_highlighted_extent);
|
|
3158
|
|
3159 /* Now add all extents that overlap the character after POS and
|
|
3160 have a non-nil face. Also check if the character is invisible. */
|
|
3161 for (i = 0; i < extent_list_num_els (sel); i++)
|
|
3162 {
|
|
3163 EXTENT e = extent_list_at (sel, i, 0);
|
|
3164 if (extent_end (e) > mempos)
|
|
3165 {
|
|
3166 Lisp_Object invis_prop = extent_invisible (e);
|
|
3167
|
|
3168 if (!NILP (invis_prop))
|
|
3169 {
|
|
3170 if (!BUFFERP (ef->object))
|
|
3171 /* #### no `string-invisibility-spec' */
|
|
3172 ef->invisible = 1;
|
|
3173 else
|
|
3174 {
|
|
3175 if (!ef->invisible_ellipses_already_displayed &&
|
|
3176 EXTENT_PROP_MEANS_INVISIBLE_WITH_ELLIPSIS
|
|
3177 (XBUFFER (ef->object), invis_prop))
|
|
3178 {
|
|
3179 ef->invisible = 1;
|
|
3180 ef->invisible_ellipses = 1;
|
|
3181 }
|
|
3182 else if (EXTENT_PROP_MEANS_INVISIBLE
|
|
3183 (XBUFFER (ef->object), invis_prop))
|
|
3184 ef->invisible = 1;
|
|
3185 }
|
|
3186 }
|
|
3187
|
|
3188 /* Remember that one of the extents in the list might be our
|
|
3189 dummy extent representing the highlighting that is
|
|
3190 attached to some other extent that is currently
|
|
3191 mouse-highlighted. When an extent is mouse-highlighted,
|
|
3192 it is as if there are two extents there, of potentially
|
|
3193 different priorities: the extent being highlighted, with
|
|
3194 whatever face and priority it has; and an ephemeral
|
|
3195 extent in the `mouse-face' face with
|
|
3196 `mouse-highlight-priority'.
|
|
3197 */
|
|
3198
|
|
3199 if (!NILP (extent_face (e)))
|
|
3200 Dynarr_add (ef->extents, e);
|
|
3201 if (e == lhe)
|
|
3202 {
|
|
3203 Lisp_Object f;
|
|
3204 /* zeroing isn't really necessary; we only deref `priority'
|
|
3205 and `face' */
|
|
3206 xzero (dummy_lhe_extent);
|
|
3207 set_extent_priority (&dummy_lhe_extent,
|
|
3208 mouse_highlight_priority);
|
|
3209 /* Need to break up the following expression, due to an */
|
|
3210 /* error in the Digital UNIX 3.2g C compiler (Digital */
|
|
3211 /* UNIX Compiler Driver 3.11). */
|
|
3212 f = extent_mouse_face (lhe);
|
|
3213 extent_face (&dummy_lhe_extent) = f;
|
|
3214 Dynarr_add (ef->extents, &dummy_lhe_extent);
|
|
3215 }
|
|
3216 /* since we are looping anyway, we might as well do this here */
|
|
3217 if ((!NILP(extent_initial_redisplay_function (e))) &&
|
|
3218 !extent_in_red_event_p(e))
|
|
3219 {
|
|
3220 Lisp_Object function = extent_initial_redisplay_function (e);
|
|
3221 Lisp_Object obj;
|
|
3222
|
|
3223 /* printf ("initial redisplay function called!\n "); */
|
|
3224
|
|
3225 /* print_extent_2 (e);
|
|
3226 printf ("\n"); */
|
|
3227
|
|
3228 /* FIXME: One should probably inhibit the displaying of
|
|
3229 this extent to reduce flicker */
|
793
|
3230 extent_in_red_event_p (e) = 1;
|
428
|
3231
|
|
3232 /* call the function */
|
793
|
3233 obj = wrap_extent (e);
|
|
3234 if (!NILP (function))
|
|
3235 Fenqueue_eval_event (function, obj);
|
428
|
3236 }
|
|
3237 }
|
|
3238 }
|
|
3239
|
|
3240 extent_fragment_sort_by_priority (ef->extents);
|
|
3241
|
|
3242 /* Now merge the faces together into a single face. The code to
|
|
3243 do this is in faces.c because it involves manipulating faces. */
|
|
3244 return get_extent_fragment_face_cache_index (w, ef);
|
|
3245 }
|
|
3246
|
|
3247
|
|
3248 /************************************************************************/
|
|
3249 /* extent-object methods */
|
|
3250 /************************************************************************/
|
|
3251
|
|
3252 /* These are the basic helper functions for handling the allocation of
|
|
3253 extent objects. They are similar to the functions for other
|
|
3254 lrecord objects. allocate_extent() is in alloc.c, not here. */
|
|
3255
|
|
3256 static Lisp_Object
|
|
3257 mark_extent (Lisp_Object obj)
|
|
3258 {
|
|
3259 struct extent *extent = XEXTENT (obj);
|
|
3260
|
|
3261 mark_object (extent_object (extent));
|
|
3262 mark_object (extent_no_chase_normal_field (extent, face));
|
|
3263 return extent->plist;
|
|
3264 }
|
|
3265
|
|
3266 static void
|
2286
|
3267 print_extent_1 (Lisp_Object obj, Lisp_Object printcharfun,
|
|
3268 int UNUSED (escapeflag))
|
428
|
3269 {
|
|
3270 EXTENT ext = XEXTENT (obj);
|
|
3271 EXTENT anc = extent_ancestor (ext);
|
|
3272 Lisp_Object tail;
|
|
3273 char buf[64], *bp = buf;
|
|
3274
|
|
3275 /* Retrieve the ancestor and use it, for faster retrieval of properties */
|
|
3276
|
|
3277 if (!NILP (extent_begin_glyph (anc))) *bp++ = '*';
|
|
3278 *bp++ = (extent_start_open_p (anc) ? '(': '[');
|
|
3279 if (extent_detached_p (ext))
|
|
3280 strcpy (bp, "detached");
|
|
3281 else
|
826
|
3282 sprintf (bp, "%ld, %ld",
|
819
|
3283 XINT (Fextent_start_position (obj)),
|
|
3284 XINT (Fextent_end_position (obj)));
|
428
|
3285 bp += strlen (bp);
|
|
3286 *bp++ = (extent_end_open_p (anc) ? ')': ']');
|
|
3287 if (!NILP (extent_end_glyph (anc))) *bp++ = '*';
|
|
3288 *bp++ = ' ';
|
|
3289
|
|
3290 if (!NILP (extent_read_only (anc))) *bp++ = '%';
|
|
3291 if (!NILP (extent_mouse_face (anc))) *bp++ = 'H';
|
|
3292 if (extent_unique_p (anc)) *bp++ = 'U';
|
|
3293 else if (extent_duplicable_p (anc)) *bp++ = 'D';
|
|
3294 if (!NILP (extent_invisible (anc))) *bp++ = 'I';
|
|
3295
|
|
3296 if (!NILP (extent_read_only (anc)) || !NILP (extent_mouse_face (anc)) ||
|
|
3297 extent_unique_p (anc) ||
|
|
3298 extent_duplicable_p (anc) || !NILP (extent_invisible (anc)))
|
|
3299 *bp++ = ' ';
|
|
3300 *bp = '\0';
|
826
|
3301 write_c_string (printcharfun, buf);
|
428
|
3302
|
|
3303 tail = extent_plist_slot (anc);
|
|
3304
|
|
3305 for (; !NILP (tail); tail = Fcdr (Fcdr (tail)))
|
|
3306 {
|
|
3307 Lisp_Object v = XCAR (XCDR (tail));
|
|
3308 if (NILP (v)) continue;
|
800
|
3309 write_fmt_string_lisp (printcharfun, "%S ", 1, XCAR (tail));
|
428
|
3310 }
|
|
3311
|
800
|
3312 write_fmt_string (printcharfun, "0x%lx", (long) ext);
|
428
|
3313 }
|
|
3314
|
|
3315 static void
|
|
3316 print_extent (Lisp_Object obj, Lisp_Object printcharfun, int escapeflag)
|
|
3317 {
|
|
3318 if (escapeflag)
|
|
3319 {
|
442
|
3320 const char *title = "";
|
|
3321 const char *name = "";
|
|
3322 const char *posttitle = "";
|
428
|
3323 Lisp_Object obj2 = Qnil;
|
|
3324
|
|
3325 /* Destroyed extents have 't' in the object field, causing
|
2500
|
3326 extent_object() to ABORT (maybe). */
|
428
|
3327 if (EXTENT_LIVE_P (XEXTENT (obj)))
|
|
3328 obj2 = extent_object (XEXTENT (obj));
|
|
3329
|
|
3330 if (NILP (obj2))
|
|
3331 title = "no buffer";
|
|
3332 else if (BUFFERP (obj2))
|
|
3333 {
|
|
3334 if (BUFFER_LIVE_P (XBUFFER (obj2)))
|
|
3335 {
|
|
3336 title = "buffer ";
|
|
3337 name = (char *) XSTRING_DATA (XBUFFER (obj2)->name);
|
|
3338 }
|
|
3339 else
|
|
3340 {
|
|
3341 title = "Killed Buffer";
|
|
3342 name = "";
|
|
3343 }
|
|
3344 }
|
|
3345 else
|
|
3346 {
|
|
3347 assert (STRINGP (obj2));
|
|
3348 title = "string \"";
|
|
3349 posttitle = "\"";
|
|
3350 name = (char *) XSTRING_DATA (obj2);
|
|
3351 }
|
|
3352
|
|
3353 if (print_readably)
|
|
3354 {
|
|
3355 if (!EXTENT_LIVE_P (XEXTENT (obj)))
|
563
|
3356 printing_unreadable_object ("#<destroyed extent>");
|
428
|
3357 else
|
563
|
3358 printing_unreadable_object ("#<extent 0x%lx>",
|
428
|
3359 (long) XEXTENT (obj));
|
|
3360 }
|
|
3361
|
|
3362 if (!EXTENT_LIVE_P (XEXTENT (obj)))
|
826
|
3363 write_c_string (printcharfun, "#<destroyed extent");
|
428
|
3364 else
|
|
3365 {
|
826
|
3366 write_c_string (printcharfun, "#<extent ");
|
428
|
3367 print_extent_1 (obj, printcharfun, escapeflag);
|
826
|
3368 write_c_string (printcharfun, extent_detached_p (XEXTENT (obj))
|
|
3369 ? " from " : " in ");
|
800
|
3370 write_fmt_string (printcharfun, "%s%s%s", title, name, posttitle);
|
428
|
3371 }
|
|
3372 }
|
|
3373 else
|
|
3374 {
|
|
3375 if (print_readably)
|
563
|
3376 printing_unreadable_object ("#<extent>");
|
826
|
3377 write_c_string (printcharfun, "#<extent");
|
428
|
3378 }
|
826
|
3379 write_c_string (printcharfun, ">");
|
428
|
3380 }
|
|
3381
|
|
3382 static int
|
|
3383 properties_equal (EXTENT e1, EXTENT e2, int depth)
|
|
3384 {
|
|
3385 /* When this function is called, all indirections have been followed.
|
|
3386 Thus, the indirection checks in the various macros below will not
|
|
3387 amount to anything, and could be removed. However, the time
|
|
3388 savings would probably not be significant. */
|
|
3389 if (!(EQ (extent_face (e1), extent_face (e2)) &&
|
|
3390 extent_priority (e1) == extent_priority (e2) &&
|
|
3391 internal_equal (extent_begin_glyph (e1), extent_begin_glyph (e2),
|
|
3392 depth + 1) &&
|
|
3393 internal_equal (extent_end_glyph (e1), extent_end_glyph (e2),
|
|
3394 depth + 1)))
|
|
3395 return 0;
|
|
3396
|
|
3397 /* compare the bit flags. */
|
|
3398 {
|
|
3399 /* The has_aux field should not be relevant. */
|
|
3400 int e1_has_aux = e1->flags.has_aux;
|
|
3401 int e2_has_aux = e2->flags.has_aux;
|
|
3402 int value;
|
|
3403
|
|
3404 e1->flags.has_aux = e2->flags.has_aux = 0;
|
|
3405 value = memcmp (&e1->flags, &e2->flags, sizeof (e1->flags));
|
|
3406 e1->flags.has_aux = e1_has_aux;
|
|
3407 e2->flags.has_aux = e2_has_aux;
|
|
3408 if (value)
|
|
3409 return 0;
|
|
3410 }
|
|
3411
|
|
3412 /* compare the random elements of the plists. */
|
|
3413 return !plists_differ (extent_no_chase_plist (e1),
|
|
3414 extent_no_chase_plist (e2),
|
|
3415 0, 0, depth + 1);
|
|
3416 }
|
|
3417
|
|
3418 static int
|
|
3419 extent_equal (Lisp_Object obj1, Lisp_Object obj2, int depth)
|
|
3420 {
|
|
3421 struct extent *e1 = XEXTENT (obj1);
|
|
3422 struct extent *e2 = XEXTENT (obj2);
|
|
3423 return
|
|
3424 (extent_start (e1) == extent_start (e2) &&
|
|
3425 extent_end (e1) == extent_end (e2) &&
|
|
3426 internal_equal (extent_object (e1), extent_object (e2), depth + 1) &&
|
|
3427 properties_equal (extent_ancestor (e1), extent_ancestor (e2),
|
|
3428 depth));
|
|
3429 }
|
|
3430
|
665
|
3431 static Hashcode
|
428
|
3432 extent_hash (Lisp_Object obj, int depth)
|
|
3433 {
|
|
3434 struct extent *e = XEXTENT (obj);
|
|
3435 /* No need to hash all of the elements; that would take too long.
|
|
3436 Just hash the most common ones. */
|
|
3437 return HASH3 (extent_start (e), extent_end (e),
|
|
3438 internal_hash (extent_object (e), depth + 1));
|
|
3439 }
|
|
3440
|
1204
|
3441 static const struct memory_description extent_description[] = {
|
442
|
3442 { XD_LISP_OBJECT, offsetof (struct extent, object) },
|
|
3443 { XD_LISP_OBJECT, offsetof (struct extent, flags.face) },
|
|
3444 { XD_LISP_OBJECT, offsetof (struct extent, plist) },
|
|
3445 { XD_END }
|
|
3446 };
|
|
3447
|
428
|
3448 static Lisp_Object
|
|
3449 extent_getprop (Lisp_Object obj, Lisp_Object prop)
|
|
3450 {
|
|
3451 return Fextent_property (obj, prop, Qunbound);
|
|
3452 }
|
|
3453
|
|
3454 static int
|
|
3455 extent_putprop (Lisp_Object obj, Lisp_Object prop, Lisp_Object value)
|
|
3456 {
|
|
3457 Fset_extent_property (obj, prop, value);
|
|
3458 return 1;
|
|
3459 }
|
|
3460
|
|
3461 static int
|
|
3462 extent_remprop (Lisp_Object obj, Lisp_Object prop)
|
|
3463 {
|
826
|
3464 Lisp_Object retval = Fset_extent_property (obj, prop, Qunbound);
|
|
3465 if (UNBOUNDP (retval))
|
|
3466 return -1;
|
|
3467 else if (!NILP (retval))
|
|
3468 return 1;
|
|
3469 else
|
|
3470 return 0;
|
428
|
3471 }
|
|
3472
|
|
3473 static Lisp_Object
|
|
3474 extent_plist (Lisp_Object obj)
|
|
3475 {
|
|
3476 return Fextent_properties (obj);
|
|
3477 }
|
|
3478
|
934
|
3479 DEFINE_BASIC_LRECORD_IMPLEMENTATION_WITH_PROPS ("extent", extent,
|
|
3480 1, /*dumpable-flag*/
|
|
3481 mark_extent,
|
|
3482 print_extent,
|
|
3483 /* NOTE: If you declare a
|
|
3484 finalization method here,
|
|
3485 it will NOT be called.
|
|
3486 Shaft city. */
|
|
3487 0,
|
|
3488 extent_equal, extent_hash,
|
|
3489 extent_description,
|
|
3490 extent_getprop, extent_putprop,
|
|
3491 extent_remprop, extent_plist,
|
|
3492 struct extent);
|
428
|
3493
|
|
3494 /************************************************************************/
|
|
3495 /* basic extent accessors */
|
|
3496 /************************************************************************/
|
|
3497
|
|
3498 /* These functions are for checking externally-passed extent objects
|
|
3499 and returning an extent's basic properties, which include the
|
|
3500 buffer the extent is associated with, the endpoints of the extent's
|
|
3501 range, the open/closed-ness of those endpoints, and whether the
|
|
3502 extent is detached. Manipulating these properties requires
|
|
3503 manipulating the ordered lists that hold extents; thus, functions
|
|
3504 to do that are in a later section. */
|
|
3505
|
|
3506 /* Given a Lisp_Object that is supposed to be an extent, make sure it
|
|
3507 is OK and return an extent pointer. Extents can be in one of four
|
|
3508 states:
|
|
3509
|
|
3510 1) destroyed
|
|
3511 2) detached and not associated with a buffer
|
|
3512 3) detached and associated with a buffer
|
|
3513 4) attached to a buffer
|
|
3514
|
|
3515 If FLAGS is 0, types 2-4 are allowed. If FLAGS is DE_MUST_HAVE_BUFFER,
|
|
3516 types 3-4 are allowed. If FLAGS is DE_MUST_BE_ATTACHED, only type 4
|
|
3517 is allowed.
|
|
3518 */
|
|
3519
|
|
3520 static EXTENT
|
|
3521 decode_extent (Lisp_Object extent_obj, unsigned int flags)
|
|
3522 {
|
|
3523 EXTENT extent;
|
|
3524 Lisp_Object obj;
|
|
3525
|
|
3526 CHECK_LIVE_EXTENT (extent_obj);
|
|
3527 extent = XEXTENT (extent_obj);
|
|
3528 obj = extent_object (extent);
|
|
3529
|
|
3530 /* the following condition will fail if we're dealing with a freed extent */
|
|
3531 assert (NILP (obj) || BUFFERP (obj) || STRINGP (obj));
|
|
3532
|
|
3533 if (flags & DE_MUST_BE_ATTACHED)
|
|
3534 flags |= DE_MUST_HAVE_BUFFER;
|
|
3535
|
|
3536 /* if buffer is dead, then convert extent to have no buffer. */
|
|
3537 if (BUFFERP (obj) && !BUFFER_LIVE_P (XBUFFER (obj)))
|
|
3538 obj = extent_object (extent) = Qnil;
|
|
3539
|
|
3540 assert (!NILP (obj) || extent_detached_p (extent));
|
|
3541
|
|
3542 if ((NILP (obj) && (flags & DE_MUST_HAVE_BUFFER))
|
|
3543 || (extent_detached_p (extent) && (flags & DE_MUST_BE_ATTACHED)))
|
|
3544 {
|
442
|
3545 invalid_argument ("extent doesn't belong to a buffer or string",
|
|
3546 extent_obj);
|
428
|
3547 }
|
|
3548
|
|
3549 return extent;
|
|
3550 }
|
|
3551
|
826
|
3552 /* Note that the returned value is a char position, not a byte position. */
|
428
|
3553
|
|
3554 static Lisp_Object
|
|
3555 extent_endpoint_external (Lisp_Object extent_obj, int endp)
|
|
3556 {
|
|
3557 EXTENT extent = decode_extent (extent_obj, 0);
|
|
3558
|
|
3559 if (extent_detached_p (extent))
|
|
3560 return Qnil;
|
|
3561 else
|
826
|
3562 return make_int (extent_endpoint_char (extent, endp));
|
428
|
3563 }
|
|
3564
|
|
3565 DEFUN ("extentp", Fextentp, 1, 1, 0, /*
|
|
3566 Return t if OBJECT is an extent.
|
|
3567 */
|
|
3568 (object))
|
|
3569 {
|
|
3570 return EXTENTP (object) ? Qt : Qnil;
|
|
3571 }
|
|
3572
|
|
3573 DEFUN ("extent-live-p", Fextent_live_p, 1, 1, 0, /*
|
|
3574 Return t if OBJECT is an extent that has not been destroyed.
|
|
3575 */
|
|
3576 (object))
|
|
3577 {
|
|
3578 return EXTENTP (object) && EXTENT_LIVE_P (XEXTENT (object)) ? Qt : Qnil;
|
|
3579 }
|
|
3580
|
|
3581 DEFUN ("extent-detached-p", Fextent_detached_p, 1, 1, 0, /*
|
|
3582 Return t if EXTENT is detached.
|
|
3583 */
|
|
3584 (extent))
|
|
3585 {
|
|
3586 return extent_detached_p (decode_extent (extent, 0)) ? Qt : Qnil;
|
|
3587 }
|
|
3588
|
|
3589 DEFUN ("extent-object", Fextent_object, 1, 1, 0, /*
|
|
3590 Return object (buffer or string) that EXTENT refers to.
|
|
3591 */
|
|
3592 (extent))
|
|
3593 {
|
|
3594 return extent_object (decode_extent (extent, 0));
|
|
3595 }
|
|
3596
|
|
3597 DEFUN ("extent-start-position", Fextent_start_position, 1, 1, 0, /*
|
|
3598 Return start position of EXTENT, or nil if EXTENT is detached.
|
|
3599 */
|
|
3600 (extent))
|
|
3601 {
|
|
3602 return extent_endpoint_external (extent, 0);
|
|
3603 }
|
|
3604
|
|
3605 DEFUN ("extent-end-position", Fextent_end_position, 1, 1, 0, /*
|
|
3606 Return end position of EXTENT, or nil if EXTENT is detached.
|
|
3607 */
|
|
3608 (extent))
|
|
3609 {
|
|
3610 return extent_endpoint_external (extent, 1);
|
|
3611 }
|
|
3612
|
|
3613 DEFUN ("extent-length", Fextent_length, 1, 1, 0, /*
|
|
3614 Return length of EXTENT in characters.
|
|
3615 */
|
|
3616 (extent))
|
|
3617 {
|
|
3618 EXTENT e = decode_extent (extent, DE_MUST_BE_ATTACHED);
|
826
|
3619 return make_int (extent_endpoint_char (e, 1)
|
|
3620 - extent_endpoint_char (e, 0));
|
428
|
3621 }
|
|
3622
|
|
3623 DEFUN ("next-extent", Fnext_extent, 1, 1, 0, /*
|
|
3624 Find next extent after EXTENT.
|
|
3625 If EXTENT is a buffer return the first extent in the buffer; likewise
|
|
3626 for strings.
|
|
3627 Extents in a buffer are ordered in what is called the "display"
|
|
3628 order, which sorts by increasing start positions and then by *decreasing*
|
|
3629 end positions.
|
|
3630 If you want to perform an operation on a series of extents, use
|
|
3631 `map-extents' instead of this function; it is much more efficient.
|
|
3632 The primary use of this function should be to enumerate all the
|
|
3633 extents in a buffer.
|
|
3634 Note: The display order is not necessarily the order that `map-extents'
|
|
3635 processes extents in!
|
|
3636 */
|
|
3637 (extent))
|
|
3638 {
|
|
3639 EXTENT next;
|
|
3640
|
|
3641 if (EXTENTP (extent))
|
|
3642 next = extent_next (decode_extent (extent, DE_MUST_BE_ATTACHED));
|
|
3643 else
|
|
3644 next = extent_first (decode_buffer_or_string (extent));
|
|
3645
|
|
3646 if (!next)
|
|
3647 return Qnil;
|
793
|
3648 return wrap_extent (next);
|
428
|
3649 }
|
|
3650
|
|
3651 DEFUN ("previous-extent", Fprevious_extent, 1, 1, 0, /*
|
|
3652 Find last extent before EXTENT.
|
|
3653 If EXTENT is a buffer return the last extent in the buffer; likewise
|
|
3654 for strings.
|
|
3655 This function is analogous to `next-extent'.
|
|
3656 */
|
|
3657 (extent))
|
|
3658 {
|
|
3659 EXTENT prev;
|
|
3660
|
|
3661 if (EXTENTP (extent))
|
|
3662 prev = extent_previous (decode_extent (extent, DE_MUST_BE_ATTACHED));
|
|
3663 else
|
|
3664 prev = extent_last (decode_buffer_or_string (extent));
|
|
3665
|
|
3666 if (!prev)
|
|
3667 return Qnil;
|
793
|
3668 return wrap_extent (prev);
|
428
|
3669 }
|
|
3670
|
|
3671 #ifdef DEBUG_XEMACS
|
|
3672
|
|
3673 DEFUN ("next-e-extent", Fnext_e_extent, 1, 1, 0, /*
|
|
3674 Find next extent after EXTENT using the "e" order.
|
|
3675 If EXTENT is a buffer return the first extent in the buffer; likewise
|
|
3676 for strings.
|
|
3677 */
|
|
3678 (extent))
|
|
3679 {
|
|
3680 EXTENT next;
|
|
3681
|
|
3682 if (EXTENTP (extent))
|
|
3683 next = extent_e_next (decode_extent (extent, DE_MUST_BE_ATTACHED));
|
|
3684 else
|
|
3685 next = extent_e_first (decode_buffer_or_string (extent));
|
|
3686
|
|
3687 if (!next)
|
|
3688 return Qnil;
|
793
|
3689 return wrap_extent (next);
|
428
|
3690 }
|
|
3691
|
|
3692 DEFUN ("previous-e-extent", Fprevious_e_extent, 1, 1, 0, /*
|
|
3693 Find last extent before EXTENT using the "e" order.
|
|
3694 If EXTENT is a buffer return the last extent in the buffer; likewise
|
|
3695 for strings.
|
|
3696 This function is analogous to `next-e-extent'.
|
|
3697 */
|
|
3698 (extent))
|
|
3699 {
|
|
3700 EXTENT prev;
|
|
3701
|
|
3702 if (EXTENTP (extent))
|
|
3703 prev = extent_e_previous (decode_extent (extent, DE_MUST_BE_ATTACHED));
|
|
3704 else
|
|
3705 prev = extent_e_last (decode_buffer_or_string (extent));
|
|
3706
|
|
3707 if (!prev)
|
|
3708 return Qnil;
|
793
|
3709 return wrap_extent (prev);
|
428
|
3710 }
|
|
3711
|
|
3712 #endif
|
|
3713
|
|
3714 DEFUN ("next-extent-change", Fnext_extent_change, 1, 2, 0, /*
|
|
3715 Return the next position after POS where an extent begins or ends.
|
|
3716 If POS is at the end of the buffer or string, POS will be returned;
|
|
3717 otherwise a position greater than POS will always be returned.
|
444
|
3718 If OBJECT is nil, the current buffer is assumed.
|
428
|
3719 */
|
|
3720 (pos, object))
|
|
3721 {
|
|
3722 Lisp_Object obj = decode_buffer_or_string (object);
|
826
|
3723 Bytexpos xpos;
|
|
3724
|
|
3725 xpos = get_buffer_or_string_pos_byte (obj, pos, GB_ALLOW_PAST_ACCESSIBLE);
|
|
3726 xpos = extent_find_end_of_run (obj, xpos, 1);
|
|
3727 return make_int (buffer_or_string_bytexpos_to_charxpos (obj, xpos));
|
428
|
3728 }
|
|
3729
|
|
3730 DEFUN ("previous-extent-change", Fprevious_extent_change, 1, 2, 0, /*
|
|
3731 Return the last position before POS where an extent begins or ends.
|
|
3732 If POS is at the beginning of the buffer or string, POS will be returned;
|
|
3733 otherwise a position less than POS will always be returned.
|
|
3734 If OBJECT is nil, the current buffer is assumed.
|
|
3735 */
|
|
3736 (pos, object))
|
|
3737 {
|
|
3738 Lisp_Object obj = decode_buffer_or_string (object);
|
826
|
3739 Bytexpos xpos;
|
|
3740
|
|
3741 xpos = get_buffer_or_string_pos_byte (obj, pos, GB_ALLOW_PAST_ACCESSIBLE);
|
|
3742 xpos = extent_find_beginning_of_run (obj, xpos, 1);
|
|
3743 return make_int (buffer_or_string_bytexpos_to_charxpos (obj, xpos));
|
428
|
3744 }
|
|
3745
|
|
3746
|
|
3747 /************************************************************************/
|
|
3748 /* parent and children stuff */
|
|
3749 /************************************************************************/
|
|
3750
|
|
3751 DEFUN ("extent-parent", Fextent_parent, 1, 1, 0, /*
|
|
3752 Return the parent (if any) of EXTENT.
|
|
3753 If an extent has a parent, it derives all its properties from that extent
|
|
3754 and has no properties of its own. (The only "properties" that the
|
|
3755 extent keeps are the buffer/string it refers to and the start and end
|
|
3756 points.) It is possible for an extent's parent to itself have a parent.
|
|
3757 */
|
|
3758 (extent))
|
|
3759 /* do I win the prize for the strangest split infinitive? */
|
|
3760 {
|
|
3761 EXTENT e = decode_extent (extent, 0);
|
|
3762 return extent_parent (e);
|
|
3763 }
|
|
3764
|
|
3765 DEFUN ("extent-children", Fextent_children, 1, 1, 0, /*
|
|
3766 Return a list of the children (if any) of EXTENT.
|
|
3767 The children of an extent are all those extents whose parent is that extent.
|
|
3768 This function does not recursively trace children of children.
|
|
3769 \(To do that, use `extent-descendants'.)
|
|
3770 */
|
|
3771 (extent))
|
|
3772 {
|
|
3773 EXTENT e = decode_extent (extent, 0);
|
|
3774 Lisp_Object children = extent_children (e);
|
|
3775
|
|
3776 if (!NILP (children))
|
|
3777 return Fcopy_sequence (XWEAK_LIST_LIST (children));
|
|
3778 else
|
|
3779 return Qnil;
|
|
3780 }
|
|
3781
|
|
3782 static void
|
|
3783 remove_extent_from_children_list (EXTENT e, Lisp_Object child)
|
|
3784 {
|
|
3785 Lisp_Object children = extent_children (e);
|
|
3786
|
|
3787 #ifdef ERROR_CHECK_EXTENTS
|
|
3788 assert (!NILP (memq_no_quit (child, XWEAK_LIST_LIST (children))));
|
|
3789 #endif
|
|
3790 XWEAK_LIST_LIST (children) =
|
|
3791 delq_no_quit (child, XWEAK_LIST_LIST (children));
|
|
3792 }
|
|
3793
|
|
3794 static void
|
|
3795 add_extent_to_children_list (EXTENT e, Lisp_Object child)
|
|
3796 {
|
|
3797 Lisp_Object children = extent_children (e);
|
|
3798
|
|
3799 if (NILP (children))
|
|
3800 {
|
|
3801 children = make_weak_list (WEAK_LIST_SIMPLE);
|
|
3802 set_extent_no_chase_aux_field (e, children, children);
|
|
3803 }
|
|
3804
|
|
3805 #ifdef ERROR_CHECK_EXTENTS
|
|
3806 assert (NILP (memq_no_quit (child, XWEAK_LIST_LIST (children))));
|
|
3807 #endif
|
|
3808 XWEAK_LIST_LIST (children) = Fcons (child, XWEAK_LIST_LIST (children));
|
|
3809 }
|
|
3810
|
826
|
3811
|
|
3812 static int
|
|
3813 compare_key_value_pairs (const void *humpty, const void *dumpty)
|
|
3814 {
|
|
3815 Lisp_Object_pair *foo = (Lisp_Object_pair *) humpty;
|
|
3816 Lisp_Object_pair *bar = (Lisp_Object_pair *) dumpty;
|
|
3817 if (EQ (foo->key, bar->key))
|
|
3818 return 0;
|
|
3819 return !NILP (Fstring_lessp (foo->key, bar->key)) ? -1 : 1;
|
|
3820 }
|
|
3821
|
428
|
3822 DEFUN ("set-extent-parent", Fset_extent_parent, 2, 2, 0, /*
|
|
3823 Set the parent of EXTENT to PARENT (may be nil).
|
|
3824 See `extent-parent'.
|
|
3825 */
|
|
3826 (extent, parent))
|
|
3827 {
|
|
3828 EXTENT e = decode_extent (extent, 0);
|
|
3829 Lisp_Object cur_parent = extent_parent (e);
|
|
3830 Lisp_Object rest;
|
|
3831
|
793
|
3832 extent = wrap_extent (e);
|
428
|
3833 if (!NILP (parent))
|
|
3834 CHECK_LIVE_EXTENT (parent);
|
|
3835 if (EQ (parent, cur_parent))
|
|
3836 return Qnil;
|
|
3837 for (rest = parent; !NILP (rest); rest = extent_parent (XEXTENT (rest)))
|
|
3838 if (EQ (rest, extent))
|
563
|
3839 signal_error (Qinvalid_change,
|
442
|
3840 "Circular parent chain would result",
|
|
3841 extent);
|
428
|
3842 if (NILP (parent))
|
|
3843 {
|
|
3844 remove_extent_from_children_list (XEXTENT (cur_parent), extent);
|
|
3845 set_extent_no_chase_aux_field (e, parent, Qnil);
|
|
3846 e->flags.has_parent = 0;
|
|
3847 }
|
|
3848 else
|
|
3849 {
|
|
3850 add_extent_to_children_list (XEXTENT (parent), extent);
|
|
3851 set_extent_no_chase_aux_field (e, parent, parent);
|
|
3852 e->flags.has_parent = 1;
|
|
3853 }
|
|
3854 /* changing the parent also changes the properties of all children. */
|
|
3855 {
|
826
|
3856 Lisp_Object_pair_dynarr *oldprops, *newprops;
|
|
3857 int i, orignewlength;
|
|
3858
|
|
3859 /* perhaps there's a smarter way, but the following will work,
|
|
3860 and it's O(N*log N):
|
|
3861
|
|
3862 (1) get the old props.
|
|
3863 (2) get the new props.
|
|
3864 (3) sort both.
|
|
3865 (4) loop through old props; if key not in new, add it, with value
|
|
3866 Qunbound.
|
|
3867 (5) vice-versa for new props.
|
|
3868 (6) sort both again.
|
|
3869 (7) now we have identical lists of keys; we run through and compare
|
|
3870 the values.
|
|
3871
|
|
3872 Of course in reality the number of properties will be low, so
|
|
3873 an N^2 algorithm wouldn't be a problem, but the stuff below is just
|
|
3874 as easy to write given the existence of qsort and bsearch.
|
|
3875 */
|
|
3876
|
|
3877 oldprops = Dynarr_new (Lisp_Object_pair);
|
|
3878 newprops = Dynarr_new (Lisp_Object_pair);
|
|
3879 if (!NILP (cur_parent))
|
|
3880 extent_properties (XEXTENT (cur_parent), oldprops);
|
|
3881 if (!NILP (parent))
|
|
3882 extent_properties (XEXTENT (parent), newprops);
|
|
3883
|
|
3884 qsort (Dynarr_atp (oldprops, 0), Dynarr_length (oldprops),
|
|
3885 sizeof (Lisp_Object_pair), compare_key_value_pairs);
|
|
3886 qsort (Dynarr_atp (newprops, 0), Dynarr_length (newprops),
|
|
3887 sizeof (Lisp_Object_pair), compare_key_value_pairs);
|
|
3888 orignewlength = Dynarr_length (newprops);
|
|
3889 for (i = 0; i < Dynarr_length (oldprops); i++)
|
|
3890 {
|
|
3891 if (!bsearch (Dynarr_atp (oldprops, i), Dynarr_atp (newprops, 0),
|
|
3892 Dynarr_length (newprops), sizeof (Lisp_Object_pair),
|
|
3893 compare_key_value_pairs))
|
|
3894 {
|
3025
|
3895 Lisp_Object_pair new_;
|
|
3896 new_.key = Dynarr_at (oldprops, i).key;
|
|
3897 new_.value = Qunbound;
|
|
3898 Dynarr_add (newprops, new_);
|
826
|
3899 }
|
|
3900 }
|
|
3901 for (i = 0; i < orignewlength; i++)
|
|
3902 {
|
859
|
3903 if (!Dynarr_length (oldprops) || !bsearch (Dynarr_atp (newprops, i),
|
|
3904 Dynarr_atp (oldprops, 0),
|
|
3905 Dynarr_length (oldprops),
|
|
3906 sizeof (Lisp_Object_pair),
|
|
3907 compare_key_value_pairs))
|
826
|
3908 {
|
3025
|
3909 Lisp_Object_pair new_;
|
|
3910 new_.key = Dynarr_at (newprops, i).key;
|
|
3911 new_.value = Qunbound;
|
|
3912 Dynarr_add (oldprops, new_);
|
826
|
3913 }
|
|
3914 }
|
|
3915 qsort (Dynarr_atp (oldprops, 0), Dynarr_length (oldprops),
|
|
3916 sizeof (Lisp_Object_pair), compare_key_value_pairs);
|
|
3917 qsort (Dynarr_atp (newprops, 0), Dynarr_length (newprops),
|
|
3918 sizeof (Lisp_Object_pair), compare_key_value_pairs);
|
|
3919 for (i = 0; i < Dynarr_length (oldprops); i++)
|
|
3920 {
|
|
3921 assert (EQ (Dynarr_at (oldprops, i).key, Dynarr_at (newprops, i).key));
|
|
3922 if (!EQ (Dynarr_at (oldprops, i).value, Dynarr_at (newprops, i).value))
|
|
3923 signal_extent_property_changed (e, Dynarr_at (oldprops, i).key, 1);
|
|
3924 }
|
|
3925
|
|
3926 Dynarr_free (oldprops);
|
|
3927 Dynarr_free (newprops);
|
|
3928 #if 0
|
|
3929 {
|
428
|
3930 int old_invis = (!NILP (cur_parent) &&
|
|
3931 !NILP (extent_invisible (XEXTENT (cur_parent))));
|
|
3932 int new_invis = (!NILP (parent) &&
|
|
3933 !NILP (extent_invisible (XEXTENT (parent))));
|
|
3934
|
|
3935 extent_maybe_changed_for_redisplay (e, 1, new_invis != old_invis);
|
|
3936 }
|
826
|
3937 #endif /* 0 */
|
|
3938 }
|
428
|
3939 return Qnil;
|
|
3940 }
|
|
3941
|
|
3942
|
|
3943 /************************************************************************/
|
|
3944 /* basic extent mutators */
|
|
3945 /************************************************************************/
|
|
3946
|
|
3947 /* Note: If you track non-duplicable extents by undo, you'll get bogus
|
|
3948 undo records for transient extents via update-extent.
|
|
3949 For example, query-replace will do this.
|
|
3950 */
|
|
3951
|
|
3952 static void
|
826
|
3953 set_extent_endpoints_1 (EXTENT extent, Memxpos start, Memxpos end)
|
428
|
3954 {
|
|
3955 #ifdef ERROR_CHECK_EXTENTS
|
|
3956 Lisp_Object obj = extent_object (extent);
|
|
3957
|
|
3958 assert (start <= end);
|
|
3959 if (BUFFERP (obj))
|
|
3960 {
|
665
|
3961 assert (valid_membpos_p (XBUFFER (obj), start));
|
|
3962 assert (valid_membpos_p (XBUFFER (obj), end));
|
428
|
3963 }
|
|
3964 #endif
|
|
3965
|
|
3966 /* Optimization: if the extent is already where we want it to be,
|
|
3967 do nothing. */
|
|
3968 if (!extent_detached_p (extent) && extent_start (extent) == start &&
|
|
3969 extent_end (extent) == end)
|
|
3970 return;
|
|
3971
|
|
3972 if (extent_detached_p (extent))
|
|
3973 {
|
|
3974 if (extent_duplicable_p (extent))
|
|
3975 {
|
793
|
3976 Lisp_Object extent_obj = wrap_extent (extent);
|
|
3977
|
428
|
3978 record_extent (extent_obj, 1);
|
|
3979 }
|
|
3980 }
|
|
3981 else
|
|
3982 extent_detach (extent);
|
|
3983
|
|
3984 set_extent_start (extent, start);
|
|
3985 set_extent_end (extent, end);
|
|
3986 extent_attach (extent);
|
|
3987 }
|
|
3988
|
|
3989 /* Set extent's endpoints to S and E, and put extent in buffer or string
|
|
3990 OBJECT. (If OBJECT is nil, do not change the extent's object.) */
|
|
3991
|
|
3992 void
|
826
|
3993 set_extent_endpoints (EXTENT extent, Bytexpos s, Bytexpos e,
|
|
3994 Lisp_Object object)
|
|
3995 {
|
|
3996 Memxpos start, end;
|
428
|
3997
|
|
3998 if (NILP (object))
|
|
3999 {
|
|
4000 object = extent_object (extent);
|
|
4001 assert (!NILP (object));
|
|
4002 }
|
|
4003 else if (!EQ (object, extent_object (extent)))
|
|
4004 {
|
|
4005 extent_detach (extent);
|
|
4006 extent_object (extent) = object;
|
|
4007 }
|
|
4008
|
|
4009 start = s < 0 ? extent_start (extent) :
|
826
|
4010 buffer_or_string_bytexpos_to_memxpos (object, s);
|
428
|
4011 end = e < 0 ? extent_end (extent) :
|
826
|
4012 buffer_or_string_bytexpos_to_memxpos (object, e);
|
428
|
4013 set_extent_endpoints_1 (extent, start, end);
|
|
4014 }
|
|
4015
|
|
4016 static void
|
|
4017 set_extent_openness (EXTENT extent, int start_open, int end_open)
|
|
4018 {
|
|
4019 if (start_open != -1)
|
826
|
4020 {
|
|
4021 extent_start_open_p (extent) = start_open;
|
|
4022 signal_extent_property_changed (extent, Qstart_open, 1);
|
|
4023 }
|
428
|
4024 if (end_open != -1)
|
826
|
4025 {
|
|
4026 extent_end_open_p (extent) = end_open;
|
|
4027 signal_extent_property_changed (extent, Qend_open, 1);
|
|
4028 }
|
428
|
4029 }
|
|
4030
|
|
4031 static EXTENT
|
826
|
4032 make_extent (Lisp_Object object, Bytexpos from, Bytexpos to)
|
428
|
4033 {
|
|
4034 EXTENT extent;
|
|
4035
|
|
4036 extent = make_extent_detached (object);
|
|
4037 set_extent_endpoints (extent, from, to, Qnil);
|
|
4038 return extent;
|
|
4039 }
|
|
4040
|
826
|
4041 /* Copy ORIGINAL, changing it to span FROM,TO in OBJECT. */
|
|
4042
|
428
|
4043 static EXTENT
|
826
|
4044 copy_extent (EXTENT original, Bytexpos from, Bytexpos to, Lisp_Object object)
|
428
|
4045 {
|
|
4046 EXTENT e;
|
|
4047
|
|
4048 e = make_extent_detached (object);
|
|
4049 if (from >= 0)
|
|
4050 set_extent_endpoints (e, from, to, Qnil);
|
|
4051
|
|
4052 e->plist = Fcopy_sequence (original->plist);
|
|
4053 memcpy (&e->flags, &original->flags, sizeof (e->flags));
|
|
4054 if (e->flags.has_aux)
|
|
4055 {
|
|
4056 /* also need to copy the aux struct. It won't work for
|
|
4057 this extent to share the same aux struct as the original
|
|
4058 one. */
|
2720
|
4059 struct extent_auxiliary *data =
|
3017
|
4060 ALLOC_LCRECORD_TYPE (struct extent_auxiliary,
|
428
|
4061 &lrecord_extent_auxiliary);
|
|
4062
|
3017
|
4063 COPY_LCRECORD (data, XEXTENT_AUXILIARY (XCAR (original->plist)));
|
793
|
4064 XCAR (e->plist) = wrap_extent_auxiliary (data);
|
428
|
4065 }
|
|
4066
|
|
4067 {
|
|
4068 /* we may have just added another child to the parent extent. */
|
|
4069 Lisp_Object parent = extent_parent (e);
|
|
4070 if (!NILP (parent))
|
|
4071 {
|
793
|
4072 Lisp_Object extent = wrap_extent (e);
|
|
4073
|
428
|
4074 add_extent_to_children_list (XEXTENT (parent), extent);
|
|
4075 }
|
|
4076 }
|
|
4077
|
|
4078 return e;
|
|
4079 }
|
|
4080
|
|
4081 static void
|
|
4082 destroy_extent (EXTENT extent)
|
|
4083 {
|
|
4084 Lisp_Object rest, nextrest, children;
|
|
4085 Lisp_Object extent_obj;
|
|
4086
|
|
4087 if (!extent_detached_p (extent))
|
|
4088 extent_detach (extent);
|
|
4089 /* disassociate the extent from its children and parent */
|
|
4090 children = extent_children (extent);
|
|
4091 if (!NILP (children))
|
|
4092 {
|
|
4093 LIST_LOOP_DELETING (rest, nextrest, XWEAK_LIST_LIST (children))
|
|
4094 Fset_extent_parent (XCAR (rest), Qnil);
|
|
4095 }
|
793
|
4096 extent_obj = wrap_extent (extent);
|
428
|
4097 Fset_extent_parent (extent_obj, Qnil);
|
|
4098 /* mark the extent as destroyed */
|
|
4099 extent_object (extent) = Qt;
|
|
4100 }
|
|
4101
|
|
4102 DEFUN ("make-extent", Fmake_extent, 2, 3, 0, /*
|
|
4103 Make an extent for the range [FROM, TO) in BUFFER-OR-STRING.
|
|
4104 BUFFER-OR-STRING defaults to the current buffer. Insertions at point
|
|
4105 TO will be outside of the extent; insertions at FROM will be inside the
|
|
4106 extent, causing the extent to grow. (This is the same way that markers
|
|
4107 behave.) You can change the behavior of insertions at the endpoints
|
|
4108 using `set-extent-property'. The extent is initially detached if both
|
|
4109 FROM and TO are nil, and in this case BUFFER-OR-STRING defaults to nil,
|
|
4110 meaning the extent is in no buffer and no string.
|
|
4111 */
|
|
4112 (from, to, buffer_or_string))
|
|
4113 {
|
|
4114 Lisp_Object extent_obj;
|
|
4115 Lisp_Object obj;
|
|
4116
|
|
4117 obj = decode_buffer_or_string (buffer_or_string);
|
|
4118 if (NILP (from) && NILP (to))
|
|
4119 {
|
|
4120 if (NILP (buffer_or_string))
|
|
4121 obj = Qnil;
|
793
|
4122 extent_obj = wrap_extent (make_extent_detached (obj));
|
428
|
4123 }
|
|
4124 else
|
|
4125 {
|
826
|
4126 Bytexpos start, end;
|
428
|
4127
|
|
4128 get_buffer_or_string_range_byte (obj, from, to, &start, &end,
|
|
4129 GB_ALLOW_PAST_ACCESSIBLE);
|
826
|
4130 extent_obj = wrap_extent (make_extent (obj, start, end));
|
428
|
4131 }
|
|
4132 return extent_obj;
|
|
4133 }
|
|
4134
|
|
4135 DEFUN ("copy-extent", Fcopy_extent, 1, 2, 0, /*
|
|
4136 Make a copy of EXTENT. It is initially detached.
|
|
4137 Optional argument BUFFER-OR-STRING defaults to EXTENT's buffer or string.
|
|
4138 */
|
|
4139 (extent, buffer_or_string))
|
|
4140 {
|
|
4141 EXTENT ext = decode_extent (extent, 0);
|
|
4142
|
|
4143 if (NILP (buffer_or_string))
|
|
4144 buffer_or_string = extent_object (ext);
|
|
4145 else
|
|
4146 buffer_or_string = decode_buffer_or_string (buffer_or_string);
|
|
4147
|
793
|
4148 return wrap_extent (copy_extent (ext, -1, -1, buffer_or_string));
|
428
|
4149 }
|
|
4150
|
|
4151 DEFUN ("delete-extent", Fdelete_extent, 1, 1, 0, /*
|
|
4152 Remove EXTENT from its buffer and destroy it.
|
|
4153 This does not modify the buffer's text, only its display properties.
|
|
4154 The extent cannot be used thereafter.
|
|
4155 */
|
|
4156 (extent))
|
|
4157 {
|
|
4158 EXTENT ext;
|
|
4159
|
|
4160 /* We do not call decode_extent() here because already-destroyed
|
|
4161 extents are OK. */
|
|
4162 CHECK_EXTENT (extent);
|
|
4163 ext = XEXTENT (extent);
|
|
4164
|
|
4165 if (!EXTENT_LIVE_P (ext))
|
|
4166 return Qnil;
|
|
4167 destroy_extent (ext);
|
|
4168 return Qnil;
|
|
4169 }
|
|
4170
|
|
4171 DEFUN ("detach-extent", Fdetach_extent, 1, 1, 0, /*
|
|
4172 Remove EXTENT from its buffer in such a way that it can be re-inserted.
|
|
4173 An extent is also detached when all of its characters are all killed by a
|
|
4174 deletion, unless its `detachable' property has been unset.
|
|
4175
|
|
4176 Extents which have the `duplicable' attribute are tracked by the undo
|
|
4177 mechanism. Detachment via `detach-extent' and string deletion is recorded,
|
|
4178 as is attachment via `insert-extent' and string insertion. Extent motion,
|
|
4179 face changes, and attachment via `make-extent' and `set-extent-endpoints'
|
|
4180 are not recorded. This means that extent changes which are to be undo-able
|
|
4181 must be performed by character editing, or by insertion and detachment of
|
|
4182 duplicable extents.
|
|
4183 */
|
|
4184 (extent))
|
|
4185 {
|
|
4186 EXTENT ext = decode_extent (extent, 0);
|
|
4187
|
|
4188 if (extent_detached_p (ext))
|
|
4189 return extent;
|
|
4190 if (extent_duplicable_p (ext))
|
|
4191 record_extent (extent, 0);
|
|
4192 extent_detach (ext);
|
|
4193
|
|
4194 return extent;
|
|
4195 }
|
|
4196
|
|
4197 DEFUN ("set-extent-endpoints", Fset_extent_endpoints, 3, 4, 0, /*
|
|
4198 Set the endpoints of EXTENT to START, END.
|
|
4199 If START and END are null, call detach-extent on EXTENT.
|
|
4200 BUFFER-OR-STRING specifies the new buffer or string that the extent should
|
|
4201 be in, and defaults to EXTENT's buffer or string. (If nil, and EXTENT
|
|
4202 is in no buffer and no string, it defaults to the current buffer.)
|
|
4203 See documentation on `detach-extent' for a discussion of undo recording.
|
|
4204 */
|
|
4205 (extent, start, end, buffer_or_string))
|
|
4206 {
|
|
4207 EXTENT ext;
|
826
|
4208 Bytexpos s, e;
|
428
|
4209
|
|
4210 ext = decode_extent (extent, 0);
|
|
4211
|
|
4212 if (NILP (buffer_or_string))
|
|
4213 {
|
|
4214 buffer_or_string = extent_object (ext);
|
|
4215 if (NILP (buffer_or_string))
|
|
4216 buffer_or_string = Fcurrent_buffer ();
|
|
4217 }
|
|
4218 else
|
|
4219 buffer_or_string = decode_buffer_or_string (buffer_or_string);
|
|
4220
|
|
4221 if (NILP (start) && NILP (end))
|
|
4222 return Fdetach_extent (extent);
|
|
4223
|
|
4224 get_buffer_or_string_range_byte (buffer_or_string, start, end, &s, &e,
|
|
4225 GB_ALLOW_PAST_ACCESSIBLE);
|
|
4226
|
468
|
4227 buffer_or_string_extent_info_force (buffer_or_string);
|
428
|
4228 set_extent_endpoints (ext, s, e, buffer_or_string);
|
|
4229 return extent;
|
|
4230 }
|
|
4231
|
|
4232
|
|
4233 /************************************************************************/
|
|
4234 /* mapping over extents */
|
|
4235 /************************************************************************/
|
|
4236
|
|
4237 static unsigned int
|
|
4238 decode_map_extents_flags (Lisp_Object flags)
|
|
4239 {
|
|
4240 unsigned int retval = 0;
|
|
4241 unsigned int all_extents_specified = 0;
|
|
4242 unsigned int in_region_specified = 0;
|
|
4243
|
|
4244 if (EQ (flags, Qt)) /* obsoleteness compatibility */
|
|
4245 return ME_END_CLOSED;
|
|
4246 if (NILP (flags))
|
|
4247 return 0;
|
|
4248 if (SYMBOLP (flags))
|
|
4249 flags = Fcons (flags, Qnil);
|
|
4250 while (!NILP (flags))
|
|
4251 {
|
|
4252 Lisp_Object sym;
|
|
4253 CHECK_CONS (flags);
|
|
4254 sym = XCAR (flags);
|
|
4255 CHECK_SYMBOL (sym);
|
|
4256 if (EQ (sym, Qall_extents_closed) || EQ (sym, Qall_extents_open) ||
|
|
4257 EQ (sym, Qall_extents_closed_open) ||
|
|
4258 EQ (sym, Qall_extents_open_closed))
|
|
4259 {
|
|
4260 if (all_extents_specified)
|
563
|
4261 invalid_argument ("Only one `all-extents-*' flag may be specified", Qunbound);
|
428
|
4262 all_extents_specified = 1;
|
|
4263 }
|
|
4264 if (EQ (sym, Qstart_in_region) || EQ (sym, Qend_in_region) ||
|
|
4265 EQ (sym, Qstart_and_end_in_region) ||
|
|
4266 EQ (sym, Qstart_or_end_in_region))
|
|
4267 {
|
|
4268 if (in_region_specified)
|
563
|
4269 invalid_argument ("Only one `*-in-region' flag may be specified", Qunbound);
|
428
|
4270 in_region_specified = 1;
|
|
4271 }
|
|
4272
|
|
4273 /* I do so love that conditional operator ... */
|
|
4274 retval |=
|
|
4275 EQ (sym, Qend_closed) ? ME_END_CLOSED :
|
|
4276 EQ (sym, Qstart_open) ? ME_START_OPEN :
|
|
4277 EQ (sym, Qall_extents_closed) ? ME_ALL_EXTENTS_CLOSED :
|
|
4278 EQ (sym, Qall_extents_open) ? ME_ALL_EXTENTS_OPEN :
|
|
4279 EQ (sym, Qall_extents_closed_open) ? ME_ALL_EXTENTS_CLOSED_OPEN :
|
|
4280 EQ (sym, Qall_extents_open_closed) ? ME_ALL_EXTENTS_OPEN_CLOSED :
|
|
4281 EQ (sym, Qstart_in_region) ? ME_START_IN_REGION :
|
|
4282 EQ (sym, Qend_in_region) ? ME_END_IN_REGION :
|
|
4283 EQ (sym, Qstart_and_end_in_region) ? ME_START_AND_END_IN_REGION :
|
|
4284 EQ (sym, Qstart_or_end_in_region) ? ME_START_OR_END_IN_REGION :
|
|
4285 EQ (sym, Qnegate_in_region) ? ME_NEGATE_IN_REGION :
|
563
|
4286 (invalid_constant ("Invalid `map-extents' flag", sym), 0);
|
428
|
4287
|
|
4288 flags = XCDR (flags);
|
|
4289 }
|
|
4290 return retval;
|
|
4291 }
|
|
4292
|
|
4293 DEFUN ("extent-in-region-p", Fextent_in_region_p, 1, 4, 0, /*
|
|
4294 Return whether EXTENT overlaps a specified region.
|
|
4295 This is equivalent to whether `map-extents' would visit EXTENT when called
|
|
4296 with these args.
|
|
4297 */
|
|
4298 (extent, from, to, flags))
|
|
4299 {
|
826
|
4300 Bytexpos start, end;
|
428
|
4301 EXTENT ext = decode_extent (extent, DE_MUST_BE_ATTACHED);
|
|
4302 Lisp_Object obj = extent_object (ext);
|
|
4303
|
|
4304 get_buffer_or_string_range_byte (obj, from, to, &start, &end, GB_ALLOW_NIL |
|
|
4305 GB_ALLOW_PAST_ACCESSIBLE);
|
|
4306
|
|
4307 return extent_in_region_p (ext, start, end, decode_map_extents_flags (flags)) ?
|
|
4308 Qt : Qnil;
|
|
4309 }
|
|
4310
|
|
4311 struct slow_map_extents_arg
|
|
4312 {
|
|
4313 Lisp_Object map_arg;
|
|
4314 Lisp_Object map_routine;
|
|
4315 Lisp_Object result;
|
|
4316 Lisp_Object property;
|
|
4317 Lisp_Object value;
|
|
4318 };
|
|
4319
|
|
4320 static int
|
|
4321 slow_map_extents_function (EXTENT extent, void *arg)
|
|
4322 {
|
|
4323 /* This function can GC */
|
|
4324 struct slow_map_extents_arg *closure = (struct slow_map_extents_arg *) arg;
|
793
|
4325 Lisp_Object extent_obj = wrap_extent (extent);
|
|
4326
|
428
|
4327
|
|
4328 /* make sure this extent qualifies according to the PROPERTY
|
|
4329 and VALUE args */
|
|
4330
|
|
4331 if (!NILP (closure->property))
|
|
4332 {
|
|
4333 Lisp_Object value = Fextent_property (extent_obj, closure->property,
|
|
4334 Qnil);
|
|
4335 if ((NILP (closure->value) && NILP (value)) ||
|
|
4336 (!NILP (closure->value) && !EQ (value, closure->value)))
|
|
4337 return 0;
|
|
4338 }
|
|
4339
|
|
4340 closure->result = call2 (closure->map_routine, extent_obj,
|
|
4341 closure->map_arg);
|
|
4342 return !NILP (closure->result);
|
|
4343 }
|
|
4344
|
|
4345 DEFUN ("map-extents", Fmap_extents, 1, 8, 0, /*
|
|
4346 Map FUNCTION over the extents which overlap a region in OBJECT.
|
|
4347 OBJECT is normally a buffer or string but could be an extent (see below).
|
|
4348 The region is normally bounded by [FROM, TO) (i.e. the beginning of the
|
|
4349 region is closed and the end of the region is open), but this can be
|
|
4350 changed with the FLAGS argument (see below for a complete discussion).
|
|
4351
|
|
4352 FUNCTION is called with the arguments (extent, MAPARG). The arguments
|
|
4353 OBJECT, FROM, TO, MAPARG, and FLAGS are all optional and default to
|
|
4354 the current buffer, the beginning of OBJECT, the end of OBJECT, nil,
|
|
4355 and nil, respectively. `map-extents' returns the first non-nil result
|
|
4356 produced by FUNCTION, and no more calls to FUNCTION are made after it
|
|
4357 returns non-nil.
|
|
4358
|
|
4359 If OBJECT is an extent, FROM and TO default to the extent's endpoints,
|
|
4360 and the mapping omits that extent and its predecessors. This feature
|
|
4361 supports restarting a loop based on `map-extents'. Note: OBJECT must
|
|
4362 be attached to a buffer or string, and the mapping is done over that
|
|
4363 buffer or string.
|
|
4364
|
|
4365 An extent overlaps the region if there is any point in the extent that is
|
|
4366 also in the region. (For the purpose of overlap, zero-length extents and
|
|
4367 regions are treated as closed on both ends regardless of their endpoints'
|
|
4368 specified open/closedness.) Note that the endpoints of an extent or region
|
|
4369 are considered to be in that extent or region if and only if the
|
|
4370 corresponding end is closed. For example, the extent [5,7] overlaps the
|
|
4371 region [2,5] because 5 is in both the extent and the region. However, (5,7]
|
|
4372 does not overlap [2,5] because 5 is not in the extent, and neither [5,7] nor
|
|
4373 \(5,7] overlaps the region [2,5) because 5 is not in the region.
|
|
4374
|
|
4375 The optional FLAGS can be a symbol or a list of one or more symbols,
|
|
4376 modifying the behavior of `map-extents'. Allowed symbols are:
|
|
4377
|
|
4378 end-closed The region's end is closed.
|
|
4379
|
|
4380 start-open The region's start is open.
|
|
4381
|
|
4382 all-extents-closed Treat all extents as closed on both ends for the
|
|
4383 purpose of determining whether they overlap the
|
|
4384 region, irrespective of their actual open- or
|
|
4385 closedness.
|
|
4386 all-extents-open Treat all extents as open on both ends.
|
|
4387 all-extents-closed-open Treat all extents as start-closed, end-open.
|
|
4388 all-extents-open-closed Treat all extents as start-open, end-closed.
|
|
4389
|
|
4390 start-in-region In addition to the above conditions for extent
|
|
4391 overlap, the extent's start position must lie within
|
|
4392 the specified region. Note that, for this
|
|
4393 condition, open start positions are treated as if
|
|
4394 0.5 was added to the endpoint's value, and open
|
|
4395 end positions are treated as if 0.5 was subtracted
|
|
4396 from the endpoint's value.
|
|
4397 end-in-region The extent's end position must lie within the
|
|
4398 region.
|
|
4399 start-and-end-in-region Both the extent's start and end positions must lie
|
|
4400 within the region.
|
|
4401 start-or-end-in-region Either the extent's start or end position must lie
|
|
4402 within the region.
|
|
4403
|
|
4404 negate-in-region The condition specified by a `*-in-region' flag
|
|
4405 must NOT hold for the extent to be considered.
|
|
4406
|
|
4407
|
|
4408 At most one of `all-extents-closed', `all-extents-open',
|
|
4409 `all-extents-closed-open', and `all-extents-open-closed' may be specified.
|
|
4410
|
|
4411 At most one of `start-in-region', `end-in-region',
|
|
4412 `start-and-end-in-region', and `start-or-end-in-region' may be specified.
|
|
4413
|
|
4414 If optional arg PROPERTY is non-nil, only extents with that property set
|
|
4415 on them will be visited. If optional arg VALUE is non-nil, only extents
|
|
4416 whose value for that property is `eq' to VALUE will be visited.
|
|
4417 */
|
|
4418 (function, object, from, to, maparg, flags, property, value))
|
|
4419 {
|
|
4420 /* This function can GC */
|
|
4421 struct slow_map_extents_arg closure;
|
|
4422 unsigned int me_flags;
|
826
|
4423 Bytexpos start, end;
|
428
|
4424 struct gcpro gcpro1, gcpro2, gcpro3, gcpro4, gcpro5;
|
|
4425 EXTENT after = 0;
|
|
4426
|
|
4427 if (EXTENTP (object))
|
|
4428 {
|
|
4429 after = decode_extent (object, DE_MUST_BE_ATTACHED);
|
|
4430 if (NILP (from))
|
|
4431 from = Fextent_start_position (object);
|
|
4432 if (NILP (to))
|
|
4433 to = Fextent_end_position (object);
|
|
4434 object = extent_object (after);
|
|
4435 }
|
|
4436 else
|
|
4437 object = decode_buffer_or_string (object);
|
|
4438
|
|
4439 get_buffer_or_string_range_byte (object, from, to, &start, &end,
|
|
4440 GB_ALLOW_NIL | GB_ALLOW_PAST_ACCESSIBLE);
|
|
4441
|
|
4442 me_flags = decode_map_extents_flags (flags);
|
|
4443
|
|
4444 if (!NILP (property))
|
|
4445 {
|
|
4446 if (!NILP (value))
|
|
4447 value = canonicalize_extent_property (property, value);
|
|
4448 }
|
|
4449
|
|
4450 GCPRO5 (function, maparg, object, property, value);
|
|
4451
|
|
4452 closure.map_arg = maparg;
|
|
4453 closure.map_routine = function;
|
|
4454 closure.result = Qnil;
|
|
4455 closure.property = property;
|
|
4456 closure.value = value;
|
|
4457
|
826
|
4458 map_extents (start, end, slow_map_extents_function,
|
|
4459 (void *) &closure, object, after,
|
|
4460 /* You never know what the user might do ... */
|
|
4461 me_flags | ME_MIGHT_CALL_ELISP);
|
428
|
4462
|
|
4463 UNGCPRO;
|
|
4464 return closure.result;
|
|
4465 }
|
|
4466
|
|
4467
|
|
4468 /************************************************************************/
|
|
4469 /* mapping over extents -- other functions */
|
|
4470 /************************************************************************/
|
|
4471
|
|
4472 /* ------------------------------- */
|
|
4473 /* map-extent-children */
|
|
4474 /* ------------------------------- */
|
|
4475
|
|
4476 struct slow_map_extent_children_arg
|
|
4477 {
|
|
4478 Lisp_Object map_arg;
|
|
4479 Lisp_Object map_routine;
|
|
4480 Lisp_Object result;
|
|
4481 Lisp_Object property;
|
|
4482 Lisp_Object value;
|
826
|
4483 Bytexpos start_min;
|
|
4484 Bytexpos prev_start;
|
|
4485 Bytexpos prev_end;
|
428
|
4486 };
|
|
4487
|
|
4488 static int
|
|
4489 slow_map_extent_children_function (EXTENT extent, void *arg)
|
|
4490 {
|
|
4491 /* This function can GC */
|
|
4492 struct slow_map_extent_children_arg *closure =
|
|
4493 (struct slow_map_extent_children_arg *) arg;
|
|
4494 Lisp_Object extent_obj;
|
826
|
4495 Bytexpos start = extent_endpoint_byte (extent, 0);
|
|
4496 Bytexpos end = extent_endpoint_byte (extent, 1);
|
428
|
4497 /* Make sure the extent starts inside the region of interest,
|
|
4498 rather than just overlaps it.
|
|
4499 */
|
|
4500 if (start < closure->start_min)
|
|
4501 return 0;
|
|
4502 /* Make sure the extent is not a child of a previous visited one.
|
|
4503 We know already, because of extent ordering,
|
|
4504 that start >= prev_start, and that if
|
|
4505 start == prev_start, then end <= prev_end.
|
|
4506 */
|
|
4507 if (start == closure->prev_start)
|
|
4508 {
|
|
4509 if (end < closure->prev_end)
|
|
4510 return 0;
|
|
4511 }
|
|
4512 else /* start > prev_start */
|
|
4513 {
|
|
4514 if (start < closure->prev_end)
|
|
4515 return 0;
|
|
4516 /* corner case: prev_end can be -1 if there is no prev */
|
|
4517 }
|
793
|
4518 extent_obj = wrap_extent (extent);
|
428
|
4519
|
|
4520 /* make sure this extent qualifies according to the PROPERTY
|
|
4521 and VALUE args */
|
|
4522
|
|
4523 if (!NILP (closure->property))
|
|
4524 {
|
|
4525 Lisp_Object value = Fextent_property (extent_obj, closure->property,
|
|
4526 Qnil);
|
|
4527 if ((NILP (closure->value) && NILP (value)) ||
|
|
4528 (!NILP (closure->value) && !EQ (value, closure->value)))
|
|
4529 return 0;
|
|
4530 }
|
|
4531
|
|
4532 closure->result = call2 (closure->map_routine, extent_obj,
|
|
4533 closure->map_arg);
|
|
4534
|
|
4535 /* Since the callback may change the buffer, compute all stored
|
|
4536 buffer positions here.
|
|
4537 */
|
|
4538 closure->start_min = -1; /* no need for this any more */
|
826
|
4539 closure->prev_start = extent_endpoint_byte (extent, 0);
|
|
4540 closure->prev_end = extent_endpoint_byte (extent, 1);
|
428
|
4541
|
|
4542 return !NILP (closure->result);
|
|
4543 }
|
|
4544
|
|
4545 DEFUN ("map-extent-children", Fmap_extent_children, 1, 8, 0, /*
|
|
4546 Map FUNCTION over the extents in the region from FROM to TO.
|
|
4547 FUNCTION is called with arguments (extent, MAPARG). See `map-extents'
|
|
4548 for a full discussion of the arguments FROM, TO, and FLAGS.
|
|
4549
|
|
4550 The arguments are the same as for `map-extents', but this function differs
|
|
4551 in that it only visits extents which start in the given region, and also
|
|
4552 in that, after visiting an extent E, it skips all other extents which start
|
|
4553 inside E but end before E's end.
|
|
4554
|
|
4555 Thus, this function may be used to walk a tree of extents in a buffer:
|
|
4556 (defun walk-extents (buffer &optional ignore)
|
|
4557 (map-extent-children 'walk-extents buffer))
|
|
4558 */
|
|
4559 (function, object, from, to, maparg, flags, property, value))
|
|
4560 {
|
|
4561 /* This function can GC */
|
|
4562 struct slow_map_extent_children_arg closure;
|
|
4563 unsigned int me_flags;
|
826
|
4564 Bytexpos start, end;
|
428
|
4565 struct gcpro gcpro1, gcpro2, gcpro3, gcpro4, gcpro5;
|
|
4566 EXTENT after = 0;
|
|
4567
|
|
4568 if (EXTENTP (object))
|
|
4569 {
|
|
4570 after = decode_extent (object, DE_MUST_BE_ATTACHED);
|
|
4571 if (NILP (from))
|
|
4572 from = Fextent_start_position (object);
|
|
4573 if (NILP (to))
|
|
4574 to = Fextent_end_position (object);
|
|
4575 object = extent_object (after);
|
|
4576 }
|
|
4577 else
|
|
4578 object = decode_buffer_or_string (object);
|
|
4579
|
|
4580 get_buffer_or_string_range_byte (object, from, to, &start, &end,
|
|
4581 GB_ALLOW_NIL | GB_ALLOW_PAST_ACCESSIBLE);
|
|
4582
|
|
4583 me_flags = decode_map_extents_flags (flags);
|
|
4584
|
|
4585 if (!NILP (property))
|
|
4586 {
|
|
4587 if (!NILP (value))
|
|
4588 value = canonicalize_extent_property (property, value);
|
|
4589 }
|
|
4590
|
|
4591 GCPRO5 (function, maparg, object, property, value);
|
|
4592
|
|
4593 closure.map_arg = maparg;
|
|
4594 closure.map_routine = function;
|
|
4595 closure.result = Qnil;
|
|
4596 closure.property = property;
|
|
4597 closure.value = value;
|
|
4598 closure.start_min = start;
|
|
4599 closure.prev_start = -1;
|
|
4600 closure.prev_end = -1;
|
826
|
4601 map_extents (start, end, slow_map_extent_children_function,
|
|
4602 (void *) &closure, object, after,
|
|
4603 /* You never know what the user might do ... */
|
|
4604 me_flags | ME_MIGHT_CALL_ELISP);
|
428
|
4605
|
|
4606 UNGCPRO;
|
|
4607 return closure.result;
|
|
4608 }
|
|
4609
|
|
4610 /* ------------------------------- */
|
|
4611 /* extent-at */
|
|
4612 /* ------------------------------- */
|
|
4613
|
|
4614 /* find "smallest" matching extent containing pos -- (flag == 0) means
|
|
4615 all extents match, else (EXTENT_FLAGS (extent) & flag) must be true;
|
|
4616 for more than one matching extent with precisely the same endpoints,
|
|
4617 we choose the last extent in the extents_list.
|
|
4618 The search stops just before "before", if that is non-null.
|
|
4619 */
|
|
4620
|
|
4621 struct extent_at_arg
|
|
4622 {
|
442
|
4623 Lisp_Object best_match; /* or list of extents */
|
826
|
4624 Memxpos best_start;
|
|
4625 Memxpos best_end;
|
428
|
4626 Lisp_Object prop;
|
|
4627 EXTENT before;
|
442
|
4628 int all_extents;
|
428
|
4629 };
|
|
4630
|
|
4631 static enum extent_at_flag
|
|
4632 decode_extent_at_flag (Lisp_Object at_flag)
|
|
4633 {
|
|
4634 if (NILP (at_flag))
|
|
4635 return EXTENT_AT_AFTER;
|
|
4636
|
|
4637 CHECK_SYMBOL (at_flag);
|
|
4638 if (EQ (at_flag, Qafter)) return EXTENT_AT_AFTER;
|
|
4639 if (EQ (at_flag, Qbefore)) return EXTENT_AT_BEFORE;
|
|
4640 if (EQ (at_flag, Qat)) return EXTENT_AT_AT;
|
|
4641
|
563
|
4642 invalid_constant ("Invalid AT-FLAG in `extent-at'", at_flag);
|
1204
|
4643 RETURN_NOT_REACHED (EXTENT_AT_AFTER);
|
428
|
4644 }
|
|
4645
|
|
4646 static int
|
|
4647 extent_at_mapper (EXTENT e, void *arg)
|
|
4648 {
|
|
4649 struct extent_at_arg *closure = (struct extent_at_arg *) arg;
|
|
4650
|
|
4651 if (e == closure->before)
|
|
4652 return 1;
|
|
4653
|
|
4654 /* If closure->prop is non-nil, then the extent is only acceptable
|
|
4655 if it has a non-nil value for that property. */
|
|
4656 if (!NILP (closure->prop))
|
|
4657 {
|
793
|
4658 Lisp_Object extent = wrap_extent (e);
|
|
4659
|
428
|
4660 if (NILP (Fextent_property (extent, closure->prop, Qnil)))
|
|
4661 return 0;
|
|
4662 }
|
|
4663
|
442
|
4664 if (!closure->all_extents)
|
428
|
4665 {
|
442
|
4666 EXTENT current;
|
|
4667
|
|
4668 if (NILP (closure->best_match))
|
428
|
4669 goto accept;
|
442
|
4670 current = XEXTENT (closure->best_match);
|
428
|
4671 /* redundant but quick test */
|
442
|
4672 if (extent_start (current) > extent_start (e))
|
428
|
4673 return 0;
|
|
4674
|
|
4675 /* we return the "last" best fit, instead of the first --
|
|
4676 this is because then the glyph closest to two equivalent
|
|
4677 extents corresponds to the "extent-at" the text just past
|
|
4678 that same glyph */
|
|
4679 else if (!EXTENT_LESS_VALS (e, closure->best_start,
|
|
4680 closure->best_end))
|
|
4681 goto accept;
|
|
4682 else
|
|
4683 return 0;
|
|
4684 accept:
|
793
|
4685 closure->best_match = wrap_extent (e);
|
428
|
4686 closure->best_start = extent_start (e);
|
|
4687 closure->best_end = extent_end (e);
|
|
4688 }
|
442
|
4689 else
|
|
4690 {
|
793
|
4691 Lisp_Object extent = wrap_extent (e);
|
|
4692
|
442
|
4693 closure->best_match = Fcons (extent, closure->best_match);
|
|
4694 }
|
428
|
4695
|
|
4696 return 0;
|
|
4697 }
|
|
4698
|
826
|
4699 Lisp_Object
|
|
4700 extent_at (Bytexpos position, Lisp_Object object,
|
|
4701 Lisp_Object property, EXTENT before,
|
|
4702 enum extent_at_flag at_flag, int all_extents)
|
428
|
4703 {
|
|
4704 struct extent_at_arg closure;
|
442
|
4705 struct gcpro gcpro1;
|
428
|
4706
|
|
4707 /* it might be argued that invalid positions should cause
|
|
4708 errors, but the principle of least surprise dictates that
|
|
4709 nil should be returned (extent-at is often used in
|
|
4710 response to a mouse event, and in many cases previous events
|
|
4711 have changed the buffer contents).
|
|
4712
|
|
4713 Also, the openness stuff in the text-property code currently
|
|
4714 does not check its limits and might go off the end. */
|
|
4715 if ((at_flag == EXTENT_AT_BEFORE
|
|
4716 ? position <= buffer_or_string_absolute_begin_byte (object)
|
|
4717 : position < buffer_or_string_absolute_begin_byte (object))
|
|
4718 || (at_flag == EXTENT_AT_AFTER
|
|
4719 ? position >= buffer_or_string_absolute_end_byte (object)
|
|
4720 : position > buffer_or_string_absolute_end_byte (object)))
|
|
4721 return Qnil;
|
|
4722
|
442
|
4723 closure.best_match = Qnil;
|
428
|
4724 closure.prop = property;
|
|
4725 closure.before = before;
|
442
|
4726 closure.all_extents = all_extents;
|
|
4727
|
|
4728 GCPRO1 (closure.best_match);
|
826
|
4729 map_extents (at_flag == EXTENT_AT_BEFORE ? prev_bytexpos (object, position) :
|
|
4730 position,
|
|
4731 at_flag == EXTENT_AT_AFTER ? next_bytexpos (object, position) :
|
|
4732 position,
|
|
4733 extent_at_mapper, (void *) &closure, object, 0,
|
|
4734 ME_START_OPEN | ME_ALL_EXTENTS_CLOSED);
|
442
|
4735 if (all_extents)
|
|
4736 closure.best_match = Fnreverse (closure.best_match);
|
|
4737 UNGCPRO;
|
|
4738
|
|
4739 return closure.best_match;
|
428
|
4740 }
|
|
4741
|
|
4742 DEFUN ("extent-at", Fextent_at, 1, 5, 0, /*
|
|
4743 Find "smallest" extent at POS in OBJECT having PROPERTY set.
|
|
4744 Normally, an extent is "at" POS if it overlaps the region (POS, POS+1);
|
|
4745 i.e. if it covers the character after POS. (However, see the definition
|
|
4746 of AT-FLAG.) "Smallest" means the extent that comes last in the display
|
|
4747 order; this normally means the extent whose start position is closest to
|
|
4748 POS. See `next-extent' for more information.
|
|
4749 OBJECT specifies a buffer or string and defaults to the current buffer.
|
|
4750 PROPERTY defaults to nil, meaning that any extent will do.
|
|
4751 Properties are attached to extents with `set-extent-property', which see.
|
|
4752 Returns nil if POS is invalid or there is no matching extent at POS.
|
|
4753 If the fourth argument BEFORE is not nil, it must be an extent; any returned
|
|
4754 extent will precede that extent. This feature allows `extent-at' to be
|
|
4755 used by a loop over extents.
|
|
4756 AT-FLAG controls how end cases are handled, and should be one of:
|
|
4757
|
|
4758 nil or `after' An extent is at POS if it covers the character
|
|
4759 after POS. This is consistent with the way
|
|
4760 that text properties work.
|
|
4761 `before' An extent is at POS if it covers the character
|
|
4762 before POS.
|
|
4763 `at' An extent is at POS if it overlaps or abuts POS.
|
|
4764 This includes all zero-length extents at POS.
|
|
4765
|
|
4766 Note that in all cases, the start-openness and end-openness of the extents
|
|
4767 considered is ignored. If you want to pay attention to those properties,
|
|
4768 you should use `map-extents', which gives you more control.
|
|
4769 */
|
|
4770 (pos, object, property, before, at_flag))
|
|
4771 {
|
826
|
4772 Bytexpos position;
|
428
|
4773 EXTENT before_extent;
|
|
4774 enum extent_at_flag fl;
|
|
4775
|
|
4776 object = decode_buffer_or_string (object);
|
|
4777 position = get_buffer_or_string_pos_byte (object, pos, GB_NO_ERROR_IF_BAD);
|
|
4778 if (NILP (before))
|
|
4779 before_extent = 0;
|
|
4780 else
|
|
4781 before_extent = decode_extent (before, DE_MUST_BE_ATTACHED);
|
|
4782 if (before_extent && !EQ (object, extent_object (before_extent)))
|
442
|
4783 invalid_argument ("extent not in specified buffer or string", object);
|
428
|
4784 fl = decode_extent_at_flag (at_flag);
|
|
4785
|
826
|
4786 return extent_at (position, object, property, before_extent, fl, 0);
|
442
|
4787 }
|
|
4788
|
|
4789 DEFUN ("extents-at", Fextents_at, 1, 5, 0, /*
|
|
4790 Find all extents at POS in OBJECT having PROPERTY set.
|
|
4791 Normally, an extent is "at" POS if it overlaps the region (POS, POS+1);
|
|
4792 i.e. if it covers the character after POS. (However, see the definition
|
|
4793 of AT-FLAG.)
|
|
4794 This provides similar functionality to `extent-list', but does so in a way
|
|
4795 that is compatible with `extent-at'. (For example, errors due to POS out of
|
|
4796 range are ignored; this makes it safer to use this function in response to
|
|
4797 a mouse event, because in many cases previous events have changed the buffer
|
|
4798 contents.)
|
|
4799 OBJECT specifies a buffer or string and defaults to the current buffer.
|
|
4800 PROPERTY defaults to nil, meaning that any extent will do.
|
|
4801 Properties are attached to extents with `set-extent-property', which see.
|
|
4802 Returns nil if POS is invalid or there is no matching extent at POS.
|
|
4803 If the fourth argument BEFORE is not nil, it must be an extent; any returned
|
|
4804 extent will precede that extent. This feature allows `extents-at' to be
|
|
4805 used by a loop over extents.
|
|
4806 AT-FLAG controls how end cases are handled, and should be one of:
|
|
4807
|
|
4808 nil or `after' An extent is at POS if it covers the character
|
|
4809 after POS. This is consistent with the way
|
|
4810 that text properties work.
|
|
4811 `before' An extent is at POS if it covers the character
|
|
4812 before POS.
|
|
4813 `at' An extent is at POS if it overlaps or abuts POS.
|
|
4814 This includes all zero-length extents at POS.
|
|
4815
|
|
4816 Note that in all cases, the start-openness and end-openness of the extents
|
|
4817 considered is ignored. If you want to pay attention to those properties,
|
|
4818 you should use `map-extents', which gives you more control.
|
|
4819 */
|
|
4820 (pos, object, property, before, at_flag))
|
|
4821 {
|
826
|
4822 Bytexpos position;
|
442
|
4823 EXTENT before_extent;
|
|
4824 enum extent_at_flag fl;
|
|
4825
|
|
4826 object = decode_buffer_or_string (object);
|
|
4827 position = get_buffer_or_string_pos_byte (object, pos, GB_NO_ERROR_IF_BAD);
|
|
4828 if (NILP (before))
|
|
4829 before_extent = 0;
|
|
4830 else
|
|
4831 before_extent = decode_extent (before, DE_MUST_BE_ATTACHED);
|
|
4832 if (before_extent && !EQ (object, extent_object (before_extent)))
|
|
4833 invalid_argument ("extent not in specified buffer or string", object);
|
|
4834 fl = decode_extent_at_flag (at_flag);
|
|
4835
|
826
|
4836 return extent_at (position, object, property, before_extent, fl, 1);
|
428
|
4837 }
|
|
4838
|
|
4839 /* ------------------------------- */
|
|
4840 /* verify_extent_modification() */
|
|
4841 /* ------------------------------- */
|
|
4842
|
|
4843 /* verify_extent_modification() is called when a buffer or string is
|
|
4844 modified to check whether the modification is occuring inside a
|
|
4845 read-only extent.
|
|
4846 */
|
|
4847
|
|
4848 struct verify_extents_arg
|
|
4849 {
|
|
4850 Lisp_Object object;
|
826
|
4851 Memxpos start;
|
|
4852 Memxpos end;
|
428
|
4853 Lisp_Object iro; /* value of inhibit-read-only */
|
|
4854 };
|
|
4855
|
|
4856 static int
|
|
4857 verify_extent_mapper (EXTENT extent, void *arg)
|
|
4858 {
|
|
4859 struct verify_extents_arg *closure = (struct verify_extents_arg *) arg;
|
|
4860 Lisp_Object prop = extent_read_only (extent);
|
|
4861
|
|
4862 if (NILP (prop))
|
|
4863 return 0;
|
|
4864
|
|
4865 if (CONSP (closure->iro) && !NILP (Fmemq (prop, closure->iro)))
|
|
4866 return 0;
|
|
4867
|
|
4868 #if 0 /* Nobody seems to care for this any more -sb */
|
|
4869 /* Allow deletion if the extent is completely contained in
|
|
4870 the region being deleted.
|
|
4871 This is important for supporting tokens which are internally
|
|
4872 write-protected, but which can be killed and yanked as a whole.
|
|
4873 Ignore open/closed distinctions at this point.
|
|
4874 -- Rose
|
|
4875 */
|
|
4876 if (closure->start != closure->end &&
|
|
4877 extent_start (extent) >= closure->start &&
|
|
4878 extent_end (extent) <= closure->end)
|
|
4879 return 0;
|
|
4880 #endif
|
|
4881
|
|
4882 while (1)
|
|
4883 Fsignal (Qbuffer_read_only, (list1 (closure->object)));
|
|
4884
|
1204
|
4885 RETURN_NOT_REACHED(0);
|
428
|
4886 }
|
|
4887
|
|
4888 /* Value of Vinhibit_read_only is precomputed and passed in for
|
|
4889 efficiency */
|
|
4890
|
|
4891 void
|
826
|
4892 verify_extent_modification (Lisp_Object object, Bytexpos from, Bytexpos to,
|
428
|
4893 Lisp_Object inhibit_read_only_value)
|
|
4894 {
|
|
4895 int closed;
|
|
4896 struct verify_extents_arg closure;
|
|
4897
|
|
4898 /* If insertion, visit closed-endpoint extents touching the insertion
|
|
4899 point because the text would go inside those extents. If deletion,
|
|
4900 treat the range as open on both ends so that touching extents are not
|
|
4901 visited. Note that we assume that an insertion is occurring if the
|
|
4902 changed range has zero length, and a deletion otherwise. This
|
|
4903 fails if a change (i.e. non-insertion, non-deletion) is happening.
|
|
4904 As far as I know, this doesn't currently occur in XEmacs. --ben */
|
|
4905 closed = (from==to);
|
|
4906 closure.object = object;
|
826
|
4907 closure.start = buffer_or_string_bytexpos_to_memxpos (object, from);
|
|
4908 closure.end = buffer_or_string_bytexpos_to_memxpos (object, to);
|
428
|
4909 closure.iro = inhibit_read_only_value;
|
|
4910
|
826
|
4911 map_extents (from, to, verify_extent_mapper, (void *) &closure,
|
|
4912 object, 0, closed ? ME_END_CLOSED : ME_START_OPEN);
|
428
|
4913 }
|
|
4914
|
|
4915 /* ------------------------------------ */
|
|
4916 /* process_extents_for_insertion() */
|
|
4917 /* ------------------------------------ */
|
|
4918
|
|
4919 struct process_extents_for_insertion_arg
|
|
4920 {
|
826
|
4921 Bytexpos opoint;
|
428
|
4922 int length;
|
|
4923 Lisp_Object object;
|
|
4924 };
|
|
4925
|
|
4926 /* A region of length LENGTH was just inserted at OPOINT. Modify all
|
|
4927 of the extents as required for the insertion, based on their
|
|
4928 start-open/end-open properties.
|
|
4929 */
|
|
4930
|
|
4931 static int
|
|
4932 process_extents_for_insertion_mapper (EXTENT extent, void *arg)
|
|
4933 {
|
|
4934 struct process_extents_for_insertion_arg *closure =
|
|
4935 (struct process_extents_for_insertion_arg *) arg;
|
826
|
4936 Memxpos indice = buffer_or_string_bytexpos_to_memxpos (closure->object,
|
|
4937 closure->opoint);
|
428
|
4938
|
|
4939 /* When this function is called, one end of the newly-inserted text should
|
|
4940 be adjacent to some endpoint of the extent, or disjoint from it. If
|
|
4941 the insertion overlaps any existing extent, something is wrong.
|
|
4942 */
|
|
4943 #ifdef ERROR_CHECK_EXTENTS
|
|
4944 if (extent_start (extent) > indice &&
|
|
4945 extent_start (extent) < indice + closure->length)
|
2500
|
4946 ABORT ();
|
428
|
4947 if (extent_end (extent) > indice &&
|
|
4948 extent_end (extent) < indice + closure->length)
|
2500
|
4949 ABORT ();
|
428
|
4950 #endif
|
|
4951
|
|
4952 /* The extent-adjustment code adjusted the extent's endpoints as if
|
468
|
4953 all extents were closed-open -- endpoints at the insertion point
|
|
4954 remain unchanged. We need to fix the other kinds of extents:
|
|
4955
|
|
4956 1. Start position of start-open extents needs to be moved.
|
|
4957
|
|
4958 2. End position of end-closed extents needs to be moved.
|
|
4959
|
|
4960 Note that both conditions hold for zero-length (] extents at the
|
|
4961 insertion point. But under these rules, zero-length () extents
|
|
4962 would get adjusted such that their start is greater than their
|
|
4963 end; instead of allowing that, we treat them as [) extents by
|
|
4964 modifying condition #1 to not fire nothing when dealing with a
|
|
4965 zero-length open-open extent.
|
|
4966
|
|
4967 Existence of zero-length open-open extents is unfortunately an
|
|
4968 inelegant part of the extent model, but there is no way around
|
|
4969 it. */
|
428
|
4970
|
|
4971 {
|
826
|
4972 Memxpos new_start = extent_start (extent);
|
|
4973 Memxpos new_end = extent_end (extent);
|
468
|
4974
|
|
4975 if (indice == extent_start (extent) && extent_start_open_p (extent)
|
|
4976 /* zero-length () extents are exempt; see comment above. */
|
|
4977 && !(new_start == new_end && extent_end_open_p (extent))
|
|
4978 )
|
428
|
4979 new_start += closure->length;
|
|
4980 if (indice == extent_end (extent) && !extent_end_open_p (extent))
|
|
4981 new_end += closure->length;
|
468
|
4982
|
428
|
4983 set_extent_endpoints_1 (extent, new_start, new_end);
|
|
4984 }
|
|
4985
|
|
4986 return 0;
|
|
4987 }
|
|
4988
|
|
4989 void
|
826
|
4990 process_extents_for_insertion (Lisp_Object object, Bytexpos opoint,
|
428
|
4991 Bytecount length)
|
|
4992 {
|
|
4993 struct process_extents_for_insertion_arg closure;
|
|
4994
|
|
4995 closure.opoint = opoint;
|
|
4996 closure.length = length;
|
|
4997 closure.object = object;
|
|
4998
|
826
|
4999 map_extents (opoint, opoint + length,
|
|
5000 process_extents_for_insertion_mapper,
|
|
5001 (void *) &closure, object, 0,
|
|
5002 ME_END_CLOSED | ME_MIGHT_MODIFY_EXTENTS |
|
|
5003 ME_INCLUDE_INTERNAL);
|
428
|
5004 }
|
|
5005
|
|
5006 /* ------------------------------------ */
|
|
5007 /* process_extents_for_deletion() */
|
|
5008 /* ------------------------------------ */
|
|
5009
|
|
5010 struct process_extents_for_deletion_arg
|
|
5011 {
|
826
|
5012 Memxpos start, end;
|
428
|
5013 int destroy_included_extents;
|
|
5014 };
|
|
5015
|
|
5016 /* This function is called when we're about to delete the range [from, to].
|
|
5017 Detach all of the extents that are completely inside the range [from, to],
|
|
5018 if they're detachable or open-open. */
|
|
5019
|
|
5020 static int
|
|
5021 process_extents_for_deletion_mapper (EXTENT extent, void *arg)
|
|
5022 {
|
|
5023 struct process_extents_for_deletion_arg *closure =
|
|
5024 (struct process_extents_for_deletion_arg *) arg;
|
|
5025
|
|
5026 /* If the extent lies completely within the range that
|
|
5027 is being deleted, then nuke the extent if it's detachable
|
|
5028 (otherwise, it will become a zero-length extent). */
|
|
5029
|
|
5030 if (closure->start <= extent_start (extent) &&
|
|
5031 extent_end (extent) <= closure->end)
|
|
5032 {
|
|
5033 if (extent_detachable_p (extent))
|
|
5034 {
|
|
5035 if (closure->destroy_included_extents)
|
|
5036 destroy_extent (extent);
|
|
5037 else
|
|
5038 extent_detach (extent);
|
|
5039 }
|
|
5040 }
|
|
5041
|
|
5042 return 0;
|
|
5043 }
|
|
5044
|
|
5045 /* DESTROY_THEM means destroy the extents instead of just deleting them.
|
|
5046 It is unused currently, but perhaps might be used (there used to
|
|
5047 be a function process_extents_for_destruction(), #if 0'd out,
|
|
5048 that did the equivalent). */
|
|
5049 void
|
826
|
5050 process_extents_for_deletion (Lisp_Object object, Bytexpos from,
|
|
5051 Bytexpos to, int destroy_them)
|
428
|
5052 {
|
|
5053 struct process_extents_for_deletion_arg closure;
|
|
5054
|
826
|
5055 closure.start = buffer_or_string_bytexpos_to_memxpos (object, from);
|
|
5056 closure.end = buffer_or_string_bytexpos_to_memxpos (object, to);
|
428
|
5057 closure.destroy_included_extents = destroy_them;
|
|
5058
|
826
|
5059 map_extents (from, to, process_extents_for_deletion_mapper,
|
|
5060 (void *) &closure, object, 0,
|
|
5061 ME_END_CLOSED | ME_MIGHT_MODIFY_EXTENTS);
|
428
|
5062 }
|
|
5063
|
|
5064 /* ------------------------------- */
|
|
5065 /* report_extent_modification() */
|
|
5066 /* ------------------------------- */
|
826
|
5067
|
|
5068 struct report_extent_modification_closure
|
|
5069 {
|
428
|
5070 Lisp_Object buffer;
|
826
|
5071 Charxpos start, end;
|
428
|
5072 int afterp;
|
|
5073 int speccount;
|
|
5074 };
|
|
5075
|
|
5076 static Lisp_Object
|
|
5077 report_extent_modification_restore (Lisp_Object buffer)
|
|
5078 {
|
|
5079 if (current_buffer != XBUFFER (buffer))
|
|
5080 Fset_buffer (buffer);
|
|
5081 return Qnil;
|
|
5082 }
|
|
5083
|
|
5084 static int
|
|
5085 report_extent_modification_mapper (EXTENT extent, void *arg)
|
|
5086 {
|
|
5087 struct report_extent_modification_closure *closure =
|
|
5088 (struct report_extent_modification_closure *)arg;
|
|
5089 Lisp_Object exobj, startobj, endobj;
|
|
5090 Lisp_Object hook = (closure->afterp
|
|
5091 ? extent_after_change_functions (extent)
|
|
5092 : extent_before_change_functions (extent));
|
|
5093 if (NILP (hook))
|
|
5094 return 0;
|
|
5095
|
793
|
5096 exobj = wrap_extent (extent);
|
|
5097 startobj = make_int (closure->start);
|
|
5098 endobj = make_int (closure->end);
|
428
|
5099
|
|
5100 /* Now that we are sure to call elisp, set up an unwind-protect so
|
|
5101 inside_change_hook gets restored in case we throw. Also record
|
|
5102 the current buffer, in case we change it. Do the recording only
|
438
|
5103 once.
|
|
5104
|
|
5105 One confusing thing here is that our caller never actually calls
|
771
|
5106 unbind_to (closure.speccount). This is because
|
826
|
5107 map_extents() unbinds before, and with a smaller
|
771
|
5108 speccount. The additional unbind_to_1() in
|
438
|
5109 report_extent_modification() would cause XEmacs to abort. */
|
428
|
5110 if (closure->speccount == -1)
|
|
5111 {
|
|
5112 closure->speccount = specpdl_depth ();
|
|
5113 record_unwind_protect (report_extent_modification_restore,
|
|
5114 Fcurrent_buffer ());
|
|
5115 }
|
|
5116
|
|
5117 /* The functions will expect closure->buffer to be the current
|
|
5118 buffer, so change it if it isn't. */
|
|
5119 if (current_buffer != XBUFFER (closure->buffer))
|
|
5120 Fset_buffer (closure->buffer);
|
|
5121
|
|
5122 /* #### It's a shame that we can't use any of the existing run_hook*
|
|
5123 functions here. This is so because all of them work with
|
|
5124 symbols, to be able to retrieve default values of local hooks.
|
438
|
5125 <sigh>
|
|
5126
|
|
5127 #### Idea: we could set up a dummy symbol, and call the hook
|
|
5128 functions on *that*. */
|
428
|
5129
|
|
5130 if (!CONSP (hook) || EQ (XCAR (hook), Qlambda))
|
|
5131 call3 (hook, exobj, startobj, endobj);
|
|
5132 else
|
|
5133 {
|
2367
|
5134 EXTERNAL_LIST_LOOP_2 (elt, hook)
|
438
|
5135 /* #### Shouldn't this perform the same Fset_buffer() check as
|
|
5136 above? */
|
2367
|
5137 call3 (elt, exobj, startobj, endobj);
|
428
|
5138 }
|
|
5139 return 0;
|
|
5140 }
|
|
5141
|
|
5142 void
|
665
|
5143 report_extent_modification (Lisp_Object buffer, Charbpos start, Charbpos end,
|
438
|
5144 int afterp)
|
428
|
5145 {
|
|
5146 struct report_extent_modification_closure closure;
|
|
5147
|
|
5148 closure.buffer = buffer;
|
|
5149 closure.start = start;
|
|
5150 closure.end = end;
|
|
5151 closure.afterp = afterp;
|
|
5152 closure.speccount = -1;
|
|
5153
|
826
|
5154 map_extents (charbpos_to_bytebpos (XBUFFER (buffer), start),
|
|
5155 charbpos_to_bytebpos (XBUFFER (buffer), end),
|
|
5156 report_extent_modification_mapper, (void *)&closure,
|
428
|
5157 buffer, NULL, ME_MIGHT_CALL_ELISP);
|
|
5158 }
|
|
5159
|
|
5160
|
|
5161 /************************************************************************/
|
|
5162 /* extent properties */
|
|
5163 /************************************************************************/
|
|
5164
|
|
5165 static void
|
|
5166 set_extent_invisible (EXTENT extent, Lisp_Object value)
|
|
5167 {
|
|
5168 if (!EQ (extent_invisible (extent), value))
|
|
5169 {
|
|
5170 set_extent_invisible_1 (extent, value);
|
826
|
5171 signal_extent_property_changed (extent, Qinvisible, 1);
|
428
|
5172 }
|
|
5173 }
|
|
5174
|
|
5175 /* This function does "memoization" -- similar to the interning
|
|
5176 that happens with symbols. Given a list of faces, an equivalent
|
|
5177 list is returned such that if this function is called twice with
|
|
5178 input that is `equal', the resulting outputs will be `eq'.
|
|
5179
|
|
5180 Note that the inputs and outputs are in general *not* `equal' --
|
|
5181 faces in symbol form become actual face objects in the output.
|
|
5182 This is necessary so that temporary faces stay around. */
|
|
5183
|
|
5184 static Lisp_Object
|
|
5185 memoize_extent_face_internal (Lisp_Object list)
|
|
5186 {
|
|
5187 int len;
|
|
5188 int thelen;
|
|
5189 Lisp_Object cons, thecons;
|
|
5190 Lisp_Object oldtail, tail;
|
|
5191 struct gcpro gcpro1;
|
|
5192
|
|
5193 if (NILP (list))
|
|
5194 return Qnil;
|
|
5195 if (!CONSP (list))
|
|
5196 return Fget_face (list);
|
|
5197
|
|
5198 /* To do the memoization, we use a hash table mapping from
|
|
5199 external lists to internal lists. We do `equal' comparisons
|
|
5200 on the keys so the memoization works correctly.
|
|
5201
|
|
5202 Note that we canonicalize things so that the keys in the
|
|
5203 hash table (the external lists) always contain symbols and
|
|
5204 the values (the internal lists) always contain face objects.
|
|
5205
|
|
5206 We also maintain a "reverse" table that maps from the internal
|
|
5207 lists to the external equivalents. The idea here is twofold:
|
|
5208
|
|
5209 1) `extent-face' wants to return a list containing face symbols
|
|
5210 rather than face objects.
|
|
5211 2) We don't want things to get quite so messed up if the user
|
|
5212 maliciously side-effects the returned lists.
|
|
5213 */
|
|
5214
|
|
5215 len = XINT (Flength (list));
|
|
5216 thelen = XINT (Flength (Vextent_face_reusable_list));
|
|
5217 oldtail = Qnil;
|
|
5218 tail = Qnil;
|
|
5219 GCPRO1 (oldtail);
|
|
5220
|
|
5221 /* We canonicalize the given list into another list.
|
|
5222 We try to avoid consing except when necessary, so we have
|
|
5223 a reusable list.
|
|
5224 */
|
|
5225
|
|
5226 if (thelen < len)
|
|
5227 {
|
|
5228 cons = Vextent_face_reusable_list;
|
|
5229 while (!NILP (XCDR (cons)))
|
|
5230 cons = XCDR (cons);
|
|
5231 XCDR (cons) = Fmake_list (make_int (len - thelen), Qnil);
|
|
5232 }
|
|
5233 else if (thelen > len)
|
|
5234 {
|
|
5235 int i;
|
|
5236
|
|
5237 /* Truncate the list temporarily so it's the right length;
|
|
5238 remember the old tail. */
|
|
5239 cons = Vextent_face_reusable_list;
|
|
5240 for (i = 0; i < len - 1; i++)
|
|
5241 cons = XCDR (cons);
|
|
5242 tail = cons;
|
|
5243 oldtail = XCDR (cons);
|
|
5244 XCDR (cons) = Qnil;
|
|
5245 }
|
|
5246
|
|
5247 thecons = Vextent_face_reusable_list;
|
2367
|
5248 {
|
|
5249 EXTERNAL_LIST_LOOP_2 (face, list)
|
|
5250 {
|
|
5251 face = Fget_face (face);
|
|
5252
|
|
5253 XCAR (thecons) = Fface_name (face);
|
|
5254 thecons = XCDR (thecons);
|
|
5255 }
|
|
5256 }
|
428
|
5257
|
|
5258 list = Fgethash (Vextent_face_reusable_list, Vextent_face_memoize_hash_table,
|
|
5259 Qnil);
|
|
5260 if (NILP (list))
|
|
5261 {
|
|
5262 Lisp_Object symlist = Fcopy_sequence (Vextent_face_reusable_list);
|
|
5263 Lisp_Object facelist = Fcopy_sequence (Vextent_face_reusable_list);
|
|
5264
|
|
5265 LIST_LOOP (cons, facelist)
|
|
5266 {
|
|
5267 XCAR (cons) = Fget_face (XCAR (cons));
|
|
5268 }
|
|
5269 Fputhash (symlist, facelist, Vextent_face_memoize_hash_table);
|
|
5270 Fputhash (facelist, symlist, Vextent_face_reverse_memoize_hash_table);
|
|
5271 list = facelist;
|
|
5272 }
|
|
5273
|
|
5274 /* Now restore the truncated tail of the reusable list, if necessary. */
|
|
5275 if (!NILP (tail))
|
|
5276 XCDR (tail) = oldtail;
|
|
5277
|
|
5278 UNGCPRO;
|
|
5279 return list;
|
|
5280 }
|
|
5281
|
|
5282 static Lisp_Object
|
|
5283 external_of_internal_memoized_face (Lisp_Object face)
|
|
5284 {
|
|
5285 if (NILP (face))
|
|
5286 return Qnil;
|
|
5287 else if (!CONSP (face))
|
|
5288 return XFACE (face)->name;
|
|
5289 else
|
|
5290 {
|
|
5291 face = Fgethash (face, Vextent_face_reverse_memoize_hash_table,
|
|
5292 Qunbound);
|
|
5293 assert (!UNBOUNDP (face));
|
|
5294 return face;
|
|
5295 }
|
|
5296 }
|
|
5297
|
826
|
5298 /* The idea here is that if we're given a list of faces, we
|
|
5299 need to "memoize" this so that two lists of faces that are `equal'
|
|
5300 turn into the same object. When `set-extent-face' is called, we
|
|
5301 "memoize" into a list of actual faces; when `extent-face' is called,
|
|
5302 we do a reverse lookup to get the list of symbols. */
|
|
5303
|
428
|
5304 static Lisp_Object
|
|
5305 canonicalize_extent_property (Lisp_Object prop, Lisp_Object value)
|
|
5306 {
|
|
5307 if (EQ (prop, Qface) || EQ (prop, Qmouse_face))
|
|
5308 value = (external_of_internal_memoized_face
|
|
5309 (memoize_extent_face_internal (value)));
|
|
5310 return value;
|
|
5311 }
|
|
5312
|
|
5313 /* Do we need a lisp-level function ? */
|
826
|
5314 DEFUN ("set-extent-initial-redisplay-function",
|
|
5315 Fset_extent_initial_redisplay_function,
|
444
|
5316 2,2,0, /*
|
428
|
5317 Note: This feature is experimental!
|
|
5318
|
|
5319 Set initial-redisplay-function of EXTENT to the function
|
|
5320 FUNCTION.
|
|
5321
|
|
5322 The first time the EXTENT is (re)displayed, an eval event will be
|
|
5323 dispatched calling FUNCTION with EXTENT as its only argument.
|
|
5324 */
|
|
5325 (extent, function))
|
|
5326 {
|
826
|
5327 /* #### This is totally broken. */
|
|
5328 EXTENT e = decode_extent (extent, DE_MUST_BE_ATTACHED);
|
428
|
5329
|
|
5330 e = extent_ancestor (e); /* Is this needed? Macro also does chasing!*/
|
826
|
5331 set_extent_initial_redisplay_function (e, function);
|
|
5332 extent_in_red_event_p (e) = 0; /* If the function changed we can spawn
|
428
|
5333 new events */
|
826
|
5334 signal_extent_property_changed (e, Qinitial_redisplay_function, 1);
|
428
|
5335 return function;
|
|
5336 }
|
|
5337
|
|
5338 DEFUN ("extent-face", Fextent_face, 1, 1, 0, /*
|
|
5339 Return the name of the face in which EXTENT is displayed, or nil
|
|
5340 if the extent's face is unspecified. This might also return a list
|
|
5341 of face names.
|
|
5342 */
|
|
5343 (extent))
|
|
5344 {
|
|
5345 Lisp_Object face;
|
|
5346
|
|
5347 CHECK_EXTENT (extent);
|
|
5348 face = extent_face (XEXTENT (extent));
|
|
5349
|
|
5350 return external_of_internal_memoized_face (face);
|
|
5351 }
|
|
5352
|
|
5353 DEFUN ("set-extent-face", Fset_extent_face, 2, 2, 0, /*
|
|
5354 Make the given EXTENT have the graphic attributes specified by FACE.
|
|
5355 FACE can also be a list of faces, and all faces listed will apply,
|
|
5356 with faces earlier in the list taking priority over those later in the
|
|
5357 list.
|
|
5358 */
|
|
5359 (extent, face))
|
|
5360 {
|
|
5361 EXTENT e = decode_extent(extent, 0);
|
|
5362 Lisp_Object orig_face = face;
|
|
5363
|
|
5364 /* retrieve the ancestor for efficiency and proper redisplay noting. */
|
|
5365 e = extent_ancestor (e);
|
|
5366
|
|
5367 face = memoize_extent_face_internal (face);
|
|
5368
|
|
5369 extent_face (e) = face;
|
826
|
5370 signal_extent_property_changed (e, Qface, 1);
|
428
|
5371
|
|
5372 return orig_face;
|
|
5373 }
|
|
5374
|
|
5375
|
|
5376 DEFUN ("extent-mouse-face", Fextent_mouse_face, 1, 1, 0, /*
|
|
5377 Return the face used to highlight EXTENT when the mouse passes over it.
|
|
5378 The return value will be a face name, a list of face names, or nil
|
|
5379 if the extent's mouse face is unspecified.
|
|
5380 */
|
|
5381 (extent))
|
|
5382 {
|
|
5383 Lisp_Object face;
|
|
5384
|
|
5385 CHECK_EXTENT (extent);
|
|
5386 face = extent_mouse_face (XEXTENT (extent));
|
|
5387
|
|
5388 return external_of_internal_memoized_face (face);
|
|
5389 }
|
|
5390
|
|
5391 DEFUN ("set-extent-mouse-face", Fset_extent_mouse_face, 2, 2, 0, /*
|
|
5392 Set the face used to highlight EXTENT when the mouse passes over it.
|
|
5393 FACE can also be a list of faces, and all faces listed will apply,
|
|
5394 with faces earlier in the list taking priority over those later in the
|
|
5395 list.
|
|
5396 */
|
|
5397 (extent, face))
|
|
5398 {
|
|
5399 EXTENT e;
|
|
5400 Lisp_Object orig_face = face;
|
|
5401
|
|
5402 CHECK_EXTENT (extent);
|
|
5403 e = XEXTENT (extent);
|
|
5404 /* retrieve the ancestor for efficiency and proper redisplay noting. */
|
|
5405 e = extent_ancestor (e);
|
|
5406
|
|
5407 face = memoize_extent_face_internal (face);
|
|
5408
|
|
5409 set_extent_mouse_face (e, face);
|
826
|
5410 signal_extent_property_changed (e, Qmouse_face, 1);
|
428
|
5411
|
|
5412 return orig_face;
|
|
5413 }
|
|
5414
|
|
5415 void
|
|
5416 set_extent_glyph (EXTENT extent, Lisp_Object glyph, int endp,
|
|
5417 glyph_layout layout)
|
|
5418 {
|
|
5419 extent = extent_ancestor (extent);
|
|
5420
|
|
5421 if (!endp)
|
|
5422 {
|
|
5423 set_extent_begin_glyph (extent, glyph);
|
647
|
5424 set_extent_begin_glyph_layout (extent, layout);
|
826
|
5425 signal_extent_property_changed (extent, Qbegin_glyph, 1);
|
|
5426 signal_extent_property_changed (extent, Qbegin_glyph_layout, 1);
|
428
|
5427 }
|
|
5428 else
|
|
5429 {
|
|
5430 set_extent_end_glyph (extent, glyph);
|
647
|
5431 set_extent_end_glyph_layout (extent, layout);
|
826
|
5432 signal_extent_property_changed (extent, Qend_glyph, 1);
|
|
5433 signal_extent_property_changed (extent, Qend_glyph_layout, 1);
|
428
|
5434 }
|
|
5435 }
|
|
5436
|
|
5437 static Lisp_Object
|
|
5438 glyph_layout_to_symbol (glyph_layout layout)
|
|
5439 {
|
|
5440 switch (layout)
|
|
5441 {
|
|
5442 case GL_TEXT: return Qtext;
|
|
5443 case GL_OUTSIDE_MARGIN: return Qoutside_margin;
|
|
5444 case GL_INSIDE_MARGIN: return Qinside_margin;
|
|
5445 case GL_WHITESPACE: return Qwhitespace;
|
|
5446 default:
|
2500
|
5447 ABORT ();
|
428
|
5448 return Qnil; /* unreached */
|
|
5449 }
|
|
5450 }
|
|
5451
|
|
5452 static glyph_layout
|
|
5453 symbol_to_glyph_layout (Lisp_Object layout_obj)
|
|
5454 {
|
|
5455 if (NILP (layout_obj))
|
|
5456 return GL_TEXT;
|
|
5457
|
|
5458 CHECK_SYMBOL (layout_obj);
|
|
5459 if (EQ (layout_obj, Qoutside_margin)) return GL_OUTSIDE_MARGIN;
|
|
5460 if (EQ (layout_obj, Qinside_margin)) return GL_INSIDE_MARGIN;
|
|
5461 if (EQ (layout_obj, Qwhitespace)) return GL_WHITESPACE;
|
|
5462 if (EQ (layout_obj, Qtext)) return GL_TEXT;
|
|
5463
|
563
|
5464 invalid_constant ("Unknown glyph layout type", layout_obj);
|
1204
|
5465 RETURN_NOT_REACHED (GL_TEXT);
|
428
|
5466 }
|
|
5467
|
|
5468 static Lisp_Object
|
|
5469 set_extent_glyph_1 (Lisp_Object extent_obj, Lisp_Object glyph, int endp,
|
|
5470 Lisp_Object layout_obj)
|
|
5471 {
|
442
|
5472 EXTENT extent = decode_extent (extent_obj, 0);
|
428
|
5473 glyph_layout layout = symbol_to_glyph_layout (layout_obj);
|
|
5474
|
|
5475 /* Make sure we've actually been given a valid glyph or it's nil
|
|
5476 (meaning we're deleting a glyph from an extent). */
|
|
5477 if (!NILP (glyph))
|
|
5478 CHECK_BUFFER_GLYPH (glyph);
|
|
5479
|
|
5480 set_extent_glyph (extent, glyph, endp, layout);
|
|
5481 return glyph;
|
|
5482 }
|
|
5483
|
|
5484 DEFUN ("set-extent-begin-glyph", Fset_extent_begin_glyph, 2, 3, 0, /*
|
|
5485 Display a bitmap, subwindow or string at the beginning of EXTENT.
|
|
5486 BEGIN-GLYPH must be a glyph object. The layout policy defaults to `text'.
|
|
5487 */
|
|
5488 (extent, begin_glyph, layout))
|
|
5489 {
|
|
5490 return set_extent_glyph_1 (extent, begin_glyph, 0, layout);
|
|
5491 }
|
|
5492
|
|
5493 DEFUN ("set-extent-end-glyph", Fset_extent_end_glyph, 2, 3, 0, /*
|
|
5494 Display a bitmap, subwindow or string at the end of EXTENT.
|
|
5495 END-GLYPH must be a glyph object. The layout policy defaults to `text'.
|
|
5496 */
|
|
5497 (extent, end_glyph, layout))
|
|
5498 {
|
|
5499 return set_extent_glyph_1 (extent, end_glyph, 1, layout);
|
|
5500 }
|
|
5501
|
|
5502 DEFUN ("extent-begin-glyph", Fextent_begin_glyph, 1, 1, 0, /*
|
|
5503 Return the glyph object displayed at the beginning of EXTENT.
|
|
5504 If there is none, nil is returned.
|
|
5505 */
|
|
5506 (extent))
|
|
5507 {
|
|
5508 return extent_begin_glyph (decode_extent (extent, 0));
|
|
5509 }
|
|
5510
|
|
5511 DEFUN ("extent-end-glyph", Fextent_end_glyph, 1, 1, 0, /*
|
|
5512 Return the glyph object displayed at the end of EXTENT.
|
|
5513 If there is none, nil is returned.
|
|
5514 */
|
|
5515 (extent))
|
|
5516 {
|
|
5517 return extent_end_glyph (decode_extent (extent, 0));
|
|
5518 }
|
|
5519
|
|
5520 DEFUN ("set-extent-begin-glyph-layout", Fset_extent_begin_glyph_layout, 2, 2, 0, /*
|
|
5521 Set the layout policy of EXTENT's begin glyph.
|
|
5522 Access this using the `extent-begin-glyph-layout' function.
|
|
5523 */
|
|
5524 (extent, layout))
|
|
5525 {
|
|
5526 EXTENT e = decode_extent (extent, 0);
|
|
5527 e = extent_ancestor (e);
|
647
|
5528 set_extent_begin_glyph_layout (e, symbol_to_glyph_layout (layout));
|
826
|
5529 signal_extent_property_changed (e, Qbegin_glyph_layout, 1);
|
428
|
5530 return layout;
|
|
5531 }
|
|
5532
|
|
5533 DEFUN ("set-extent-end-glyph-layout", Fset_extent_end_glyph_layout, 2, 2, 0, /*
|
|
5534 Set the layout policy of EXTENT's end glyph.
|
|
5535 Access this using the `extent-end-glyph-layout' function.
|
|
5536 */
|
|
5537 (extent, layout))
|
|
5538 {
|
|
5539 EXTENT e = decode_extent (extent, 0);
|
|
5540 e = extent_ancestor (e);
|
647
|
5541 set_extent_end_glyph_layout (e, symbol_to_glyph_layout (layout));
|
826
|
5542 signal_extent_property_changed (e, Qend_glyph_layout, 1);
|
428
|
5543 return layout;
|
|
5544 }
|
|
5545
|
|
5546 DEFUN ("extent-begin-glyph-layout", Fextent_begin_glyph_layout, 1, 1, 0, /*
|
|
5547 Return the layout policy associated with EXTENT's begin glyph.
|
|
5548 Set this using the `set-extent-begin-glyph-layout' function.
|
|
5549 */
|
|
5550 (extent))
|
|
5551 {
|
|
5552 EXTENT e = decode_extent (extent, 0);
|
|
5553 return glyph_layout_to_symbol ((glyph_layout) extent_begin_glyph_layout (e));
|
|
5554 }
|
|
5555
|
|
5556 DEFUN ("extent-end-glyph-layout", Fextent_end_glyph_layout, 1, 1, 0, /*
|
|
5557 Return the layout policy associated with EXTENT's end glyph.
|
|
5558 Set this using the `set-extent-end-glyph-layout' function.
|
|
5559 */
|
|
5560 (extent))
|
|
5561 {
|
|
5562 EXTENT e = decode_extent (extent, 0);
|
|
5563 return glyph_layout_to_symbol ((glyph_layout) extent_end_glyph_layout (e));
|
|
5564 }
|
|
5565
|
|
5566 DEFUN ("set-extent-priority", Fset_extent_priority, 2, 2, 0, /*
|
|
5567 Set the display priority of EXTENT to PRIORITY (an integer).
|
|
5568 When the extent attributes are being merged for display, the priority
|
|
5569 is used to determine which extent takes precedence in the event of a
|
|
5570 conflict (two extents whose faces both specify font, for example: the
|
|
5571 font of the extent with the higher priority will be used).
|
|
5572 Extents are created with priority 0; priorities may be negative.
|
|
5573 */
|
|
5574 (extent, priority))
|
|
5575 {
|
|
5576 EXTENT e = decode_extent (extent, 0);
|
|
5577
|
|
5578 CHECK_INT (priority);
|
|
5579 e = extent_ancestor (e);
|
|
5580 set_extent_priority (e, XINT (priority));
|
826
|
5581 signal_extent_property_changed (e, Qpriority, 1);
|
428
|
5582 return priority;
|
|
5583 }
|
|
5584
|
|
5585 DEFUN ("extent-priority", Fextent_priority, 1, 1, 0, /*
|
|
5586 Return the display priority of EXTENT; see `set-extent-priority'.
|
|
5587 */
|
|
5588 (extent))
|
|
5589 {
|
|
5590 EXTENT e = decode_extent (extent, 0);
|
|
5591 return make_int (extent_priority (e));
|
|
5592 }
|
|
5593
|
|
5594 DEFUN ("set-extent-property", Fset_extent_property, 3, 3, 0, /*
|
|
5595 Change a property of an extent.
|
|
5596 PROPERTY may be any symbol; the value stored may be accessed with
|
|
5597 the `extent-property' function.
|
2758
|
5598
|
428
|
5599 The following symbols have predefined meanings:
|
|
5600
|
|
5601 detached Removes the extent from its buffer; setting this is
|
|
5602 the same as calling `detach-extent'.
|
|
5603
|
|
5604 destroyed Removes the extent from its buffer, and makes it
|
|
5605 unusable in the future; this is the same calling
|
|
5606 `delete-extent'.
|
|
5607
|
|
5608 priority Change redisplay priority; same as `set-extent-priority'.
|
|
5609
|
|
5610 start-open Whether the set of characters within the extent is
|
|
5611 treated being open on the left, that is, whether
|
|
5612 the start position is an exclusive, rather than
|
|
5613 inclusive, boundary. If true, then characters
|
|
5614 inserted exactly at the beginning of the extent
|
|
5615 will remain outside of the extent; otherwise they
|
|
5616 will go into the extent, extending it.
|
|
5617
|
|
5618 end-open Whether the set of characters within the extent is
|
|
5619 treated being open on the right, that is, whether
|
|
5620 the end position is an exclusive, rather than
|
|
5621 inclusive, boundary. If true, then characters
|
|
5622 inserted exactly at the end of the extent will
|
|
5623 remain outside of the extent; otherwise they will
|
|
5624 go into the extent, extending it.
|
|
5625
|
|
5626 By default, extents have the `end-open' but not the
|
|
5627 `start-open' property set.
|
|
5628
|
|
5629 read-only Text within this extent will be unmodifiable.
|
|
5630
|
|
5631 initial-redisplay-function (EXPERIMENTAL)
|
|
5632 function to be called the first time (part of) the extent
|
|
5633 is redisplayed. It will be called with the extent as its
|
|
5634 first argument.
|
1041
|
5635 Note: The function will not be called immediately
|
|
5636 during redisplay, an eval event will be dispatched.
|
428
|
5637
|
|
5638 detachable Whether the extent gets detached (as with
|
|
5639 `detach-extent') when all the text within the
|
|
5640 extent is deleted. This is true by default. If
|
|
5641 this property is not set, the extent becomes a
|
|
5642 zero-length extent when its text is deleted. (In
|
|
5643 such a case, the `start-open' property is
|
|
5644 automatically removed if both the `start-open' and
|
|
5645 `end-open' properties are set, since zero-length
|
|
5646 extents open on both ends are not allowed.)
|
|
5647
|
|
5648 face The face in which to display the text. Setting
|
|
5649 this is the same as calling `set-extent-face'.
|
|
5650
|
1041
|
5651 mouse-face If non-nil, the extent will be highlighted in this
|
|
5652 face when the mouse moves over it.
|
428
|
5653
|
|
5654 pointer If non-nil, and a valid pointer glyph, this specifies
|
|
5655 the shape of the mouse pointer while over the extent.
|
|
5656
|
|
5657 highlight Obsolete: Setting this property is equivalent to
|
1041
|
5658 setting a `mouse-face' property of `highlight'.
|
|
5659 Reading this property returns non-nil if
|
|
5660 the extent has a non-nil `mouse-face' property.
|
428
|
5661
|
|
5662 duplicable Whether this extent should be copied into strings,
|
|
5663 so that kill, yank, and undo commands will restore
|
|
5664 or copy it. `duplicable' extents are copied from
|
|
5665 an extent into a string when `buffer-substring' or
|
|
5666 a similar function creates a string. The extents
|
|
5667 in a string are copied into other strings created
|
|
5668 from the string using `concat' or `substring'.
|
|
5669 When `insert' or a similar function inserts the
|
|
5670 string into a buffer, the extents are copied back
|
|
5671 into the buffer.
|
|
5672
|
|
5673 unique Meaningful only in conjunction with `duplicable'.
|
|
5674 When this is set, there may be only one instance
|
|
5675 of this extent attached at a time: if it is copied
|
|
5676 to the kill ring and then yanked, the extent is
|
|
5677 not copied. If, however, it is killed (removed
|
|
5678 from the buffer) and then yanked, it will be
|
|
5679 re-attached at the new position.
|
|
5680
|
|
5681 invisible If the value is non-nil, text under this extent
|
|
5682 may be treated as not present for the purpose of
|
|
5683 redisplay, or may be displayed using an ellipsis
|
|
5684 or other marker; see `buffer-invisibility-spec'
|
|
5685 and `invisible-text-glyph'. In all cases,
|
|
5686 however, the text is still visible to other
|
|
5687 functions that examine a buffer's text.
|
|
5688
|
|
5689 keymap This keymap is consulted for mouse clicks on this
|
|
5690 extent, or keypresses made while point is within the
|
|
5691 extent.
|
|
5692
|
|
5693 copy-function This is a hook that is run when a duplicable extent
|
|
5694 is about to be copied from a buffer to a string (or
|
|
5695 the kill ring). It is called with three arguments,
|
|
5696 the extent, and the buffer-positions within it
|
|
5697 which are being copied. If this function returns
|
|
5698 nil, then the extent will not be copied; otherwise
|
|
5699 it will.
|
|
5700
|
|
5701 paste-function This is a hook that is run when a duplicable extent is
|
|
5702 about to be copied from a string (or the kill ring)
|
|
5703 into a buffer. It is called with three arguments,
|
|
5704 the original extent, and the buffer positions which
|
|
5705 the copied extent will occupy. (This hook is run
|
|
5706 after the corresponding text has already been
|
|
5707 inserted into the buffer.) Note that the extent
|
|
5708 argument may be detached when this function is run.
|
|
5709 If this function returns nil, no extent will be
|
|
5710 inserted. Otherwise, there will be an extent
|
|
5711 covering the range in question.
|
|
5712
|
|
5713 If the original extent is not attached to a buffer,
|
|
5714 then it will be re-attached at this range.
|
|
5715 Otherwise, a copy will be made, and that copy
|
|
5716 attached here.
|
|
5717
|
|
5718 The copy-function and paste-function are meaningful
|
|
5719 only for extents with the `duplicable' flag set,
|
|
5720 and if they are not specified, behave as if `t' was
|
|
5721 the returned value. When these hooks are invoked,
|
|
5722 the current buffer is the buffer which the extent
|
|
5723 is being copied from/to, respectively.
|
|
5724
|
|
5725 begin-glyph A glyph to be displayed at the beginning of the extent,
|
|
5726 or nil.
|
|
5727
|
|
5728 end-glyph A glyph to be displayed at the end of the extent,
|
|
5729 or nil.
|
|
5730
|
|
5731 begin-glyph-layout The layout policy (one of `text', `whitespace',
|
|
5732 `inside-margin', or `outside-margin') of the extent's
|
|
5733 begin glyph.
|
|
5734
|
1041
|
5735 end-glyph-layout The layout policy of the extent's end glyph.
|
|
5736
|
|
5737 syntax-table A cons or a syntax table object. If a cons, the car must
|
2767
|
5738 be an integer (interpreted as a syntax code, applicable
|
|
5739 to all characters in the extent). Otherwise, syntax of
|
|
5740 characters in the extent is looked up in the syntax
|
|
5741 table. You should use the text property API to
|
|
5742 manipulate this property. (This may be required in the
|
|
5743 future.)
|
|
5744
|
|
5745 The following property is available if `atomic-extents.el'--part of the
|
|
5746 `edit-utils' package--has been loaded:
|
2758
|
5747
|
|
5748 atomic When set, point will never fall inside the extent.
|
|
5749 Not as useful as you might think, as
|
|
5750 `delete-backward-char' still removes characters one by
|
2767
|
5751 one. This property as currently implemented is a
|
|
5752 kludge, and be prepared for it to go away if and when we
|
|
5753 implement something better.
|
2758
|
5754
|
428
|
5755 */
|
|
5756 (extent, property, value))
|
|
5757 {
|
|
5758 /* This function can GC if property is `keymap' */
|
|
5759 EXTENT e = decode_extent (extent, 0);
|
826
|
5760 int signal_change = 0;
|
|
5761
|
|
5762 /* If VALUE is unbound, the property is being removed through `remprop'.
|
|
5763 Return Qunbound if removal disallowed, Qt if anything removed,
|
|
5764 Qnil otherwise. */
|
|
5765
|
|
5766 /* Keep in synch with stuff below. */
|
|
5767 if (UNBOUNDP (value))
|
|
5768 {
|
|
5769 int retval;
|
|
5770
|
|
5771 if (EQ (property, Qread_only)
|
|
5772 || EQ (property, Qunique)
|
|
5773 || EQ (property, Qduplicable)
|
|
5774 || EQ (property, Qinvisible)
|
|
5775 || EQ (property, Qdetachable)
|
|
5776 || EQ (property, Qdetached)
|
|
5777 || EQ (property, Qdestroyed)
|
|
5778 || EQ (property, Qpriority)
|
|
5779 || EQ (property, Qface)
|
|
5780 || EQ (property, Qinitial_redisplay_function)
|
|
5781 || EQ (property, Qafter_change_functions)
|
|
5782 || EQ (property, Qbefore_change_functions)
|
|
5783 || EQ (property, Qmouse_face)
|
|
5784 || EQ (property, Qhighlight)
|
|
5785 || EQ (property, Qbegin_glyph_layout)
|
|
5786 || EQ (property, Qend_glyph_layout)
|
|
5787 || EQ (property, Qglyph_layout)
|
|
5788 || EQ (property, Qbegin_glyph)
|
|
5789 || EQ (property, Qend_glyph)
|
|
5790 || EQ (property, Qstart_open)
|
|
5791 || EQ (property, Qend_open)
|
|
5792 || EQ (property, Qstart_closed)
|
|
5793 || EQ (property, Qend_closed)
|
|
5794 || EQ (property, Qkeymap))
|
|
5795 return Qunbound;
|
|
5796
|
|
5797 retval = external_remprop (extent_plist_addr (e), property, 0,
|
|
5798 ERROR_ME);
|
|
5799 if (retval)
|
|
5800 signal_extent_property_changed (e, property, 1);
|
|
5801 return retval ? Qt : Qnil;
|
|
5802 }
|
428
|
5803
|
|
5804 if (EQ (property, Qread_only))
|
826
|
5805 {
|
|
5806 set_extent_read_only (e, value);
|
|
5807 signal_change = 1;
|
|
5808 }
|
428
|
5809 else if (EQ (property, Qunique))
|
826
|
5810 {
|
|
5811 extent_unique_p (e) = !NILP (value);
|
|
5812 signal_change = 1;
|
|
5813 }
|
428
|
5814 else if (EQ (property, Qduplicable))
|
826
|
5815 {
|
|
5816 extent_duplicable_p (e) = !NILP (value);
|
|
5817 signal_change = 1;
|
|
5818 }
|
428
|
5819 else if (EQ (property, Qinvisible))
|
|
5820 set_extent_invisible (e, value);
|
|
5821 else if (EQ (property, Qdetachable))
|
826
|
5822 {
|
|
5823 extent_detachable_p (e) = !NILP (value);
|
|
5824 signal_change = 1;
|
|
5825 }
|
428
|
5826 else if (EQ (property, Qdetached))
|
|
5827 {
|
|
5828 if (NILP (value))
|
826
|
5829 invalid_operation ("can only set `detached' to t", Qunbound);
|
428
|
5830 Fdetach_extent (extent);
|
|
5831 }
|
|
5832 else if (EQ (property, Qdestroyed))
|
|
5833 {
|
|
5834 if (NILP (value))
|
826
|
5835 invalid_operation ("can only set `destroyed' to t", Qunbound);
|
428
|
5836 Fdelete_extent (extent);
|
|
5837 }
|
|
5838 else if (EQ (property, Qpriority))
|
|
5839 Fset_extent_priority (extent, value);
|
|
5840 else if (EQ (property, Qface))
|
|
5841 Fset_extent_face (extent, value);
|
|
5842 else if (EQ (property, Qinitial_redisplay_function))
|
|
5843 Fset_extent_initial_redisplay_function (extent, value);
|
|
5844 else if (EQ (property, Qbefore_change_functions))
|
826
|
5845 {
|
|
5846 set_extent_before_change_functions (e, value);
|
|
5847 signal_change = 1;
|
|
5848 }
|
428
|
5849 else if (EQ (property, Qafter_change_functions))
|
826
|
5850 {
|
|
5851 set_extent_after_change_functions (e, value);
|
|
5852 signal_change = 1;
|
|
5853 }
|
428
|
5854 else if (EQ (property, Qmouse_face))
|
|
5855 Fset_extent_mouse_face (extent, value);
|
|
5856 /* Obsolete: */
|
|
5857 else if (EQ (property, Qhighlight))
|
|
5858 Fset_extent_mouse_face (extent, Qhighlight);
|
|
5859 else if (EQ (property, Qbegin_glyph_layout))
|
|
5860 Fset_extent_begin_glyph_layout (extent, value);
|
|
5861 else if (EQ (property, Qend_glyph_layout))
|
|
5862 Fset_extent_end_glyph_layout (extent, value);
|
|
5863 /* For backwards compatibility. We use begin glyph because it is by
|
|
5864 far the more used of the two. */
|
|
5865 else if (EQ (property, Qglyph_layout))
|
|
5866 Fset_extent_begin_glyph_layout (extent, value);
|
|
5867 else if (EQ (property, Qbegin_glyph))
|
|
5868 Fset_extent_begin_glyph (extent, value, Qnil);
|
|
5869 else if (EQ (property, Qend_glyph))
|
|
5870 Fset_extent_end_glyph (extent, value, Qnil);
|
|
5871 else if (EQ (property, Qstart_open))
|
|
5872 set_extent_openness (e, !NILP (value), -1);
|
|
5873 else if (EQ (property, Qend_open))
|
|
5874 set_extent_openness (e, -1, !NILP (value));
|
|
5875 /* Support (but don't document...) the obvious *_closed antonyms. */
|
|
5876 else if (EQ (property, Qstart_closed))
|
|
5877 set_extent_openness (e, NILP (value), -1);
|
|
5878 else if (EQ (property, Qend_closed))
|
|
5879 set_extent_openness (e, -1, NILP (value));
|
|
5880 else
|
|
5881 {
|
|
5882 if (EQ (property, Qkeymap))
|
|
5883 while (!NILP (value) && NILP (Fkeymapp (value)))
|
|
5884 value = wrong_type_argument (Qkeymapp, value);
|
|
5885
|
|
5886 external_plist_put (extent_plist_addr (e), property, value, 0, ERROR_ME);
|
826
|
5887 signal_change = 1;
|
428
|
5888 }
|
|
5889
|
826
|
5890 if (signal_change)
|
|
5891 signal_extent_property_changed (e, property, 1);
|
428
|
5892 return value;
|
|
5893 }
|
|
5894
|
|
5895 DEFUN ("set-extent-properties", Fset_extent_properties, 2, 2, 0, /*
|
|
5896 Change some properties of EXTENT.
|
|
5897 PLIST is a property list.
|
|
5898 For a list of built-in properties, see `set-extent-property'.
|
|
5899 */
|
|
5900 (extent, plist))
|
|
5901 {
|
|
5902 /* This function can GC, if one of the properties is `keymap' */
|
|
5903 Lisp_Object property, value;
|
|
5904 struct gcpro gcpro1;
|
|
5905 GCPRO1 (plist);
|
|
5906
|
|
5907 plist = Fcopy_sequence (plist);
|
|
5908 Fcanonicalize_plist (plist, Qnil);
|
|
5909
|
|
5910 while (!NILP (plist))
|
|
5911 {
|
|
5912 property = Fcar (plist); plist = Fcdr (plist);
|
|
5913 value = Fcar (plist); plist = Fcdr (plist);
|
|
5914 Fset_extent_property (extent, property, value);
|
|
5915 }
|
|
5916 UNGCPRO;
|
|
5917 return Qnil;
|
|
5918 }
|
|
5919
|
|
5920 DEFUN ("extent-property", Fextent_property, 2, 3, 0, /*
|
|
5921 Return EXTENT's value for property PROPERTY.
|
444
|
5922 If no such property exists, DEFAULT is returned.
|
428
|
5923 See `set-extent-property' for the built-in property names.
|
|
5924 */
|
|
5925 (extent, property, default_))
|
|
5926 {
|
|
5927 EXTENT e = decode_extent (extent, 0);
|
|
5928
|
|
5929 if (EQ (property, Qdetached))
|
|
5930 return extent_detached_p (e) ? Qt : Qnil;
|
|
5931 else if (EQ (property, Qdestroyed))
|
|
5932 return !EXTENT_LIVE_P (e) ? Qt : Qnil;
|
|
5933 else if (EQ (property, Qstart_open))
|
|
5934 return extent_normal_field (e, start_open) ? Qt : Qnil;
|
|
5935 else if (EQ (property, Qend_open))
|
|
5936 return extent_normal_field (e, end_open) ? Qt : Qnil;
|
|
5937 else if (EQ (property, Qunique))
|
|
5938 return extent_normal_field (e, unique) ? Qt : Qnil;
|
|
5939 else if (EQ (property, Qduplicable))
|
|
5940 return extent_normal_field (e, duplicable) ? Qt : Qnil;
|
|
5941 else if (EQ (property, Qdetachable))
|
|
5942 return extent_normal_field (e, detachable) ? Qt : Qnil;
|
|
5943 /* Support (but don't document...) the obvious *_closed antonyms. */
|
|
5944 else if (EQ (property, Qstart_closed))
|
|
5945 return extent_start_open_p (e) ? Qnil : Qt;
|
|
5946 else if (EQ (property, Qend_closed))
|
|
5947 return extent_end_open_p (e) ? Qnil : Qt;
|
|
5948 else if (EQ (property, Qpriority))
|
|
5949 return make_int (extent_priority (e));
|
|
5950 else if (EQ (property, Qread_only))
|
|
5951 return extent_read_only (e);
|
|
5952 else if (EQ (property, Qinvisible))
|
|
5953 return extent_invisible (e);
|
|
5954 else if (EQ (property, Qface))
|
|
5955 return Fextent_face (extent);
|
|
5956 else if (EQ (property, Qinitial_redisplay_function))
|
|
5957 return extent_initial_redisplay_function (e);
|
|
5958 else if (EQ (property, Qbefore_change_functions))
|
|
5959 return extent_before_change_functions (e);
|
|
5960 else if (EQ (property, Qafter_change_functions))
|
|
5961 return extent_after_change_functions (e);
|
|
5962 else if (EQ (property, Qmouse_face))
|
|
5963 return Fextent_mouse_face (extent);
|
|
5964 /* Obsolete: */
|
|
5965 else if (EQ (property, Qhighlight))
|
|
5966 return !NILP (Fextent_mouse_face (extent)) ? Qt : Qnil;
|
|
5967 else if (EQ (property, Qbegin_glyph_layout))
|
|
5968 return Fextent_begin_glyph_layout (extent);
|
|
5969 else if (EQ (property, Qend_glyph_layout))
|
|
5970 return Fextent_end_glyph_layout (extent);
|
|
5971 /* For backwards compatibility. We use begin glyph because it is by
|
|
5972 far the more used of the two. */
|
|
5973 else if (EQ (property, Qglyph_layout))
|
|
5974 return Fextent_begin_glyph_layout (extent);
|
|
5975 else if (EQ (property, Qbegin_glyph))
|
|
5976 return extent_begin_glyph (e);
|
|
5977 else if (EQ (property, Qend_glyph))
|
|
5978 return extent_end_glyph (e);
|
|
5979 else
|
|
5980 {
|
|
5981 Lisp_Object value = external_plist_get (extent_plist_addr (e),
|
|
5982 property, 0, ERROR_ME);
|
|
5983 return UNBOUNDP (value) ? default_ : value;
|
|
5984 }
|
|
5985 }
|
|
5986
|
826
|
5987 static void
|
|
5988 extent_properties (EXTENT e, Lisp_Object_pair_dynarr *props)
|
|
5989 {
|
|
5990 Lisp_Object face, anc_obj;
|
428
|
5991 glyph_layout layout;
|
826
|
5992 EXTENT anc;
|
|
5993
|
|
5994 #define ADD_PROP(miftaaH, maal) \
|
|
5995 do { \
|
|
5996 Lisp_Object_pair p; \
|
|
5997 p.key = miftaaH; \
|
|
5998 p.value = maal; \
|
|
5999 Dynarr_add (props, p); \
|
|
6000 } while (0)
|
|
6001
|
428
|
6002 if (!EXTENT_LIVE_P (e))
|
826
|
6003 {
|
|
6004 ADD_PROP (Qdestroyed, Qt);
|
|
6005 return;
|
|
6006 }
|
428
|
6007
|
|
6008 anc = extent_ancestor (e);
|
793
|
6009 anc_obj = wrap_extent (anc);
|
428
|
6010
|
|
6011 /* For efficiency, use the ancestor for all properties except detached */
|
826
|
6012 {
|
|
6013 EXTERNAL_PROPERTY_LIST_LOOP_3 (key, value, extent_plist_slot (anc))
|
|
6014 ADD_PROP (key, value);
|
|
6015 }
|
428
|
6016
|
|
6017 if (!NILP (face = Fextent_face (anc_obj)))
|
826
|
6018 ADD_PROP (Qface, face);
|
428
|
6019
|
|
6020 if (!NILP (face = Fextent_mouse_face (anc_obj)))
|
826
|
6021 ADD_PROP (Qmouse_face, face);
|
428
|
6022
|
|
6023 if ((layout = (glyph_layout) extent_begin_glyph_layout (anc)) != GL_TEXT)
|
|
6024 {
|
|
6025 Lisp_Object sym = glyph_layout_to_symbol (layout);
|
826
|
6026 ADD_PROP (Qglyph_layout, sym); /* compatibility */
|
|
6027 ADD_PROP (Qbegin_glyph_layout, sym);
|
428
|
6028 }
|
|
6029
|
|
6030 if ((layout = (glyph_layout) extent_end_glyph_layout (anc)) != GL_TEXT)
|
826
|
6031 ADD_PROP (Qend_glyph_layout, glyph_layout_to_symbol (layout));
|
428
|
6032
|
|
6033 if (!NILP (extent_end_glyph (anc)))
|
826
|
6034 ADD_PROP (Qend_glyph, extent_end_glyph (anc));
|
428
|
6035
|
|
6036 if (!NILP (extent_begin_glyph (anc)))
|
826
|
6037 ADD_PROP (Qbegin_glyph, extent_begin_glyph (anc));
|
428
|
6038
|
|
6039 if (extent_priority (anc) != 0)
|
826
|
6040 ADD_PROP (Qpriority, make_int (extent_priority (anc)));
|
428
|
6041
|
|
6042 if (!NILP (extent_initial_redisplay_function (anc)))
|
826
|
6043 ADD_PROP (Qinitial_redisplay_function,
|
|
6044 extent_initial_redisplay_function (anc));
|
428
|
6045
|
|
6046 if (!NILP (extent_before_change_functions (anc)))
|
826
|
6047 ADD_PROP (Qbefore_change_functions, extent_before_change_functions (anc));
|
428
|
6048
|
|
6049 if (!NILP (extent_after_change_functions (anc)))
|
826
|
6050 ADD_PROP (Qafter_change_functions, extent_after_change_functions (anc));
|
428
|
6051
|
|
6052 if (!NILP (extent_invisible (anc)))
|
826
|
6053 ADD_PROP (Qinvisible, extent_invisible (anc));
|
428
|
6054
|
|
6055 if (!NILP (extent_read_only (anc)))
|
826
|
6056 ADD_PROP (Qread_only, extent_read_only (anc));
|
428
|
6057
|
|
6058 if (extent_normal_field (anc, end_open))
|
826
|
6059 ADD_PROP (Qend_open, Qt);
|
428
|
6060
|
|
6061 if (extent_normal_field (anc, start_open))
|
826
|
6062 ADD_PROP (Qstart_open, Qt);
|
428
|
6063
|
|
6064 if (extent_normal_field (anc, detachable))
|
826
|
6065 ADD_PROP (Qdetachable, Qt);
|
428
|
6066
|
|
6067 if (extent_normal_field (anc, duplicable))
|
826
|
6068 ADD_PROP (Qduplicable, Qt);
|
428
|
6069
|
|
6070 if (extent_normal_field (anc, unique))
|
826
|
6071 ADD_PROP (Qunique, Qt);
|
428
|
6072
|
|
6073 /* detached is not an inherited property */
|
|
6074 if (extent_detached_p (e))
|
826
|
6075 ADD_PROP (Qdetached, Qt);
|
|
6076
|
|
6077 #undef ADD_PROP
|
|
6078 }
|
|
6079
|
|
6080 DEFUN ("extent-properties", Fextent_properties, 1, 1, 0, /*
|
|
6081 Return a property list of the attributes of EXTENT.
|
|
6082 Do not modify this list; use `set-extent-property' instead.
|
|
6083 */
|
|
6084 (extent))
|
|
6085 {
|
|
6086 EXTENT e;
|
|
6087 Lisp_Object result = Qnil;
|
|
6088 Lisp_Object_pair_dynarr *props;
|
|
6089 int i;
|
|
6090
|
|
6091 CHECK_EXTENT (extent);
|
|
6092 e = XEXTENT (extent);
|
|
6093 props = Dynarr_new (Lisp_Object_pair);
|
|
6094 extent_properties (e, props);
|
|
6095
|
|
6096 for (i = 0; i < Dynarr_length (props); i++)
|
|
6097 result = cons3 (Dynarr_at (props, i).key, Dynarr_at (props, i).value,
|
|
6098 result);
|
|
6099
|
|
6100 Dynarr_free (props);
|
428
|
6101 return result;
|
|
6102 }
|
|
6103
|
|
6104
|
|
6105 /************************************************************************/
|
|
6106 /* highlighting */
|
|
6107 /************************************************************************/
|
|
6108
|
|
6109 /* The display code looks into the Vlast_highlighted_extent variable to
|
|
6110 correctly display highlighted extents. This updates that variable,
|
|
6111 and marks the appropriate buffers as needing some redisplay.
|
|
6112 */
|
|
6113 static void
|
|
6114 do_highlight (Lisp_Object extent_obj, int highlight_p)
|
|
6115 {
|
|
6116 if (( highlight_p && (EQ (Vlast_highlighted_extent, extent_obj))) ||
|
|
6117 (!highlight_p && (EQ (Vlast_highlighted_extent, Qnil))))
|
|
6118 return;
|
|
6119 if (EXTENTP (Vlast_highlighted_extent) &&
|
|
6120 EXTENT_LIVE_P (XEXTENT (Vlast_highlighted_extent)))
|
|
6121 {
|
|
6122 /* do not recurse on descendants. Only one extent is highlighted
|
|
6123 at a time. */
|
826
|
6124 /* A bit of a lie. */
|
|
6125 signal_extent_property_changed (XEXTENT (Vlast_highlighted_extent),
|
|
6126 Qface, 0);
|
428
|
6127 }
|
|
6128 Vlast_highlighted_extent = Qnil;
|
|
6129 if (!NILP (extent_obj)
|
|
6130 && BUFFERP (extent_object (XEXTENT (extent_obj)))
|
|
6131 && highlight_p)
|
|
6132 {
|
826
|
6133 signal_extent_property_changed (XEXTENT (extent_obj), Qface, 0);
|
428
|
6134 Vlast_highlighted_extent = extent_obj;
|
|
6135 }
|
|
6136 }
|
|
6137
|
|
6138 DEFUN ("force-highlight-extent", Fforce_highlight_extent, 1, 2, 0, /*
|
|
6139 Highlight or unhighlight the given extent.
|
|
6140 If the second arg is non-nil, it will be highlighted, else dehighlighted.
|
|
6141 This is the same as `highlight-extent', except that it will work even
|
|
6142 on extents without the `mouse-face' property.
|
|
6143 */
|
|
6144 (extent, highlight_p))
|
|
6145 {
|
|
6146 if (NILP (extent))
|
|
6147 highlight_p = Qnil;
|
|
6148 else
|
793
|
6149 extent = wrap_extent (decode_extent (extent, DE_MUST_BE_ATTACHED));
|
428
|
6150 do_highlight (extent, !NILP (highlight_p));
|
|
6151 return Qnil;
|
|
6152 }
|
|
6153
|
|
6154 DEFUN ("highlight-extent", Fhighlight_extent, 1, 2, 0, /*
|
|
6155 Highlight EXTENT, if it is highlightable.
|
|
6156 \(that is, if it has the `mouse-face' property).
|
|
6157 If the second arg is non-nil, it will be highlighted, else dehighlighted.
|
|
6158 Highlighted extents are displayed as if they were merged with the face
|
|
6159 or faces specified by the `mouse-face' property.
|
|
6160 */
|
|
6161 (extent, highlight_p))
|
|
6162 {
|
|
6163 if (EXTENTP (extent) && NILP (extent_mouse_face (XEXTENT (extent))))
|
|
6164 return Qnil;
|
|
6165 else
|
|
6166 return Fforce_highlight_extent (extent, highlight_p);
|
|
6167 }
|
|
6168
|
|
6169
|
|
6170 /************************************************************************/
|
|
6171 /* strings and extents */
|
|
6172 /************************************************************************/
|
|
6173
|
|
6174 /* copy/paste hooks */
|
|
6175
|
|
6176 static int
|
826
|
6177 run_extent_copy_paste_internal (EXTENT e, Charxpos from, Charxpos to,
|
428
|
6178 Lisp_Object object,
|
|
6179 Lisp_Object prop)
|
|
6180 {
|
|
6181 /* This function can GC */
|
|
6182 Lisp_Object extent;
|
|
6183 Lisp_Object copy_fn;
|
793
|
6184 extent = wrap_extent (e);
|
428
|
6185 copy_fn = Fextent_property (extent, prop, Qnil);
|
|
6186 if (!NILP (copy_fn))
|
|
6187 {
|
|
6188 Lisp_Object flag;
|
|
6189 struct gcpro gcpro1, gcpro2, gcpro3;
|
|
6190 GCPRO3 (extent, copy_fn, object);
|
|
6191 if (BUFFERP (object))
|
|
6192 flag = call3_in_buffer (XBUFFER (object), copy_fn, extent,
|
|
6193 make_int (from), make_int (to));
|
|
6194 else
|
|
6195 flag = call3 (copy_fn, extent, make_int (from), make_int (to));
|
|
6196 UNGCPRO;
|
|
6197 if (NILP (flag) || !EXTENT_LIVE_P (XEXTENT (extent)))
|
|
6198 return 0;
|
|
6199 }
|
|
6200 return 1;
|
|
6201 }
|
|
6202
|
|
6203 static int
|
826
|
6204 run_extent_copy_function (EXTENT e, Bytexpos from, Bytexpos to)
|
428
|
6205 {
|
|
6206 Lisp_Object object = extent_object (e);
|
|
6207 /* This function can GC */
|
|
6208 return run_extent_copy_paste_internal
|
826
|
6209 (e, buffer_or_string_bytexpos_to_charxpos (object, from),
|
|
6210 buffer_or_string_bytexpos_to_charxpos (object, to), object,
|
428
|
6211 Qcopy_function);
|
|
6212 }
|
|
6213
|
|
6214 static int
|
826
|
6215 run_extent_paste_function (EXTENT e, Bytexpos from, Bytexpos to,
|
428
|
6216 Lisp_Object object)
|
|
6217 {
|
|
6218 /* This function can GC */
|
|
6219 return run_extent_copy_paste_internal
|
826
|
6220 (e, buffer_or_string_bytexpos_to_charxpos (object, from),
|
|
6221 buffer_or_string_bytexpos_to_charxpos (object, to), object,
|
428
|
6222 Qpaste_function);
|
|
6223 }
|
|
6224
|
826
|
6225 static int
|
|
6226 run_extent_paste_function_char (EXTENT e, Charxpos from, Charxpos to,
|
|
6227 Lisp_Object object)
|
|
6228 {
|
|
6229 /* This function can GC */
|
|
6230 return run_extent_copy_paste_internal (e, from, to, object, Qpaste_function);
|
|
6231 }
|
|
6232
|
428
|
6233 static Lisp_Object
|
826
|
6234 insert_extent (EXTENT extent, Bytexpos new_start, Bytexpos new_end,
|
428
|
6235 Lisp_Object object, int run_hooks)
|
|
6236 {
|
|
6237 /* This function can GC */
|
|
6238 if (!EQ (extent_object (extent), object))
|
|
6239 goto copy_it;
|
|
6240
|
|
6241 if (extent_detached_p (extent))
|
|
6242 {
|
|
6243 if (run_hooks &&
|
|
6244 !run_extent_paste_function (extent, new_start, new_end, object))
|
|
6245 /* The paste-function said don't re-attach this extent here. */
|
|
6246 return Qnil;
|
|
6247 else
|
826
|
6248 set_extent_endpoints (extent, new_start, new_end, Qnil);
|
428
|
6249 }
|
|
6250 else
|
|
6251 {
|
826
|
6252 Bytexpos exstart = extent_endpoint_byte (extent, 0);
|
|
6253 Bytexpos exend = extent_endpoint_byte (extent, 1);
|
428
|
6254
|
|
6255 if (exend < new_start || exstart > new_end)
|
|
6256 goto copy_it;
|
|
6257 else
|
|
6258 {
|
|
6259 new_start = min (exstart, new_start);
|
|
6260 new_end = max (exend, new_end);
|
|
6261 if (exstart != new_start || exend != new_end)
|
826
|
6262 set_extent_endpoints (extent, new_start, new_end, Qnil);
|
428
|
6263 }
|
|
6264 }
|
|
6265
|
793
|
6266 return wrap_extent (extent);
|
428
|
6267
|
|
6268 copy_it:
|
|
6269 if (run_hooks &&
|
|
6270 !run_extent_paste_function (extent, new_start, new_end, object))
|
|
6271 /* The paste-function said don't attach a copy of the extent here. */
|
|
6272 return Qnil;
|
|
6273 else
|
793
|
6274 return wrap_extent (copy_extent (extent, new_start, new_end, object));
|
428
|
6275 }
|
|
6276
|
|
6277 DEFUN ("insert-extent", Finsert_extent, 1, 5, 0, /*
|
|
6278 Insert EXTENT from START to END in BUFFER-OR-STRING.
|
|
6279 BUFFER-OR-STRING defaults to the current buffer if omitted.
|
826
|
6280 If EXTENT is already on the same object, and overlaps or is adjacent to
|
|
6281 the given range, its range is merely extended to include the new range.
|
|
6282 Otherwise, a copy is made of the extent at the new position and object.
|
|
6283 When a copy is made, the new extent is returned, copy/paste hooks are run,
|
|
6284 and the change is noted for undo recording. When no copy is made, nil is
|
|
6285 returned. See documentation on `detach-extent' for a discussion of undo
|
|
6286 recording.
|
|
6287
|
428
|
6288 The fourth arg, NO-HOOKS, can be used to inhibit the running of the
|
826
|
6289 extent's `paste-function' property if it has one.
|
|
6290
|
|
6291 It's not really clear why this function exists any more. It was a holdover
|
|
6292 from a much older implementation of extents, before extents could really
|
|
6293 exist on strings.
|
428
|
6294 */
|
|
6295 (extent, start, end, no_hooks, buffer_or_string))
|
|
6296 {
|
|
6297 EXTENT ext = decode_extent (extent, 0);
|
|
6298 Lisp_Object copy;
|
826
|
6299 Bytexpos s, e;
|
428
|
6300
|
|
6301 buffer_or_string = decode_buffer_or_string (buffer_or_string);
|
|
6302 get_buffer_or_string_range_byte (buffer_or_string, start, end, &s, &e,
|
|
6303 GB_ALLOW_PAST_ACCESSIBLE);
|
|
6304
|
|
6305 copy = insert_extent (ext, s, e, buffer_or_string, NILP (no_hooks));
|
|
6306 if (EXTENTP (copy))
|
|
6307 {
|
|
6308 if (extent_duplicable_p (XEXTENT (copy)))
|
|
6309 record_extent (copy, 1);
|
|
6310 }
|
|
6311 return copy;
|
|
6312 }
|
|
6313
|
|
6314
|
|
6315 /* adding buffer extents to a string */
|
|
6316
|
|
6317 struct add_string_extents_arg
|
|
6318 {
|
826
|
6319 Bytexpos from;
|
428
|
6320 Bytecount length;
|
|
6321 Lisp_Object string;
|
|
6322 };
|
|
6323
|
|
6324 static int
|
|
6325 add_string_extents_mapper (EXTENT extent, void *arg)
|
|
6326 {
|
|
6327 /* This function can GC */
|
|
6328 struct add_string_extents_arg *closure =
|
|
6329 (struct add_string_extents_arg *) arg;
|
826
|
6330 Bytecount start = extent_endpoint_byte (extent, 0) - closure->from;
|
|
6331 Bytecount end = extent_endpoint_byte (extent, 1) - closure->from;
|
428
|
6332
|
|
6333 if (extent_duplicable_p (extent))
|
|
6334 {
|
|
6335 start = max (start, 0);
|
|
6336 end = min (end, closure->length);
|
|
6337
|
|
6338 /* Run the copy-function to give an extent the option of
|
|
6339 not being copied into the string (or kill ring).
|
|
6340 */
|
|
6341 if (extent_duplicable_p (extent) &&
|
|
6342 !run_extent_copy_function (extent, start + closure->from,
|
|
6343 end + closure->from))
|
|
6344 return 0;
|
|
6345 copy_extent (extent, start, end, closure->string);
|
|
6346 }
|
|
6347
|
|
6348 return 0;
|
|
6349 }
|
|
6350
|
826
|
6351 struct add_string_extents_the_hard_way_arg
|
|
6352 {
|
|
6353 Charxpos from;
|
|
6354 Charcount length;
|
|
6355 Lisp_Object string;
|
|
6356 };
|
|
6357
|
|
6358 static int
|
|
6359 add_string_extents_the_hard_way_mapper (EXTENT extent, void *arg)
|
|
6360 {
|
|
6361 /* This function can GC */
|
|
6362 struct add_string_extents_arg *closure =
|
|
6363 (struct add_string_extents_arg *) arg;
|
|
6364 Charcount start = extent_endpoint_char (extent, 0) - closure->from;
|
|
6365 Charcount end = extent_endpoint_char (extent, 1) - closure->from;
|
|
6366
|
|
6367 if (extent_duplicable_p (extent))
|
|
6368 {
|
|
6369 start = max (start, 0);
|
|
6370 end = min (end, closure->length);
|
|
6371
|
|
6372 /* Run the copy-function to give an extent the option of
|
|
6373 not being copied into the string (or kill ring).
|
|
6374 */
|
|
6375 if (extent_duplicable_p (extent) &&
|
|
6376 !run_extent_copy_function (extent, start + closure->from,
|
|
6377 end + closure->from))
|
|
6378 return 0;
|
|
6379 copy_extent (extent,
|
|
6380 string_index_char_to_byte (closure->string, start),
|
|
6381 string_index_char_to_byte (closure->string, end),
|
|
6382 closure->string);
|
|
6383 }
|
|
6384
|
|
6385 return 0;
|
|
6386 }
|
|
6387
|
428
|
6388 /* Add the extents in buffer BUF from OPOINT to OPOINT+LENGTH to
|
|
6389 the string STRING. */
|
|
6390 void
|
826
|
6391 add_string_extents (Lisp_Object string, struct buffer *buf, Bytexpos opoint,
|
428
|
6392 Bytecount length)
|
|
6393 {
|
|
6394 /* This function can GC */
|
|
6395 struct gcpro gcpro1, gcpro2;
|
|
6396 Lisp_Object buffer;
|
|
6397
|
771
|
6398 buffer = wrap_buffer (buf);
|
428
|
6399 GCPRO2 (buffer, string);
|
826
|
6400
|
|
6401 if (XSTRING_FORMAT (string) == BUF_FORMAT (buf))
|
|
6402 {
|
|
6403 struct add_string_extents_arg closure;
|
|
6404 closure.from = opoint;
|
|
6405 closure.length = length;
|
|
6406 closure.string = string;
|
|
6407 map_extents (opoint, opoint + length, add_string_extents_mapper,
|
|
6408 (void *) &closure, buffer, 0,
|
|
6409 /* ignore extents that just abut the region */
|
|
6410 ME_END_CLOSED | ME_ALL_EXTENTS_OPEN |
|
|
6411 /* we are calling E-Lisp (the extent's copy function)
|
|
6412 so anything might happen */
|
|
6413 ME_MIGHT_CALL_ELISP);
|
|
6414 }
|
|
6415 else
|
|
6416 {
|
|
6417 struct add_string_extents_the_hard_way_arg closure;
|
|
6418 closure.from = bytebpos_to_charbpos (buf, opoint);
|
|
6419 closure.length = (bytebpos_to_charbpos (buf, opoint + length) -
|
|
6420 closure.from);
|
|
6421 closure.string = string;
|
|
6422
|
|
6423 /* If the string and buffer are in different formats, things get
|
|
6424 tricky; the only reasonable way to do the operation is entirely in
|
|
6425 char offsets, which are invariant to format changes. In practice,
|
|
6426 this won't be time-consuming because the byte/char conversions are
|
|
6427 mostly in the buffer, which will be in a fixed-width format. */
|
|
6428 map_extents (opoint, opoint + length,
|
|
6429 add_string_extents_the_hard_way_mapper,
|
|
6430 (void *) &closure, buffer, 0,
|
|
6431 /* ignore extents that just abut the region */
|
|
6432 ME_END_CLOSED | ME_ALL_EXTENTS_OPEN |
|
|
6433 /* we are calling E-Lisp (the extent's copy function)
|
|
6434 so anything might happen */
|
|
6435 ME_MIGHT_CALL_ELISP);
|
|
6436
|
|
6437 }
|
|
6438
|
428
|
6439 UNGCPRO;
|
|
6440 }
|
|
6441
|
|
6442 struct splice_in_string_extents_arg
|
|
6443 {
|
|
6444 Bytecount pos;
|
|
6445 Bytecount length;
|
826
|
6446 Bytexpos opoint;
|
428
|
6447 Lisp_Object buffer;
|
|
6448 };
|
|
6449
|
|
6450 static int
|
|
6451 splice_in_string_extents_mapper (EXTENT extent, void *arg)
|
|
6452 {
|
|
6453 /* This function can GC */
|
|
6454 struct splice_in_string_extents_arg *closure =
|
|
6455 (struct splice_in_string_extents_arg *) arg;
|
|
6456 /* BASE_START and BASE_END are the limits in the buffer of the string
|
|
6457 that was just inserted.
|
826
|
6458
|
428
|
6459 NEW_START and NEW_END are the prospective buffer positions of the
|
|
6460 extent that is going into the buffer. */
|
826
|
6461 Bytexpos base_start = closure->opoint;
|
|
6462 Bytexpos base_end = base_start + closure->length;
|
|
6463 Bytexpos new_start = (base_start + extent_endpoint_byte (extent, 0) -
|
|
6464 closure->pos);
|
|
6465 Bytexpos new_end = (base_start + extent_endpoint_byte (extent, 1) -
|
428
|
6466 closure->pos);
|
|
6467
|
|
6468 if (new_start < base_start)
|
|
6469 new_start = base_start;
|
|
6470 if (new_end > base_end)
|
|
6471 new_end = base_end;
|
|
6472 if (new_end <= new_start)
|
|
6473 return 0;
|
|
6474
|
|
6475 if (!extent_duplicable_p (extent))
|
|
6476 return 0;
|
|
6477
|
|
6478 if (!inside_undo &&
|
|
6479 !run_extent_paste_function (extent, new_start, new_end,
|
|
6480 closure->buffer))
|
|
6481 return 0;
|
|
6482 copy_extent (extent, new_start, new_end, closure->buffer);
|
|
6483
|
|
6484 return 0;
|
|
6485 }
|
|
6486
|
826
|
6487 struct splice_in_string_extents_the_hard_way_arg
|
|
6488 {
|
|
6489 Charcount pos;
|
|
6490 Charcount length;
|
|
6491 Charxpos opoint;
|
|
6492 Lisp_Object buffer;
|
|
6493 };
|
|
6494
|
|
6495 static int
|
|
6496 splice_in_string_extents_the_hard_way_mapper (EXTENT extent, void *arg)
|
|
6497 {
|
|
6498 /* This function can GC */
|
|
6499 struct splice_in_string_extents_arg *closure =
|
|
6500 (struct splice_in_string_extents_arg *) arg;
|
|
6501 /* BASE_START and BASE_END are the limits in the buffer of the string
|
|
6502 that was just inserted.
|
|
6503
|
|
6504 NEW_START and NEW_END are the prospective buffer positions of the
|
|
6505 extent that is going into the buffer. */
|
|
6506 Charxpos base_start = closure->opoint;
|
|
6507 Charxpos base_end = base_start + closure->length;
|
|
6508 Charxpos new_start = (base_start + extent_endpoint_char (extent, 0) -
|
|
6509 closure->pos);
|
|
6510 Charxpos new_end = (base_start + extent_endpoint_char (extent, 1) -
|
|
6511 closure->pos);
|
|
6512
|
|
6513 if (new_start < base_start)
|
|
6514 new_start = base_start;
|
|
6515 if (new_end > base_end)
|
|
6516 new_end = base_end;
|
|
6517 if (new_end <= new_start)
|
|
6518 return 0;
|
|
6519
|
|
6520 if (!extent_duplicable_p (extent))
|
|
6521 return 0;
|
|
6522
|
|
6523 if (!inside_undo &&
|
|
6524 !run_extent_paste_function_char (extent, new_start, new_end,
|
|
6525 closure->buffer))
|
|
6526 return 0;
|
|
6527 copy_extent (extent,
|
|
6528 charbpos_to_bytebpos (XBUFFER (closure->buffer), new_start),
|
|
6529 charbpos_to_bytebpos (XBUFFER (closure->buffer), new_end),
|
|
6530 closure->buffer);
|
|
6531
|
|
6532 return 0;
|
|
6533 }
|
|
6534
|
428
|
6535 /* We have just inserted a section of STRING (starting at POS, of
|
|
6536 length LENGTH) into buffer BUF at OPOINT. Do whatever is necessary
|
|
6537 to get the string's extents into the buffer. */
|
|
6538
|
|
6539 void
|
|
6540 splice_in_string_extents (Lisp_Object string, struct buffer *buf,
|
826
|
6541 Bytexpos opoint, Bytecount length, Bytecount pos)
|
|
6542 {
|
428
|
6543 struct gcpro gcpro1, gcpro2;
|
793
|
6544 Lisp_Object buffer = wrap_buffer (buf);
|
|
6545
|
428
|
6546 GCPRO2 (buffer, string);
|
826
|
6547 if (XSTRING_FORMAT (string) == BUF_FORMAT (buf))
|
|
6548 {
|
|
6549 struct splice_in_string_extents_arg closure;
|
|
6550 closure.opoint = opoint;
|
|
6551 closure.pos = pos;
|
|
6552 closure.length = length;
|
|
6553 closure.buffer = buffer;
|
|
6554 map_extents (pos, pos + length,
|
|
6555 splice_in_string_extents_mapper,
|
|
6556 (void *) &closure, string, 0,
|
|
6557 /* ignore extents that just abut the region */
|
|
6558 ME_END_CLOSED | ME_ALL_EXTENTS_OPEN |
|
|
6559 /* we are calling E-Lisp (the extent's copy function)
|
|
6560 so anything might happen */
|
|
6561 ME_MIGHT_CALL_ELISP);
|
|
6562 }
|
|
6563 else
|
|
6564 {
|
|
6565 struct splice_in_string_extents_the_hard_way_arg closure;
|
|
6566 closure.opoint = bytebpos_to_charbpos (buf, opoint);
|
|
6567 closure.pos = string_index_byte_to_char (string, pos);
|
|
6568 closure.length = string_offset_byte_to_char_len (string, pos, length);
|
|
6569 closure.buffer = buffer;
|
|
6570
|
|
6571 /* If the string and buffer are in different formats, things get
|
|
6572 tricky; the only reasonable way to do the operation is entirely in
|
|
6573 char offsets, which are invariant to format changes. In practice,
|
|
6574 this won't be time-consuming because the byte/char conversions are
|
|
6575 mostly in the buffer, which will be in a fixed-width format. */
|
|
6576 map_extents (pos, pos + length,
|
|
6577 splice_in_string_extents_the_hard_way_mapper,
|
|
6578 (void *) &closure, string, 0,
|
|
6579 /* ignore extents that just abut the region */
|
|
6580 ME_END_CLOSED | ME_ALL_EXTENTS_OPEN |
|
|
6581 /* we are calling E-Lisp (the extent's copy function)
|
|
6582 so anything might happen */
|
|
6583 ME_MIGHT_CALL_ELISP);
|
|
6584
|
|
6585 }
|
428
|
6586 UNGCPRO;
|
|
6587 }
|
|
6588
|
|
6589 struct copy_string_extents_arg
|
|
6590 {
|
|
6591 Bytecount new_pos;
|
|
6592 Bytecount old_pos;
|
|
6593 Bytecount length;
|
|
6594 Lisp_Object new_string;
|
|
6595 };
|
|
6596
|
|
6597 struct copy_string_extents_1_arg
|
|
6598 {
|
|
6599 Lisp_Object parent_in_question;
|
|
6600 EXTENT found_extent;
|
|
6601 };
|
|
6602
|
|
6603 static int
|
|
6604 copy_string_extents_mapper (EXTENT extent, void *arg)
|
|
6605 {
|
|
6606 struct copy_string_extents_arg *closure =
|
|
6607 (struct copy_string_extents_arg *) arg;
|
|
6608 Bytecount old_start, old_end, new_start, new_end;
|
|
6609
|
826
|
6610 old_start = extent_endpoint_byte (extent, 0);
|
|
6611 old_end = extent_endpoint_byte (extent, 1);
|
428
|
6612
|
|
6613 old_start = max (closure->old_pos, old_start);
|
|
6614 old_end = min (closure->old_pos + closure->length, old_end);
|
|
6615
|
|
6616 if (old_start >= old_end)
|
|
6617 return 0;
|
|
6618
|
|
6619 new_start = old_start + closure->new_pos - closure->old_pos;
|
|
6620 new_end = old_end + closure->new_pos - closure->old_pos;
|
|
6621
|
|
6622 copy_extent (extent, new_start, new_end, closure->new_string);
|
|
6623 return 0;
|
|
6624 }
|
|
6625
|
|
6626 /* The string NEW_STRING was partially constructed from OLD_STRING.
|
|
6627 In particular, the section of length LEN starting at NEW_POS in
|
|
6628 NEW_STRING came from the section of the same length starting at
|
|
6629 OLD_POS in OLD_STRING. Copy the extents as appropriate. */
|
|
6630
|
|
6631 void
|
|
6632 copy_string_extents (Lisp_Object new_string, Lisp_Object old_string,
|
|
6633 Bytecount new_pos, Bytecount old_pos,
|
|
6634 Bytecount length)
|
|
6635 {
|
|
6636 struct copy_string_extents_arg closure;
|
|
6637 struct gcpro gcpro1, gcpro2;
|
|
6638
|
|
6639 closure.new_pos = new_pos;
|
|
6640 closure.old_pos = old_pos;
|
|
6641 closure.new_string = new_string;
|
|
6642 closure.length = length;
|
|
6643 GCPRO2 (new_string, old_string);
|
826
|
6644 map_extents (old_pos, old_pos + length,
|
|
6645 copy_string_extents_mapper,
|
|
6646 (void *) &closure, old_string, 0,
|
|
6647 /* ignore extents that just abut the region */
|
|
6648 ME_END_CLOSED | ME_ALL_EXTENTS_OPEN |
|
|
6649 /* we are calling E-Lisp (the extent's copy function)
|
|
6650 so anything might happen */
|
|
6651 ME_MIGHT_CALL_ELISP);
|
428
|
6652 UNGCPRO;
|
|
6653 }
|
|
6654
|
|
6655 /* Checklist for sanity checking:
|
|
6656 - {kill, yank, copy} at {open, closed} {start, end} of {writable, read-only} extent
|
|
6657 - {kill, copy} & yank {once, repeatedly} duplicable extent in {same, different} buffer
|
|
6658 */
|
|
6659
|
|
6660
|
|
6661 /************************************************************************/
|
|
6662 /* text properties */
|
|
6663 /************************************************************************/
|
|
6664
|
|
6665 /* Text properties
|
|
6666 Originally this stuff was implemented in lisp (all of the functionality
|
|
6667 exists to make that possible) but speed was a problem.
|
|
6668 */
|
|
6669
|
|
6670 Lisp_Object Qtext_prop;
|
|
6671 Lisp_Object Qtext_prop_extent_paste_function;
|
|
6672
|
826
|
6673 /* Retrieve the value of the property PROP of the text at position POSITION
|
|
6674 in OBJECT. TEXT-PROPS-ONLY means only look at extents with the
|
|
6675 `text-prop' property, i.e. extents created by the text property
|
|
6676 routines. Otherwise, all extents are examined. &&#### finish Note that
|
|
6677 the default extent_at_flag is EXTENT_AT_DEFAULT (same as
|
|
6678 EXTENT_AT_AFTER). */
|
|
6679 Lisp_Object
|
|
6680 get_char_property (Bytexpos position, Lisp_Object prop,
|
|
6681 Lisp_Object object, enum extent_at_flag fl,
|
|
6682 int text_props_only)
|
428
|
6683 {
|
|
6684 Lisp_Object extent;
|
|
6685
|
|
6686 /* text_props_only specifies whether we only consider text-property
|
3025
|
6687 extents (those with the `text-prop' property set) or all extents. */
|
428
|
6688 if (!text_props_only)
|
826
|
6689 extent = extent_at (position, object, prop, 0, fl, 0);
|
428
|
6690 else
|
|
6691 {
|
|
6692 EXTENT prior = 0;
|
|
6693 while (1)
|
|
6694 {
|
826
|
6695 extent = extent_at (position, object, Qtext_prop, prior, fl, 0);
|
428
|
6696 if (NILP (extent))
|
|
6697 return Qnil;
|
|
6698 if (EQ (prop, Fextent_property (extent, Qtext_prop, Qnil)))
|
|
6699 break;
|
|
6700 prior = XEXTENT (extent);
|
|
6701 }
|
|
6702 }
|
|
6703
|
|
6704 if (!NILP (extent))
|
|
6705 return Fextent_property (extent, prop, Qnil);
|
|
6706 if (!NILP (Vdefault_text_properties))
|
|
6707 return Fplist_get (Vdefault_text_properties, prop, Qnil);
|
|
6708 return Qnil;
|
|
6709 }
|
|
6710
|
|
6711 static Lisp_Object
|
826
|
6712 get_char_property_char (Lisp_Object pos, Lisp_Object prop, Lisp_Object object,
|
|
6713 Lisp_Object at_flag, int text_props_only)
|
|
6714 {
|
|
6715 Bytexpos position;
|
428
|
6716 int invert = 0;
|
|
6717
|
|
6718 object = decode_buffer_or_string (object);
|
|
6719 position = get_buffer_or_string_pos_byte (object, pos, GB_NO_ERROR_IF_BAD);
|
|
6720
|
|
6721 /* We canonicalize the start/end-open/closed properties to the
|
|
6722 non-default version -- "adding" the default property really
|
|
6723 needs to remove the non-default one. See below for more
|
|
6724 on this. */
|
|
6725 if (EQ (prop, Qstart_closed))
|
|
6726 {
|
|
6727 prop = Qstart_open;
|
|
6728 invert = 1;
|
|
6729 }
|
|
6730
|
|
6731 if (EQ (prop, Qend_open))
|
|
6732 {
|
|
6733 prop = Qend_closed;
|
|
6734 invert = 1;
|
|
6735 }
|
|
6736
|
|
6737 {
|
|
6738 Lisp_Object val =
|
826
|
6739 get_char_property (position, prop, object,
|
|
6740 decode_extent_at_flag (at_flag),
|
|
6741 text_props_only);
|
428
|
6742 if (invert)
|
|
6743 val = NILP (val) ? Qt : Qnil;
|
|
6744 return val;
|
|
6745 }
|
|
6746 }
|
|
6747
|
|
6748 DEFUN ("get-text-property", Fget_text_property, 2, 4, 0, /*
|
|
6749 Return the value of the PROP property at the given position.
|
|
6750 Optional arg OBJECT specifies the buffer or string to look in, and
|
|
6751 defaults to the current buffer.
|
|
6752 Optional arg AT-FLAG controls what it means for a property to be "at"
|
|
6753 a position, and has the same meaning as in `extent-at'.
|
|
6754 This examines only those properties added with `put-text-property'.
|
|
6755 See also `get-char-property'.
|
|
6756 */
|
|
6757 (pos, prop, object, at_flag))
|
|
6758 {
|
826
|
6759 return get_char_property_char (pos, prop, object, at_flag, 1);
|
428
|
6760 }
|
|
6761
|
|
6762 DEFUN ("get-char-property", Fget_char_property, 2, 4, 0, /*
|
|
6763 Return the value of the PROP property at the given position.
|
|
6764 Optional arg OBJECT specifies the buffer or string to look in, and
|
|
6765 defaults to the current buffer.
|
|
6766 Optional arg AT-FLAG controls what it means for a property to be "at"
|
|
6767 a position, and has the same meaning as in `extent-at'.
|
|
6768 This examines properties on all extents.
|
|
6769 See also `get-text-property'.
|
|
6770 */
|
|
6771 (pos, prop, object, at_flag))
|
|
6772 {
|
826
|
6773 return get_char_property_char (pos, prop, object, at_flag, 0);
|
428
|
6774 }
|
|
6775
|
|
6776 /* About start/end-open/closed:
|
|
6777
|
|
6778 These properties have to be handled specially because of their
|
|
6779 strange behavior. If I put the "start-open" property on a region,
|
|
6780 then *all* text-property extents in the region have to have their
|
|
6781 start be open. This is unlike all other properties, which don't
|
|
6782 affect the extents of text properties other than their own.
|
|
6783
|
|
6784 So:
|
|
6785
|
|
6786 1) We have to map start-closed to (not start-open) and end-open
|
|
6787 to (not end-closed) -- i.e. adding the default is really the
|
|
6788 same as remove the non-default property. It won't work, for
|
|
6789 example, to have both "start-open" and "start-closed" on
|
|
6790 the same region.
|
|
6791 2) Whenever we add one of these properties, we go through all
|
|
6792 text-property extents in the region and set the appropriate
|
|
6793 open/closedness on them.
|
|
6794 3) Whenever we change a text-property extent for a property,
|
|
6795 we have to make sure we set the open/closedness properly.
|
|
6796
|
|
6797 (2) and (3) together rely on, and maintain, the invariant
|
|
6798 that the open/closedness of text-property extents is correct
|
|
6799 at the beginning and end of each operation.
|
|
6800 */
|
|
6801
|
|
6802 struct put_text_prop_arg
|
|
6803 {
|
|
6804 Lisp_Object prop, value; /* The property and value we are storing */
|
826
|
6805 Bytexpos start, end; /* The region into which we are storing it */
|
428
|
6806 Lisp_Object object;
|
|
6807 Lisp_Object the_extent; /* Our chosen extent; this is used for
|
|
6808 communication between subsequent passes. */
|
|
6809 int changed_p; /* Output: whether we have modified anything */
|
|
6810 };
|
|
6811
|
|
6812 static int
|
|
6813 put_text_prop_mapper (EXTENT e, void *arg)
|
|
6814 {
|
|
6815 struct put_text_prop_arg *closure = (struct put_text_prop_arg *) arg;
|
|
6816
|
|
6817 Lisp_Object object = closure->object;
|
|
6818 Lisp_Object value = closure->value;
|
826
|
6819 Bytexpos e_start, e_end;
|
|
6820 Bytexpos start = closure->start;
|
|
6821 Bytexpos end = closure->end;
|
428
|
6822 Lisp_Object extent, e_val;
|
|
6823 int is_eq;
|
|
6824
|
793
|
6825 extent = wrap_extent (e);
|
428
|
6826
|
3025
|
6827 /* Note: in some cases when the property itself is `start-open'
|
|
6828 or `end-closed', the checks to set the openness may do a bit
|
428
|
6829 of extra work; but it won't hurt because we then fix up the
|
|
6830 openness later on in put_text_prop_openness_mapper(). */
|
|
6831 if (!EQ (Fextent_property (extent, Qtext_prop, Qnil), closure->prop))
|
|
6832 /* It's not for this property; do nothing. */
|
|
6833 return 0;
|
|
6834
|
826
|
6835 e_start = extent_endpoint_byte (e, 0);
|
|
6836 e_end = extent_endpoint_byte (e, 1);
|
428
|
6837 e_val = Fextent_property (extent, closure->prop, Qnil);
|
|
6838 is_eq = EQ (value, e_val);
|
|
6839
|
|
6840 if (!NILP (value) && NILP (closure->the_extent) && is_eq)
|
|
6841 {
|
|
6842 /* We want there to be an extent here at the end, and we haven't picked
|
|
6843 one yet, so use this one. Extend it as necessary. We only reuse an
|
|
6844 extent which has an EQ value for the prop in question to avoid
|
|
6845 side-effecting the kill ring (that is, we never change the property
|
|
6846 on an extent after it has been created.)
|
|
6847 */
|
|
6848 if (e_start != start || e_end != end)
|
|
6849 {
|
826
|
6850 Bytexpos new_start = min (e_start, start);
|
|
6851 Bytexpos new_end = max (e_end, end);
|
428
|
6852 set_extent_endpoints (e, new_start, new_end, Qnil);
|
|
6853 /* If we changed the endpoint, then we need to set its
|
|
6854 openness. */
|
|
6855 set_extent_openness (e, new_start != e_start
|
826
|
6856 ? !NILP (get_char_property
|
428
|
6857 (start, Qstart_open, object,
|
|
6858 EXTENT_AT_AFTER, 1)) : -1,
|
|
6859 new_end != e_end
|
826
|
6860 ? NILP (get_char_property
|
|
6861 (prev_bytexpos (object, end),
|
|
6862 Qend_closed, object,
|
428
|
6863 EXTENT_AT_AFTER, 1))
|
|
6864 : -1);
|
|
6865 closure->changed_p = 1;
|
|
6866 }
|
|
6867 closure->the_extent = extent;
|
|
6868 }
|
|
6869
|
|
6870 /* Even if we're adding a prop, at this point, we want all other extents of
|
|
6871 this prop to go away (as now they overlap). So the theory here is that,
|
|
6872 when we are adding a prop to a region that has multiple (disjoint)
|
|
6873 occurrences of that prop in it already, we pick one of those and extend
|
|
6874 it, and remove the others.
|
|
6875 */
|
|
6876
|
|
6877 else if (EQ (extent, closure->the_extent))
|
|
6878 {
|
|
6879 /* just in case map-extents hits it again (does that happen?) */
|
|
6880 ;
|
|
6881 }
|
|
6882 else if (e_start >= start && e_end <= end)
|
|
6883 {
|
|
6884 /* Extent is contained in region; remove it. Don't destroy or modify
|
|
6885 it, because we don't want to change the attributes pointed to by the
|
|
6886 duplicates in the kill ring.
|
|
6887 */
|
|
6888 extent_detach (e);
|
|
6889 closure->changed_p = 1;
|
|
6890 }
|
|
6891 else if (!NILP (closure->the_extent) &&
|
|
6892 is_eq &&
|
|
6893 e_start <= end &&
|
|
6894 e_end >= start)
|
|
6895 {
|
|
6896 EXTENT te = XEXTENT (closure->the_extent);
|
|
6897 /* This extent overlaps, and has the same prop/value as the extent we've
|
|
6898 decided to reuse, so we can remove this existing extent as well (the
|
|
6899 whole thing, even the part outside of the region) and extend
|
|
6900 the-extent to cover it, resulting in the minimum number of extents in
|
|
6901 the buffer.
|
|
6902 */
|
826
|
6903 Bytexpos the_start = extent_endpoint_byte (te, 0);
|
|
6904 Bytexpos the_end = extent_endpoint_byte (te, 1);
|
428
|
6905 if (e_start != the_start && /* note AND not OR -- hmm, why is this
|
|
6906 the case? I think it's because the
|
|
6907 assumption that the text-property
|
|
6908 extents don't overlap makes it
|
|
6909 OK; changing it to an OR would
|
|
6910 result in changed_p sometimes getting
|
|
6911 falsely marked. Is this bad? */
|
|
6912 e_end != the_end)
|
|
6913 {
|
826
|
6914 Bytexpos new_start = min (e_start, the_start);
|
|
6915 Bytexpos new_end = max (e_end, the_end);
|
428
|
6916 set_extent_endpoints (te, new_start, new_end, Qnil);
|
|
6917 /* If we changed the endpoint, then we need to set its
|
|
6918 openness. We are setting the endpoint to be the same as
|
|
6919 that of the extent we're about to remove, and we assume
|
|
6920 (the invariant mentioned above) that extent has the
|
|
6921 proper endpoint setting, so we just use it. */
|
|
6922 set_extent_openness (te, new_start != e_start ?
|
|
6923 (int) extent_start_open_p (e) : -1,
|
|
6924 new_end != e_end ?
|
|
6925 (int) extent_end_open_p (e) : -1);
|
|
6926 closure->changed_p = 1;
|
|
6927 }
|
|
6928 extent_detach (e);
|
|
6929 }
|
|
6930 else if (e_end <= end)
|
|
6931 {
|
|
6932 /* Extent begins before start but ends before end, so we can just
|
|
6933 decrease its end position.
|
|
6934 */
|
|
6935 if (e_end != start)
|
|
6936 {
|
|
6937 set_extent_endpoints (e, e_start, start, Qnil);
|
826
|
6938 set_extent_openness (e, -1,
|
|
6939 NILP (get_char_property
|
|
6940 (prev_bytexpos (object, start),
|
|
6941 Qend_closed, object,
|
|
6942 EXTENT_AT_AFTER, 1)));
|
428
|
6943 closure->changed_p = 1;
|
|
6944 }
|
|
6945 }
|
|
6946 else if (e_start >= start)
|
|
6947 {
|
|
6948 /* Extent ends after end but begins after start, so we can just
|
|
6949 increase its start position.
|
|
6950 */
|
|
6951 if (e_start != end)
|
|
6952 {
|
|
6953 set_extent_endpoints (e, end, e_end, Qnil);
|
826
|
6954 set_extent_openness (e, !NILP (get_char_property
|
428
|
6955 (end, Qstart_open, object,
|
|
6956 EXTENT_AT_AFTER, 1)), -1);
|
|
6957 closure->changed_p = 1;
|
|
6958 }
|
|
6959 }
|
|
6960 else
|
|
6961 {
|
|
6962 /* Otherwise, `extent' straddles the region. We need to split it.
|
|
6963 */
|
|
6964 set_extent_endpoints (e, e_start, start, Qnil);
|
826
|
6965 set_extent_openness (e, -1, NILP (get_char_property
|
|
6966 (prev_bytexpos (object, start),
|
|
6967 Qend_closed, object,
|
428
|
6968 EXTENT_AT_AFTER, 1)));
|
|
6969 set_extent_openness (copy_extent (e, end, e_end, extent_object (e)),
|
826
|
6970 !NILP (get_char_property
|
428
|
6971 (end, Qstart_open, object,
|
|
6972 EXTENT_AT_AFTER, 1)), -1);
|
|
6973 closure->changed_p = 1;
|
|
6974 }
|
|
6975
|
|
6976 return 0; /* to continue mapping. */
|
|
6977 }
|
|
6978
|
|
6979 static int
|
|
6980 put_text_prop_openness_mapper (EXTENT e, void *arg)
|
|
6981 {
|
|
6982 struct put_text_prop_arg *closure = (struct put_text_prop_arg *) arg;
|
826
|
6983 Bytexpos e_start, e_end;
|
|
6984 Bytexpos start = closure->start;
|
|
6985 Bytexpos end = closure->end;
|
793
|
6986 Lisp_Object extent = wrap_extent (e);
|
|
6987
|
826
|
6988 e_start = extent_endpoint_byte (e, 0);
|
|
6989 e_end = extent_endpoint_byte (e, 1);
|
428
|
6990
|
|
6991 if (NILP (Fextent_property (extent, Qtext_prop, Qnil)))
|
|
6992 {
|
|
6993 /* It's not a text-property extent; do nothing. */
|
|
6994 ;
|
|
6995 }
|
|
6996 /* Note end conditions and NILP/!NILP's carefully. */
|
|
6997 else if (EQ (closure->prop, Qstart_open)
|
|
6998 && e_start >= start && e_start < end)
|
|
6999 set_extent_openness (e, !NILP (closure->value), -1);
|
|
7000 else if (EQ (closure->prop, Qend_closed)
|
|
7001 && e_end > start && e_end <= end)
|
|
7002 set_extent_openness (e, -1, NILP (closure->value));
|
|
7003
|
|
7004 return 0; /* to continue mapping. */
|
|
7005 }
|
|
7006
|
|
7007 static int
|
826
|
7008 put_text_prop (Bytexpos start, Bytexpos end, Lisp_Object object,
|
428
|
7009 Lisp_Object prop, Lisp_Object value,
|
|
7010 int duplicable_p)
|
|
7011 {
|
|
7012 /* This function can GC */
|
|
7013 struct put_text_prop_arg closure;
|
|
7014
|
|
7015 if (start == end) /* There are no characters in the region. */
|
|
7016 return 0;
|
|
7017
|
|
7018 /* convert to the non-default versions, since a nil property is
|
|
7019 the same as it not being present. */
|
|
7020 if (EQ (prop, Qstart_closed))
|
|
7021 {
|
|
7022 prop = Qstart_open;
|
|
7023 value = NILP (value) ? Qt : Qnil;
|
|
7024 }
|
|
7025 else if (EQ (prop, Qend_open))
|
|
7026 {
|
|
7027 prop = Qend_closed;
|
|
7028 value = NILP (value) ? Qt : Qnil;
|
|
7029 }
|
|
7030
|
|
7031 value = canonicalize_extent_property (prop, value);
|
|
7032
|
|
7033 closure.prop = prop;
|
|
7034 closure.value = value;
|
|
7035 closure.start = start;
|
|
7036 closure.end = end;
|
|
7037 closure.object = object;
|
|
7038 closure.changed_p = 0;
|
|
7039 closure.the_extent = Qnil;
|
|
7040
|
826
|
7041 map_extents (start, end,
|
|
7042 put_text_prop_mapper,
|
|
7043 (void *) &closure, object, 0,
|
|
7044 /* get all extents that abut the region */
|
|
7045 ME_ALL_EXTENTS_CLOSED | ME_END_CLOSED |
|
|
7046 #if 0
|
|
7047 /* it might move the SOE because the callback function calls
|
|
7048 get_char_property(), which calls extent_at(), which calls
|
|
7049 map_extents()
|
|
7050
|
|
7051 #### this was comment out before, and nothing seemed broken;
|
|
7052 #### but when I added the above comment and uncommented it,
|
|
7053 #### text property operations (e.g. font-lock) suddenly
|
|
7054 #### became *WAY* slow, and dominated font-lock, when a
|
|
7055 #### single extent spanning the entire buffer
|
|
7056 #### existed. --ben */
|
|
7057 ME_MIGHT_MOVE_SOE |
|
|
7058 #endif
|
|
7059 /* it might QUIT or error if the user has
|
|
7060 fucked with the extent plist. */
|
|
7061 ME_MIGHT_THROW |
|
|
7062 ME_MIGHT_MODIFY_EXTENTS);
|
428
|
7063
|
|
7064 /* If we made it through the loop without reusing an extent
|
|
7065 (and we want there to be one) make it now.
|
|
7066 */
|
|
7067 if (!NILP (value) && NILP (closure.the_extent))
|
|
7068 {
|
826
|
7069 Lisp_Object extent =
|
|
7070 wrap_extent (make_extent (object, start, end));
|
793
|
7071
|
428
|
7072 closure.changed_p = 1;
|
|
7073 Fset_extent_property (extent, Qtext_prop, prop);
|
|
7074 Fset_extent_property (extent, prop, value);
|
|
7075 if (duplicable_p)
|
|
7076 {
|
|
7077 extent_duplicable_p (XEXTENT (extent)) = 1;
|
|
7078 Fset_extent_property (extent, Qpaste_function,
|
|
7079 Qtext_prop_extent_paste_function);
|
|
7080 }
|
|
7081 set_extent_openness (XEXTENT (extent),
|
826
|
7082 !NILP (get_char_property
|
428
|
7083 (start, Qstart_open, object,
|
|
7084 EXTENT_AT_AFTER, 1)),
|
826
|
7085 NILP (get_char_property
|
|
7086 (prev_bytexpos (object, end),
|
|
7087 Qend_closed, object,
|
428
|
7088 EXTENT_AT_AFTER, 1)));
|
|
7089 }
|
|
7090
|
|
7091 if (EQ (prop, Qstart_open) || EQ (prop, Qend_closed))
|
|
7092 {
|
826
|
7093 map_extents (start, end, put_text_prop_openness_mapper,
|
|
7094 (void *) &closure, object, 0,
|
|
7095 /* get all extents that abut the region */
|
|
7096 ME_ALL_EXTENTS_CLOSED | ME_END_CLOSED |
|
|
7097 ME_MIGHT_MODIFY_EXTENTS);
|
428
|
7098 }
|
|
7099
|
|
7100 return closure.changed_p;
|
|
7101 }
|
|
7102
|
|
7103 DEFUN ("put-text-property", Fput_text_property, 4, 5, 0, /*
|
|
7104 Adds the given property/value to all characters in the specified region.
|
|
7105 The property is conceptually attached to the characters rather than the
|
|
7106 region. The properties are copied when the characters are copied/pasted.
|
|
7107 Fifth argument OBJECT is the buffer or string containing the text, and
|
|
7108 defaults to the current buffer.
|
|
7109 */
|
|
7110 (start, end, prop, value, object))
|
|
7111 {
|
|
7112 /* This function can GC */
|
826
|
7113 Bytexpos s, e;
|
428
|
7114
|
|
7115 object = decode_buffer_or_string (object);
|
|
7116 get_buffer_or_string_range_byte (object, start, end, &s, &e, 0);
|
|
7117 put_text_prop (s, e, object, prop, value, 1);
|
|
7118 return prop;
|
|
7119 }
|
|
7120
|
|
7121 DEFUN ("put-nonduplicable-text-property", Fput_nonduplicable_text_property,
|
|
7122 4, 5, 0, /*
|
|
7123 Adds the given property/value to all characters in the specified region.
|
|
7124 The property is conceptually attached to the characters rather than the
|
|
7125 region, however the properties will not be copied when the characters
|
|
7126 are copied.
|
|
7127 Fifth argument OBJECT is the buffer or string containing the text, and
|
|
7128 defaults to the current buffer.
|
|
7129 */
|
|
7130 (start, end, prop, value, object))
|
|
7131 {
|
|
7132 /* This function can GC */
|
826
|
7133 Bytexpos s, e;
|
428
|
7134
|
|
7135 object = decode_buffer_or_string (object);
|
|
7136 get_buffer_or_string_range_byte (object, start, end, &s, &e, 0);
|
|
7137 put_text_prop (s, e, object, prop, value, 0);
|
|
7138 return prop;
|
|
7139 }
|
|
7140
|
|
7141 DEFUN ("add-text-properties", Fadd_text_properties, 3, 4, 0, /*
|
|
7142 Add properties to the characters from START to END.
|
|
7143 The third argument PROPS is a property list specifying the property values
|
|
7144 to add. The optional fourth argument, OBJECT, is the buffer or string
|
|
7145 containing the text and defaults to the current buffer. Returns t if
|
|
7146 any property was changed, nil otherwise.
|
|
7147 */
|
|
7148 (start, end, props, object))
|
|
7149 {
|
|
7150 /* This function can GC */
|
|
7151 int changed = 0;
|
826
|
7152 Bytexpos s, e;
|
428
|
7153
|
|
7154 object = decode_buffer_or_string (object);
|
|
7155 get_buffer_or_string_range_byte (object, start, end, &s, &e, 0);
|
|
7156 CHECK_LIST (props);
|
|
7157 for (; !NILP (props); props = Fcdr (Fcdr (props)))
|
|
7158 {
|
|
7159 Lisp_Object prop = XCAR (props);
|
|
7160 Lisp_Object value = Fcar (XCDR (props));
|
|
7161 changed |= put_text_prop (s, e, object, prop, value, 1);
|
|
7162 }
|
|
7163 return changed ? Qt : Qnil;
|
|
7164 }
|
|
7165
|
|
7166
|
|
7167 DEFUN ("add-nonduplicable-text-properties", Fadd_nonduplicable_text_properties,
|
|
7168 3, 4, 0, /*
|
|
7169 Add nonduplicable properties to the characters from START to END.
|
|
7170 \(The properties will not be copied when the characters are copied.)
|
|
7171 The third argument PROPS is a property list specifying the property values
|
|
7172 to add. The optional fourth argument, OBJECT, is the buffer or string
|
|
7173 containing the text and defaults to the current buffer. Returns t if
|
|
7174 any property was changed, nil otherwise.
|
|
7175 */
|
|
7176 (start, end, props, object))
|
|
7177 {
|
|
7178 /* This function can GC */
|
|
7179 int changed = 0;
|
826
|
7180 Bytexpos s, e;
|
428
|
7181
|
|
7182 object = decode_buffer_or_string (object);
|
|
7183 get_buffer_or_string_range_byte (object, start, end, &s, &e, 0);
|
|
7184 CHECK_LIST (props);
|
|
7185 for (; !NILP (props); props = Fcdr (Fcdr (props)))
|
|
7186 {
|
|
7187 Lisp_Object prop = XCAR (props);
|
|
7188 Lisp_Object value = Fcar (XCDR (props));
|
|
7189 changed |= put_text_prop (s, e, object, prop, value, 0);
|
|
7190 }
|
|
7191 return changed ? Qt : Qnil;
|
|
7192 }
|
|
7193
|
|
7194 DEFUN ("remove-text-properties", Fremove_text_properties, 3, 4, 0, /*
|
|
7195 Remove the given properties from all characters in the specified region.
|
|
7196 PROPS should be a plist, but the values in that plist are ignored (treated
|
|
7197 as nil). Returns t if any property was changed, nil otherwise.
|
|
7198 Fourth argument OBJECT is the buffer or string containing the text, and
|
|
7199 defaults to the current buffer.
|
|
7200 */
|
|
7201 (start, end, props, object))
|
|
7202 {
|
|
7203 /* This function can GC */
|
|
7204 int changed = 0;
|
826
|
7205 Bytexpos s, e;
|
428
|
7206
|
|
7207 object = decode_buffer_or_string (object);
|
|
7208 get_buffer_or_string_range_byte (object, start, end, &s, &e, 0);
|
|
7209 CHECK_LIST (props);
|
|
7210 for (; !NILP (props); props = Fcdr (Fcdr (props)))
|
|
7211 {
|
|
7212 Lisp_Object prop = XCAR (props);
|
|
7213 changed |= put_text_prop (s, e, object, prop, Qnil, 1);
|
|
7214 }
|
|
7215 return changed ? Qt : Qnil;
|
|
7216 }
|
|
7217
|
|
7218 /* Whenever a text-prop extent is pasted into a buffer (via `yank' or `insert'
|
|
7219 or whatever) we attach the properties to the buffer by calling
|
|
7220 `put-text-property' instead of by simply allowing the extent to be copied or
|
|
7221 re-attached. Then we return nil, telling the extents code not to attach it
|
|
7222 again. By handing the insertion hackery in this way, we make kill/yank
|
|
7223 behave consistently with put-text-property and not fragment the extents
|
|
7224 (since text-prop extents must partition, not overlap).
|
|
7225
|
|
7226 The lisp implementation of this was probably fast enough, but since I moved
|
|
7227 the rest of the put-text-prop code here, I moved this as well for
|
|
7228 completeness.
|
|
7229 */
|
|
7230 DEFUN ("text-prop-extent-paste-function", Ftext_prop_extent_paste_function,
|
|
7231 3, 3, 0, /*
|
|
7232 Used as the `paste-function' property of `text-prop' extents.
|
|
7233 */
|
|
7234 (extent, from, to))
|
|
7235 {
|
|
7236 /* This function can GC */
|
|
7237 Lisp_Object prop, val;
|
|
7238
|
|
7239 prop = Fextent_property (extent, Qtext_prop, Qnil);
|
|
7240 if (NILP (prop))
|
563
|
7241 signal_error (Qinternal_error,
|
442
|
7242 "Internal error: no text-prop", extent);
|
428
|
7243 val = Fextent_property (extent, prop, Qnil);
|
|
7244 #if 0
|
|
7245 /* removed by bill perry, 2/9/97
|
|
7246 ** This little bit of code would not allow you to have a text property
|
|
7247 ** with a value of Qnil. This is bad bad bad.
|
|
7248 */
|
|
7249 if (NILP (val))
|
563
|
7250 signal_error_2 (Qinternal_error,
|
442
|
7251 "Internal error: no text-prop",
|
|
7252 extent, prop);
|
428
|
7253 #endif
|
|
7254 Fput_text_property (from, to, prop, val, Qnil);
|
|
7255 return Qnil; /* important! */
|
|
7256 }
|
|
7257
|
826
|
7258 Bytexpos
|
2506
|
7259 next_previous_single_property_change (Bytexpos pos, Lisp_Object prop,
|
|
7260 Lisp_Object object, Bytexpos limit,
|
|
7261 Boolint next, Boolint text_props_only)
|
826
|
7262 {
|
|
7263 Lisp_Object extent, value;
|
|
7264 int limit_was_nil;
|
2506
|
7265 enum extent_at_flag at_flag = next ? EXTENT_AT_AFTER : EXTENT_AT_BEFORE;
|
826
|
7266 if (limit < 0)
|
|
7267 {
|
2506
|
7268 limit = (next ? buffer_or_string_accessible_end_byte :
|
|
7269 buffer_or_string_accessible_begin_byte) (object);
|
826
|
7270 limit_was_nil = 1;
|
|
7271 }
|
|
7272 else
|
|
7273 limit_was_nil = 0;
|
|
7274
|
2506
|
7275 /* Retrieve initial property value to compare against */
|
|
7276 extent = extent_at (pos, object, prop, 0, at_flag, 0);
|
|
7277 /* If we only want text-prop extents, ignore all others */
|
|
7278 if (text_props_only && !NILP (extent) &&
|
|
7279 NILP (Fextent_property (extent, Qtext_prop, Qnil)))
|
|
7280 extent = Qnil;
|
826
|
7281 if (!NILP (extent))
|
|
7282 value = Fextent_property (extent, prop, Qnil);
|
|
7283 else
|
|
7284 value = Qnil;
|
|
7285
|
|
7286 while (1)
|
|
7287 {
|
2506
|
7288 pos = (next ? extent_find_end_of_run : extent_find_beginning_of_run)
|
|
7289 (object, pos, 1);
|
|
7290 if (next ? pos >= limit : pos <= limit)
|
|
7291 break; /* property is the same all the way to the beginning/end */
|
|
7292 extent = extent_at (pos, object, prop, 0, at_flag, 0);
|
|
7293 /* If we only want text-prop extents, ignore all others */
|
|
7294 if (text_props_only && !NILP (extent) &&
|
|
7295 NILP (Fextent_property (extent, Qtext_prop, Qnil)))
|
|
7296 extent = Qnil;
|
826
|
7297 if ((NILP (extent) && !NILP (value)) ||
|
|
7298 (!NILP (extent) && !EQ (value,
|
|
7299 Fextent_property (extent, prop, Qnil))))
|
|
7300 return pos;
|
|
7301 }
|
|
7302
|
|
7303 if (limit_was_nil)
|
|
7304 return -1;
|
|
7305 else
|
|
7306 return limit;
|
|
7307 }
|
|
7308
|
2506
|
7309 static Lisp_Object
|
|
7310 next_previous_single_property_change_fn (Lisp_Object pos, Lisp_Object prop,
|
|
7311 Lisp_Object object, Lisp_Object limit,
|
|
7312 Boolint next, Boolint text_props_only)
|
|
7313 {
|
|
7314 Bytexpos xpos;
|
|
7315 Bytexpos blim;
|
|
7316
|
|
7317 object = decode_buffer_or_string (object);
|
|
7318 xpos = get_buffer_or_string_pos_byte (object, pos, 0);
|
|
7319 blim = !NILP (limit) ? get_buffer_or_string_pos_byte (object, limit, 0) : -1;
|
|
7320 blim = next_previous_single_property_change (xpos, prop, object, blim,
|
|
7321 next, text_props_only);
|
|
7322
|
|
7323 if (blim < 0)
|
|
7324 return Qnil;
|
826
|
7325 else
|
2506
|
7326 return make_int (buffer_or_string_bytexpos_to_charxpos (object, blim));
|
826
|
7327 }
|
428
|
7328
|
|
7329 DEFUN ("next-single-property-change", Fnext_single_property_change,
|
|
7330 2, 4, 0, /*
|
|
7331 Return the position of next property change for a specific property.
|
|
7332 Scans characters forward from POS till it finds a change in the PROP
|
|
7333 property, then returns the position of the change. The optional third
|
|
7334 argument OBJECT is the buffer or string to scan (defaults to the current
|
|
7335 buffer).
|
|
7336 The property values are compared with `eq'.
|
444
|
7337 Return nil if the property is constant all the way to the end of OBJECT.
|
428
|
7338 If the value is non-nil, it is a position greater than POS, never equal.
|
|
7339
|
|
7340 If the optional fourth argument LIMIT is non-nil, don't search
|
|
7341 past position LIMIT; return LIMIT if nothing is found before LIMIT.
|
|
7342 If two or more extents with conflicting non-nil values for PROP overlap
|
|
7343 a particular character, it is undefined which value is considered to be
|
|
7344 the value of PROP. (Note that this situation will not happen if you always
|
|
7345 use the text-property primitives.)
|
2506
|
7346
|
|
7347 This function looks only at extents created using the text-property primitives.
|
|
7348 To look at all extents, use `next-single-char-property-change'.
|
428
|
7349 */
|
|
7350 (pos, prop, object, limit))
|
|
7351 {
|
2506
|
7352 return next_previous_single_property_change_fn (pos, prop, object, limit,
|
|
7353 1, 1);
|
826
|
7354 }
|
428
|
7355
|
|
7356 DEFUN ("previous-single-property-change", Fprevious_single_property_change,
|
|
7357 2, 4, 0, /*
|
|
7358 Return the position of next property change for a specific property.
|
|
7359 Scans characters backward from POS till it finds a change in the PROP
|
|
7360 property, then returns the position of the change. The optional third
|
|
7361 argument OBJECT is the buffer or string to scan (defaults to the current
|
|
7362 buffer).
|
|
7363 The property values are compared with `eq'.
|
444
|
7364 Return nil if the property is constant all the way to the start of OBJECT.
|
428
|
7365 If the value is non-nil, it is a position less than POS, never equal.
|
|
7366
|
|
7367 If the optional fourth argument LIMIT is non-nil, don't search back
|
|
7368 past position LIMIT; return LIMIT if nothing is found until LIMIT.
|
|
7369 If two or more extents with conflicting non-nil values for PROP overlap
|
|
7370 a particular character, it is undefined which value is considered to be
|
|
7371 the value of PROP. (Note that this situation will not happen if you always
|
|
7372 use the text-property primitives.)
|
2506
|
7373
|
|
7374 This function looks only at extents created using the text-property primitives.
|
|
7375 To look at all extents, use `next-single-char-property-change'.
|
|
7376 */
|
|
7377 (pos, prop, object, limit))
|
|
7378 {
|
|
7379 return next_previous_single_property_change_fn (pos, prop, object, limit,
|
|
7380 0, 1);
|
|
7381 }
|
|
7382
|
|
7383 DEFUN ("next-single-char-property-change", Fnext_single_char_property_change,
|
|
7384 2, 4, 0, /*
|
|
7385 Return the position of next property change for a specific property.
|
|
7386 Scans characters forward from POS till it finds a change in the PROP
|
|
7387 property, then returns the position of the change. The optional third
|
|
7388 argument OBJECT is the buffer or string to scan (defaults to the current
|
|
7389 buffer).
|
|
7390 The property values are compared with `eq'.
|
|
7391 Return nil if the property is constant all the way to the end of OBJECT.
|
|
7392 If the value is non-nil, it is a position greater than POS, never equal.
|
|
7393
|
|
7394 If the optional fourth argument LIMIT is non-nil, don't search
|
|
7395 past position LIMIT; return LIMIT if nothing is found before LIMIT.
|
|
7396 If two or more extents with conflicting non-nil values for PROP overlap
|
|
7397 a particular character, it is undefined which value is considered to be
|
|
7398 the value of PROP. (Note that this situation will not happen if you always
|
|
7399 use the text-property primitives.)
|
|
7400
|
|
7401 This function looks at all extents. To look at only extents created using the
|
|
7402 text-property primitives, use `next-single-char-property-change'.
|
428
|
7403 */
|
|
7404 (pos, prop, object, limit))
|
|
7405 {
|
2506
|
7406 return next_previous_single_property_change_fn (pos, prop, object, limit,
|
|
7407 1, 0);
|
|
7408 }
|
|
7409
|
|
7410 DEFUN ("previous-single-char-property-change",
|
|
7411 Fprevious_single_char_property_change,
|
|
7412 2, 4, 0, /*
|
|
7413 Return the position of next property change for a specific property.
|
|
7414 Scans characters backward from POS till it finds a change in the PROP
|
|
7415 property, then returns the position of the change. The optional third
|
|
7416 argument OBJECT is the buffer or string to scan (defaults to the current
|
|
7417 buffer).
|
|
7418 The property values are compared with `eq'.
|
|
7419 Return nil if the property is constant all the way to the start of OBJECT.
|
|
7420 If the value is non-nil, it is a position less than POS, never equal.
|
|
7421
|
|
7422 If the optional fourth argument LIMIT is non-nil, don't search back
|
|
7423 past position LIMIT; return LIMIT if nothing is found until LIMIT.
|
|
7424 If two or more extents with conflicting non-nil values for PROP overlap
|
|
7425 a particular character, it is undefined which value is considered to be
|
|
7426 the value of PROP. (Note that this situation will not happen if you always
|
|
7427 use the text-property primitives.)
|
|
7428
|
|
7429 This function looks at all extents. To look at only extents created using the
|
|
7430 text-property primitives, use `next-single-char-property-change'.
|
|
7431 */
|
|
7432 (pos, prop, object, limit))
|
|
7433 {
|
|
7434 return next_previous_single_property_change_fn (pos, prop, object, limit,
|
|
7435 0, 0);
|
428
|
7436 }
|
|
7437
|
|
7438 #ifdef MEMORY_USAGE_STATS
|
|
7439
|
|
7440 int
|
2286
|
7441 compute_buffer_extent_usage (struct buffer *UNUSED (b),
|
|
7442 struct overhead_stats *UNUSED (ovstats))
|
428
|
7443 {
|
|
7444 /* #### not yet written */
|
|
7445 return 0;
|
|
7446 }
|
|
7447
|
|
7448 #endif /* MEMORY_USAGE_STATS */
|
|
7449
|
|
7450
|
|
7451 /************************************************************************/
|
|
7452 /* initialization */
|
|
7453 /************************************************************************/
|
|
7454
|
|
7455 void
|
|
7456 syms_of_extents (void)
|
|
7457 {
|
442
|
7458 INIT_LRECORD_IMPLEMENTATION (extent);
|
|
7459 INIT_LRECORD_IMPLEMENTATION (extent_info);
|
|
7460 INIT_LRECORD_IMPLEMENTATION (extent_auxiliary);
|
3092
|
7461 #ifdef NEW_GC
|
|
7462 INIT_LRECORD_IMPLEMENTATION (gap_array_marker);
|
|
7463 INIT_LRECORD_IMPLEMENTATION (gap_array);
|
|
7464 INIT_LRECORD_IMPLEMENTATION (extent_list_marker);
|
|
7465 INIT_LRECORD_IMPLEMENTATION (extent_list);
|
|
7466 INIT_LRECORD_IMPLEMENTATION (stack_of_extents);
|
3263
|
7467 #endif /* NEW_GC */
|
442
|
7468
|
563
|
7469 DEFSYMBOL (Qextentp);
|
|
7470 DEFSYMBOL (Qextent_live_p);
|
|
7471
|
|
7472 DEFSYMBOL (Qall_extents_closed);
|
|
7473 DEFSYMBOL (Qall_extents_open);
|
|
7474 DEFSYMBOL (Qall_extents_closed_open);
|
|
7475 DEFSYMBOL (Qall_extents_open_closed);
|
|
7476 DEFSYMBOL (Qstart_in_region);
|
|
7477 DEFSYMBOL (Qend_in_region);
|
|
7478 DEFSYMBOL (Qstart_and_end_in_region);
|
|
7479 DEFSYMBOL (Qstart_or_end_in_region);
|
|
7480 DEFSYMBOL (Qnegate_in_region);
|
|
7481
|
|
7482 DEFSYMBOL (Qdetached);
|
|
7483 DEFSYMBOL (Qdestroyed);
|
|
7484 DEFSYMBOL (Qbegin_glyph);
|
|
7485 DEFSYMBOL (Qend_glyph);
|
|
7486 DEFSYMBOL (Qstart_open);
|
|
7487 DEFSYMBOL (Qend_open);
|
|
7488 DEFSYMBOL (Qstart_closed);
|
|
7489 DEFSYMBOL (Qend_closed);
|
|
7490 DEFSYMBOL (Qread_only);
|
|
7491 /* DEFSYMBOL (Qhighlight); in faces.c */
|
|
7492 DEFSYMBOL (Qunique);
|
|
7493 DEFSYMBOL (Qduplicable);
|
|
7494 DEFSYMBOL (Qdetachable);
|
|
7495 DEFSYMBOL (Qpriority);
|
|
7496 DEFSYMBOL (Qmouse_face);
|
|
7497 DEFSYMBOL (Qinitial_redisplay_function);
|
|
7498
|
|
7499
|
|
7500 DEFSYMBOL (Qglyph_layout); /* backwards compatibility */
|
|
7501 DEFSYMBOL (Qbegin_glyph_layout);
|
|
7502 DEFSYMBOL (Qend_glyph_layout);
|
|
7503 DEFSYMBOL (Qoutside_margin);
|
|
7504 DEFSYMBOL (Qinside_margin);
|
|
7505 DEFSYMBOL (Qwhitespace);
|
428
|
7506 /* Qtext defined in general.c */
|
|
7507
|
563
|
7508 DEFSYMBOL (Qpaste_function);
|
|
7509 DEFSYMBOL (Qcopy_function);
|
|
7510
|
|
7511 DEFSYMBOL (Qtext_prop);
|
|
7512 DEFSYMBOL (Qtext_prop_extent_paste_function);
|
428
|
7513
|
|
7514 DEFSUBR (Fextentp);
|
|
7515 DEFSUBR (Fextent_live_p);
|
|
7516 DEFSUBR (Fextent_detached_p);
|
|
7517 DEFSUBR (Fextent_start_position);
|
|
7518 DEFSUBR (Fextent_end_position);
|
|
7519 DEFSUBR (Fextent_object);
|
|
7520 DEFSUBR (Fextent_length);
|
|
7521
|
|
7522 DEFSUBR (Fmake_extent);
|
|
7523 DEFSUBR (Fcopy_extent);
|
|
7524 DEFSUBR (Fdelete_extent);
|
|
7525 DEFSUBR (Fdetach_extent);
|
|
7526 DEFSUBR (Fset_extent_endpoints);
|
|
7527 DEFSUBR (Fnext_extent);
|
|
7528 DEFSUBR (Fprevious_extent);
|
1204
|
7529 #ifdef DEBUG_XEMACS
|
428
|
7530 DEFSUBR (Fnext_e_extent);
|
|
7531 DEFSUBR (Fprevious_e_extent);
|
|
7532 #endif
|
|
7533 DEFSUBR (Fnext_extent_change);
|
|
7534 DEFSUBR (Fprevious_extent_change);
|
|
7535
|
|
7536 DEFSUBR (Fextent_parent);
|
|
7537 DEFSUBR (Fextent_children);
|
|
7538 DEFSUBR (Fset_extent_parent);
|
|
7539
|
|
7540 DEFSUBR (Fextent_in_region_p);
|
|
7541 DEFSUBR (Fmap_extents);
|
|
7542 DEFSUBR (Fmap_extent_children);
|
|
7543 DEFSUBR (Fextent_at);
|
442
|
7544 DEFSUBR (Fextents_at);
|
428
|
7545
|
|
7546 DEFSUBR (Fset_extent_initial_redisplay_function);
|
|
7547 DEFSUBR (Fextent_face);
|
|
7548 DEFSUBR (Fset_extent_face);
|
|
7549 DEFSUBR (Fextent_mouse_face);
|
|
7550 DEFSUBR (Fset_extent_mouse_face);
|
|
7551 DEFSUBR (Fset_extent_begin_glyph);
|
|
7552 DEFSUBR (Fset_extent_end_glyph);
|
|
7553 DEFSUBR (Fextent_begin_glyph);
|
|
7554 DEFSUBR (Fextent_end_glyph);
|
|
7555 DEFSUBR (Fset_extent_begin_glyph_layout);
|
|
7556 DEFSUBR (Fset_extent_end_glyph_layout);
|
|
7557 DEFSUBR (Fextent_begin_glyph_layout);
|
|
7558 DEFSUBR (Fextent_end_glyph_layout);
|
|
7559 DEFSUBR (Fset_extent_priority);
|
|
7560 DEFSUBR (Fextent_priority);
|
|
7561 DEFSUBR (Fset_extent_property);
|
|
7562 DEFSUBR (Fset_extent_properties);
|
|
7563 DEFSUBR (Fextent_property);
|
|
7564 DEFSUBR (Fextent_properties);
|
|
7565
|
|
7566 DEFSUBR (Fhighlight_extent);
|
|
7567 DEFSUBR (Fforce_highlight_extent);
|
|
7568
|
|
7569 DEFSUBR (Finsert_extent);
|
|
7570
|
|
7571 DEFSUBR (Fget_text_property);
|
|
7572 DEFSUBR (Fget_char_property);
|
|
7573 DEFSUBR (Fput_text_property);
|
|
7574 DEFSUBR (Fput_nonduplicable_text_property);
|
|
7575 DEFSUBR (Fadd_text_properties);
|
|
7576 DEFSUBR (Fadd_nonduplicable_text_properties);
|
|
7577 DEFSUBR (Fremove_text_properties);
|
|
7578 DEFSUBR (Ftext_prop_extent_paste_function);
|
|
7579 DEFSUBR (Fnext_single_property_change);
|
|
7580 DEFSUBR (Fprevious_single_property_change);
|
2506
|
7581 DEFSUBR (Fnext_single_char_property_change);
|
|
7582 DEFSUBR (Fprevious_single_char_property_change);
|
428
|
7583 }
|
|
7584
|
|
7585 void
|
|
7586 reinit_vars_of_extents (void)
|
|
7587 {
|
|
7588 extent_auxiliary_defaults.begin_glyph = Qnil;
|
|
7589 extent_auxiliary_defaults.end_glyph = Qnil;
|
|
7590 extent_auxiliary_defaults.parent = Qnil;
|
|
7591 extent_auxiliary_defaults.children = Qnil;
|
|
7592 extent_auxiliary_defaults.priority = 0;
|
|
7593 extent_auxiliary_defaults.invisible = Qnil;
|
|
7594 extent_auxiliary_defaults.read_only = Qnil;
|
|
7595 extent_auxiliary_defaults.mouse_face = Qnil;
|
|
7596 extent_auxiliary_defaults.initial_redisplay_function = Qnil;
|
|
7597 extent_auxiliary_defaults.before_change_functions = Qnil;
|
|
7598 extent_auxiliary_defaults.after_change_functions = Qnil;
|
|
7599 }
|
|
7600
|
|
7601 void
|
|
7602 vars_of_extents (void)
|
|
7603 {
|
|
7604 DEFVAR_INT ("mouse-highlight-priority", &mouse_highlight_priority /*
|
|
7605 The priority to use for the mouse-highlighting pseudo-extent
|
|
7606 that is used to highlight extents with the `mouse-face' attribute set.
|
|
7607 See `set-extent-priority'.
|
|
7608 */ );
|
|
7609 /* Set mouse-highlight-priority (which ends up being used both for the
|
|
7610 mouse-highlighting pseudo-extent and the primary selection extent)
|
|
7611 to a very high value because very few extents should override it.
|
|
7612 1000 gives lots of room below it for different-prioritized extents.
|
|
7613 10 doesn't. ediff, for example, likes to use priorities around 100.
|
|
7614 --ben */
|
|
7615 mouse_highlight_priority = /* 10 */ 1000;
|
|
7616
|
|
7617 DEFVAR_LISP ("default-text-properties", &Vdefault_text_properties /*
|
|
7618 Property list giving default values for text properties.
|
|
7619 Whenever a character does not specify a value for a property, the value
|
|
7620 stored in this list is used instead. This only applies when the
|
|
7621 functions `get-text-property' or `get-char-property' are called.
|
|
7622 */ );
|
|
7623 Vdefault_text_properties = Qnil;
|
|
7624
|
|
7625 staticpro (&Vlast_highlighted_extent);
|
|
7626 Vlast_highlighted_extent = Qnil;
|
|
7627
|
|
7628 Vextent_face_reusable_list = Fcons (Qnil, Qnil);
|
|
7629 staticpro (&Vextent_face_reusable_list);
|
771
|
7630
|
428
|
7631 staticpro (&Vextent_face_memoize_hash_table);
|
|
7632 /* The memoize hash table maps from lists of symbols to lists of
|
|
7633 faces. It needs to be `equal' to implement the memoization.
|
|
7634 The reverse table maps in the other direction and just needs
|
|
7635 to do `eq' comparison because the lists of faces are already
|
|
7636 memoized. */
|
|
7637 Vextent_face_memoize_hash_table =
|
|
7638 make_lisp_hash_table (100, HASH_TABLE_VALUE_WEAK, HASH_TABLE_EQUAL);
|
|
7639 staticpro (&Vextent_face_reverse_memoize_hash_table);
|
|
7640 Vextent_face_reverse_memoize_hash_table =
|
|
7641 make_lisp_hash_table (100, HASH_TABLE_KEY_WEAK, HASH_TABLE_EQ);
|
1292
|
7642
|
|
7643 QSin_map_extents_internal = build_msg_string ("(in map-extents-internal)");
|
|
7644 staticpro (&QSin_map_extents_internal);
|
|
7645 }
|