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