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