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