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