Commit | Line | Data |
---|---|---|
d418ef42 | 1 | /* Interface code for dealing with text properties. |
0b5538bd | 2 | Copyright (C) 1993, 1994, 1995, 1997, 1999, 2000, 2001, 2002, 2003, |
8cabe764 | 3 | 2004, 2005, 2006, 2007, 2008 Free Software Foundation, Inc. |
d418ef42 JA |
4 | |
5 | This file is part of GNU Emacs. | |
6 | ||
7 | GNU Emacs is free software; you can redistribute it and/or modify | |
8 | it under the terms of the GNU General Public License as published by | |
684d6f5b | 9 | the Free Software Foundation; either version 3, or (at your option) |
d418ef42 JA |
10 | any later version. |
11 | ||
12 | GNU Emacs is distributed in the hope that it will be useful, | |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
18 | along with GNU Emacs; see the file COPYING. If not, write to | |
4fc5845f LK |
19 | the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, |
20 | Boston, MA 02110-1301, USA. */ | |
d418ef42 | 21 | |
18160b98 | 22 | #include <config.h> |
d418ef42 JA |
23 | #include "lisp.h" |
24 | #include "intervals.h" | |
25 | #include "buffer.h" | |
f5957179 | 26 | #include "window.h" |
59a486ab RS |
27 | |
28 | #ifndef NULL | |
29 | #define NULL (void *)0 | |
30 | #endif | |
318d2fa8 RS |
31 | |
32 | /* Test for membership, allowing for t (actually any non-cons) to mean the | |
33 | universal set. */ | |
34 | ||
35 | #define TMEM(sym, set) (CONSP (set) ? ! NILP (Fmemq (sym, set)) : ! NILP (set)) | |
d418ef42 JA |
36 | \f |
37 | ||
38 | /* NOTES: previous- and next- property change will have to skip | |
39 | zero-length intervals if they are implemented. This could be done | |
40 | inside next_interval and previous_interval. | |
41 | ||
9c79dd1b JA |
42 | set_properties needs to deal with the interval property cache. |
43 | ||
d418ef42 | 44 | It is assumed that for any interval plist, a property appears |
d4b530ad | 45 | only once on the list. Although some code i.e., remove_properties, |
d418ef42 | 46 | handles the more general case, the uniqueness of properties is |
eb8c3be9 | 47 | necessary for the system to remain consistent. This requirement |
cdf3e5a2 | 48 | is enforced by the subrs installing properties onto the intervals. */ |
d418ef42 JA |
49 | |
50 | \f | |
cdf3e5a2 | 51 | /* Types of hooks. */ |
d418ef42 JA |
52 | Lisp_Object Qmouse_left; |
53 | Lisp_Object Qmouse_entered; | |
54 | Lisp_Object Qpoint_left; | |
55 | Lisp_Object Qpoint_entered; | |
dc70cea7 RS |
56 | Lisp_Object Qcategory; |
57 | Lisp_Object Qlocal_map; | |
d418ef42 | 58 | |
cdf3e5a2 | 59 | /* Visual properties text (including strings) may have. */ |
d418ef42 | 60 | Lisp_Object Qforeground, Qbackground, Qfont, Qunderline, Qstipple; |
69bb837e | 61 | Lisp_Object Qinvisible, Qread_only, Qintangible, Qmouse_face; |
19e1c426 RS |
62 | |
63 | /* Sticky properties */ | |
64 | Lisp_Object Qfront_sticky, Qrear_nonsticky; | |
d7b4e137 JB |
65 | |
66 | /* If o1 is a cons whose cdr is a cons, return non-zero and set o2 to | |
67 | the o1's cdr. Otherwise, return zero. This is handy for | |
68 | traversing plists. */ | |
70949dac | 69 | #define PLIST_ELT_P(o1, o2) (CONSP (o1) && ((o2)=XCDR (o1), CONSP (o2))) |
d7b4e137 | 70 | |
688a5a0f | 71 | Lisp_Object Vinhibit_point_motion_hooks; |
ad1b2f20 | 72 | Lisp_Object Vdefault_text_properties; |
49d110a8 | 73 | Lisp_Object Vchar_property_alias_alist; |
abc2f676 | 74 | Lisp_Object Vtext_property_default_nonsticky; |
688a5a0f | 75 | |
318d2fa8 RS |
76 | /* verify_interval_modification saves insertion hooks here |
77 | to be run later by report_interval_modification. */ | |
78 | Lisp_Object interval_insert_behind_hooks; | |
79 | Lisp_Object interval_insert_in_front_hooks; | |
7cb66899 | 80 | |
2381d38d DN |
81 | static void text_read_only P_ ((Lisp_Object)) NO_RETURN; |
82 | ||
7cb66899 GM |
83 | |
84 | /* Signal a `text-read-only' error. This function makes it easier | |
85 | to capture that error in GDB by putting a breakpoint on it. */ | |
86 | ||
87 | static void | |
bcf97349 SM |
88 | text_read_only (propval) |
89 | Lisp_Object propval; | |
7cb66899 | 90 | { |
d0a29e1d KS |
91 | if (STRINGP (propval)) |
92 | xsignal1 (Qtext_read_only, propval); | |
93 | ||
94 | xsignal0 (Qtext_read_only); | |
7cb66899 GM |
95 | } |
96 | ||
97 | ||
d418ef42 | 98 | \f |
ac876a79 JA |
99 | /* Extract the interval at the position pointed to by BEGIN from |
100 | OBJECT, a string or buffer. Additionally, check that the positions | |
101 | pointed to by BEGIN and END are within the bounds of OBJECT, and | |
102 | reverse them if *BEGIN is greater than *END. The objects pointed | |
103 | to by BEGIN and END may be integers or markers; if the latter, they | |
104 | are coerced to integers. | |
d418ef42 | 105 | |
d4b530ad RS |
106 | When OBJECT is a string, we increment *BEGIN and *END |
107 | to make them origin-one. | |
108 | ||
d418ef42 JA |
109 | Note that buffer points don't correspond to interval indices. |
110 | For example, point-max is 1 greater than the index of the last | |
111 | character. This difference is handled in the caller, which uses | |
112 | the validated points to determine a length, and operates on that. | |
113 | Exceptions are Ftext_properties_at, Fnext_property_change, and | |
114 | Fprevious_property_change which call this function with BEGIN == END. | |
115 | Handle this case specially. | |
116 | ||
117 | If FORCE is soft (0), it's OK to return NULL_INTERVAL. Otherwise, | |
ac876a79 JA |
118 | create an interval tree for OBJECT if one doesn't exist, provided |
119 | the object actually contains text. In the current design, if there | |
d4b530ad | 120 | is no text, there can be no text properties. */ |
d418ef42 JA |
121 | |
122 | #define soft 0 | |
123 | #define hard 1 | |
124 | ||
9dd7eec6 | 125 | INTERVAL |
d418ef42 JA |
126 | validate_interval_range (object, begin, end, force) |
127 | Lisp_Object object, *begin, *end; | |
128 | int force; | |
129 | { | |
130 | register INTERVAL i; | |
d4b530ad RS |
131 | int searchpos; |
132 | ||
b7826503 PJ |
133 | CHECK_STRING_OR_BUFFER (object); |
134 | CHECK_NUMBER_COERCE_MARKER (*begin); | |
135 | CHECK_NUMBER_COERCE_MARKER (*end); | |
d418ef42 JA |
136 | |
137 | /* If we are asked for a point, but from a subr which operates | |
cdf3e5a2 | 138 | on a range, then return nothing. */ |
64a49ca7 | 139 | if (EQ (*begin, *end) && begin != end) |
d418ef42 JA |
140 | return NULL_INTERVAL; |
141 | ||
142 | if (XINT (*begin) > XINT (*end)) | |
143 | { | |
d4b530ad RS |
144 | Lisp_Object n; |
145 | n = *begin; | |
d418ef42 | 146 | *begin = *end; |
d4b530ad | 147 | *end = n; |
d418ef42 JA |
148 | } |
149 | ||
5d2fa46f | 150 | if (BUFFERP (object)) |
d418ef42 JA |
151 | { |
152 | register struct buffer *b = XBUFFER (object); | |
153 | ||
d418ef42 JA |
154 | if (!(BUF_BEGV (b) <= XINT (*begin) && XINT (*begin) <= XINT (*end) |
155 | && XINT (*end) <= BUF_ZV (b))) | |
156 | args_out_of_range (*begin, *end); | |
866bf246 | 157 | i = BUF_INTERVALS (b); |
d418ef42 | 158 | |
cdf3e5a2 | 159 | /* If there's no text, there are no properties. */ |
d4b530ad RS |
160 | if (BUF_BEGV (b) == BUF_ZV (b)) |
161 | return NULL_INTERVAL; | |
162 | ||
163 | searchpos = XINT (*begin); | |
d418ef42 JA |
164 | } |
165 | else | |
166 | { | |
943afcc7 | 167 | int len = SCHARS (object); |
d418ef42 | 168 | |
d4b530ad | 169 | if (! (0 <= XINT (*begin) && XINT (*begin) <= XINT (*end) |
943afcc7 | 170 | && XINT (*end) <= len)) |
d418ef42 | 171 | args_out_of_range (*begin, *end); |
ad077db0 | 172 | XSETFASTINT (*begin, XFASTINT (*begin)); |
b1e94638 | 173 | if (begin != end) |
ad077db0 | 174 | XSETFASTINT (*end, XFASTINT (*end)); |
943afcc7 | 175 | i = STRING_INTERVALS (object); |
d4b530ad | 176 | |
943afcc7 | 177 | if (len == 0) |
d4b530ad RS |
178 | return NULL_INTERVAL; |
179 | ||
180 | searchpos = XINT (*begin); | |
d418ef42 JA |
181 | } |
182 | ||
183 | if (NULL_INTERVAL_P (i)) | |
184 | return (force ? create_root_interval (object) : i); | |
81f6e55f | 185 | |
d4b530ad | 186 | return find_interval (i, searchpos); |
d418ef42 JA |
187 | } |
188 | ||
189 | /* Validate LIST as a property list. If LIST is not a list, then | |
190 | make one consisting of (LIST nil). Otherwise, verify that LIST | |
cdf3e5a2 | 191 | is even numbered and thus suitable as a plist. */ |
d418ef42 JA |
192 | |
193 | static Lisp_Object | |
194 | validate_plist (list) | |
4d780c76 | 195 | Lisp_Object list; |
d418ef42 JA |
196 | { |
197 | if (NILP (list)) | |
198 | return Qnil; | |
199 | ||
200 | if (CONSP (list)) | |
201 | { | |
202 | register int i; | |
203 | register Lisp_Object tail; | |
99784d63 | 204 | for (i = 0, tail = list; CONSP (tail); i++) |
b1e94638 | 205 | { |
99784d63 | 206 | tail = XCDR (tail); |
b1e94638 JB |
207 | QUIT; |
208 | } | |
d418ef42 JA |
209 | if (i & 1) |
210 | error ("Odd length text property list"); | |
211 | return list; | |
212 | } | |
213 | ||
214 | return Fcons (list, Fcons (Qnil, Qnil)); | |
215 | } | |
216 | ||
d418ef42 | 217 | /* Return nonzero if interval I has all the properties, |
cdf3e5a2 | 218 | with the same values, of list PLIST. */ |
d418ef42 JA |
219 | |
220 | static int | |
221 | interval_has_all_properties (plist, i) | |
222 | Lisp_Object plist; | |
223 | INTERVAL i; | |
224 | { | |
695f302f | 225 | register Lisp_Object tail1, tail2, sym1; |
d418ef42 JA |
226 | register int found; |
227 | ||
cdf3e5a2 | 228 | /* Go through each element of PLIST. */ |
99784d63 | 229 | for (tail1 = plist; CONSP (tail1); tail1 = Fcdr (XCDR (tail1))) |
d418ef42 | 230 | { |
99784d63 | 231 | sym1 = XCAR (tail1); |
d418ef42 JA |
232 | found = 0; |
233 | ||
234 | /* Go through I's plist, looking for sym1 */ | |
99784d63 SM |
235 | for (tail2 = i->plist; CONSP (tail2); tail2 = Fcdr (XCDR (tail2))) |
236 | if (EQ (sym1, XCAR (tail2))) | |
d418ef42 JA |
237 | { |
238 | /* Found the same property on both lists. If the | |
cdf3e5a2 | 239 | values are unequal, return zero. */ |
99784d63 | 240 | if (! EQ (Fcar (XCDR (tail1)), Fcar (XCDR (tail2)))) |
d418ef42 JA |
241 | return 0; |
242 | ||
cdf3e5a2 | 243 | /* Property has same value on both lists; go to next one. */ |
d418ef42 JA |
244 | found = 1; |
245 | break; | |
246 | } | |
247 | ||
248 | if (! found) | |
249 | return 0; | |
250 | } | |
251 | ||
252 | return 1; | |
253 | } | |
254 | ||
255 | /* Return nonzero if the plist of interval I has any of the | |
cdf3e5a2 | 256 | properties of PLIST, regardless of their values. */ |
d418ef42 JA |
257 | |
258 | static INLINE int | |
259 | interval_has_some_properties (plist, i) | |
260 | Lisp_Object plist; | |
261 | INTERVAL i; | |
262 | { | |
263 | register Lisp_Object tail1, tail2, sym; | |
264 | ||
cdf3e5a2 | 265 | /* Go through each element of PLIST. */ |
99784d63 | 266 | for (tail1 = plist; CONSP (tail1); tail1 = Fcdr (XCDR (tail1))) |
d418ef42 | 267 | { |
99784d63 | 268 | sym = XCAR (tail1); |
d418ef42 JA |
269 | |
270 | /* Go through i's plist, looking for tail1 */ | |
99784d63 SM |
271 | for (tail2 = i->plist; CONSP (tail2); tail2 = Fcdr (XCDR (tail2))) |
272 | if (EQ (sym, XCAR (tail2))) | |
d418ef42 JA |
273 | return 1; |
274 | } | |
275 | ||
276 | return 0; | |
277 | } | |
11713b6d RS |
278 | |
279 | /* Return nonzero if the plist of interval I has any of the | |
280 | property names in LIST, regardless of their values. */ | |
281 | ||
282 | static INLINE int | |
283 | interval_has_some_properties_list (list, i) | |
284 | Lisp_Object list; | |
285 | INTERVAL i; | |
286 | { | |
287 | register Lisp_Object tail1, tail2, sym; | |
288 | ||
289 | /* Go through each element of LIST. */ | |
99784d63 | 290 | for (tail1 = list; CONSP (tail1); tail1 = XCDR (tail1)) |
11713b6d RS |
291 | { |
292 | sym = Fcar (tail1); | |
293 | ||
294 | /* Go through i's plist, looking for tail1 */ | |
99784d63 | 295 | for (tail2 = i->plist; CONSP (tail2); tail2 = XCDR (XCDR (tail2))) |
11713b6d RS |
296 | if (EQ (sym, XCAR (tail2))) |
297 | return 1; | |
298 | } | |
299 | ||
300 | return 0; | |
301 | } | |
d4b530ad | 302 | \f |
d7b4e137 JB |
303 | /* Changing the plists of individual intervals. */ |
304 | ||
305 | /* Return the value of PROP in property-list PLIST, or Qunbound if it | |
306 | has none. */ | |
64a49ca7 | 307 | static Lisp_Object |
d7b4e137 | 308 | property_value (plist, prop) |
33ca3504 | 309 | Lisp_Object plist, prop; |
d7b4e137 JB |
310 | { |
311 | Lisp_Object value; | |
312 | ||
313 | while (PLIST_ELT_P (plist, value)) | |
70949dac KR |
314 | if (EQ (XCAR (plist), prop)) |
315 | return XCAR (value); | |
d7b4e137 | 316 | else |
70949dac | 317 | plist = XCDR (value); |
d7b4e137 JB |
318 | |
319 | return Qunbound; | |
320 | } | |
321 | ||
d4b530ad RS |
322 | /* Set the properties of INTERVAL to PROPERTIES, |
323 | and record undo info for the previous values. | |
324 | OBJECT is the string or buffer that INTERVAL belongs to. */ | |
325 | ||
326 | static void | |
327 | set_properties (properties, interval, object) | |
328 | Lisp_Object properties, object; | |
329 | INTERVAL interval; | |
330 | { | |
d7b4e137 | 331 | Lisp_Object sym, value; |
d4b530ad | 332 | |
d7b4e137 | 333 | if (BUFFERP (object)) |
d4b530ad | 334 | { |
d7b4e137 JB |
335 | /* For each property in the old plist which is missing from PROPERTIES, |
336 | or has a different value in PROPERTIES, make an undo record. */ | |
337 | for (sym = interval->plist; | |
338 | PLIST_ELT_P (sym, value); | |
70949dac KR |
339 | sym = XCDR (value)) |
340 | if (! EQ (property_value (properties, XCAR (sym)), | |
341 | XCAR (value))) | |
f7a9275a | 342 | { |
f7a9275a | 343 | record_property_change (interval->position, LENGTH (interval), |
70949dac | 344 | XCAR (sym), XCAR (value), |
f7a9275a RS |
345 | object); |
346 | } | |
d7b4e137 JB |
347 | |
348 | /* For each new property that has no value at all in the old plist, | |
349 | make an undo record binding it to nil, so it will be removed. */ | |
350 | for (sym = properties; | |
351 | PLIST_ELT_P (sym, value); | |
70949dac KR |
352 | sym = XCDR (value)) |
353 | if (EQ (property_value (interval->plist, XCAR (sym)), Qunbound)) | |
f7a9275a | 354 | { |
f7a9275a | 355 | record_property_change (interval->position, LENGTH (interval), |
70949dac | 356 | XCAR (sym), Qnil, |
f7a9275a RS |
357 | object); |
358 | } | |
d4b530ad RS |
359 | } |
360 | ||
361 | /* Store new properties. */ | |
362 | interval->plist = Fcopy_sequence (properties); | |
363 | } | |
d418ef42 JA |
364 | |
365 | /* Add the properties of PLIST to the interval I, or set | |
366 | the value of I's property to the value of the property on PLIST | |
367 | if they are different. | |
368 | ||
d4b530ad RS |
369 | OBJECT should be the string or buffer the interval is in. |
370 | ||
d418ef42 JA |
371 | Return nonzero if this changes I (i.e., if any members of PLIST |
372 | are actually added to I's plist) */ | |
373 | ||
d4b530ad RS |
374 | static int |
375 | add_properties (plist, i, object) | |
d418ef42 JA |
376 | Lisp_Object plist; |
377 | INTERVAL i; | |
d4b530ad | 378 | Lisp_Object object; |
d418ef42 | 379 | { |
c98da214 | 380 | Lisp_Object tail1, tail2, sym1, val1; |
d418ef42 JA |
381 | register int changed = 0; |
382 | register int found; | |
c98da214 RS |
383 | struct gcpro gcpro1, gcpro2, gcpro3; |
384 | ||
385 | tail1 = plist; | |
386 | sym1 = Qnil; | |
387 | val1 = Qnil; | |
388 | /* No need to protect OBJECT, because we can GC only in the case | |
389 | where it is a buffer, and live buffers are always protected. | |
390 | I and its plist are also protected, via OBJECT. */ | |
391 | GCPRO3 (tail1, sym1, val1); | |
d418ef42 | 392 | |
cdf3e5a2 | 393 | /* Go through each element of PLIST. */ |
99784d63 | 394 | for (tail1 = plist; CONSP (tail1); tail1 = Fcdr (XCDR (tail1))) |
d418ef42 | 395 | { |
99784d63 SM |
396 | sym1 = XCAR (tail1); |
397 | val1 = Fcar (XCDR (tail1)); | |
d418ef42 JA |
398 | found = 0; |
399 | ||
400 | /* Go through I's plist, looking for sym1 */ | |
99784d63 SM |
401 | for (tail2 = i->plist; CONSP (tail2); tail2 = Fcdr (XCDR (tail2))) |
402 | if (EQ (sym1, XCAR (tail2))) | |
d418ef42 | 403 | { |
c98da214 RS |
404 | /* No need to gcpro, because tail2 protects this |
405 | and it must be a cons cell (we get an error otherwise). */ | |
3814ccf5 | 406 | register Lisp_Object this_cdr; |
d418ef42 | 407 | |
99784d63 | 408 | this_cdr = XCDR (tail2); |
cdf3e5a2 | 409 | /* Found the property. Now check its value. */ |
d418ef42 JA |
410 | found = 1; |
411 | ||
412 | /* The properties have the same value on both lists. | |
cdf3e5a2 | 413 | Continue to the next property. */ |
734c51b2 | 414 | if (EQ (val1, Fcar (this_cdr))) |
d418ef42 JA |
415 | break; |
416 | ||
d4b530ad | 417 | /* Record this change in the buffer, for undo purposes. */ |
5d2fa46f | 418 | if (BUFFERP (object)) |
d4b530ad | 419 | { |
f7a9275a RS |
420 | record_property_change (i->position, LENGTH (i), |
421 | sym1, Fcar (this_cdr), object); | |
d4b530ad RS |
422 | } |
423 | ||
d418ef42 JA |
424 | /* I's property has a different value -- change it */ |
425 | Fsetcar (this_cdr, val1); | |
426 | changed++; | |
427 | break; | |
428 | } | |
429 | ||
430 | if (! found) | |
431 | { | |
d4b530ad | 432 | /* Record this change in the buffer, for undo purposes. */ |
5d2fa46f | 433 | if (BUFFERP (object)) |
d4b530ad | 434 | { |
f7a9275a RS |
435 | record_property_change (i->position, LENGTH (i), |
436 | sym1, Qnil, object); | |
d4b530ad | 437 | } |
d418ef42 JA |
438 | i->plist = Fcons (sym1, Fcons (val1, i->plist)); |
439 | changed++; | |
440 | } | |
441 | } | |
442 | ||
c98da214 RS |
443 | UNGCPRO; |
444 | ||
d418ef42 JA |
445 | return changed; |
446 | } | |
447 | ||
11713b6d RS |
448 | /* For any members of PLIST, or LIST, |
449 | which are properties of I, remove them from I's plist. | |
450 | (If PLIST is non-nil, use that, otherwise use LIST.) | |
d4b530ad | 451 | OBJECT is the string or buffer containing I. */ |
d418ef42 | 452 | |
d4b530ad | 453 | static int |
11713b6d RS |
454 | remove_properties (plist, list, i, object) |
455 | Lisp_Object plist, list; | |
d418ef42 | 456 | INTERVAL i; |
d4b530ad | 457 | Lisp_Object object; |
d418ef42 | 458 | { |
3814ccf5 | 459 | register Lisp_Object tail1, tail2, sym, current_plist; |
d418ef42 JA |
460 | register int changed = 0; |
461 | ||
f25d60d6 KS |
462 | /* Nonzero means tail1 is a plist, otherwise it is a list. */ |
463 | int use_plist; | |
11713b6d | 464 | |
3814ccf5 | 465 | current_plist = i->plist; |
11713b6d RS |
466 | |
467 | if (! NILP (plist)) | |
f25d60d6 | 468 | tail1 = plist, use_plist = 1; |
11713b6d | 469 | else |
f25d60d6 | 470 | tail1 = list, use_plist = 0; |
11713b6d RS |
471 | |
472 | /* Go through each element of LIST or PLIST. */ | |
b079118d | 473 | while (CONSP (tail1)) |
d418ef42 | 474 | { |
11713b6d | 475 | sym = XCAR (tail1); |
d418ef42 | 476 | |
11713b6d | 477 | /* First, remove the symbol if it's at the head of the list */ |
b079118d | 478 | while (CONSP (current_plist) && EQ (sym, XCAR (current_plist))) |
d418ef42 | 479 | { |
5d2fa46f | 480 | if (BUFFERP (object)) |
11713b6d RS |
481 | record_property_change (i->position, LENGTH (i), |
482 | sym, XCAR (XCDR (current_plist)), | |
483 | object); | |
d4b530ad | 484 | |
11713b6d | 485 | current_plist = XCDR (XCDR (current_plist)); |
d418ef42 JA |
486 | changed++; |
487 | } | |
488 | ||
11713b6d | 489 | /* Go through I's plist, looking for SYM. */ |
d418ef42 JA |
490 | tail2 = current_plist; |
491 | while (! NILP (tail2)) | |
492 | { | |
3814ccf5 | 493 | register Lisp_Object this; |
11713b6d | 494 | this = XCDR (XCDR (tail2)); |
b079118d | 495 | if (CONSP (this) && EQ (sym, XCAR (this))) |
d418ef42 | 496 | { |
5d2fa46f | 497 | if (BUFFERP (object)) |
11713b6d RS |
498 | record_property_change (i->position, LENGTH (i), |
499 | sym, XCAR (XCDR (this)), object); | |
d4b530ad | 500 | |
11713b6d | 501 | Fsetcdr (XCDR (tail2), XCDR (XCDR (this))); |
d418ef42 JA |
502 | changed++; |
503 | } | |
504 | tail2 = this; | |
505 | } | |
11713b6d RS |
506 | |
507 | /* Advance thru TAIL1 one way or the other. */ | |
f25d60d6 KS |
508 | tail1 = XCDR (tail1); |
509 | if (use_plist && CONSP (tail1)) | |
11713b6d | 510 | tail1 = XCDR (tail1); |
d418ef42 JA |
511 | } |
512 | ||
513 | if (changed) | |
514 | i->plist = current_plist; | |
515 | return changed; | |
516 | } | |
517 | ||
d4b530ad | 518 | #if 0 |
d418ef42 | 519 | /* Remove all properties from interval I. Return non-zero |
cdf3e5a2 | 520 | if this changes the interval. */ |
d418ef42 JA |
521 | |
522 | static INLINE int | |
523 | erase_properties (i) | |
524 | INTERVAL i; | |
525 | { | |
526 | if (NILP (i->plist)) | |
527 | return 0; | |
528 | ||
529 | i->plist = Qnil; | |
530 | return 1; | |
531 | } | |
d4b530ad | 532 | #endif |
d418ef42 | 533 | \f |
81f6e55f | 534 | /* Returns the interval of POSITION in OBJECT. |
cdf3e5a2 RS |
535 | POSITION is BEG-based. */ |
536 | ||
537 | INTERVAL | |
538 | interval_of (position, object) | |
539 | int position; | |
540 | Lisp_Object object; | |
541 | { | |
542 | register INTERVAL i; | |
543 | int beg, end; | |
544 | ||
545 | if (NILP (object)) | |
546 | XSETBUFFER (object, current_buffer); | |
d0cb872a KH |
547 | else if (EQ (object, Qt)) |
548 | return NULL_INTERVAL; | |
cdf3e5a2 | 549 | |
b7826503 | 550 | CHECK_STRING_OR_BUFFER (object); |
cdf3e5a2 RS |
551 | |
552 | if (BUFFERP (object)) | |
553 | { | |
554 | register struct buffer *b = XBUFFER (object); | |
555 | ||
556 | beg = BUF_BEGV (b); | |
557 | end = BUF_ZV (b); | |
558 | i = BUF_INTERVALS (b); | |
559 | } | |
560 | else | |
561 | { | |
ad077db0 | 562 | beg = 0; |
943afcc7 KR |
563 | end = SCHARS (object); |
564 | i = STRING_INTERVALS (object); | |
cdf3e5a2 RS |
565 | } |
566 | ||
567 | if (!(beg <= position && position <= end)) | |
c7ef8e24 | 568 | args_out_of_range (make_number (position), make_number (position)); |
cdf3e5a2 RS |
569 | if (beg == end || NULL_INTERVAL_P (i)) |
570 | return NULL_INTERVAL; | |
81f6e55f | 571 | |
cdf3e5a2 RS |
572 | return find_interval (i, position); |
573 | } | |
574 | \f | |
d418ef42 JA |
575 | DEFUN ("text-properties-at", Ftext_properties_at, |
576 | Stext_properties_at, 1, 2, 0, | |
8c1a1077 | 577 | doc: /* Return the list of properties of the character at POSITION in OBJECT. |
81f6e55f FP |
578 | If the optional second argument OBJECT is a buffer (or nil, which means |
579 | the current buffer), POSITION is a buffer position (integer or marker). | |
580 | If OBJECT is a string, POSITION is a 0-based index into it. | |
8c1a1077 PJ |
581 | If POSITION is at the end of OBJECT, the value is nil. */) |
582 | (position, object) | |
1f5e848a | 583 | Lisp_Object position, object; |
d418ef42 JA |
584 | { |
585 | register INTERVAL i; | |
d418ef42 JA |
586 | |
587 | if (NILP (object)) | |
c8a4fc3d | 588 | XSETBUFFER (object, current_buffer); |
d418ef42 | 589 | |
1f5e848a | 590 | i = validate_interval_range (object, &position, &position, soft); |
d418ef42 JA |
591 | if (NULL_INTERVAL_P (i)) |
592 | return Qnil; | |
1f5e848a | 593 | /* If POSITION is at the end of the interval, |
d4b530ad RS |
594 | it means it's the end of OBJECT. |
595 | There are no properties at the very end, | |
596 | since no character follows. */ | |
1f5e848a | 597 | if (XINT (position) == LENGTH (i) + i->position) |
d4b530ad | 598 | return Qnil; |
d418ef42 JA |
599 | |
600 | return i->plist; | |
601 | } | |
602 | ||
5fbe2a44 | 603 | DEFUN ("get-text-property", Fget_text_property, Sget_text_property, 2, 3, 0, |
8c1a1077 PJ |
604 | doc: /* Return the value of POSITION's property PROP, in OBJECT. |
605 | OBJECT is optional and defaults to the current buffer. | |
606 | If POSITION is at the end of OBJECT, the value is nil. */) | |
607 | (position, prop, object) | |
1f5e848a | 608 | Lisp_Object position, object; |
46bb7c2b | 609 | Lisp_Object prop; |
5fbe2a44 | 610 | { |
1f5e848a | 611 | return textget (Ftext_properties_at (position, object), prop); |
5fbe2a44 RS |
612 | } |
613 | ||
bcf97349 | 614 | /* Return the value of char's property PROP, in OBJECT at POSITION. |
8d41abc4 MB |
615 | OBJECT is optional and defaults to the current buffer. |
616 | If OVERLAY is non-0, then in the case that the returned property is from | |
617 | an overlay, the overlay found is returned in *OVERLAY, otherwise nil is | |
618 | returned in *OVERLAY. | |
619 | If POSITION is at the end of OBJECT, the value is nil. | |
620 | If OBJECT is a buffer, then overlay properties are considered as well as | |
621 | text properties. | |
622 | If OBJECT is a window, then that window's buffer is used, but | |
623 | window-specific overlays are considered only if they are associated | |
624 | with OBJECT. */ | |
625 | Lisp_Object | |
626 | get_char_property_and_overlay (position, prop, object, overlay) | |
1f5e848a | 627 | Lisp_Object position, object; |
f5957179 | 628 | register Lisp_Object prop; |
8d41abc4 | 629 | Lisp_Object *overlay; |
f5957179 KH |
630 | { |
631 | struct window *w = 0; | |
632 | ||
b7826503 | 633 | CHECK_NUMBER_COERCE_MARKER (position); |
f5957179 KH |
634 | |
635 | if (NILP (object)) | |
c8a4fc3d | 636 | XSETBUFFER (object, current_buffer); |
f5957179 KH |
637 | |
638 | if (WINDOWP (object)) | |
639 | { | |
640 | w = XWINDOW (object); | |
64a49ca7 | 641 | object = w->buffer; |
f5957179 KH |
642 | } |
643 | if (BUFFERP (object)) | |
644 | { | |
f5957179 | 645 | int noverlays; |
b5be4dbe | 646 | Lisp_Object *overlay_vec; |
cbc55f55 RS |
647 | struct buffer *obuf = current_buffer; |
648 | ||
dd6f2802 RS |
649 | if (XINT (position) < BUF_BEGV (XBUFFER (object)) |
650 | || XINT (position) > BUF_ZV (XBUFFER (object))) | |
651 | xsignal1 (Qargs_out_of_range, position); | |
652 | ||
cbc55f55 | 653 | set_buffer_temp (XBUFFER (object)); |
f5957179 | 654 | |
b5be4dbe | 655 | GET_OVERLAYS_AT (XINT (position), overlay_vec, noverlays, NULL, 0); |
f5957179 KH |
656 | noverlays = sort_overlays (overlay_vec, noverlays, w); |
657 | ||
cbc55f55 RS |
658 | set_buffer_temp (obuf); |
659 | ||
f5957179 KH |
660 | /* Now check the overlays in order of decreasing priority. */ |
661 | while (--noverlays >= 0) | |
662 | { | |
b5be4dbe | 663 | Lisp_Object tem = Foverlay_get (overlay_vec[noverlays], prop); |
f5957179 | 664 | if (!NILP (tem)) |
8d41abc4 MB |
665 | { |
666 | if (overlay) | |
667 | /* Return the overlay we got the property from. */ | |
668 | *overlay = overlay_vec[noverlays]; | |
669 | return tem; | |
670 | } | |
f5957179 KH |
671 | } |
672 | } | |
8d41abc4 MB |
673 | |
674 | if (overlay) | |
675 | /* Indicate that the return value is not from an overlay. */ | |
676 | *overlay = Qnil; | |
677 | ||
f5957179 KH |
678 | /* Not a buffer, or no appropriate overlay, so fall through to the |
679 | simpler case. */ | |
8d41abc4 MB |
680 | return Fget_text_property (position, prop, object); |
681 | } | |
682 | ||
683 | DEFUN ("get-char-property", Fget_char_property, Sget_char_property, 2, 3, 0, | |
8c1a1077 | 684 | doc: /* Return the value of POSITION's property PROP, in OBJECT. |
8faef085 | 685 | Both overlay properties and text properties are checked. |
8c1a1077 PJ |
686 | OBJECT is optional and defaults to the current buffer. |
687 | If POSITION is at the end of OBJECT, the value is nil. | |
688 | If OBJECT is a buffer, then overlay properties are considered as well as | |
689 | text properties. | |
690 | If OBJECT is a window, then that window's buffer is used, but window-specific | |
691 | overlays are considered only if they are associated with OBJECT. */) | |
692 | (position, prop, object) | |
8d41abc4 MB |
693 | Lisp_Object position, object; |
694 | register Lisp_Object prop; | |
695 | { | |
696 | return get_char_property_and_overlay (position, prop, object, 0); | |
f5957179 | 697 | } |
97a1bc63 LT |
698 | |
699 | DEFUN ("get-char-property-and-overlay", Fget_char_property_and_overlay, | |
700 | Sget_char_property_and_overlay, 2, 3, 0, | |
701 | doc: /* Like `get-char-property', but with extra overlay information. | |
95555145 RS |
702 | The value is a cons cell. Its car is the return value of `get-char-property' |
703 | with the same arguments--that is, the value of POSITION's property | |
704 | PROP in OBJECT. Its cdr is the overlay in which the property was | |
97a1bc63 | 705 | found, or nil, if it was found as a text property or not found at all. |
95555145 | 706 | |
97a1bc63 LT |
707 | OBJECT is optional and defaults to the current buffer. OBJECT may be |
708 | a string, a buffer or a window. For strings, the cdr of the return | |
709 | value is always nil, since strings do not have overlays. If OBJECT is | |
710 | a window, then that window's buffer is used, but window-specific | |
711 | overlays are considered only if they are associated with OBJECT. If | |
712 | POSITION is at the end of OBJECT, both car and cdr are nil. */) | |
713 | (position, prop, object) | |
714 | Lisp_Object position, object; | |
715 | register Lisp_Object prop; | |
716 | { | |
717 | Lisp_Object overlay; | |
718 | Lisp_Object val | |
719 | = get_char_property_and_overlay (position, prop, object, &overlay); | |
6519d955 | 720 | return Fcons (val, overlay); |
97a1bc63 LT |
721 | } |
722 | ||
fcab51aa RS |
723 | \f |
724 | DEFUN ("next-char-property-change", Fnext_char_property_change, | |
725 | Snext_char_property_change, 1, 2, 0, | |
8c1a1077 | 726 | doc: /* Return the position of next text property or overlay change. |
81f6e55f FP |
727 | This scans characters forward in the current buffer from POSITION till |
728 | it finds a change in some text property, or the beginning or end of an | |
729 | overlay, and returns the position of that. | |
85cc6738 | 730 | If none is found up to (point-max), the function returns (point-max). |
8c1a1077 | 731 | |
a41292c2 | 732 | If the optional second argument LIMIT is non-nil, don't search |
85cc6738 RS |
733 | past position LIMIT; return LIMIT if nothing is found before LIMIT. |
734 | LIMIT is a no-op if it is greater than (point-max). */) | |
8c1a1077 | 735 | (position, limit) |
fcab51aa RS |
736 | Lisp_Object position, limit; |
737 | { | |
738 | Lisp_Object temp; | |
739 | ||
740 | temp = Fnext_overlay_change (position); | |
741 | if (! NILP (limit)) | |
742 | { | |
d615870a | 743 | CHECK_NUMBER_COERCE_MARKER (limit); |
fcab51aa RS |
744 | if (XINT (limit) < XINT (temp)) |
745 | temp = limit; | |
746 | } | |
747 | return Fnext_property_change (position, Qnil, temp); | |
748 | } | |
749 | ||
750 | DEFUN ("previous-char-property-change", Fprevious_char_property_change, | |
751 | Sprevious_char_property_change, 1, 2, 0, | |
8c1a1077 | 752 | doc: /* Return the position of previous text property or overlay change. |
81f6e55f FP |
753 | Scans characters backward in the current buffer from POSITION till it |
754 | finds a change in some text property, or the beginning or end of an | |
755 | overlay, and returns the position of that. | |
85cc6738 | 756 | If none is found since (point-min), the function returns (point-min). |
8c1a1077 | 757 | |
a41292c2 | 758 | If the optional second argument LIMIT is non-nil, don't search |
85cc6738 RS |
759 | past position LIMIT; return LIMIT if nothing is found before LIMIT. |
760 | LIMIT is a no-op if it is less than (point-min). */) | |
8c1a1077 | 761 | (position, limit) |
fcab51aa RS |
762 | Lisp_Object position, limit; |
763 | { | |
764 | Lisp_Object temp; | |
f5957179 | 765 | |
fcab51aa RS |
766 | temp = Fprevious_overlay_change (position); |
767 | if (! NILP (limit)) | |
768 | { | |
d615870a | 769 | CHECK_NUMBER_COERCE_MARKER (limit); |
fcab51aa RS |
770 | if (XINT (limit) > XINT (temp)) |
771 | temp = limit; | |
772 | } | |
773 | return Fprevious_property_change (position, Qnil, temp); | |
774 | } | |
0b0737d1 GM |
775 | |
776 | ||
b7e047fb MB |
777 | DEFUN ("next-single-char-property-change", Fnext_single_char_property_change, |
778 | Snext_single_char_property_change, 2, 4, 0, | |
8c1a1077 PJ |
779 | doc: /* Return the position of next text property or overlay change for a specific property. |
780 | Scans characters forward from POSITION till it finds | |
781 | a change in the PROP property, then returns the position of the change. | |
81f6e55f FP |
782 | If the optional third argument OBJECT is a buffer (or nil, which means |
783 | the current buffer), POSITION is a buffer position (integer or marker). | |
784 | If OBJECT is a string, POSITION is a 0-based index into it. | |
785 | ||
85cc6738 RS |
786 | In a string, scan runs to the end of the string. |
787 | In a buffer, it runs to (point-max), and the value cannot exceed that. | |
788 | ||
8c1a1077 PJ |
789 | The property values are compared with `eq'. |
790 | If the property is constant all the way to the end of OBJECT, return the | |
791 | last valid position in OBJECT. | |
792 | If the optional fourth argument LIMIT is non-nil, don't search | |
793 | past position LIMIT; return LIMIT if nothing is found before LIMIT. */) | |
794 | (position, prop, object, limit) | |
b7e047fb | 795 | Lisp_Object prop, position, object, limit; |
0b0737d1 GM |
796 | { |
797 | if (STRINGP (object)) | |
798 | { | |
b7e047fb MB |
799 | position = Fnext_single_property_change (position, prop, object, limit); |
800 | if (NILP (position)) | |
0b0737d1 GM |
801 | { |
802 | if (NILP (limit)) | |
d5db4077 | 803 | position = make_number (SCHARS (object)); |
0b0737d1 | 804 | else |
d615870a DK |
805 | { |
806 | CHECK_NUMBER (limit); | |
807 | position = limit; | |
808 | } | |
0b0737d1 GM |
809 | } |
810 | } | |
811 | else | |
812 | { | |
813 | Lisp_Object initial_value, value; | |
aed13378 | 814 | int count = SPECPDL_INDEX (); |
0b0737d1 | 815 | |
b7e047fb | 816 | if (! NILP (object)) |
b7826503 | 817 | CHECK_BUFFER (object); |
81f6e55f | 818 | |
0b0737d1 GM |
819 | if (BUFFERP (object) && current_buffer != XBUFFER (object)) |
820 | { | |
821 | record_unwind_protect (Fset_buffer, Fcurrent_buffer ()); | |
822 | Fset_buffer (object); | |
823 | } | |
824 | ||
d615870a DK |
825 | CHECK_NUMBER_COERCE_MARKER (position); |
826 | ||
b7e047fb | 827 | initial_value = Fget_char_property (position, prop, object); |
81f6e55f | 828 | |
b7e047fb | 829 | if (NILP (limit)) |
85cc6738 | 830 | XSETFASTINT (limit, ZV); |
b7e047fb | 831 | else |
b7826503 | 832 | CHECK_NUMBER_COERCE_MARKER (limit); |
b7e047fb | 833 | |
85cc6738 | 834 | if (XFASTINT (position) >= XFASTINT (limit)) |
0b0737d1 | 835 | { |
85cc6738 RS |
836 | position = limit; |
837 | if (XFASTINT (position) > ZV) | |
838 | XSETFASTINT (position, ZV); | |
0b0737d1 | 839 | } |
85cc6738 RS |
840 | else |
841 | while (1) | |
842 | { | |
843 | position = Fnext_char_property_change (position, limit); | |
844 | if (XFASTINT (position) >= XFASTINT (limit)) | |
845 | { | |
846 | position = limit; | |
847 | break; | |
848 | } | |
849 | ||
850 | value = Fget_char_property (position, prop, object); | |
851 | if (!EQ (value, initial_value)) | |
852 | break; | |
853 | } | |
0b0737d1 GM |
854 | |
855 | unbind_to (count, Qnil); | |
856 | } | |
857 | ||
b7e047fb | 858 | return position; |
0b0737d1 GM |
859 | } |
860 | ||
b7e047fb MB |
861 | DEFUN ("previous-single-char-property-change", |
862 | Fprevious_single_char_property_change, | |
863 | Sprevious_single_char_property_change, 2, 4, 0, | |
8c1a1077 PJ |
864 | doc: /* Return the position of previous text property or overlay change for a specific property. |
865 | Scans characters backward from POSITION till it finds | |
866 | a change in the PROP property, then returns the position of the change. | |
81f6e55f FP |
867 | If the optional third argument OBJECT is a buffer (or nil, which means |
868 | the current buffer), POSITION is a buffer position (integer or marker). | |
869 | If OBJECT is a string, POSITION is a 0-based index into it. | |
870 | ||
85cc6738 RS |
871 | In a string, scan runs to the start of the string. |
872 | In a buffer, it runs to (point-min), and the value cannot be less than that. | |
873 | ||
8c1a1077 PJ |
874 | The property values are compared with `eq'. |
875 | If the property is constant all the way to the start of OBJECT, return the | |
876 | first valid position in OBJECT. | |
877 | If the optional fourth argument LIMIT is non-nil, don't search | |
878 | back past position LIMIT; return LIMIT if nothing is found before LIMIT. */) | |
879 | (position, prop, object, limit) | |
b7e047fb MB |
880 | Lisp_Object prop, position, object, limit; |
881 | { | |
882 | if (STRINGP (object)) | |
883 | { | |
884 | position = Fprevious_single_property_change (position, prop, object, limit); | |
885 | if (NILP (position)) | |
886 | { | |
887 | if (NILP (limit)) | |
d5db4077 | 888 | position = make_number (SCHARS (object)); |
b7e047fb | 889 | else |
d615870a DK |
890 | { |
891 | CHECK_NUMBER (limit); | |
892 | position = limit; | |
893 | } | |
b7e047fb MB |
894 | } |
895 | } | |
896 | else | |
897 | { | |
aed13378 | 898 | int count = SPECPDL_INDEX (); |
b7e047fb MB |
899 | |
900 | if (! NILP (object)) | |
b7826503 | 901 | CHECK_BUFFER (object); |
81f6e55f | 902 | |
b7e047fb MB |
903 | if (BUFFERP (object) && current_buffer != XBUFFER (object)) |
904 | { | |
905 | record_unwind_protect (Fset_buffer, Fcurrent_buffer ()); | |
906 | Fset_buffer (object); | |
907 | } | |
81f6e55f | 908 | |
d615870a DK |
909 | CHECK_NUMBER_COERCE_MARKER (position); |
910 | ||
b7e047fb | 911 | if (NILP (limit)) |
85cc6738 | 912 | XSETFASTINT (limit, BEGV); |
b7e047fb | 913 | else |
b7826503 | 914 | CHECK_NUMBER_COERCE_MARKER (limit); |
b7e047fb | 915 | |
ce6b02e0 | 916 | if (XFASTINT (position) <= XFASTINT (limit)) |
85cc6738 RS |
917 | { |
918 | position = limit; | |
919 | if (XFASTINT (position) < BEGV) | |
920 | XSETFASTINT (position, BEGV); | |
921 | } | |
ce6b02e0 | 922 | else |
b7e047fb | 923 | { |
85cc6738 RS |
924 | Lisp_Object initial_value |
925 | = Fget_char_property (make_number (XFASTINT (position) - 1), | |
926 | prop, object); | |
81f6e55f | 927 | |
85cc6738 | 928 | while (1) |
ce6b02e0 MB |
929 | { |
930 | position = Fprevious_char_property_change (position, limit); | |
0b0737d1 | 931 | |
ce6b02e0 MB |
932 | if (XFASTINT (position) <= XFASTINT (limit)) |
933 | { | |
934 | position = limit; | |
935 | break; | |
936 | } | |
937 | else | |
938 | { | |
85cc6738 RS |
939 | Lisp_Object value |
940 | = Fget_char_property (make_number (XFASTINT (position) - 1), | |
941 | prop, object); | |
ce6b02e0 MB |
942 | |
943 | if (!EQ (value, initial_value)) | |
944 | break; | |
945 | } | |
946 | } | |
b7e047fb MB |
947 | } |
948 | ||
949 | unbind_to (count, Qnil); | |
950 | } | |
951 | ||
952 | return position; | |
953 | } | |
fcab51aa | 954 | \f |
d418ef42 | 955 | DEFUN ("next-property-change", Fnext_property_change, |
111b637d | 956 | Snext_property_change, 1, 3, 0, |
8c1a1077 PJ |
957 | doc: /* Return the position of next property change. |
958 | Scans characters forward from POSITION in OBJECT till it finds | |
959 | a change in some text property, then returns the position of the change. | |
81f6e55f FP |
960 | If the optional second argument OBJECT is a buffer (or nil, which means |
961 | the current buffer), POSITION is a buffer position (integer or marker). | |
962 | If OBJECT is a string, POSITION is a 0-based index into it. | |
8c1a1077 PJ |
963 | Return nil if the property is constant all the way to the end of OBJECT. |
964 | If the value is non-nil, it is a position greater than POSITION, never equal. | |
965 | ||
966 | If the optional third argument LIMIT is non-nil, don't search | |
967 | past position LIMIT; return LIMIT if nothing is found before LIMIT. */) | |
968 | (position, object, limit) | |
1f5e848a | 969 | Lisp_Object position, object, limit; |
d418ef42 JA |
970 | { |
971 | register INTERVAL i, next; | |
972 | ||
5fbe2a44 | 973 | if (NILP (object)) |
c8a4fc3d | 974 | XSETBUFFER (object, current_buffer); |
5fbe2a44 | 975 | |
3a232704 | 976 | if (!NILP (limit) && !EQ (limit, Qt)) |
b7826503 | 977 | CHECK_NUMBER_COERCE_MARKER (limit); |
1387d54e | 978 | |
1f5e848a | 979 | i = validate_interval_range (object, &position, &position, soft); |
d418ef42 | 980 | |
041aa96f RS |
981 | /* If LIMIT is t, return start of next interval--don't |
982 | bother checking further intervals. */ | |
983 | if (EQ (limit, Qt)) | |
984 | { | |
44214c1b RS |
985 | if (NULL_INTERVAL_P (i)) |
986 | next = i; | |
987 | else | |
988 | next = next_interval (i); | |
81f6e55f | 989 | |
c7b6dfa6 | 990 | if (NULL_INTERVAL_P (next)) |
1f5e848a | 991 | XSETFASTINT (position, (STRINGP (object) |
d5db4077 | 992 | ? SCHARS (object) |
1f5e848a | 993 | : BUF_ZV (XBUFFER (object)))); |
c7b6dfa6 | 994 | else |
ad077db0 | 995 | XSETFASTINT (position, next->position); |
1f5e848a | 996 | return position; |
041aa96f RS |
997 | } |
998 | ||
44214c1b RS |
999 | if (NULL_INTERVAL_P (i)) |
1000 | return limit; | |
1001 | ||
1002 | next = next_interval (i); | |
1003 | ||
3a232704 | 1004 | while (!NULL_INTERVAL_P (next) && intervals_equal (i, next) |
ad077db0 | 1005 | && (NILP (limit) || next->position < XFASTINT (limit))) |
d418ef42 JA |
1006 | next = next_interval (next); |
1007 | ||
52c0f270 CY |
1008 | if (NULL_INTERVAL_P (next) |
1009 | || (next->position | |
1010 | >= (INTEGERP (limit) | |
1011 | ? XFASTINT (limit) | |
1012 | : (STRINGP (object) | |
1013 | ? SCHARS (object) | |
1014 | : BUF_ZV (XBUFFER (object)))))) | |
111b637d | 1015 | return limit; |
52c0f270 CY |
1016 | else |
1017 | return make_number (next->position); | |
19e1c426 RS |
1018 | } |
1019 | ||
1020 | /* Return 1 if there's a change in some property between BEG and END. */ | |
1021 | ||
1022 | int | |
1023 | property_change_between_p (beg, end) | |
1024 | int beg, end; | |
1025 | { | |
1026 | register INTERVAL i, next; | |
1027 | Lisp_Object object, pos; | |
1028 | ||
c8a4fc3d | 1029 | XSETBUFFER (object, current_buffer); |
e9c4fbcd | 1030 | XSETFASTINT (pos, beg); |
19e1c426 RS |
1031 | |
1032 | i = validate_interval_range (object, &pos, &pos, soft); | |
1033 | if (NULL_INTERVAL_P (i)) | |
1034 | return 0; | |
1035 | ||
1036 | next = next_interval (i); | |
1037 | while (! NULL_INTERVAL_P (next) && intervals_equal (i, next)) | |
1038 | { | |
1039 | next = next_interval (next); | |
e050ef74 RS |
1040 | if (NULL_INTERVAL_P (next)) |
1041 | return 0; | |
ad077db0 | 1042 | if (next->position >= end) |
19e1c426 RS |
1043 | return 0; |
1044 | } | |
1045 | ||
1046 | if (NULL_INTERVAL_P (next)) | |
1047 | return 0; | |
1048 | ||
1049 | return 1; | |
d418ef42 JA |
1050 | } |
1051 | ||
9c79dd1b | 1052 | DEFUN ("next-single-property-change", Fnext_single_property_change, |
111b637d | 1053 | Snext_single_property_change, 2, 4, 0, |
8c1a1077 PJ |
1054 | doc: /* Return the position of next property change for a specific property. |
1055 | Scans characters forward from POSITION till it finds | |
1056 | a change in the PROP property, then returns the position of the change. | |
81f6e55f FP |
1057 | If the optional third argument OBJECT is a buffer (or nil, which means |
1058 | the current buffer), POSITION is a buffer position (integer or marker). | |
1059 | If OBJECT is a string, POSITION is a 0-based index into it. | |
8c1a1077 PJ |
1060 | The property values are compared with `eq'. |
1061 | Return nil if the property is constant all the way to the end of OBJECT. | |
1062 | If the value is non-nil, it is a position greater than POSITION, never equal. | |
1063 | ||
1064 | If the optional fourth argument LIMIT is non-nil, don't search | |
1065 | past position LIMIT; return LIMIT if nothing is found before LIMIT. */) | |
1066 | (position, prop, object, limit) | |
1f5e848a | 1067 | Lisp_Object position, prop, object, limit; |
9c79dd1b JA |
1068 | { |
1069 | register INTERVAL i, next; | |
1070 | register Lisp_Object here_val; | |
1071 | ||
5fbe2a44 | 1072 | if (NILP (object)) |
c8a4fc3d | 1073 | XSETBUFFER (object, current_buffer); |
5fbe2a44 | 1074 | |
1387d54e | 1075 | if (!NILP (limit)) |
b7826503 | 1076 | CHECK_NUMBER_COERCE_MARKER (limit); |
1387d54e | 1077 | |
1f5e848a | 1078 | i = validate_interval_range (object, &position, &position, soft); |
9c79dd1b | 1079 | if (NULL_INTERVAL_P (i)) |
111b637d | 1080 | return limit; |
9c79dd1b | 1081 | |
6a0486dd | 1082 | here_val = textget (i->plist, prop); |
9c79dd1b | 1083 | next = next_interval (i); |
81f6e55f | 1084 | while (! NULL_INTERVAL_P (next) |
111b637d | 1085 | && EQ (here_val, textget (next->plist, prop)) |
ad077db0 | 1086 | && (NILP (limit) || next->position < XFASTINT (limit))) |
9c79dd1b JA |
1087 | next = next_interval (next); |
1088 | ||
52c0f270 CY |
1089 | if (NULL_INTERVAL_P (next) |
1090 | || (next->position | |
1091 | >= (INTEGERP (limit) | |
1092 | ? XFASTINT (limit) | |
1093 | : (STRINGP (object) | |
1094 | ? SCHARS (object) | |
1095 | : BUF_ZV (XBUFFER (object)))))) | |
111b637d | 1096 | return limit; |
52c0f270 CY |
1097 | else |
1098 | return make_number (next->position); | |
9c79dd1b JA |
1099 | } |
1100 | ||
d418ef42 | 1101 | DEFUN ("previous-property-change", Fprevious_property_change, |
111b637d | 1102 | Sprevious_property_change, 1, 3, 0, |
8c1a1077 PJ |
1103 | doc: /* Return the position of previous property change. |
1104 | Scans characters backwards from POSITION in OBJECT till it finds | |
1105 | a change in some text property, then returns the position of the change. | |
81f6e55f FP |
1106 | If the optional second argument OBJECT is a buffer (or nil, which means |
1107 | the current buffer), POSITION is a buffer position (integer or marker). | |
1108 | If OBJECT is a string, POSITION is a 0-based index into it. | |
8c1a1077 PJ |
1109 | Return nil if the property is constant all the way to the start of OBJECT. |
1110 | If the value is non-nil, it is a position less than POSITION, never equal. | |
1111 | ||
1112 | If the optional third argument LIMIT is non-nil, don't search | |
1113 | back past position LIMIT; return LIMIT if nothing is found until LIMIT. */) | |
1114 | (position, object, limit) | |
1f5e848a | 1115 | Lisp_Object position, object, limit; |
d418ef42 JA |
1116 | { |
1117 | register INTERVAL i, previous; | |
1118 | ||
5fbe2a44 | 1119 | if (NILP (object)) |
c8a4fc3d | 1120 | XSETBUFFER (object, current_buffer); |
5fbe2a44 | 1121 | |
1387d54e | 1122 | if (!NILP (limit)) |
b7826503 | 1123 | CHECK_NUMBER_COERCE_MARKER (limit); |
1387d54e | 1124 | |
1f5e848a | 1125 | i = validate_interval_range (object, &position, &position, soft); |
d418ef42 | 1126 | if (NULL_INTERVAL_P (i)) |
111b637d | 1127 | return limit; |
d418ef42 | 1128 | |
53b7feec | 1129 | /* Start with the interval containing the char before point. */ |
1f5e848a | 1130 | if (i->position == XFASTINT (position)) |
53b7feec RS |
1131 | i = previous_interval (i); |
1132 | ||
d418ef42 | 1133 | previous = previous_interval (i); |
3a232704 | 1134 | while (!NULL_INTERVAL_P (previous) && intervals_equal (previous, i) |
111b637d | 1135 | && (NILP (limit) |
ad077db0 | 1136 | || (previous->position + LENGTH (previous) > XFASTINT (limit)))) |
d418ef42 | 1137 | previous = previous_interval (previous); |
d418ef42 | 1138 | |
52c0f270 CY |
1139 | if (NULL_INTERVAL_P (previous) |
1140 | || (previous->position + LENGTH (previous) | |
1141 | <= (INTEGERP (limit) | |
1142 | ? XFASTINT (limit) | |
1143 | : (STRINGP (object) ? 0 : BUF_BEGV (XBUFFER (object)))))) | |
1144 | return limit; | |
1145 | else | |
1146 | return make_number (previous->position + LENGTH (previous)); | |
d418ef42 JA |
1147 | } |
1148 | ||
9c79dd1b | 1149 | DEFUN ("previous-single-property-change", Fprevious_single_property_change, |
111b637d | 1150 | Sprevious_single_property_change, 2, 4, 0, |
8c1a1077 PJ |
1151 | doc: /* Return the position of previous property change for a specific property. |
1152 | Scans characters backward from POSITION till it finds | |
1153 | a change in the PROP property, then returns the position of the change. | |
81f6e55f FP |
1154 | If the optional third argument OBJECT is a buffer (or nil, which means |
1155 | the current buffer), POSITION is a buffer position (integer or marker). | |
1156 | If OBJECT is a string, POSITION is a 0-based index into it. | |
8c1a1077 PJ |
1157 | The property values are compared with `eq'. |
1158 | Return nil if the property is constant all the way to the start of OBJECT. | |
1159 | If the value is non-nil, it is a position less than POSITION, never equal. | |
1160 | ||
1161 | If the optional fourth argument LIMIT is non-nil, don't search | |
1162 | back past position LIMIT; return LIMIT if nothing is found until LIMIT. */) | |
1f5e848a EN |
1163 | (position, prop, object, limit) |
1164 | Lisp_Object position, prop, object, limit; | |
9c79dd1b JA |
1165 | { |
1166 | register INTERVAL i, previous; | |
1167 | register Lisp_Object here_val; | |
1168 | ||
5fbe2a44 | 1169 | if (NILP (object)) |
c8a4fc3d | 1170 | XSETBUFFER (object, current_buffer); |
5fbe2a44 | 1171 | |
1387d54e | 1172 | if (!NILP (limit)) |
b7826503 | 1173 | CHECK_NUMBER_COERCE_MARKER (limit); |
1387d54e | 1174 | |
1f5e848a | 1175 | i = validate_interval_range (object, &position, &position, soft); |
9c79dd1b | 1176 | |
53b7feec | 1177 | /* Start with the interval containing the char before point. */ |
3a232704 | 1178 | if (!NULL_INTERVAL_P (i) && i->position == XFASTINT (position)) |
53b7feec RS |
1179 | i = previous_interval (i); |
1180 | ||
6873cfa3 KH |
1181 | if (NULL_INTERVAL_P (i)) |
1182 | return limit; | |
1183 | ||
6a0486dd | 1184 | here_val = textget (i->plist, prop); |
9c79dd1b | 1185 | previous = previous_interval (i); |
3a232704 | 1186 | while (!NULL_INTERVAL_P (previous) |
111b637d RS |
1187 | && EQ (here_val, textget (previous->plist, prop)) |
1188 | && (NILP (limit) | |
ad077db0 | 1189 | || (previous->position + LENGTH (previous) > XFASTINT (limit)))) |
9c79dd1b | 1190 | previous = previous_interval (previous); |
9c79dd1b | 1191 | |
52c0f270 CY |
1192 | if (NULL_INTERVAL_P (previous) |
1193 | || (previous->position + LENGTH (previous) | |
1194 | <= (INTEGERP (limit) | |
1195 | ? XFASTINT (limit) | |
1196 | : (STRINGP (object) ? 0 : BUF_BEGV (XBUFFER (object)))))) | |
1197 | return limit; | |
1198 | else | |
1199 | return make_number (previous->position + LENGTH (previous)); | |
9c79dd1b | 1200 | } |
fcab51aa | 1201 | \f |
c98da214 RS |
1202 | /* Callers note, this can GC when OBJECT is a buffer (or nil). */ |
1203 | ||
d418ef42 | 1204 | DEFUN ("add-text-properties", Fadd_text_properties, |
5fbe2a44 | 1205 | Sadd_text_properties, 3, 4, 0, |
8c1a1077 PJ |
1206 | doc: /* Add properties to the text from START to END. |
1207 | The third argument PROPERTIES is a property list | |
81f6e55f FP |
1208 | specifying the property values to add. If the optional fourth argument |
1209 | OBJECT is a buffer (or nil, which means the current buffer), | |
1210 | START and END are buffer positions (integers or markers). | |
1211 | If OBJECT is a string, START and END are 0-based indices into it. | |
8c1a1077 PJ |
1212 | Return t if any property value actually changed, nil otherwise. */) |
1213 | (start, end, properties, object) | |
5fbe2a44 | 1214 | Lisp_Object start, end, properties, object; |
d418ef42 JA |
1215 | { |
1216 | register INTERVAL i, unchanged; | |
caa31568 | 1217 | register int s, len, modified = 0; |
c98da214 | 1218 | struct gcpro gcpro1; |
d418ef42 JA |
1219 | |
1220 | properties = validate_plist (properties); | |
1221 | if (NILP (properties)) | |
1222 | return Qnil; | |
1223 | ||
5fbe2a44 | 1224 | if (NILP (object)) |
c8a4fc3d | 1225 | XSETBUFFER (object, current_buffer); |
5fbe2a44 | 1226 | |
d418ef42 JA |
1227 | i = validate_interval_range (object, &start, &end, hard); |
1228 | if (NULL_INTERVAL_P (i)) | |
1229 | return Qnil; | |
1230 | ||
1231 | s = XINT (start); | |
1232 | len = XINT (end) - s; | |
1233 | ||
c98da214 RS |
1234 | /* No need to protect OBJECT, because we GC only if it's a buffer, |
1235 | and live buffers are always protected. */ | |
1236 | GCPRO1 (properties); | |
1237 | ||
d418ef42 | 1238 | /* If we're not starting on an interval boundary, we have to |
cdf3e5a2 | 1239 | split this interval. */ |
d418ef42 JA |
1240 | if (i->position != s) |
1241 | { | |
1242 | /* If this interval already has the properties, we can | |
cdf3e5a2 | 1243 | skip it. */ |
d418ef42 JA |
1244 | if (interval_has_all_properties (properties, i)) |
1245 | { | |
1246 | int got = (LENGTH (i) - (s - i->position)); | |
1247 | if (got >= len) | |
64db1307 | 1248 | RETURN_UNGCPRO (Qnil); |
d418ef42 | 1249 | len -= got; |
05d5b93e | 1250 | i = next_interval (i); |
d418ef42 JA |
1251 | } |
1252 | else | |
1253 | { | |
1254 | unchanged = i; | |
ad9c1940 | 1255 | i = split_interval_right (unchanged, s - unchanged->position); |
d418ef42 | 1256 | copy_properties (unchanged, i); |
d418ef42 JA |
1257 | } |
1258 | } | |
1259 | ||
2a631db1 | 1260 | if (BUFFERP (object)) |
3e145152 | 1261 | modify_region (XBUFFER (object), XINT (start), XINT (end), 1); |
26c76ace | 1262 | |
daa5e28f | 1263 | /* We are at the beginning of interval I, with LEN chars to scan. */ |
caa31568 | 1264 | for (;;) |
d418ef42 | 1265 | { |
d4b530ad RS |
1266 | if (i == 0) |
1267 | abort (); | |
1268 | ||
d418ef42 JA |
1269 | if (LENGTH (i) >= len) |
1270 | { | |
c98da214 RS |
1271 | /* We can UNGCPRO safely here, because there will be just |
1272 | one more chance to gc, in the next call to add_properties, | |
1273 | and after that we will not need PROPERTIES or OBJECT again. */ | |
1274 | UNGCPRO; | |
1275 | ||
d418ef42 | 1276 | if (interval_has_all_properties (properties, i)) |
26c76ace | 1277 | { |
2a631db1 RS |
1278 | if (BUFFERP (object)) |
1279 | signal_after_change (XINT (start), XINT (end) - XINT (start), | |
1280 | XINT (end) - XINT (start)); | |
26c76ace RS |
1281 | |
1282 | return modified ? Qt : Qnil; | |
1283 | } | |
d418ef42 JA |
1284 | |
1285 | if (LENGTH (i) == len) | |
1286 | { | |
d4b530ad | 1287 | add_properties (properties, i, object); |
2a631db1 RS |
1288 | if (BUFFERP (object)) |
1289 | signal_after_change (XINT (start), XINT (end) - XINT (start), | |
1290 | XINT (end) - XINT (start)); | |
d418ef42 JA |
1291 | return Qt; |
1292 | } | |
1293 | ||
1294 | /* i doesn't have the properties, and goes past the change limit */ | |
1295 | unchanged = i; | |
ad9c1940 | 1296 | i = split_interval_left (unchanged, len); |
d418ef42 | 1297 | copy_properties (unchanged, i); |
d4b530ad | 1298 | add_properties (properties, i, object); |
2a631db1 RS |
1299 | if (BUFFERP (object)) |
1300 | signal_after_change (XINT (start), XINT (end) - XINT (start), | |
1301 | XINT (end) - XINT (start)); | |
d418ef42 JA |
1302 | return Qt; |
1303 | } | |
1304 | ||
1305 | len -= LENGTH (i); | |
d4b530ad | 1306 | modified += add_properties (properties, i, object); |
d418ef42 JA |
1307 | i = next_interval (i); |
1308 | } | |
1309 | } | |
1310 | ||
c98da214 RS |
1311 | /* Callers note, this can GC when OBJECT is a buffer (or nil). */ |
1312 | ||
d4b530ad RS |
1313 | DEFUN ("put-text-property", Fput_text_property, |
1314 | Sput_text_property, 4, 5, 0, | |
8c1a1077 PJ |
1315 | doc: /* Set one property of the text from START to END. |
1316 | The third and fourth arguments PROPERTY and VALUE | |
1317 | specify the property to add. | |
81f6e55f FP |
1318 | If the optional fifth argument OBJECT is a buffer (or nil, which means |
1319 | the current buffer), START and END are buffer positions (integers or | |
1320 | markers). If OBJECT is a string, START and END are 0-based indices into it. */) | |
8c1a1077 | 1321 | (start, end, property, value, object) |
1f5e848a | 1322 | Lisp_Object start, end, property, value, object; |
d4b530ad RS |
1323 | { |
1324 | Fadd_text_properties (start, end, | |
1f5e848a | 1325 | Fcons (property, Fcons (value, Qnil)), |
d4b530ad RS |
1326 | object); |
1327 | return Qnil; | |
1328 | } | |
1329 | ||
d418ef42 | 1330 | DEFUN ("set-text-properties", Fset_text_properties, |
5fbe2a44 | 1331 | Sset_text_properties, 3, 4, 0, |
8c1a1077 PJ |
1332 | doc: /* Completely replace properties of text from START to END. |
1333 | The third argument PROPERTIES is the new property list. | |
81f6e55f FP |
1334 | If the optional fourth argument OBJECT is a buffer (or nil, which means |
1335 | the current buffer), START and END are buffer positions (integers or | |
1336 | markers). If OBJECT is a string, START and END are 0-based indices into it. | |
8c1a1077 PJ |
1337 | If PROPERTIES is nil, the effect is to remove all properties from |
1338 | the designated part of OBJECT. */) | |
1339 | (start, end, properties, object) | |
1f5e848a | 1340 | Lisp_Object start, end, properties, object; |
0087ade6 GM |
1341 | { |
1342 | return set_text_properties (start, end, properties, object, Qt); | |
1343 | } | |
1344 | ||
1345 | ||
1346 | /* Replace properties of text from START to END with new list of | |
1347 | properties PROPERTIES. OBJECT is the buffer or string containing | |
1348 | the text. OBJECT nil means use the current buffer. | |
1349 | SIGNAL_AFTER_CHANGE_P nil means don't signal after changes. Value | |
537562fa LT |
1350 | is nil if the function _detected_ that it did not replace any |
1351 | properties, non-nil otherwise. */ | |
0087ade6 GM |
1352 | |
1353 | Lisp_Object | |
1354 | set_text_properties (start, end, properties, object, signal_after_change_p) | |
1355 | Lisp_Object start, end, properties, object, signal_after_change_p; | |
d418ef42 | 1356 | { |
28ff4293 | 1357 | register INTERVAL i; |
33d7d0df RS |
1358 | Lisp_Object ostart, oend; |
1359 | ||
1360 | ostart = start; | |
1361 | oend = end; | |
d418ef42 | 1362 | |
1f5e848a | 1363 | properties = validate_plist (properties); |
d418ef42 | 1364 | |
5fbe2a44 | 1365 | if (NILP (object)) |
c8a4fc3d | 1366 | XSETBUFFER (object, current_buffer); |
5fbe2a44 | 1367 | |
919fa9cb RS |
1368 | /* If we want no properties for a whole string, |
1369 | get rid of its intervals. */ | |
1f5e848a | 1370 | if (NILP (properties) && STRINGP (object) |
919fa9cb | 1371 | && XFASTINT (start) == 0 |
d5db4077 | 1372 | && XFASTINT (end) == SCHARS (object)) |
919fa9cb | 1373 | { |
d5db4077 | 1374 | if (! STRING_INTERVALS (object)) |
537562fa | 1375 | return Qnil; |
26c76ace | 1376 | |
9056febe | 1377 | STRING_SET_INTERVALS (object, NULL_INTERVAL); |
919fa9cb RS |
1378 | return Qt; |
1379 | } | |
1380 | ||
facc570e | 1381 | i = validate_interval_range (object, &start, &end, soft); |
919fa9cb | 1382 | |
d418ef42 | 1383 | if (NULL_INTERVAL_P (i)) |
facc570e | 1384 | { |
1f5e848a EN |
1385 | /* If buffer has no properties, and we want none, return now. */ |
1386 | if (NILP (properties)) | |
facc570e RS |
1387 | return Qnil; |
1388 | ||
33d7d0df RS |
1389 | /* Restore the original START and END values |
1390 | because validate_interval_range increments them for strings. */ | |
1391 | start = ostart; | |
1392 | end = oend; | |
1393 | ||
facc570e RS |
1394 | i = validate_interval_range (object, &start, &end, hard); |
1395 | /* This can return if start == end. */ | |
1396 | if (NULL_INTERVAL_P (i)) | |
1397 | return Qnil; | |
1398 | } | |
d418ef42 | 1399 | |
2a631db1 | 1400 | if (BUFFERP (object)) |
3e145152 | 1401 | modify_region (XBUFFER (object), XINT (start), XINT (end), 1); |
26c76ace | 1402 | |
78ff4175 RS |
1403 | set_text_properties_1 (start, end, properties, object, i); |
1404 | ||
1405 | if (BUFFERP (object) && !NILP (signal_after_change_p)) | |
1406 | signal_after_change (XINT (start), XINT (end) - XINT (start), | |
1407 | XINT (end) - XINT (start)); | |
1408 | return Qt; | |
1409 | } | |
1410 | ||
1411 | /* Replace properties of text from START to END with new list of | |
1412 | properties PROPERTIES. BUFFER is the buffer containing | |
1413 | the text. This does not obey any hooks. | |
1414 | You can provide the interval that START is located in as I, | |
ce768453 | 1415 | or pass NULL for I and this function will find it. |
49f68fd2 | 1416 | START and END can be in any order. */ |
78ff4175 RS |
1417 | |
1418 | void | |
1419 | set_text_properties_1 (start, end, properties, buffer, i) | |
1420 | Lisp_Object start, end, properties, buffer; | |
1421 | INTERVAL i; | |
1422 | { | |
1423 | register INTERVAL prev_changed = NULL_INTERVAL; | |
1424 | register int s, len; | |
1425 | INTERVAL unchanged; | |
1426 | ||
1427 | s = XINT (start); | |
1428 | len = XINT (end) - s; | |
49f68fd2 RS |
1429 | if (len == 0) |
1430 | return; | |
1431 | if (len < 0) | |
1432 | { | |
1433 | s = s + len; | |
1434 | len = - len; | |
1435 | } | |
1436 | ||
78ff4175 RS |
1437 | if (i == 0) |
1438 | i = find_interval (BUF_INTERVALS (XBUFFER (buffer)), s); | |
1439 | ||
d418ef42 JA |
1440 | if (i->position != s) |
1441 | { | |
1442 | unchanged = i; | |
ad9c1940 | 1443 | i = split_interval_right (unchanged, s - unchanged->position); |
7855e674 | 1444 | |
d418ef42 JA |
1445 | if (LENGTH (i) > len) |
1446 | { | |
9c79dd1b | 1447 | copy_properties (unchanged, i); |
ad9c1940 | 1448 | i = split_interval_left (i, len); |
78ff4175 RS |
1449 | set_properties (properties, i, buffer); |
1450 | return; | |
d418ef42 JA |
1451 | } |
1452 | ||
78ff4175 | 1453 | set_properties (properties, i, buffer); |
daa5e28f | 1454 | |
9c79dd1b | 1455 | if (LENGTH (i) == len) |
78ff4175 | 1456 | return; |
9c79dd1b JA |
1457 | |
1458 | prev_changed = i; | |
d418ef42 JA |
1459 | len -= LENGTH (i); |
1460 | i = next_interval (i); | |
1461 | } | |
1462 | ||
cd7d971d | 1463 | /* We are starting at the beginning of an interval, I */ |
7855e674 | 1464 | while (len > 0) |
d418ef42 | 1465 | { |
d4b530ad RS |
1466 | if (i == 0) |
1467 | abort (); | |
1468 | ||
d418ef42 JA |
1469 | if (LENGTH (i) >= len) |
1470 | { | |
cd7d971d | 1471 | if (LENGTH (i) > len) |
ad9c1940 | 1472 | i = split_interval_left (i, len); |
d418ef42 | 1473 | |
6f232881 RS |
1474 | /* We have to call set_properties even if we are going to |
1475 | merge the intervals, so as to make the undo records | |
1476 | and cause redisplay to happen. */ | |
78ff4175 | 1477 | set_properties (properties, i, buffer); |
6f232881 | 1478 | if (!NULL_INTERVAL_P (prev_changed)) |
9c79dd1b | 1479 | merge_interval_left (i); |
78ff4175 | 1480 | return; |
d418ef42 JA |
1481 | } |
1482 | ||
1483 | len -= LENGTH (i); | |
6f232881 RS |
1484 | |
1485 | /* We have to call set_properties even if we are going to | |
1486 | merge the intervals, so as to make the undo records | |
1487 | and cause redisplay to happen. */ | |
78ff4175 | 1488 | set_properties (properties, i, buffer); |
9c79dd1b | 1489 | if (NULL_INTERVAL_P (prev_changed)) |
6f232881 | 1490 | prev_changed = i; |
9c79dd1b JA |
1491 | else |
1492 | prev_changed = i = merge_interval_left (i); | |
1493 | ||
d418ef42 JA |
1494 | i = next_interval (i); |
1495 | } | |
d418ef42 JA |
1496 | } |
1497 | ||
1498 | DEFUN ("remove-text-properties", Fremove_text_properties, | |
5fbe2a44 | 1499 | Sremove_text_properties, 3, 4, 0, |
8c1a1077 PJ |
1500 | doc: /* Remove some properties from text from START to END. |
1501 | The third argument PROPERTIES is a property list | |
1502 | whose property names specify the properties to remove. | |
1503 | \(The values stored in PROPERTIES are ignored.) | |
81f6e55f FP |
1504 | If the optional fourth argument OBJECT is a buffer (or nil, which means |
1505 | the current buffer), START and END are buffer positions (integers or | |
1506 | markers). If OBJECT is a string, START and END are 0-based indices into it. | |
1507 | Return t if any property was actually removed, nil otherwise. | |
1508 | ||
1509 | Use set-text-properties if you want to remove all text properties. */) | |
8c1a1077 | 1510 | (start, end, properties, object) |
1f5e848a | 1511 | Lisp_Object start, end, properties, object; |
d418ef42 JA |
1512 | { |
1513 | register INTERVAL i, unchanged; | |
caa31568 | 1514 | register int s, len, modified = 0; |
d418ef42 | 1515 | |
5fbe2a44 | 1516 | if (NILP (object)) |
c8a4fc3d | 1517 | XSETBUFFER (object, current_buffer); |
5fbe2a44 | 1518 | |
d418ef42 JA |
1519 | i = validate_interval_range (object, &start, &end, soft); |
1520 | if (NULL_INTERVAL_P (i)) | |
1521 | return Qnil; | |
1522 | ||
1523 | s = XINT (start); | |
1524 | len = XINT (end) - s; | |
9c79dd1b | 1525 | |
d418ef42 JA |
1526 | if (i->position != s) |
1527 | { | |
1528 | /* No properties on this first interval -- return if | |
cdf3e5a2 | 1529 | it covers the entire region. */ |
1f5e848a | 1530 | if (! interval_has_some_properties (properties, i)) |
d418ef42 JA |
1531 | { |
1532 | int got = (LENGTH (i) - (s - i->position)); | |
1533 | if (got >= len) | |
1534 | return Qnil; | |
1535 | len -= got; | |
05d5b93e | 1536 | i = next_interval (i); |
d418ef42 | 1537 | } |
daa5e28f RS |
1538 | /* Split away the beginning of this interval; what we don't |
1539 | want to modify. */ | |
d418ef42 JA |
1540 | else |
1541 | { | |
1542 | unchanged = i; | |
ad9c1940 | 1543 | i = split_interval_right (unchanged, s - unchanged->position); |
d418ef42 | 1544 | copy_properties (unchanged, i); |
d418ef42 JA |
1545 | } |
1546 | } | |
1547 | ||
2a631db1 | 1548 | if (BUFFERP (object)) |
3e145152 | 1549 | modify_region (XBUFFER (object), XINT (start), XINT (end), 1); |
26c76ace | 1550 | |
d418ef42 | 1551 | /* We are at the beginning of an interval, with len to scan */ |
caa31568 | 1552 | for (;;) |
d418ef42 | 1553 | { |
d4b530ad RS |
1554 | if (i == 0) |
1555 | abort (); | |
1556 | ||
d418ef42 JA |
1557 | if (LENGTH (i) >= len) |
1558 | { | |
1f5e848a | 1559 | if (! interval_has_some_properties (properties, i)) |
d418ef42 JA |
1560 | return modified ? Qt : Qnil; |
1561 | ||
1562 | if (LENGTH (i) == len) | |
1563 | { | |
11713b6d RS |
1564 | remove_properties (properties, Qnil, i, object); |
1565 | if (BUFFERP (object)) | |
1566 | signal_after_change (XINT (start), XINT (end) - XINT (start), | |
1567 | XINT (end) - XINT (start)); | |
1568 | return Qt; | |
1569 | } | |
1570 | ||
1571 | /* i has the properties, and goes past the change limit */ | |
1572 | unchanged = i; | |
1573 | i = split_interval_left (i, len); | |
1574 | copy_properties (unchanged, i); | |
1575 | remove_properties (properties, Qnil, i, object); | |
1576 | if (BUFFERP (object)) | |
1577 | signal_after_change (XINT (start), XINT (end) - XINT (start), | |
1578 | XINT (end) - XINT (start)); | |
1579 | return Qt; | |
1580 | } | |
1581 | ||
1582 | len -= LENGTH (i); | |
1583 | modified += remove_properties (properties, Qnil, i, object); | |
1584 | i = next_interval (i); | |
1585 | } | |
1586 | } | |
1587 | ||
1588 | DEFUN ("remove-list-of-text-properties", Fremove_list_of_text_properties, | |
1589 | Sremove_list_of_text_properties, 3, 4, 0, | |
1590 | doc: /* Remove some properties from text from START to END. | |
1591 | The third argument LIST-OF-PROPERTIES is a list of property names to remove. | |
81f6e55f FP |
1592 | If the optional fourth argument OBJECT is a buffer (or nil, which means |
1593 | the current buffer), START and END are buffer positions (integers or | |
1594 | markers). If OBJECT is a string, START and END are 0-based indices into it. | |
11713b6d RS |
1595 | Return t if any property was actually removed, nil otherwise. */) |
1596 | (start, end, list_of_properties, object) | |
1597 | Lisp_Object start, end, list_of_properties, object; | |
1598 | { | |
1599 | register INTERVAL i, unchanged; | |
1600 | register int s, len, modified = 0; | |
1601 | Lisp_Object properties; | |
1602 | properties = list_of_properties; | |
1603 | ||
1604 | if (NILP (object)) | |
1605 | XSETBUFFER (object, current_buffer); | |
1606 | ||
1607 | i = validate_interval_range (object, &start, &end, soft); | |
1608 | if (NULL_INTERVAL_P (i)) | |
1609 | return Qnil; | |
1610 | ||
1611 | s = XINT (start); | |
1612 | len = XINT (end) - s; | |
1613 | ||
1614 | if (i->position != s) | |
1615 | { | |
1616 | /* No properties on this first interval -- return if | |
1617 | it covers the entire region. */ | |
1618 | if (! interval_has_some_properties_list (properties, i)) | |
1619 | { | |
1620 | int got = (LENGTH (i) - (s - i->position)); | |
1621 | if (got >= len) | |
1622 | return Qnil; | |
1623 | len -= got; | |
1624 | i = next_interval (i); | |
1625 | } | |
1626 | /* Split away the beginning of this interval; what we don't | |
1627 | want to modify. */ | |
1628 | else | |
1629 | { | |
1630 | unchanged = i; | |
1631 | i = split_interval_right (unchanged, s - unchanged->position); | |
1632 | copy_properties (unchanged, i); | |
1633 | } | |
1634 | } | |
1635 | ||
9b17c9f5 LH |
1636 | /* We are at the beginning of an interval, with len to scan. |
1637 | The flag `modified' records if changes have been made. | |
1638 | When object is a buffer, we must call modify_region before changes are | |
1639 | made and signal_after_change when we are done. | |
e0f24100 GM |
1640 | We call modify_region before calling remove_properties if modified == 0, |
1641 | and we call signal_after_change before returning if modified != 0. */ | |
11713b6d RS |
1642 | for (;;) |
1643 | { | |
1644 | if (i == 0) | |
1645 | abort (); | |
1646 | ||
1647 | if (LENGTH (i) >= len) | |
1648 | { | |
1649 | if (! interval_has_some_properties_list (properties, i)) | |
9b17c9f5 LH |
1650 | if (modified) |
1651 | { | |
1652 | if (BUFFERP (object)) | |
1653 | signal_after_change (XINT (start), XINT (end) - XINT (start), | |
1654 | XINT (end) - XINT (start)); | |
1655 | return Qt; | |
1656 | } | |
1657 | else | |
1658 | return Qnil; | |
11713b6d RS |
1659 | |
1660 | if (LENGTH (i) == len) | |
1661 | { | |
9b17c9f5 | 1662 | if (!modified && BUFFERP (object)) |
3e145152 | 1663 | modify_region (XBUFFER (object), XINT (start), XINT (end), 1); |
11713b6d | 1664 | remove_properties (Qnil, properties, i, object); |
2a631db1 RS |
1665 | if (BUFFERP (object)) |
1666 | signal_after_change (XINT (start), XINT (end) - XINT (start), | |
1667 | XINT (end) - XINT (start)); | |
d418ef42 JA |
1668 | return Qt; |
1669 | } | |
1670 | ||
1671 | /* i has the properties, and goes past the change limit */ | |
daa5e28f | 1672 | unchanged = i; |
ad9c1940 | 1673 | i = split_interval_left (i, len); |
d418ef42 | 1674 | copy_properties (unchanged, i); |
9b17c9f5 | 1675 | if (!modified && BUFFERP (object)) |
3e145152 | 1676 | modify_region (XBUFFER (object), XINT (start), XINT (end), 1); |
11713b6d | 1677 | remove_properties (Qnil, properties, i, object); |
2a631db1 RS |
1678 | if (BUFFERP (object)) |
1679 | signal_after_change (XINT (start), XINT (end) - XINT (start), | |
1680 | XINT (end) - XINT (start)); | |
d418ef42 JA |
1681 | return Qt; |
1682 | } | |
1683 | ||
9b17c9f5 LH |
1684 | if (interval_has_some_properties_list (properties, i)) |
1685 | { | |
1686 | if (!modified && BUFFERP (object)) | |
3e145152 | 1687 | modify_region (XBUFFER (object), XINT (start), XINT (end), 1); |
9b17c9f5 LH |
1688 | remove_properties (Qnil, properties, i, object); |
1689 | modified = 1; | |
1690 | } | |
d418ef42 | 1691 | len -= LENGTH (i); |
d418ef42 JA |
1692 | i = next_interval (i); |
1693 | } | |
1694 | } | |
fcab51aa | 1695 | \f |
ad9c1940 JB |
1696 | DEFUN ("text-property-any", Ftext_property_any, |
1697 | Stext_property_any, 4, 5, 0, | |
8c1a1077 PJ |
1698 | doc: /* Check text from START to END for property PROPERTY equalling VALUE. |
1699 | If so, return the position of the first character whose property PROPERTY | |
1700 | is `eq' to VALUE. Otherwise return nil. | |
81f6e55f FP |
1701 | If the optional fifth argument OBJECT is a buffer (or nil, which means |
1702 | the current buffer), START and END are buffer positions (integers or | |
1703 | markers). If OBJECT is a string, START and END are 0-based indices into it. */) | |
8c1a1077 PJ |
1704 | (start, end, property, value, object) |
1705 | Lisp_Object start, end, property, value, object; | |
ad9c1940 JB |
1706 | { |
1707 | register INTERVAL i; | |
1708 | register int e, pos; | |
1709 | ||
1710 | if (NILP (object)) | |
c8a4fc3d | 1711 | XSETBUFFER (object, current_buffer); |
ad9c1940 | 1712 | i = validate_interval_range (object, &start, &end, soft); |
2084fddb KH |
1713 | if (NULL_INTERVAL_P (i)) |
1714 | return (!NILP (value) || EQ (start, end) ? Qnil : start); | |
ad9c1940 JB |
1715 | e = XINT (end); |
1716 | ||
1717 | while (! NULL_INTERVAL_P (i)) | |
1718 | { | |
1719 | if (i->position >= e) | |
1720 | break; | |
1f5e848a | 1721 | if (EQ (textget (i->plist, property), value)) |
ad9c1940 JB |
1722 | { |
1723 | pos = i->position; | |
1724 | if (pos < XINT (start)) | |
1725 | pos = XINT (start); | |
ad077db0 | 1726 | return make_number (pos); |
ad9c1940 JB |
1727 | } |
1728 | i = next_interval (i); | |
1729 | } | |
1730 | return Qnil; | |
1731 | } | |
1732 | ||
1733 | DEFUN ("text-property-not-all", Ftext_property_not_all, | |
1734 | Stext_property_not_all, 4, 5, 0, | |
8c1a1077 PJ |
1735 | doc: /* Check text from START to END for property PROPERTY not equalling VALUE. |
1736 | If so, return the position of the first character whose property PROPERTY | |
1737 | is not `eq' to VALUE. Otherwise, return nil. | |
81f6e55f FP |
1738 | If the optional fifth argument OBJECT is a buffer (or nil, which means |
1739 | the current buffer), START and END are buffer positions (integers or | |
1740 | markers). If OBJECT is a string, START and END are 0-based indices into it. */) | |
8c1a1077 PJ |
1741 | (start, end, property, value, object) |
1742 | Lisp_Object start, end, property, value, object; | |
ad9c1940 JB |
1743 | { |
1744 | register INTERVAL i; | |
1745 | register int s, e; | |
1746 | ||
1747 | if (NILP (object)) | |
c8a4fc3d | 1748 | XSETBUFFER (object, current_buffer); |
ad9c1940 JB |
1749 | i = validate_interval_range (object, &start, &end, soft); |
1750 | if (NULL_INTERVAL_P (i)) | |
916a3119 | 1751 | return (NILP (value) || EQ (start, end)) ? Qnil : start; |
ad9c1940 JB |
1752 | s = XINT (start); |
1753 | e = XINT (end); | |
1754 | ||
1755 | while (! NULL_INTERVAL_P (i)) | |
1756 | { | |
1757 | if (i->position >= e) | |
1758 | break; | |
1f5e848a | 1759 | if (! EQ (textget (i->plist, property), value)) |
ad9c1940 JB |
1760 | { |
1761 | if (i->position > s) | |
1762 | s = i->position; | |
ad077db0 | 1763 | return make_number (s); |
ad9c1940 JB |
1764 | } |
1765 | i = next_interval (i); | |
1766 | } | |
1767 | return Qnil; | |
1768 | } | |
e138dfdc MB |
1769 | |
1770 | \f | |
1771 | /* Return the direction from which the text-property PROP would be | |
1772 | inherited by any new text inserted at POS: 1 if it would be | |
1773 | inherited from the char after POS, -1 if it would be inherited from | |
6f716644 SM |
1774 | the char before POS, and 0 if from neither. |
1775 | BUFFER can be either a buffer or nil (meaning current buffer). */ | |
e138dfdc MB |
1776 | |
1777 | int | |
6f716644 SM |
1778 | text_property_stickiness (prop, pos, buffer) |
1779 | Lisp_Object prop, pos, buffer; | |
e138dfdc MB |
1780 | { |
1781 | Lisp_Object prev_pos, front_sticky; | |
1782 | int is_rear_sticky = 1, is_front_sticky = 0; /* defaults */ | |
1783 | ||
6f716644 SM |
1784 | if (NILP (buffer)) |
1785 | XSETBUFFER (buffer, current_buffer); | |
1786 | ||
1787 | if (XINT (pos) > BUF_BEGV (XBUFFER (buffer))) | |
e138dfdc MB |
1788 | /* Consider previous character. */ |
1789 | { | |
1790 | Lisp_Object rear_non_sticky; | |
1791 | ||
1792 | prev_pos = make_number (XINT (pos) - 1); | |
6f716644 | 1793 | rear_non_sticky = Fget_text_property (prev_pos, Qrear_nonsticky, buffer); |
e138dfdc MB |
1794 | |
1795 | if (!NILP (CONSP (rear_non_sticky) | |
1796 | ? Fmemq (prop, rear_non_sticky) | |
1797 | : rear_non_sticky)) | |
1798 | /* PROP is rear-non-sticky. */ | |
1799 | is_rear_sticky = 0; | |
1800 | } | |
506d2f9a CY |
1801 | else |
1802 | return 0; | |
e138dfdc MB |
1803 | |
1804 | /* Consider following character. */ | |
506d2f9a CY |
1805 | /* This signals an arg-out-of-range error if pos is outside the |
1806 | buffer's accessible range. */ | |
6f716644 | 1807 | front_sticky = Fget_text_property (pos, Qfront_sticky, buffer); |
e138dfdc MB |
1808 | |
1809 | if (EQ (front_sticky, Qt) | |
1810 | || (CONSP (front_sticky) | |
1811 | && !NILP (Fmemq (prop, front_sticky)))) | |
1812 | /* PROP is inherited from after. */ | |
1813 | is_front_sticky = 1; | |
1814 | ||
1815 | /* Simple cases, where the properties are consistent. */ | |
1816 | if (is_rear_sticky && !is_front_sticky) | |
1817 | return -1; | |
1818 | else if (!is_rear_sticky && is_front_sticky) | |
1819 | return 1; | |
1820 | else if (!is_rear_sticky && !is_front_sticky) | |
1821 | return 0; | |
1822 | ||
1823 | /* The stickiness properties are inconsistent, so we have to | |
1824 | disambiguate. Basically, rear-sticky wins, _except_ if the | |
1825 | property that would be inherited has a value of nil, in which case | |
1826 | front-sticky wins. */ | |
6f716644 SM |
1827 | if (XINT (pos) == BUF_BEGV (XBUFFER (buffer)) |
1828 | || NILP (Fget_text_property (prev_pos, prop, buffer))) | |
e138dfdc MB |
1829 | return 1; |
1830 | else | |
1831 | return -1; | |
1832 | } | |
1833 | ||
fcab51aa | 1834 | \f |
15e4954b JB |
1835 | /* I don't think this is the right interface to export; how often do you |
1836 | want to do something like this, other than when you're copying objects | |
1837 | around? | |
1838 | ||
1839 | I think it would be better to have a pair of functions, one which | |
1840 | returns the text properties of a region as a list of ranges and | |
1841 | plists, and another which applies such a list to another object. */ | |
1842 | ||
c98da214 RS |
1843 | /* Add properties from SRC to SRC of SRC, starting at POS in DEST. |
1844 | SRC and DEST may each refer to strings or buffers. | |
1845 | Optional sixth argument PROP causes only that property to be copied. | |
1846 | Properties are copied to DEST as if by `add-text-properties'. | |
1847 | Return t if any property value actually changed, nil otherwise. */ | |
1848 | ||
1849 | /* Note this can GC when DEST is a buffer. */ | |
ad077db0 | 1850 | |
15e4954b JB |
1851 | Lisp_Object |
1852 | copy_text_properties (start, end, src, pos, dest, prop) | |
1853 | Lisp_Object start, end, src, pos, dest, prop; | |
1854 | { | |
1855 | INTERVAL i; | |
1856 | Lisp_Object res; | |
1857 | Lisp_Object stuff; | |
1858 | Lisp_Object plist; | |
1859 | int s, e, e2, p, len, modified = 0; | |
c98da214 | 1860 | struct gcpro gcpro1, gcpro2; |
15e4954b JB |
1861 | |
1862 | i = validate_interval_range (src, &start, &end, soft); | |
1863 | if (NULL_INTERVAL_P (i)) | |
1864 | return Qnil; | |
1865 | ||
b7826503 | 1866 | CHECK_NUMBER_COERCE_MARKER (pos); |
15e4954b JB |
1867 | { |
1868 | Lisp_Object dest_start, dest_end; | |
1869 | ||
1870 | dest_start = pos; | |
e9c4fbcd | 1871 | XSETFASTINT (dest_end, XINT (dest_start) + (XINT (end) - XINT (start))); |
15e4954b JB |
1872 | /* Apply this to a copy of pos; it will try to increment its arguments, |
1873 | which we don't want. */ | |
1874 | validate_interval_range (dest, &dest_start, &dest_end, soft); | |
1875 | } | |
1876 | ||
1877 | s = XINT (start); | |
1878 | e = XINT (end); | |
1879 | p = XINT (pos); | |
1880 | ||
1881 | stuff = Qnil; | |
1882 | ||
1883 | while (s < e) | |
1884 | { | |
1885 | e2 = i->position + LENGTH (i); | |
1886 | if (e2 > e) | |
1887 | e2 = e; | |
1888 | len = e2 - s; | |
1889 | ||
1890 | plist = i->plist; | |
1891 | if (! NILP (prop)) | |
1892 | while (! NILP (plist)) | |
1893 | { | |
1894 | if (EQ (Fcar (plist), prop)) | |
1895 | { | |
1896 | plist = Fcons (prop, Fcons (Fcar (Fcdr (plist)), Qnil)); | |
1897 | break; | |
1898 | } | |
1899 | plist = Fcdr (Fcdr (plist)); | |
1900 | } | |
1901 | if (! NILP (plist)) | |
1902 | { | |
1903 | /* Must defer modifications to the interval tree in case src | |
cdf3e5a2 | 1904 | and dest refer to the same string or buffer. */ |
15e4954b JB |
1905 | stuff = Fcons (Fcons (make_number (p), |
1906 | Fcons (make_number (p + len), | |
1907 | Fcons (plist, Qnil))), | |
1908 | stuff); | |
1909 | } | |
1910 | ||
1911 | i = next_interval (i); | |
1912 | if (NULL_INTERVAL_P (i)) | |
1913 | break; | |
1914 | ||
1915 | p += len; | |
1916 | s = i->position; | |
1917 | } | |
1918 | ||
c98da214 RS |
1919 | GCPRO2 (stuff, dest); |
1920 | ||
15e4954b JB |
1921 | while (! NILP (stuff)) |
1922 | { | |
1923 | res = Fcar (stuff); | |
1924 | res = Fadd_text_properties (Fcar (res), Fcar (Fcdr (res)), | |
1925 | Fcar (Fcdr (Fcdr (res))), dest); | |
1926 | if (! NILP (res)) | |
1927 | modified++; | |
1928 | stuff = Fcdr (stuff); | |
1929 | } | |
1930 | ||
c98da214 RS |
1931 | UNGCPRO; |
1932 | ||
15e4954b JB |
1933 | return modified ? Qt : Qnil; |
1934 | } | |
9dd7eec6 GM |
1935 | |
1936 | ||
1937 | /* Return a list representing the text properties of OBJECT between | |
1938 | START and END. if PROP is non-nil, report only on that property. | |
1939 | Each result list element has the form (S E PLIST), where S and E | |
1940 | are positions in OBJECT and PLIST is a property list containing the | |
1941 | text properties of OBJECT between S and E. Value is nil if OBJECT | |
1942 | doesn't contain text properties between START and END. */ | |
1943 | ||
1944 | Lisp_Object | |
1945 | text_property_list (object, start, end, prop) | |
1946 | Lisp_Object object, start, end, prop; | |
1947 | { | |
1948 | struct interval *i; | |
1949 | Lisp_Object result; | |
9dd7eec6 GM |
1950 | |
1951 | result = Qnil; | |
81f6e55f | 1952 | |
9dd7eec6 GM |
1953 | i = validate_interval_range (object, &start, &end, soft); |
1954 | if (!NULL_INTERVAL_P (i)) | |
1955 | { | |
1956 | int s = XINT (start); | |
1957 | int e = XINT (end); | |
81f6e55f | 1958 | |
9dd7eec6 GM |
1959 | while (s < e) |
1960 | { | |
1961 | int interval_end, len; | |
1962 | Lisp_Object plist; | |
81f6e55f | 1963 | |
9dd7eec6 GM |
1964 | interval_end = i->position + LENGTH (i); |
1965 | if (interval_end > e) | |
1966 | interval_end = e; | |
1967 | len = interval_end - s; | |
81f6e55f | 1968 | |
9dd7eec6 GM |
1969 | plist = i->plist; |
1970 | ||
1971 | if (!NILP (prop)) | |
99784d63 SM |
1972 | for (; CONSP (plist); plist = Fcdr (XCDR (plist))) |
1973 | if (EQ (XCAR (plist), prop)) | |
9dd7eec6 | 1974 | { |
99784d63 | 1975 | plist = Fcons (prop, Fcons (Fcar (XCDR (plist)), Qnil)); |
9dd7eec6 GM |
1976 | break; |
1977 | } | |
1978 | ||
1979 | if (!NILP (plist)) | |
1980 | result = Fcons (Fcons (make_number (s), | |
1981 | Fcons (make_number (s + len), | |
1982 | Fcons (plist, Qnil))), | |
1983 | result); | |
81f6e55f | 1984 | |
9dd7eec6 GM |
1985 | i = next_interval (i); |
1986 | if (NULL_INTERVAL_P (i)) | |
1987 | break; | |
1988 | s = i->position; | |
1989 | } | |
1990 | } | |
81f6e55f | 1991 | |
9dd7eec6 GM |
1992 | return result; |
1993 | } | |
1994 | ||
1995 | ||
1996 | /* Add text properties to OBJECT from LIST. LIST is a list of triples | |
1997 | (START END PLIST), where START and END are positions and PLIST is a | |
1998 | property list containing the text properties to add. Adjust START | |
1999 | and END positions by DELTA before adding properties. Value is | |
2000 | non-zero if OBJECT was modified. */ | |
2001 | ||
2002 | int | |
2003 | add_text_properties_from_list (object, list, delta) | |
2004 | Lisp_Object object, list, delta; | |
2005 | { | |
2006 | struct gcpro gcpro1, gcpro2; | |
2007 | int modified_p = 0; | |
81f6e55f | 2008 | |
9dd7eec6 | 2009 | GCPRO2 (list, object); |
81f6e55f | 2010 | |
9dd7eec6 GM |
2011 | for (; CONSP (list); list = XCDR (list)) |
2012 | { | |
2013 | Lisp_Object item, start, end, plist, tem; | |
81f6e55f | 2014 | |
9dd7eec6 GM |
2015 | item = XCAR (list); |
2016 | start = make_number (XINT (XCAR (item)) + XINT (delta)); | |
2017 | end = make_number (XINT (XCAR (XCDR (item))) + XINT (delta)); | |
2018 | plist = XCAR (XCDR (XCDR (item))); | |
81f6e55f | 2019 | |
9dd7eec6 GM |
2020 | tem = Fadd_text_properties (start, end, plist, object); |
2021 | if (!NILP (tem)) | |
2022 | modified_p = 1; | |
2023 | } | |
2024 | ||
2025 | UNGCPRO; | |
2026 | return modified_p; | |
2027 | } | |
2028 | ||
2029 | ||
2030 | ||
2031 | /* Modify end-points of ranges in LIST destructively. LIST is a list | |
2032 | as returned from text_property_list. Change end-points equal to | |
2033 | OLD_END to NEW_END. */ | |
2034 | ||
2035 | void | |
2036 | extend_property_ranges (list, old_end, new_end) | |
2037 | Lisp_Object list, old_end, new_end; | |
2038 | { | |
2039 | for (; CONSP (list); list = XCDR (list)) | |
2040 | { | |
2041 | Lisp_Object item, end; | |
81f6e55f | 2042 | |
9dd7eec6 GM |
2043 | item = XCAR (list); |
2044 | end = XCAR (XCDR (item)); | |
2045 | ||
2046 | if (EQ (end, old_end)) | |
f3fbd155 | 2047 | XSETCAR (XCDR (item), new_end); |
9dd7eec6 GM |
2048 | } |
2049 | } | |
2050 | ||
2051 | ||
318d2fa8 RS |
2052 | \f |
2053 | /* Call the modification hook functions in LIST, each with START and END. */ | |
2054 | ||
2055 | static void | |
2056 | call_mod_hooks (list, start, end) | |
2057 | Lisp_Object list, start, end; | |
2058 | { | |
2059 | struct gcpro gcpro1; | |
2060 | GCPRO1 (list); | |
2061 | while (!NILP (list)) | |
2062 | { | |
2063 | call2 (Fcar (list), start, end); | |
2064 | list = Fcdr (list); | |
2065 | } | |
2066 | UNGCPRO; | |
2067 | } | |
2068 | ||
96f90544 RS |
2069 | /* Check for read-only intervals between character positions START ... END, |
2070 | in BUF, and signal an error if we find one. | |
2071 | ||
2072 | Then check for any modification hooks in the range. | |
2073 | Create a list of all these hooks in lexicographic order, | |
2074 | eliminating consecutive extra copies of the same hook. Then call | |
2075 | those hooks in order, with START and END - 1 as arguments. */ | |
15e4954b | 2076 | |
318d2fa8 RS |
2077 | void |
2078 | verify_interval_modification (buf, start, end) | |
2079 | struct buffer *buf; | |
2080 | int start, end; | |
2081 | { | |
2082 | register INTERVAL intervals = BUF_INTERVALS (buf); | |
695f302f | 2083 | register INTERVAL i; |
318d2fa8 RS |
2084 | Lisp_Object hooks; |
2085 | register Lisp_Object prev_mod_hooks; | |
2086 | Lisp_Object mod_hooks; | |
2087 | struct gcpro gcpro1; | |
2088 | ||
2089 | hooks = Qnil; | |
2090 | prev_mod_hooks = Qnil; | |
2091 | mod_hooks = Qnil; | |
2092 | ||
2093 | interval_insert_behind_hooks = Qnil; | |
2094 | interval_insert_in_front_hooks = Qnil; | |
2095 | ||
2096 | if (NULL_INTERVAL_P (intervals)) | |
2097 | return; | |
2098 | ||
2099 | if (start > end) | |
2100 | { | |
2101 | int temp = start; | |
2102 | start = end; | |
2103 | end = temp; | |
2104 | } | |
2105 | ||
2106 | /* For an insert operation, check the two chars around the position. */ | |
2107 | if (start == end) | |
2108 | { | |
7cb66899 | 2109 | INTERVAL prev = NULL; |
318d2fa8 RS |
2110 | Lisp_Object before, after; |
2111 | ||
2112 | /* Set I to the interval containing the char after START, | |
2113 | and PREV to the interval containing the char before START. | |
2114 | Either one may be null. They may be equal. */ | |
2115 | i = find_interval (intervals, start); | |
2116 | ||
2117 | if (start == BUF_BEGV (buf)) | |
2118 | prev = 0; | |
2119 | else if (i->position == start) | |
2120 | prev = previous_interval (i); | |
2121 | else if (i->position < start) | |
2122 | prev = i; | |
2123 | if (start == BUF_ZV (buf)) | |
2124 | i = 0; | |
2125 | ||
2126 | /* If Vinhibit_read_only is set and is not a list, we can | |
2127 | skip the read_only checks. */ | |
2128 | if (NILP (Vinhibit_read_only) || CONSP (Vinhibit_read_only)) | |
2129 | { | |
2130 | /* If I and PREV differ we need to check for the read-only | |
cdf3e5a2 | 2131 | property together with its stickiness. If either I or |
318d2fa8 RS |
2132 | PREV are 0, this check is all we need. |
2133 | We have to take special care, since read-only may be | |
2134 | indirectly defined via the category property. */ | |
2135 | if (i != prev) | |
2136 | { | |
2137 | if (! NULL_INTERVAL_P (i)) | |
2138 | { | |
2139 | after = textget (i->plist, Qread_only); | |
81f6e55f | 2140 | |
318d2fa8 RS |
2141 | /* If interval I is read-only and read-only is |
2142 | front-sticky, inhibit insertion. | |
2143 | Check for read-only as well as category. */ | |
2144 | if (! NILP (after) | |
2145 | && NILP (Fmemq (after, Vinhibit_read_only))) | |
2146 | { | |
2147 | Lisp_Object tem; | |
2148 | ||
2149 | tem = textget (i->plist, Qfront_sticky); | |
2150 | if (TMEM (Qread_only, tem) | |
2151 | || (NILP (Fplist_get (i->plist, Qread_only)) | |
2152 | && TMEM (Qcategory, tem))) | |
bcf97349 | 2153 | text_read_only (after); |
318d2fa8 RS |
2154 | } |
2155 | } | |
2156 | ||
2157 | if (! NULL_INTERVAL_P (prev)) | |
2158 | { | |
2159 | before = textget (prev->plist, Qread_only); | |
81f6e55f | 2160 | |
318d2fa8 RS |
2161 | /* If interval PREV is read-only and read-only isn't |
2162 | rear-nonsticky, inhibit insertion. | |
2163 | Check for read-only as well as category. */ | |
2164 | if (! NILP (before) | |
2165 | && NILP (Fmemq (before, Vinhibit_read_only))) | |
2166 | { | |
2167 | Lisp_Object tem; | |
2168 | ||
2169 | tem = textget (prev->plist, Qrear_nonsticky); | |
2170 | if (! TMEM (Qread_only, tem) | |
2171 | && (! NILP (Fplist_get (prev->plist,Qread_only)) | |
2172 | || ! TMEM (Qcategory, tem))) | |
bcf97349 | 2173 | text_read_only (before); |
318d2fa8 RS |
2174 | } |
2175 | } | |
2176 | } | |
2177 | else if (! NULL_INTERVAL_P (i)) | |
2178 | { | |
2179 | after = textget (i->plist, Qread_only); | |
81f6e55f | 2180 | |
318d2fa8 RS |
2181 | /* If interval I is read-only and read-only is |
2182 | front-sticky, inhibit insertion. | |
2183 | Check for read-only as well as category. */ | |
2184 | if (! NILP (after) && NILP (Fmemq (after, Vinhibit_read_only))) | |
2185 | { | |
2186 | Lisp_Object tem; | |
2187 | ||
2188 | tem = textget (i->plist, Qfront_sticky); | |
2189 | if (TMEM (Qread_only, tem) | |
2190 | || (NILP (Fplist_get (i->plist, Qread_only)) | |
2191 | && TMEM (Qcategory, tem))) | |
bcf97349 | 2192 | text_read_only (after); |
318d2fa8 RS |
2193 | |
2194 | tem = textget (prev->plist, Qrear_nonsticky); | |
2195 | if (! TMEM (Qread_only, tem) | |
2196 | && (! NILP (Fplist_get (prev->plist, Qread_only)) | |
2197 | || ! TMEM (Qcategory, tem))) | |
bcf97349 | 2198 | text_read_only (after); |
318d2fa8 RS |
2199 | } |
2200 | } | |
2201 | } | |
2202 | ||
2203 | /* Run both insert hooks (just once if they're the same). */ | |
2204 | if (!NULL_INTERVAL_P (prev)) | |
2205 | interval_insert_behind_hooks | |
2206 | = textget (prev->plist, Qinsert_behind_hooks); | |
2207 | if (!NULL_INTERVAL_P (i)) | |
2208 | interval_insert_in_front_hooks | |
2209 | = textget (i->plist, Qinsert_in_front_hooks); | |
2210 | } | |
0ba7995b | 2211 | else |
318d2fa8 RS |
2212 | { |
2213 | /* Loop over intervals on or next to START...END, | |
2214 | collecting their hooks. */ | |
2215 | ||
2216 | i = find_interval (intervals, start); | |
2217 | do | |
2218 | { | |
2219 | if (! INTERVAL_WRITABLE_P (i)) | |
bcf97349 | 2220 | text_read_only (textget (i->plist, Qread_only)); |
318d2fa8 | 2221 | |
0ba7995b | 2222 | if (!inhibit_modification_hooks) |
318d2fa8 | 2223 | { |
0ba7995b GM |
2224 | mod_hooks = textget (i->plist, Qmodification_hooks); |
2225 | if (! NILP (mod_hooks) && ! EQ (mod_hooks, prev_mod_hooks)) | |
2226 | { | |
2227 | hooks = Fcons (mod_hooks, hooks); | |
2228 | prev_mod_hooks = mod_hooks; | |
2229 | } | |
318d2fa8 RS |
2230 | } |
2231 | ||
2232 | i = next_interval (i); | |
2233 | } | |
2234 | /* Keep going thru the interval containing the char before END. */ | |
2235 | while (! NULL_INTERVAL_P (i) && i->position < end); | |
2236 | ||
0ba7995b | 2237 | if (!inhibit_modification_hooks) |
318d2fa8 | 2238 | { |
0ba7995b GM |
2239 | GCPRO1 (hooks); |
2240 | hooks = Fnreverse (hooks); | |
2241 | while (! EQ (hooks, Qnil)) | |
2242 | { | |
2243 | call_mod_hooks (Fcar (hooks), make_number (start), | |
2244 | make_number (end)); | |
2245 | hooks = Fcdr (hooks); | |
2246 | } | |
2247 | UNGCPRO; | |
318d2fa8 | 2248 | } |
318d2fa8 RS |
2249 | } |
2250 | } | |
2251 | ||
96f90544 | 2252 | /* Run the interval hooks for an insertion on character range START ... END. |
318d2fa8 RS |
2253 | verify_interval_modification chose which hooks to run; |
2254 | this function is called after the insertion happens | |
2255 | so it can indicate the range of inserted text. */ | |
2256 | ||
2257 | void | |
2258 | report_interval_modification (start, end) | |
2259 | Lisp_Object start, end; | |
2260 | { | |
2261 | if (! NILP (interval_insert_behind_hooks)) | |
2e34157c | 2262 | call_mod_hooks (interval_insert_behind_hooks, start, end); |
318d2fa8 RS |
2263 | if (! NILP (interval_insert_in_front_hooks) |
2264 | && ! EQ (interval_insert_in_front_hooks, | |
2265 | interval_insert_behind_hooks)) | |
2e34157c | 2266 | call_mod_hooks (interval_insert_in_front_hooks, start, end); |
318d2fa8 RS |
2267 | } |
2268 | \f | |
d418ef42 JA |
2269 | void |
2270 | syms_of_textprop () | |
2271 | { | |
ad1b2f20 | 2272 | DEFVAR_LISP ("default-text-properties", &Vdefault_text_properties, |
8c1a1077 PJ |
2273 | doc: /* Property-list used as default values. |
2274 | The value of a property in this list is seen as the value for every | |
2275 | character that does not have its own value for that property. */); | |
ad1b2f20 | 2276 | Vdefault_text_properties = Qnil; |
c7dd82a3 | 2277 | |
49d110a8 CW |
2278 | DEFVAR_LISP ("char-property-alias-alist", &Vchar_property_alias_alist, |
2279 | doc: /* Alist of alternative properties for properties without a value. | |
2280 | Each element should look like (PROPERTY ALTERNATIVE1 ALTERNATIVE2...). | |
2281 | If a piece of text has no direct value for a particular property, then | |
2282 | this alist is consulted. If that property appears in the alist, then | |
2283 | the first non-nil value from the associated alternative properties is | |
2284 | returned. */); | |
2285 | Vchar_property_alias_alist = Qnil; | |
2286 | ||
688a5a0f | 2287 | DEFVAR_LISP ("inhibit-point-motion-hooks", &Vinhibit_point_motion_hooks, |
8c1a1077 PJ |
2288 | doc: /* If non-nil, don't run `point-left' and `point-entered' text properties. |
2289 | This also inhibits the use of the `intangible' text property. */); | |
688a5a0f | 2290 | Vinhibit_point_motion_hooks = Qnil; |
318d2fa8 | 2291 | |
abc2f676 KH |
2292 | DEFVAR_LISP ("text-property-default-nonsticky", |
2293 | &Vtext_property_default_nonsticky, | |
8c1a1077 PJ |
2294 | doc: /* Alist of properties vs the corresponding non-stickinesses. |
2295 | Each element has the form (PROPERTY . NONSTICKINESS). | |
2296 | ||
2297 | If a character in a buffer has PROPERTY, new text inserted adjacent to | |
2298 | the character doesn't inherit PROPERTY if NONSTICKINESS is non-nil, | |
2299 | inherits it if NONSTICKINESS is nil. The front-sticky and | |
2300 | rear-nonsticky properties of the character overrides NONSTICKINESS. */); | |
98ebf860 SM |
2301 | /* Text property `syntax-table' should be nonsticky by default. */ |
2302 | Vtext_property_default_nonsticky | |
2303 | = Fcons (Fcons (intern ("syntax-table"), Qt), Qnil); | |
abc2f676 | 2304 | |
318d2fa8 RS |
2305 | staticpro (&interval_insert_behind_hooks); |
2306 | staticpro (&interval_insert_in_front_hooks); | |
2307 | interval_insert_behind_hooks = Qnil; | |
2308 | interval_insert_in_front_hooks = Qnil; | |
2309 | ||
81f6e55f | 2310 | |
d418ef42 JA |
2311 | /* Common attributes one might give text */ |
2312 | ||
2313 | staticpro (&Qforeground); | |
2314 | Qforeground = intern ("foreground"); | |
2315 | staticpro (&Qbackground); | |
2316 | Qbackground = intern ("background"); | |
2317 | staticpro (&Qfont); | |
2318 | Qfont = intern ("font"); | |
2319 | staticpro (&Qstipple); | |
2320 | Qstipple = intern ("stipple"); | |
2321 | staticpro (&Qunderline); | |
2322 | Qunderline = intern ("underline"); | |
2323 | staticpro (&Qread_only); | |
2324 | Qread_only = intern ("read-only"); | |
2325 | staticpro (&Qinvisible); | |
2326 | Qinvisible = intern ("invisible"); | |
46b4e741 KH |
2327 | staticpro (&Qintangible); |
2328 | Qintangible = intern ("intangible"); | |
dc70cea7 RS |
2329 | staticpro (&Qcategory); |
2330 | Qcategory = intern ("category"); | |
2331 | staticpro (&Qlocal_map); | |
2332 | Qlocal_map = intern ("local-map"); | |
19e1c426 RS |
2333 | staticpro (&Qfront_sticky); |
2334 | Qfront_sticky = intern ("front-sticky"); | |
2335 | staticpro (&Qrear_nonsticky); | |
2336 | Qrear_nonsticky = intern ("rear-nonsticky"); | |
69bb837e RS |
2337 | staticpro (&Qmouse_face); |
2338 | Qmouse_face = intern ("mouse-face"); | |
d418ef42 JA |
2339 | |
2340 | /* Properties that text might use to specify certain actions */ | |
2341 | ||
2342 | staticpro (&Qmouse_left); | |
2343 | Qmouse_left = intern ("mouse-left"); | |
2344 | staticpro (&Qmouse_entered); | |
2345 | Qmouse_entered = intern ("mouse-entered"); | |
2346 | staticpro (&Qpoint_left); | |
2347 | Qpoint_left = intern ("point-left"); | |
2348 | staticpro (&Qpoint_entered); | |
2349 | Qpoint_entered = intern ("point-entered"); | |
d418ef42 JA |
2350 | |
2351 | defsubr (&Stext_properties_at); | |
5fbe2a44 | 2352 | defsubr (&Sget_text_property); |
eb769fd7 | 2353 | defsubr (&Sget_char_property); |
97a1bc63 | 2354 | defsubr (&Sget_char_property_and_overlay); |
fcab51aa RS |
2355 | defsubr (&Snext_char_property_change); |
2356 | defsubr (&Sprevious_char_property_change); | |
b7e047fb MB |
2357 | defsubr (&Snext_single_char_property_change); |
2358 | defsubr (&Sprevious_single_char_property_change); | |
d418ef42 | 2359 | defsubr (&Snext_property_change); |
9c79dd1b | 2360 | defsubr (&Snext_single_property_change); |
d418ef42 | 2361 | defsubr (&Sprevious_property_change); |
9c79dd1b | 2362 | defsubr (&Sprevious_single_property_change); |
d418ef42 | 2363 | defsubr (&Sadd_text_properties); |
d4b530ad | 2364 | defsubr (&Sput_text_property); |
d418ef42 JA |
2365 | defsubr (&Sset_text_properties); |
2366 | defsubr (&Sremove_text_properties); | |
11713b6d | 2367 | defsubr (&Sremove_list_of_text_properties); |
ad9c1940 JB |
2368 | defsubr (&Stext_property_any); |
2369 | defsubr (&Stext_property_not_all); | |
5fbe2a44 | 2370 | /* defsubr (&Serase_text_properties); */ |
15e4954b | 2371 | /* defsubr (&Scopy_text_properties); */ |
d418ef42 | 2372 | } |
ab5796a9 MB |
2373 | |
2374 | /* arch-tag: 454cdde8-5f86-4faa-a078-101e3625d479 | |
2375 | (do not change this comment) */ |