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