Commit | Line | Data |
---|---|---|
d418ef42 | 1 | /* Interface code for dealing with text properties. |
98ebf860 | 2 | Copyright (C) 1993, 1994, 1995, 1997, 1999, 2000, 2001, 2002, 2003, 2004 |
d4881c6a | 3 | 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 | |
3b7ad313 EN |
19 | the Free Software Foundation, Inc., 59 Temple Place - Suite 330, |
20 | Boston, MA 02111-1307, 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. | |
8c1a1077 PJ |
720 | If none is found, the function returns (point-max). |
721 | ||
722 | If the optional third argument LIMIT is non-nil, don't search | |
723 | past position LIMIT; return LIMIT if nothing is found before LIMIT. */) | |
724 | (position, limit) | |
fcab51aa RS |
725 | Lisp_Object position, limit; |
726 | { | |
727 | Lisp_Object temp; | |
728 | ||
729 | temp = Fnext_overlay_change (position); | |
730 | if (! NILP (limit)) | |
731 | { | |
d615870a | 732 | CHECK_NUMBER_COERCE_MARKER (limit); |
fcab51aa RS |
733 | if (XINT (limit) < XINT (temp)) |
734 | temp = limit; | |
735 | } | |
736 | return Fnext_property_change (position, Qnil, temp); | |
737 | } | |
738 | ||
739 | DEFUN ("previous-char-property-change", Fprevious_char_property_change, | |
740 | Sprevious_char_property_change, 1, 2, 0, | |
8c1a1077 | 741 | doc: /* Return the position of previous text property or overlay change. |
81f6e55f FP |
742 | Scans characters backward in the current buffer from POSITION till it |
743 | finds a change in some text property, or the beginning or end of an | |
744 | overlay, and returns the position of that. | |
8c1a1077 PJ |
745 | If none is found, the function returns (point-max). |
746 | ||
747 | If the optional third argument LIMIT is non-nil, don't search | |
748 | past position LIMIT; return LIMIT if nothing is found before LIMIT. */) | |
749 | (position, limit) | |
fcab51aa RS |
750 | Lisp_Object position, limit; |
751 | { | |
752 | Lisp_Object temp; | |
f5957179 | 753 | |
fcab51aa RS |
754 | temp = Fprevious_overlay_change (position); |
755 | if (! NILP (limit)) | |
756 | { | |
d615870a | 757 | CHECK_NUMBER_COERCE_MARKER (limit); |
fcab51aa RS |
758 | if (XINT (limit) > XINT (temp)) |
759 | temp = limit; | |
760 | } | |
761 | return Fprevious_property_change (position, Qnil, temp); | |
762 | } | |
0b0737d1 GM |
763 | |
764 | ||
b7e047fb MB |
765 | DEFUN ("next-single-char-property-change", Fnext_single_char_property_change, |
766 | Snext_single_char_property_change, 2, 4, 0, | |
8c1a1077 PJ |
767 | doc: /* Return the position of next text property or overlay change for a specific property. |
768 | Scans characters forward from POSITION till it finds | |
769 | a change in the PROP property, then returns the position of the change. | |
81f6e55f FP |
770 | If the optional third argument OBJECT is a buffer (or nil, which means |
771 | the current buffer), POSITION is a buffer position (integer or marker). | |
772 | If OBJECT is a string, POSITION is a 0-based index into it. | |
773 | ||
8c1a1077 PJ |
774 | The property values are compared with `eq'. |
775 | If the property is constant all the way to the end of OBJECT, return the | |
776 | last valid position in OBJECT. | |
777 | If the optional fourth argument LIMIT is non-nil, don't search | |
778 | past position LIMIT; return LIMIT if nothing is found before LIMIT. */) | |
779 | (position, prop, object, limit) | |
b7e047fb | 780 | Lisp_Object prop, position, object, limit; |
0b0737d1 GM |
781 | { |
782 | if (STRINGP (object)) | |
783 | { | |
b7e047fb MB |
784 | position = Fnext_single_property_change (position, prop, object, limit); |
785 | if (NILP (position)) | |
0b0737d1 GM |
786 | { |
787 | if (NILP (limit)) | |
d5db4077 | 788 | position = make_number (SCHARS (object)); |
0b0737d1 | 789 | else |
d615870a DK |
790 | { |
791 | CHECK_NUMBER (limit); | |
792 | position = limit; | |
793 | } | |
0b0737d1 GM |
794 | } |
795 | } | |
796 | else | |
797 | { | |
798 | Lisp_Object initial_value, value; | |
aed13378 | 799 | int count = SPECPDL_INDEX (); |
0b0737d1 | 800 | |
b7e047fb | 801 | if (! NILP (object)) |
b7826503 | 802 | CHECK_BUFFER (object); |
81f6e55f | 803 | |
0b0737d1 GM |
804 | if (BUFFERP (object) && current_buffer != XBUFFER (object)) |
805 | { | |
806 | record_unwind_protect (Fset_buffer, Fcurrent_buffer ()); | |
807 | Fset_buffer (object); | |
808 | } | |
809 | ||
d615870a DK |
810 | CHECK_NUMBER_COERCE_MARKER (position); |
811 | ||
b7e047fb | 812 | initial_value = Fget_char_property (position, prop, object); |
81f6e55f | 813 | |
b7e047fb MB |
814 | if (NILP (limit)) |
815 | XSETFASTINT (limit, BUF_ZV (current_buffer)); | |
816 | else | |
b7826503 | 817 | CHECK_NUMBER_COERCE_MARKER (limit); |
b7e047fb MB |
818 | |
819 | for (;;) | |
0b0737d1 | 820 | { |
b7e047fb MB |
821 | position = Fnext_char_property_change (position, limit); |
822 | if (XFASTINT (position) >= XFASTINT (limit)) { | |
823 | position = limit; | |
824 | break; | |
825 | } | |
826 | ||
827 | value = Fget_char_property (position, prop, object); | |
0b0737d1 GM |
828 | if (!EQ (value, initial_value)) |
829 | break; | |
830 | } | |
831 | ||
832 | unbind_to (count, Qnil); | |
833 | } | |
834 | ||
b7e047fb | 835 | return position; |
0b0737d1 GM |
836 | } |
837 | ||
b7e047fb MB |
838 | DEFUN ("previous-single-char-property-change", |
839 | Fprevious_single_char_property_change, | |
840 | Sprevious_single_char_property_change, 2, 4, 0, | |
8c1a1077 PJ |
841 | doc: /* Return the position of previous text property or overlay change for a specific property. |
842 | Scans characters backward from POSITION till it finds | |
843 | a change in the PROP property, then returns the position of the change. | |
81f6e55f FP |
844 | If the optional third argument OBJECT is a buffer (or nil, which means |
845 | the current buffer), POSITION is a buffer position (integer or marker). | |
846 | If OBJECT is a string, POSITION is a 0-based index into it. | |
847 | ||
8c1a1077 PJ |
848 | The property values are compared with `eq'. |
849 | If the property is constant all the way to the start of OBJECT, return the | |
850 | first valid position in OBJECT. | |
851 | If the optional fourth argument LIMIT is non-nil, don't search | |
852 | back past position LIMIT; return LIMIT if nothing is found before LIMIT. */) | |
853 | (position, prop, object, limit) | |
b7e047fb MB |
854 | Lisp_Object prop, position, object, limit; |
855 | { | |
856 | if (STRINGP (object)) | |
857 | { | |
858 | position = Fprevious_single_property_change (position, prop, object, limit); | |
859 | if (NILP (position)) | |
860 | { | |
861 | if (NILP (limit)) | |
d5db4077 | 862 | position = make_number (SCHARS (object)); |
b7e047fb | 863 | else |
d615870a DK |
864 | { |
865 | CHECK_NUMBER (limit); | |
866 | position = limit; | |
867 | } | |
b7e047fb MB |
868 | } |
869 | } | |
870 | else | |
871 | { | |
aed13378 | 872 | int count = SPECPDL_INDEX (); |
b7e047fb MB |
873 | |
874 | if (! NILP (object)) | |
b7826503 | 875 | CHECK_BUFFER (object); |
81f6e55f | 876 | |
b7e047fb MB |
877 | if (BUFFERP (object) && current_buffer != XBUFFER (object)) |
878 | { | |
879 | record_unwind_protect (Fset_buffer, Fcurrent_buffer ()); | |
880 | Fset_buffer (object); | |
881 | } | |
81f6e55f | 882 | |
d615870a DK |
883 | CHECK_NUMBER_COERCE_MARKER (position); |
884 | ||
b7e047fb MB |
885 | if (NILP (limit)) |
886 | XSETFASTINT (limit, BUF_BEGV (current_buffer)); | |
887 | else | |
b7826503 | 888 | CHECK_NUMBER_COERCE_MARKER (limit); |
b7e047fb | 889 | |
ce6b02e0 MB |
890 | if (XFASTINT (position) <= XFASTINT (limit)) |
891 | position = limit; | |
892 | else | |
b7e047fb | 893 | { |
ce6b02e0 | 894 | Lisp_Object initial_value = |
d4225c08 KR |
895 | Fget_char_property (make_number (XFASTINT (position) - 1), |
896 | prop, object); | |
81f6e55f | 897 | |
ce6b02e0 MB |
898 | for (;;) |
899 | { | |
900 | position = Fprevious_char_property_change (position, limit); | |
0b0737d1 | 901 | |
ce6b02e0 MB |
902 | if (XFASTINT (position) <= XFASTINT (limit)) |
903 | { | |
904 | position = limit; | |
905 | break; | |
906 | } | |
907 | else | |
908 | { | |
909 | Lisp_Object value = | |
d4225c08 KR |
910 | Fget_char_property (make_number (XFASTINT (position) - 1), |
911 | prop, object); | |
ce6b02e0 MB |
912 | |
913 | if (!EQ (value, initial_value)) | |
914 | break; | |
915 | } | |
916 | } | |
b7e047fb MB |
917 | } |
918 | ||
919 | unbind_to (count, Qnil); | |
920 | } | |
921 | ||
922 | return position; | |
923 | } | |
fcab51aa | 924 | \f |
d418ef42 | 925 | DEFUN ("next-property-change", Fnext_property_change, |
111b637d | 926 | Snext_property_change, 1, 3, 0, |
8c1a1077 PJ |
927 | doc: /* Return the position of next property change. |
928 | Scans characters forward from POSITION in OBJECT till it finds | |
929 | a change in some text property, then returns the position of the change. | |
81f6e55f FP |
930 | If the optional second argument OBJECT is a buffer (or nil, which means |
931 | the current buffer), POSITION is a buffer position (integer or marker). | |
932 | If OBJECT is a string, POSITION is a 0-based index into it. | |
8c1a1077 PJ |
933 | Return nil if the property is constant all the way to the end of OBJECT. |
934 | If the value is non-nil, it is a position greater than POSITION, never equal. | |
935 | ||
936 | If the optional third argument LIMIT is non-nil, don't search | |
937 | past position LIMIT; return LIMIT if nothing is found before LIMIT. */) | |
938 | (position, object, limit) | |
1f5e848a | 939 | Lisp_Object position, object, limit; |
d418ef42 JA |
940 | { |
941 | register INTERVAL i, next; | |
942 | ||
5fbe2a44 | 943 | if (NILP (object)) |
c8a4fc3d | 944 | XSETBUFFER (object, current_buffer); |
5fbe2a44 | 945 | |
3a232704 | 946 | if (!NILP (limit) && !EQ (limit, Qt)) |
b7826503 | 947 | CHECK_NUMBER_COERCE_MARKER (limit); |
1387d54e | 948 | |
1f5e848a | 949 | i = validate_interval_range (object, &position, &position, soft); |
d418ef42 | 950 | |
041aa96f RS |
951 | /* If LIMIT is t, return start of next interval--don't |
952 | bother checking further intervals. */ | |
953 | if (EQ (limit, Qt)) | |
954 | { | |
44214c1b RS |
955 | if (NULL_INTERVAL_P (i)) |
956 | next = i; | |
957 | else | |
958 | next = next_interval (i); | |
81f6e55f | 959 | |
c7b6dfa6 | 960 | if (NULL_INTERVAL_P (next)) |
1f5e848a | 961 | XSETFASTINT (position, (STRINGP (object) |
d5db4077 | 962 | ? SCHARS (object) |
1f5e848a | 963 | : BUF_ZV (XBUFFER (object)))); |
c7b6dfa6 | 964 | else |
ad077db0 | 965 | XSETFASTINT (position, next->position); |
1f5e848a | 966 | return position; |
041aa96f RS |
967 | } |
968 | ||
44214c1b RS |
969 | if (NULL_INTERVAL_P (i)) |
970 | return limit; | |
971 | ||
972 | next = next_interval (i); | |
973 | ||
3a232704 | 974 | while (!NULL_INTERVAL_P (next) && intervals_equal (i, next) |
ad077db0 | 975 | && (NILP (limit) || next->position < XFASTINT (limit))) |
d418ef42 JA |
976 | next = next_interval (next); |
977 | ||
978 | if (NULL_INTERVAL_P (next)) | |
111b637d | 979 | return limit; |
3a232704 SM |
980 | if (NILP (limit)) |
981 | XSETFASTINT (limit, (STRINGP (object) | |
d5db4077 | 982 | ? SCHARS (object) |
3a232704 SM |
983 | : BUF_ZV (XBUFFER (object)))); |
984 | if (!(next->position < XFASTINT (limit))) | |
111b637d | 985 | return limit; |
d418ef42 | 986 | |
ad077db0 | 987 | XSETFASTINT (position, next->position); |
1f5e848a | 988 | return position; |
19e1c426 RS |
989 | } |
990 | ||
991 | /* Return 1 if there's a change in some property between BEG and END. */ | |
992 | ||
993 | int | |
994 | property_change_between_p (beg, end) | |
995 | int beg, end; | |
996 | { | |
997 | register INTERVAL i, next; | |
998 | Lisp_Object object, pos; | |
999 | ||
c8a4fc3d | 1000 | XSETBUFFER (object, current_buffer); |
e9c4fbcd | 1001 | XSETFASTINT (pos, beg); |
19e1c426 RS |
1002 | |
1003 | i = validate_interval_range (object, &pos, &pos, soft); | |
1004 | if (NULL_INTERVAL_P (i)) | |
1005 | return 0; | |
1006 | ||
1007 | next = next_interval (i); | |
1008 | while (! NULL_INTERVAL_P (next) && intervals_equal (i, next)) | |
1009 | { | |
1010 | next = next_interval (next); | |
e050ef74 RS |
1011 | if (NULL_INTERVAL_P (next)) |
1012 | return 0; | |
ad077db0 | 1013 | if (next->position >= end) |
19e1c426 RS |
1014 | return 0; |
1015 | } | |
1016 | ||
1017 | if (NULL_INTERVAL_P (next)) | |
1018 | return 0; | |
1019 | ||
1020 | return 1; | |
d418ef42 JA |
1021 | } |
1022 | ||
9c79dd1b | 1023 | DEFUN ("next-single-property-change", Fnext_single_property_change, |
111b637d | 1024 | Snext_single_property_change, 2, 4, 0, |
8c1a1077 PJ |
1025 | doc: /* Return the position of next property change for a specific property. |
1026 | Scans characters forward from POSITION till it finds | |
1027 | a change in the PROP property, then returns the position of the change. | |
81f6e55f FP |
1028 | If the optional third argument OBJECT is a buffer (or nil, which means |
1029 | the current buffer), POSITION is a buffer position (integer or marker). | |
1030 | If OBJECT is a string, POSITION is a 0-based index into it. | |
8c1a1077 PJ |
1031 | The property values are compared with `eq'. |
1032 | Return nil if the property is constant all the way to the end of OBJECT. | |
1033 | If the value is non-nil, it is a position greater than POSITION, never equal. | |
1034 | ||
1035 | If the optional fourth argument LIMIT is non-nil, don't search | |
1036 | past position LIMIT; return LIMIT if nothing is found before LIMIT. */) | |
1037 | (position, prop, object, limit) | |
1f5e848a | 1038 | Lisp_Object position, prop, object, limit; |
9c79dd1b JA |
1039 | { |
1040 | register INTERVAL i, next; | |
1041 | register Lisp_Object here_val; | |
1042 | ||
5fbe2a44 | 1043 | if (NILP (object)) |
c8a4fc3d | 1044 | XSETBUFFER (object, current_buffer); |
5fbe2a44 | 1045 | |
1387d54e | 1046 | if (!NILP (limit)) |
b7826503 | 1047 | CHECK_NUMBER_COERCE_MARKER (limit); |
1387d54e | 1048 | |
1f5e848a | 1049 | i = validate_interval_range (object, &position, &position, soft); |
9c79dd1b | 1050 | if (NULL_INTERVAL_P (i)) |
111b637d | 1051 | return limit; |
9c79dd1b | 1052 | |
6a0486dd | 1053 | here_val = textget (i->plist, prop); |
9c79dd1b | 1054 | next = next_interval (i); |
81f6e55f | 1055 | while (! NULL_INTERVAL_P (next) |
111b637d | 1056 | && EQ (here_val, textget (next->plist, prop)) |
ad077db0 | 1057 | && (NILP (limit) || next->position < XFASTINT (limit))) |
9c79dd1b JA |
1058 | next = next_interval (next); |
1059 | ||
1060 | if (NULL_INTERVAL_P (next)) | |
111b637d | 1061 | return limit; |
3a232704 SM |
1062 | if (NILP (limit)) |
1063 | XSETFASTINT (limit, (STRINGP (object) | |
d5db4077 | 1064 | ? SCHARS (object) |
3a232704 SM |
1065 | : BUF_ZV (XBUFFER (object)))); |
1066 | if (!(next->position < XFASTINT (limit))) | |
111b637d | 1067 | return limit; |
9c79dd1b | 1068 | |
ad077db0 | 1069 | return make_number (next->position); |
9c79dd1b JA |
1070 | } |
1071 | ||
d418ef42 | 1072 | DEFUN ("previous-property-change", Fprevious_property_change, |
111b637d | 1073 | Sprevious_property_change, 1, 3, 0, |
8c1a1077 PJ |
1074 | doc: /* Return the position of previous property change. |
1075 | Scans characters backwards from POSITION in OBJECT till it finds | |
1076 | a change in some text property, then returns the position of the change. | |
81f6e55f FP |
1077 | If the optional second argument OBJECT is a buffer (or nil, which means |
1078 | the current buffer), POSITION is a buffer position (integer or marker). | |
1079 | If OBJECT is a string, POSITION is a 0-based index into it. | |
8c1a1077 PJ |
1080 | Return nil if the property is constant all the way to the start of OBJECT. |
1081 | If the value is non-nil, it is a position less than POSITION, never equal. | |
1082 | ||
1083 | If the optional third argument LIMIT is non-nil, don't search | |
1084 | back past position LIMIT; return LIMIT if nothing is found until LIMIT. */) | |
1085 | (position, object, limit) | |
1f5e848a | 1086 | Lisp_Object position, object, limit; |
d418ef42 JA |
1087 | { |
1088 | register INTERVAL i, previous; | |
1089 | ||
5fbe2a44 | 1090 | if (NILP (object)) |
c8a4fc3d | 1091 | XSETBUFFER (object, current_buffer); |
5fbe2a44 | 1092 | |
1387d54e | 1093 | if (!NILP (limit)) |
b7826503 | 1094 | CHECK_NUMBER_COERCE_MARKER (limit); |
1387d54e | 1095 | |
1f5e848a | 1096 | i = validate_interval_range (object, &position, &position, soft); |
d418ef42 | 1097 | if (NULL_INTERVAL_P (i)) |
111b637d | 1098 | return limit; |
d418ef42 | 1099 | |
53b7feec | 1100 | /* Start with the interval containing the char before point. */ |
1f5e848a | 1101 | if (i->position == XFASTINT (position)) |
53b7feec RS |
1102 | i = previous_interval (i); |
1103 | ||
d418ef42 | 1104 | previous = previous_interval (i); |
3a232704 | 1105 | while (!NULL_INTERVAL_P (previous) && intervals_equal (previous, i) |
111b637d | 1106 | && (NILP (limit) |
ad077db0 | 1107 | || (previous->position + LENGTH (previous) > XFASTINT (limit)))) |
d418ef42 JA |
1108 | previous = previous_interval (previous); |
1109 | if (NULL_INTERVAL_P (previous)) | |
111b637d | 1110 | return limit; |
3a232704 SM |
1111 | if (NILP (limit)) |
1112 | XSETFASTINT (limit, (STRINGP (object) ? 0 : BUF_BEGV (XBUFFER (object)))); | |
1113 | if (!(previous->position + LENGTH (previous) > XFASTINT (limit))) | |
111b637d | 1114 | return limit; |
d418ef42 | 1115 | |
ad077db0 | 1116 | return make_number (previous->position + LENGTH (previous)); |
d418ef42 JA |
1117 | } |
1118 | ||
9c79dd1b | 1119 | DEFUN ("previous-single-property-change", Fprevious_single_property_change, |
111b637d | 1120 | Sprevious_single_property_change, 2, 4, 0, |
8c1a1077 PJ |
1121 | doc: /* Return the position of previous property change for a specific property. |
1122 | Scans characters backward from POSITION till it finds | |
1123 | a change in the PROP property, then returns the position of the change. | |
81f6e55f FP |
1124 | If the optional third argument OBJECT is a buffer (or nil, which means |
1125 | the current buffer), POSITION is a buffer position (integer or marker). | |
1126 | If OBJECT is a string, POSITION is a 0-based index into it. | |
8c1a1077 PJ |
1127 | The property values are compared with `eq'. |
1128 | Return nil if the property is constant all the way to the start of OBJECT. | |
1129 | If the value is non-nil, it is a position less than POSITION, never equal. | |
1130 | ||
1131 | If the optional fourth argument LIMIT is non-nil, don't search | |
1132 | back past position LIMIT; return LIMIT if nothing is found until LIMIT. */) | |
1f5e848a EN |
1133 | (position, prop, object, limit) |
1134 | Lisp_Object position, prop, object, limit; | |
9c79dd1b JA |
1135 | { |
1136 | register INTERVAL i, previous; | |
1137 | register Lisp_Object here_val; | |
1138 | ||
5fbe2a44 | 1139 | if (NILP (object)) |
c8a4fc3d | 1140 | XSETBUFFER (object, current_buffer); |
5fbe2a44 | 1141 | |
1387d54e | 1142 | if (!NILP (limit)) |
b7826503 | 1143 | CHECK_NUMBER_COERCE_MARKER (limit); |
1387d54e | 1144 | |
1f5e848a | 1145 | i = validate_interval_range (object, &position, &position, soft); |
9c79dd1b | 1146 | |
53b7feec | 1147 | /* Start with the interval containing the char before point. */ |
3a232704 | 1148 | if (!NULL_INTERVAL_P (i) && i->position == XFASTINT (position)) |
53b7feec RS |
1149 | i = previous_interval (i); |
1150 | ||
6873cfa3 KH |
1151 | if (NULL_INTERVAL_P (i)) |
1152 | return limit; | |
1153 | ||
6a0486dd | 1154 | here_val = textget (i->plist, prop); |
9c79dd1b | 1155 | previous = previous_interval (i); |
3a232704 | 1156 | while (!NULL_INTERVAL_P (previous) |
111b637d RS |
1157 | && EQ (here_val, textget (previous->plist, prop)) |
1158 | && (NILP (limit) | |
ad077db0 | 1159 | || (previous->position + LENGTH (previous) > XFASTINT (limit)))) |
9c79dd1b JA |
1160 | previous = previous_interval (previous); |
1161 | if (NULL_INTERVAL_P (previous)) | |
111b637d | 1162 | return limit; |
3a232704 SM |
1163 | if (NILP (limit)) |
1164 | XSETFASTINT (limit, (STRINGP (object) ? 0 : BUF_BEGV (XBUFFER (object)))); | |
1165 | if (!(previous->position + LENGTH (previous) > XFASTINT (limit))) | |
111b637d | 1166 | return limit; |
9c79dd1b | 1167 | |
ad077db0 | 1168 | return make_number (previous->position + LENGTH (previous)); |
9c79dd1b | 1169 | } |
fcab51aa | 1170 | \f |
c98da214 RS |
1171 | /* Callers note, this can GC when OBJECT is a buffer (or nil). */ |
1172 | ||
d418ef42 | 1173 | DEFUN ("add-text-properties", Fadd_text_properties, |
5fbe2a44 | 1174 | Sadd_text_properties, 3, 4, 0, |
8c1a1077 PJ |
1175 | doc: /* Add properties to the text from START to END. |
1176 | The third argument PROPERTIES is a property list | |
81f6e55f FP |
1177 | specifying the property values to add. If the optional fourth argument |
1178 | OBJECT is a buffer (or nil, which means the current buffer), | |
1179 | START and END are buffer positions (integers or markers). | |
1180 | If OBJECT is a string, START and END are 0-based indices into it. | |
8c1a1077 PJ |
1181 | Return t if any property value actually changed, nil otherwise. */) |
1182 | (start, end, properties, object) | |
5fbe2a44 | 1183 | Lisp_Object start, end, properties, object; |
d418ef42 JA |
1184 | { |
1185 | register INTERVAL i, unchanged; | |
caa31568 | 1186 | register int s, len, modified = 0; |
c98da214 | 1187 | struct gcpro gcpro1; |
d418ef42 JA |
1188 | |
1189 | properties = validate_plist (properties); | |
1190 | if (NILP (properties)) | |
1191 | return Qnil; | |
1192 | ||
5fbe2a44 | 1193 | if (NILP (object)) |
c8a4fc3d | 1194 | XSETBUFFER (object, current_buffer); |
5fbe2a44 | 1195 | |
d418ef42 JA |
1196 | i = validate_interval_range (object, &start, &end, hard); |
1197 | if (NULL_INTERVAL_P (i)) | |
1198 | return Qnil; | |
1199 | ||
1200 | s = XINT (start); | |
1201 | len = XINT (end) - s; | |
1202 | ||
c98da214 RS |
1203 | /* No need to protect OBJECT, because we GC only if it's a buffer, |
1204 | and live buffers are always protected. */ | |
1205 | GCPRO1 (properties); | |
1206 | ||
d418ef42 | 1207 | /* If we're not starting on an interval boundary, we have to |
cdf3e5a2 | 1208 | split this interval. */ |
d418ef42 JA |
1209 | if (i->position != s) |
1210 | { | |
1211 | /* If this interval already has the properties, we can | |
cdf3e5a2 | 1212 | skip it. */ |
d418ef42 JA |
1213 | if (interval_has_all_properties (properties, i)) |
1214 | { | |
1215 | int got = (LENGTH (i) - (s - i->position)); | |
1216 | if (got >= len) | |
64db1307 | 1217 | RETURN_UNGCPRO (Qnil); |
d418ef42 | 1218 | len -= got; |
05d5b93e | 1219 | i = next_interval (i); |
d418ef42 JA |
1220 | } |
1221 | else | |
1222 | { | |
1223 | unchanged = i; | |
ad9c1940 | 1224 | i = split_interval_right (unchanged, s - unchanged->position); |
d418ef42 | 1225 | copy_properties (unchanged, i); |
d418ef42 JA |
1226 | } |
1227 | } | |
1228 | ||
2a631db1 RS |
1229 | if (BUFFERP (object)) |
1230 | modify_region (XBUFFER (object), XINT (start), XINT (end)); | |
26c76ace | 1231 | |
daa5e28f | 1232 | /* We are at the beginning of interval I, with LEN chars to scan. */ |
caa31568 | 1233 | for (;;) |
d418ef42 | 1234 | { |
d4b530ad RS |
1235 | if (i == 0) |
1236 | abort (); | |
1237 | ||
d418ef42 JA |
1238 | if (LENGTH (i) >= len) |
1239 | { | |
c98da214 RS |
1240 | /* We can UNGCPRO safely here, because there will be just |
1241 | one more chance to gc, in the next call to add_properties, | |
1242 | and after that we will not need PROPERTIES or OBJECT again. */ | |
1243 | UNGCPRO; | |
1244 | ||
d418ef42 | 1245 | if (interval_has_all_properties (properties, i)) |
26c76ace | 1246 | { |
2a631db1 RS |
1247 | if (BUFFERP (object)) |
1248 | signal_after_change (XINT (start), XINT (end) - XINT (start), | |
1249 | XINT (end) - XINT (start)); | |
26c76ace RS |
1250 | |
1251 | return modified ? Qt : Qnil; | |
1252 | } | |
d418ef42 JA |
1253 | |
1254 | if (LENGTH (i) == len) | |
1255 | { | |
d4b530ad | 1256 | add_properties (properties, i, object); |
2a631db1 RS |
1257 | if (BUFFERP (object)) |
1258 | signal_after_change (XINT (start), XINT (end) - XINT (start), | |
1259 | XINT (end) - XINT (start)); | |
d418ef42 JA |
1260 | return Qt; |
1261 | } | |
1262 | ||
1263 | /* i doesn't have the properties, and goes past the change limit */ | |
1264 | unchanged = i; | |
ad9c1940 | 1265 | i = split_interval_left (unchanged, len); |
d418ef42 | 1266 | copy_properties (unchanged, i); |
d4b530ad | 1267 | add_properties (properties, i, object); |
2a631db1 RS |
1268 | if (BUFFERP (object)) |
1269 | signal_after_change (XINT (start), XINT (end) - XINT (start), | |
1270 | XINT (end) - XINT (start)); | |
d418ef42 JA |
1271 | return Qt; |
1272 | } | |
1273 | ||
1274 | len -= LENGTH (i); | |
d4b530ad | 1275 | modified += add_properties (properties, i, object); |
d418ef42 JA |
1276 | i = next_interval (i); |
1277 | } | |
1278 | } | |
1279 | ||
c98da214 RS |
1280 | /* Callers note, this can GC when OBJECT is a buffer (or nil). */ |
1281 | ||
d4b530ad RS |
1282 | DEFUN ("put-text-property", Fput_text_property, |
1283 | Sput_text_property, 4, 5, 0, | |
8c1a1077 PJ |
1284 | doc: /* Set one property of the text from START to END. |
1285 | The third and fourth arguments PROPERTY and VALUE | |
1286 | specify the property to add. | |
81f6e55f FP |
1287 | If the optional fifth argument OBJECT is a buffer (or nil, which means |
1288 | the current buffer), START and END are buffer positions (integers or | |
1289 | markers). If OBJECT is a string, START and END are 0-based indices into it. */) | |
8c1a1077 | 1290 | (start, end, property, value, object) |
1f5e848a | 1291 | Lisp_Object start, end, property, value, object; |
d4b530ad RS |
1292 | { |
1293 | Fadd_text_properties (start, end, | |
1f5e848a | 1294 | Fcons (property, Fcons (value, Qnil)), |
d4b530ad RS |
1295 | object); |
1296 | return Qnil; | |
1297 | } | |
1298 | ||
d418ef42 | 1299 | DEFUN ("set-text-properties", Fset_text_properties, |
5fbe2a44 | 1300 | Sset_text_properties, 3, 4, 0, |
8c1a1077 PJ |
1301 | doc: /* Completely replace properties of text from START to END. |
1302 | The third argument PROPERTIES is the new property list. | |
81f6e55f FP |
1303 | If the optional fourth argument OBJECT is a buffer (or nil, which means |
1304 | the current buffer), START and END are buffer positions (integers or | |
1305 | markers). If OBJECT is a string, START and END are 0-based indices into it. | |
8c1a1077 PJ |
1306 | If PROPERTIES is nil, the effect is to remove all properties from |
1307 | the designated part of OBJECT. */) | |
1308 | (start, end, properties, object) | |
1f5e848a | 1309 | Lisp_Object start, end, properties, object; |
0087ade6 GM |
1310 | { |
1311 | return set_text_properties (start, end, properties, object, Qt); | |
1312 | } | |
1313 | ||
1314 | ||
1315 | /* Replace properties of text from START to END with new list of | |
1316 | properties PROPERTIES. OBJECT is the buffer or string containing | |
1317 | the text. OBJECT nil means use the current buffer. | |
1318 | SIGNAL_AFTER_CHANGE_P nil means don't signal after changes. Value | |
1319 | is non-nil if properties were replaced; it is nil if there weren't | |
1320 | any properties to replace. */ | |
1321 | ||
1322 | Lisp_Object | |
1323 | set_text_properties (start, end, properties, object, signal_after_change_p) | |
1324 | Lisp_Object start, end, properties, object, signal_after_change_p; | |
d418ef42 | 1325 | { |
28ff4293 | 1326 | register INTERVAL i; |
33d7d0df RS |
1327 | Lisp_Object ostart, oend; |
1328 | ||
1329 | ostart = start; | |
1330 | oend = end; | |
d418ef42 | 1331 | |
1f5e848a | 1332 | properties = validate_plist (properties); |
d418ef42 | 1333 | |
5fbe2a44 | 1334 | if (NILP (object)) |
c8a4fc3d | 1335 | XSETBUFFER (object, current_buffer); |
5fbe2a44 | 1336 | |
919fa9cb RS |
1337 | /* If we want no properties for a whole string, |
1338 | get rid of its intervals. */ | |
1f5e848a | 1339 | if (NILP (properties) && STRINGP (object) |
919fa9cb | 1340 | && XFASTINT (start) == 0 |
d5db4077 | 1341 | && XFASTINT (end) == SCHARS (object)) |
919fa9cb | 1342 | { |
d5db4077 | 1343 | if (! STRING_INTERVALS (object)) |
26c76ace RS |
1344 | return Qt; |
1345 | ||
9056febe | 1346 | STRING_SET_INTERVALS (object, NULL_INTERVAL); |
919fa9cb RS |
1347 | return Qt; |
1348 | } | |
1349 | ||
facc570e | 1350 | i = validate_interval_range (object, &start, &end, soft); |
919fa9cb | 1351 | |
d418ef42 | 1352 | if (NULL_INTERVAL_P (i)) |
facc570e | 1353 | { |
1f5e848a EN |
1354 | /* If buffer has no properties, and we want none, return now. */ |
1355 | if (NILP (properties)) | |
facc570e RS |
1356 | return Qnil; |
1357 | ||
33d7d0df RS |
1358 | /* Restore the original START and END values |
1359 | because validate_interval_range increments them for strings. */ | |
1360 | start = ostart; | |
1361 | end = oend; | |
1362 | ||
facc570e RS |
1363 | i = validate_interval_range (object, &start, &end, hard); |
1364 | /* This can return if start == end. */ | |
1365 | if (NULL_INTERVAL_P (i)) | |
1366 | return Qnil; | |
1367 | } | |
d418ef42 | 1368 | |
2a631db1 RS |
1369 | if (BUFFERP (object)) |
1370 | modify_region (XBUFFER (object), XINT (start), XINT (end)); | |
26c76ace | 1371 | |
78ff4175 RS |
1372 | set_text_properties_1 (start, end, properties, object, i); |
1373 | ||
1374 | if (BUFFERP (object) && !NILP (signal_after_change_p)) | |
1375 | signal_after_change (XINT (start), XINT (end) - XINT (start), | |
1376 | XINT (end) - XINT (start)); | |
1377 | return Qt; | |
1378 | } | |
1379 | ||
1380 | /* Replace properties of text from START to END with new list of | |
1381 | properties PROPERTIES. BUFFER is the buffer containing | |
1382 | the text. This does not obey any hooks. | |
1383 | You can provide the interval that START is located in as I, | |
ce768453 | 1384 | or pass NULL for I and this function will find it. |
49f68fd2 | 1385 | START and END can be in any order. */ |
78ff4175 RS |
1386 | |
1387 | void | |
1388 | set_text_properties_1 (start, end, properties, buffer, i) | |
1389 | Lisp_Object start, end, properties, buffer; | |
1390 | INTERVAL i; | |
1391 | { | |
1392 | register INTERVAL prev_changed = NULL_INTERVAL; | |
1393 | register int s, len; | |
1394 | INTERVAL unchanged; | |
1395 | ||
1396 | s = XINT (start); | |
1397 | len = XINT (end) - s; | |
49f68fd2 RS |
1398 | if (len == 0) |
1399 | return; | |
1400 | if (len < 0) | |
1401 | { | |
1402 | s = s + len; | |
1403 | len = - len; | |
1404 | } | |
1405 | ||
78ff4175 RS |
1406 | if (i == 0) |
1407 | i = find_interval (BUF_INTERVALS (XBUFFER (buffer)), s); | |
1408 | ||
d418ef42 JA |
1409 | if (i->position != s) |
1410 | { | |
1411 | unchanged = i; | |
ad9c1940 | 1412 | i = split_interval_right (unchanged, s - unchanged->position); |
7855e674 | 1413 | |
d418ef42 JA |
1414 | if (LENGTH (i) > len) |
1415 | { | |
9c79dd1b | 1416 | copy_properties (unchanged, i); |
ad9c1940 | 1417 | i = split_interval_left (i, len); |
78ff4175 RS |
1418 | set_properties (properties, i, buffer); |
1419 | return; | |
d418ef42 JA |
1420 | } |
1421 | ||
78ff4175 | 1422 | set_properties (properties, i, buffer); |
daa5e28f | 1423 | |
9c79dd1b | 1424 | if (LENGTH (i) == len) |
78ff4175 | 1425 | return; |
9c79dd1b JA |
1426 | |
1427 | prev_changed = i; | |
d418ef42 JA |
1428 | len -= LENGTH (i); |
1429 | i = next_interval (i); | |
1430 | } | |
1431 | ||
cd7d971d | 1432 | /* We are starting at the beginning of an interval, I */ |
7855e674 | 1433 | while (len > 0) |
d418ef42 | 1434 | { |
d4b530ad RS |
1435 | if (i == 0) |
1436 | abort (); | |
1437 | ||
d418ef42 JA |
1438 | if (LENGTH (i) >= len) |
1439 | { | |
cd7d971d | 1440 | if (LENGTH (i) > len) |
ad9c1940 | 1441 | i = split_interval_left (i, len); |
d418ef42 | 1442 | |
6f232881 RS |
1443 | /* We have to call set_properties even if we are going to |
1444 | merge the intervals, so as to make the undo records | |
1445 | and cause redisplay to happen. */ | |
78ff4175 | 1446 | set_properties (properties, i, buffer); |
6f232881 | 1447 | if (!NULL_INTERVAL_P (prev_changed)) |
9c79dd1b | 1448 | merge_interval_left (i); |
78ff4175 | 1449 | return; |
d418ef42 JA |
1450 | } |
1451 | ||
1452 | len -= LENGTH (i); | |
6f232881 RS |
1453 | |
1454 | /* We have to call set_properties even if we are going to | |
1455 | merge the intervals, so as to make the undo records | |
1456 | and cause redisplay to happen. */ | |
78ff4175 | 1457 | set_properties (properties, i, buffer); |
9c79dd1b | 1458 | if (NULL_INTERVAL_P (prev_changed)) |
6f232881 | 1459 | prev_changed = i; |
9c79dd1b JA |
1460 | else |
1461 | prev_changed = i = merge_interval_left (i); | |
1462 | ||
d418ef42 JA |
1463 | i = next_interval (i); |
1464 | } | |
d418ef42 JA |
1465 | } |
1466 | ||
1467 | DEFUN ("remove-text-properties", Fremove_text_properties, | |
5fbe2a44 | 1468 | Sremove_text_properties, 3, 4, 0, |
8c1a1077 PJ |
1469 | doc: /* Remove some properties from text from START to END. |
1470 | The third argument PROPERTIES is a property list | |
1471 | whose property names specify the properties to remove. | |
1472 | \(The values stored in PROPERTIES are ignored.) | |
81f6e55f FP |
1473 | If the optional fourth argument OBJECT is a buffer (or nil, which means |
1474 | the current buffer), START and END are buffer positions (integers or | |
1475 | markers). If OBJECT is a string, START and END are 0-based indices into it. | |
1476 | Return t if any property was actually removed, nil otherwise. | |
1477 | ||
1478 | Use set-text-properties if you want to remove all text properties. */) | |
8c1a1077 | 1479 | (start, end, properties, object) |
1f5e848a | 1480 | Lisp_Object start, end, properties, object; |
d418ef42 JA |
1481 | { |
1482 | register INTERVAL i, unchanged; | |
caa31568 | 1483 | register int s, len, modified = 0; |
d418ef42 | 1484 | |
5fbe2a44 | 1485 | if (NILP (object)) |
c8a4fc3d | 1486 | XSETBUFFER (object, current_buffer); |
5fbe2a44 | 1487 | |
d418ef42 JA |
1488 | i = validate_interval_range (object, &start, &end, soft); |
1489 | if (NULL_INTERVAL_P (i)) | |
1490 | return Qnil; | |
1491 | ||
1492 | s = XINT (start); | |
1493 | len = XINT (end) - s; | |
9c79dd1b | 1494 | |
d418ef42 JA |
1495 | if (i->position != s) |
1496 | { | |
1497 | /* No properties on this first interval -- return if | |
cdf3e5a2 | 1498 | it covers the entire region. */ |
1f5e848a | 1499 | if (! interval_has_some_properties (properties, i)) |
d418ef42 JA |
1500 | { |
1501 | int got = (LENGTH (i) - (s - i->position)); | |
1502 | if (got >= len) | |
1503 | return Qnil; | |
1504 | len -= got; | |
05d5b93e | 1505 | i = next_interval (i); |
d418ef42 | 1506 | } |
daa5e28f RS |
1507 | /* Split away the beginning of this interval; what we don't |
1508 | want to modify. */ | |
d418ef42 JA |
1509 | else |
1510 | { | |
1511 | unchanged = i; | |
ad9c1940 | 1512 | i = split_interval_right (unchanged, s - unchanged->position); |
d418ef42 | 1513 | copy_properties (unchanged, i); |
d418ef42 JA |
1514 | } |
1515 | } | |
1516 | ||
2a631db1 RS |
1517 | if (BUFFERP (object)) |
1518 | modify_region (XBUFFER (object), XINT (start), XINT (end)); | |
26c76ace | 1519 | |
d418ef42 | 1520 | /* We are at the beginning of an interval, with len to scan */ |
caa31568 | 1521 | for (;;) |
d418ef42 | 1522 | { |
d4b530ad RS |
1523 | if (i == 0) |
1524 | abort (); | |
1525 | ||
d418ef42 JA |
1526 | if (LENGTH (i) >= len) |
1527 | { | |
1f5e848a | 1528 | if (! interval_has_some_properties (properties, i)) |
d418ef42 JA |
1529 | return modified ? Qt : Qnil; |
1530 | ||
1531 | if (LENGTH (i) == len) | |
1532 | { | |
11713b6d RS |
1533 | remove_properties (properties, Qnil, i, object); |
1534 | if (BUFFERP (object)) | |
1535 | signal_after_change (XINT (start), XINT (end) - XINT (start), | |
1536 | XINT (end) - XINT (start)); | |
1537 | return Qt; | |
1538 | } | |
1539 | ||
1540 | /* i has the properties, and goes past the change limit */ | |
1541 | unchanged = i; | |
1542 | i = split_interval_left (i, len); | |
1543 | copy_properties (unchanged, i); | |
1544 | remove_properties (properties, Qnil, i, object); | |
1545 | if (BUFFERP (object)) | |
1546 | signal_after_change (XINT (start), XINT (end) - XINT (start), | |
1547 | XINT (end) - XINT (start)); | |
1548 | return Qt; | |
1549 | } | |
1550 | ||
1551 | len -= LENGTH (i); | |
1552 | modified += remove_properties (properties, Qnil, i, object); | |
1553 | i = next_interval (i); | |
1554 | } | |
1555 | } | |
1556 | ||
1557 | DEFUN ("remove-list-of-text-properties", Fremove_list_of_text_properties, | |
1558 | Sremove_list_of_text_properties, 3, 4, 0, | |
1559 | doc: /* Remove some properties from text from START to END. | |
1560 | The third argument LIST-OF-PROPERTIES is a list of property names to remove. | |
81f6e55f FP |
1561 | If the optional fourth argument OBJECT is a buffer (or nil, which means |
1562 | the current buffer), START and END are buffer positions (integers or | |
1563 | markers). If OBJECT is a string, START and END are 0-based indices into it. | |
11713b6d RS |
1564 | Return t if any property was actually removed, nil otherwise. */) |
1565 | (start, end, list_of_properties, object) | |
1566 | Lisp_Object start, end, list_of_properties, object; | |
1567 | { | |
1568 | register INTERVAL i, unchanged; | |
1569 | register int s, len, modified = 0; | |
1570 | Lisp_Object properties; | |
1571 | properties = list_of_properties; | |
1572 | ||
1573 | if (NILP (object)) | |
1574 | XSETBUFFER (object, current_buffer); | |
1575 | ||
1576 | i = validate_interval_range (object, &start, &end, soft); | |
1577 | if (NULL_INTERVAL_P (i)) | |
1578 | return Qnil; | |
1579 | ||
1580 | s = XINT (start); | |
1581 | len = XINT (end) - s; | |
1582 | ||
1583 | if (i->position != s) | |
1584 | { | |
1585 | /* No properties on this first interval -- return if | |
1586 | it covers the entire region. */ | |
1587 | if (! interval_has_some_properties_list (properties, i)) | |
1588 | { | |
1589 | int got = (LENGTH (i) - (s - i->position)); | |
1590 | if (got >= len) | |
1591 | return Qnil; | |
1592 | len -= got; | |
1593 | i = next_interval (i); | |
1594 | } | |
1595 | /* Split away the beginning of this interval; what we don't | |
1596 | want to modify. */ | |
1597 | else | |
1598 | { | |
1599 | unchanged = i; | |
1600 | i = split_interval_right (unchanged, s - unchanged->position); | |
1601 | copy_properties (unchanged, i); | |
1602 | } | |
1603 | } | |
1604 | ||
1605 | if (BUFFERP (object)) | |
1606 | modify_region (XBUFFER (object), XINT (start), XINT (end)); | |
1607 | ||
1608 | /* We are at the beginning of an interval, with len to scan */ | |
1609 | for (;;) | |
1610 | { | |
1611 | if (i == 0) | |
1612 | abort (); | |
1613 | ||
1614 | if (LENGTH (i) >= len) | |
1615 | { | |
1616 | if (! interval_has_some_properties_list (properties, i)) | |
1617 | return modified ? Qt : Qnil; | |
1618 | ||
1619 | if (LENGTH (i) == len) | |
1620 | { | |
1621 | remove_properties (Qnil, properties, i, object); | |
2a631db1 RS |
1622 | if (BUFFERP (object)) |
1623 | signal_after_change (XINT (start), XINT (end) - XINT (start), | |
1624 | XINT (end) - XINT (start)); | |
d418ef42 JA |
1625 | return Qt; |
1626 | } | |
1627 | ||
1628 | /* i has the properties, and goes past the change limit */ | |
daa5e28f | 1629 | unchanged = i; |
ad9c1940 | 1630 | i = split_interval_left (i, len); |
d418ef42 | 1631 | copy_properties (unchanged, i); |
11713b6d | 1632 | remove_properties (Qnil, properties, i, object); |
2a631db1 RS |
1633 | if (BUFFERP (object)) |
1634 | signal_after_change (XINT (start), XINT (end) - XINT (start), | |
1635 | XINT (end) - XINT (start)); | |
d418ef42 JA |
1636 | return Qt; |
1637 | } | |
1638 | ||
1639 | len -= LENGTH (i); | |
11713b6d | 1640 | modified += remove_properties (Qnil, properties, i, object); |
d418ef42 JA |
1641 | i = next_interval (i); |
1642 | } | |
1643 | } | |
fcab51aa | 1644 | \f |
ad9c1940 JB |
1645 | DEFUN ("text-property-any", Ftext_property_any, |
1646 | Stext_property_any, 4, 5, 0, | |
8c1a1077 PJ |
1647 | doc: /* Check text from START to END for property PROPERTY equalling VALUE. |
1648 | If so, return the position of the first character whose property PROPERTY | |
1649 | is `eq' to VALUE. Otherwise return nil. | |
81f6e55f FP |
1650 | If the optional fifth argument OBJECT is a buffer (or nil, which means |
1651 | the current buffer), START and END are buffer positions (integers or | |
1652 | markers). If OBJECT is a string, START and END are 0-based indices into it. */) | |
8c1a1077 PJ |
1653 | (start, end, property, value, object) |
1654 | Lisp_Object start, end, property, value, object; | |
ad9c1940 JB |
1655 | { |
1656 | register INTERVAL i; | |
1657 | register int e, pos; | |
1658 | ||
1659 | if (NILP (object)) | |
c8a4fc3d | 1660 | XSETBUFFER (object, current_buffer); |
ad9c1940 | 1661 | i = validate_interval_range (object, &start, &end, soft); |
2084fddb KH |
1662 | if (NULL_INTERVAL_P (i)) |
1663 | return (!NILP (value) || EQ (start, end) ? Qnil : start); | |
ad9c1940 JB |
1664 | e = XINT (end); |
1665 | ||
1666 | while (! NULL_INTERVAL_P (i)) | |
1667 | { | |
1668 | if (i->position >= e) | |
1669 | break; | |
1f5e848a | 1670 | if (EQ (textget (i->plist, property), value)) |
ad9c1940 JB |
1671 | { |
1672 | pos = i->position; | |
1673 | if (pos < XINT (start)) | |
1674 | pos = XINT (start); | |
ad077db0 | 1675 | return make_number (pos); |
ad9c1940 JB |
1676 | } |
1677 | i = next_interval (i); | |
1678 | } | |
1679 | return Qnil; | |
1680 | } | |
1681 | ||
1682 | DEFUN ("text-property-not-all", Ftext_property_not_all, | |
1683 | Stext_property_not_all, 4, 5, 0, | |
8c1a1077 PJ |
1684 | doc: /* Check text from START to END for property PROPERTY not equalling VALUE. |
1685 | If so, return the position of the first character whose property PROPERTY | |
1686 | is not `eq' to VALUE. Otherwise, return nil. | |
81f6e55f FP |
1687 | If the optional fifth argument OBJECT is a buffer (or nil, which means |
1688 | the current buffer), START and END are buffer positions (integers or | |
1689 | markers). If OBJECT is a string, START and END are 0-based indices into it. */) | |
8c1a1077 PJ |
1690 | (start, end, property, value, object) |
1691 | Lisp_Object start, end, property, value, object; | |
ad9c1940 JB |
1692 | { |
1693 | register INTERVAL i; | |
1694 | register int s, e; | |
1695 | ||
1696 | if (NILP (object)) | |
c8a4fc3d | 1697 | XSETBUFFER (object, current_buffer); |
ad9c1940 JB |
1698 | i = validate_interval_range (object, &start, &end, soft); |
1699 | if (NULL_INTERVAL_P (i)) | |
916a3119 | 1700 | return (NILP (value) || EQ (start, end)) ? Qnil : start; |
ad9c1940 JB |
1701 | s = XINT (start); |
1702 | e = XINT (end); | |
1703 | ||
1704 | while (! NULL_INTERVAL_P (i)) | |
1705 | { | |
1706 | if (i->position >= e) | |
1707 | break; | |
1f5e848a | 1708 | if (! EQ (textget (i->plist, property), value)) |
ad9c1940 JB |
1709 | { |
1710 | if (i->position > s) | |
1711 | s = i->position; | |
ad077db0 | 1712 | return make_number (s); |
ad9c1940 JB |
1713 | } |
1714 | i = next_interval (i); | |
1715 | } | |
1716 | return Qnil; | |
1717 | } | |
e138dfdc MB |
1718 | |
1719 | \f | |
1720 | /* Return the direction from which the text-property PROP would be | |
1721 | inherited by any new text inserted at POS: 1 if it would be | |
1722 | inherited from the char after POS, -1 if it would be inherited from | |
6f716644 SM |
1723 | the char before POS, and 0 if from neither. |
1724 | BUFFER can be either a buffer or nil (meaning current buffer). */ | |
e138dfdc MB |
1725 | |
1726 | int | |
6f716644 SM |
1727 | text_property_stickiness (prop, pos, buffer) |
1728 | Lisp_Object prop, pos, buffer; | |
e138dfdc MB |
1729 | { |
1730 | Lisp_Object prev_pos, front_sticky; | |
1731 | int is_rear_sticky = 1, is_front_sticky = 0; /* defaults */ | |
1732 | ||
6f716644 SM |
1733 | if (NILP (buffer)) |
1734 | XSETBUFFER (buffer, current_buffer); | |
1735 | ||
1736 | if (XINT (pos) > BUF_BEGV (XBUFFER (buffer))) | |
e138dfdc MB |
1737 | /* Consider previous character. */ |
1738 | { | |
1739 | Lisp_Object rear_non_sticky; | |
1740 | ||
1741 | prev_pos = make_number (XINT (pos) - 1); | |
6f716644 | 1742 | rear_non_sticky = Fget_text_property (prev_pos, Qrear_nonsticky, buffer); |
e138dfdc MB |
1743 | |
1744 | if (!NILP (CONSP (rear_non_sticky) | |
1745 | ? Fmemq (prop, rear_non_sticky) | |
1746 | : rear_non_sticky)) | |
1747 | /* PROP is rear-non-sticky. */ | |
1748 | is_rear_sticky = 0; | |
1749 | } | |
1750 | ||
1751 | /* Consider following character. */ | |
6f716644 | 1752 | front_sticky = Fget_text_property (pos, Qfront_sticky, buffer); |
e138dfdc MB |
1753 | |
1754 | if (EQ (front_sticky, Qt) | |
1755 | || (CONSP (front_sticky) | |
1756 | && !NILP (Fmemq (prop, front_sticky)))) | |
1757 | /* PROP is inherited from after. */ | |
1758 | is_front_sticky = 1; | |
1759 | ||
1760 | /* Simple cases, where the properties are consistent. */ | |
1761 | if (is_rear_sticky && !is_front_sticky) | |
1762 | return -1; | |
1763 | else if (!is_rear_sticky && is_front_sticky) | |
1764 | return 1; | |
1765 | else if (!is_rear_sticky && !is_front_sticky) | |
1766 | return 0; | |
1767 | ||
1768 | /* The stickiness properties are inconsistent, so we have to | |
1769 | disambiguate. Basically, rear-sticky wins, _except_ if the | |
1770 | property that would be inherited has a value of nil, in which case | |
1771 | front-sticky wins. */ | |
6f716644 SM |
1772 | if (XINT (pos) == BUF_BEGV (XBUFFER (buffer)) |
1773 | || NILP (Fget_text_property (prev_pos, prop, buffer))) | |
e138dfdc MB |
1774 | return 1; |
1775 | else | |
1776 | return -1; | |
1777 | } | |
1778 | ||
fcab51aa | 1779 | \f |
15e4954b JB |
1780 | /* I don't think this is the right interface to export; how often do you |
1781 | want to do something like this, other than when you're copying objects | |
1782 | around? | |
1783 | ||
1784 | I think it would be better to have a pair of functions, one which | |
1785 | returns the text properties of a region as a list of ranges and | |
1786 | plists, and another which applies such a list to another object. */ | |
1787 | ||
c98da214 RS |
1788 | /* Add properties from SRC to SRC of SRC, starting at POS in DEST. |
1789 | SRC and DEST may each refer to strings or buffers. | |
1790 | Optional sixth argument PROP causes only that property to be copied. | |
1791 | Properties are copied to DEST as if by `add-text-properties'. | |
1792 | Return t if any property value actually changed, nil otherwise. */ | |
1793 | ||
1794 | /* Note this can GC when DEST is a buffer. */ | |
ad077db0 | 1795 | |
15e4954b JB |
1796 | Lisp_Object |
1797 | copy_text_properties (start, end, src, pos, dest, prop) | |
1798 | Lisp_Object start, end, src, pos, dest, prop; | |
1799 | { | |
1800 | INTERVAL i; | |
1801 | Lisp_Object res; | |
1802 | Lisp_Object stuff; | |
1803 | Lisp_Object plist; | |
1804 | int s, e, e2, p, len, modified = 0; | |
c98da214 | 1805 | struct gcpro gcpro1, gcpro2; |
15e4954b JB |
1806 | |
1807 | i = validate_interval_range (src, &start, &end, soft); | |
1808 | if (NULL_INTERVAL_P (i)) | |
1809 | return Qnil; | |
1810 | ||
b7826503 | 1811 | CHECK_NUMBER_COERCE_MARKER (pos); |
15e4954b JB |
1812 | { |
1813 | Lisp_Object dest_start, dest_end; | |
1814 | ||
1815 | dest_start = pos; | |
e9c4fbcd | 1816 | XSETFASTINT (dest_end, XINT (dest_start) + (XINT (end) - XINT (start))); |
15e4954b JB |
1817 | /* Apply this to a copy of pos; it will try to increment its arguments, |
1818 | which we don't want. */ | |
1819 | validate_interval_range (dest, &dest_start, &dest_end, soft); | |
1820 | } | |
1821 | ||
1822 | s = XINT (start); | |
1823 | e = XINT (end); | |
1824 | p = XINT (pos); | |
1825 | ||
1826 | stuff = Qnil; | |
1827 | ||
1828 | while (s < e) | |
1829 | { | |
1830 | e2 = i->position + LENGTH (i); | |
1831 | if (e2 > e) | |
1832 | e2 = e; | |
1833 | len = e2 - s; | |
1834 | ||
1835 | plist = i->plist; | |
1836 | if (! NILP (prop)) | |
1837 | while (! NILP (plist)) | |
1838 | { | |
1839 | if (EQ (Fcar (plist), prop)) | |
1840 | { | |
1841 | plist = Fcons (prop, Fcons (Fcar (Fcdr (plist)), Qnil)); | |
1842 | break; | |
1843 | } | |
1844 | plist = Fcdr (Fcdr (plist)); | |
1845 | } | |
1846 | if (! NILP (plist)) | |
1847 | { | |
1848 | /* Must defer modifications to the interval tree in case src | |
cdf3e5a2 | 1849 | and dest refer to the same string or buffer. */ |
15e4954b JB |
1850 | stuff = Fcons (Fcons (make_number (p), |
1851 | Fcons (make_number (p + len), | |
1852 | Fcons (plist, Qnil))), | |
1853 | stuff); | |
1854 | } | |
1855 | ||
1856 | i = next_interval (i); | |
1857 | if (NULL_INTERVAL_P (i)) | |
1858 | break; | |
1859 | ||
1860 | p += len; | |
1861 | s = i->position; | |
1862 | } | |
1863 | ||
c98da214 RS |
1864 | GCPRO2 (stuff, dest); |
1865 | ||
15e4954b JB |
1866 | while (! NILP (stuff)) |
1867 | { | |
1868 | res = Fcar (stuff); | |
1869 | res = Fadd_text_properties (Fcar (res), Fcar (Fcdr (res)), | |
1870 | Fcar (Fcdr (Fcdr (res))), dest); | |
1871 | if (! NILP (res)) | |
1872 | modified++; | |
1873 | stuff = Fcdr (stuff); | |
1874 | } | |
1875 | ||
c98da214 RS |
1876 | UNGCPRO; |
1877 | ||
15e4954b JB |
1878 | return modified ? Qt : Qnil; |
1879 | } | |
9dd7eec6 GM |
1880 | |
1881 | ||
1882 | /* Return a list representing the text properties of OBJECT between | |
1883 | START and END. if PROP is non-nil, report only on that property. | |
1884 | Each result list element has the form (S E PLIST), where S and E | |
1885 | are positions in OBJECT and PLIST is a property list containing the | |
1886 | text properties of OBJECT between S and E. Value is nil if OBJECT | |
1887 | doesn't contain text properties between START and END. */ | |
1888 | ||
1889 | Lisp_Object | |
1890 | text_property_list (object, start, end, prop) | |
1891 | Lisp_Object object, start, end, prop; | |
1892 | { | |
1893 | struct interval *i; | |
1894 | Lisp_Object result; | |
9dd7eec6 GM |
1895 | |
1896 | result = Qnil; | |
81f6e55f | 1897 | |
9dd7eec6 GM |
1898 | i = validate_interval_range (object, &start, &end, soft); |
1899 | if (!NULL_INTERVAL_P (i)) | |
1900 | { | |
1901 | int s = XINT (start); | |
1902 | int e = XINT (end); | |
81f6e55f | 1903 | |
9dd7eec6 GM |
1904 | while (s < e) |
1905 | { | |
1906 | int interval_end, len; | |
1907 | Lisp_Object plist; | |
81f6e55f | 1908 | |
9dd7eec6 GM |
1909 | interval_end = i->position + LENGTH (i); |
1910 | if (interval_end > e) | |
1911 | interval_end = e; | |
1912 | len = interval_end - s; | |
81f6e55f | 1913 | |
9dd7eec6 GM |
1914 | plist = i->plist; |
1915 | ||
1916 | if (!NILP (prop)) | |
1917 | for (; !NILP (plist); plist = Fcdr (Fcdr (plist))) | |
1918 | if (EQ (Fcar (plist), prop)) | |
1919 | { | |
1920 | plist = Fcons (prop, Fcons (Fcar (Fcdr (plist)), Qnil)); | |
1921 | break; | |
1922 | } | |
1923 | ||
1924 | if (!NILP (plist)) | |
1925 | result = Fcons (Fcons (make_number (s), | |
1926 | Fcons (make_number (s + len), | |
1927 | Fcons (plist, Qnil))), | |
1928 | result); | |
81f6e55f | 1929 | |
9dd7eec6 GM |
1930 | i = next_interval (i); |
1931 | if (NULL_INTERVAL_P (i)) | |
1932 | break; | |
1933 | s = i->position; | |
1934 | } | |
1935 | } | |
81f6e55f | 1936 | |
9dd7eec6 GM |
1937 | return result; |
1938 | } | |
1939 | ||
1940 | ||
1941 | /* Add text properties to OBJECT from LIST. LIST is a list of triples | |
1942 | (START END PLIST), where START and END are positions and PLIST is a | |
1943 | property list containing the text properties to add. Adjust START | |
1944 | and END positions by DELTA before adding properties. Value is | |
1945 | non-zero if OBJECT was modified. */ | |
1946 | ||
1947 | int | |
1948 | add_text_properties_from_list (object, list, delta) | |
1949 | Lisp_Object object, list, delta; | |
1950 | { | |
1951 | struct gcpro gcpro1, gcpro2; | |
1952 | int modified_p = 0; | |
81f6e55f | 1953 | |
9dd7eec6 | 1954 | GCPRO2 (list, object); |
81f6e55f | 1955 | |
9dd7eec6 GM |
1956 | for (; CONSP (list); list = XCDR (list)) |
1957 | { | |
1958 | Lisp_Object item, start, end, plist, tem; | |
81f6e55f | 1959 | |
9dd7eec6 GM |
1960 | item = XCAR (list); |
1961 | start = make_number (XINT (XCAR (item)) + XINT (delta)); | |
1962 | end = make_number (XINT (XCAR (XCDR (item))) + XINT (delta)); | |
1963 | plist = XCAR (XCDR (XCDR (item))); | |
81f6e55f | 1964 | |
9dd7eec6 GM |
1965 | tem = Fadd_text_properties (start, end, plist, object); |
1966 | if (!NILP (tem)) | |
1967 | modified_p = 1; | |
1968 | } | |
1969 | ||
1970 | UNGCPRO; | |
1971 | return modified_p; | |
1972 | } | |
1973 | ||
1974 | ||
1975 | ||
1976 | /* Modify end-points of ranges in LIST destructively. LIST is a list | |
1977 | as returned from text_property_list. Change end-points equal to | |
1978 | OLD_END to NEW_END. */ | |
1979 | ||
1980 | void | |
1981 | extend_property_ranges (list, old_end, new_end) | |
1982 | Lisp_Object list, old_end, new_end; | |
1983 | { | |
1984 | for (; CONSP (list); list = XCDR (list)) | |
1985 | { | |
1986 | Lisp_Object item, end; | |
81f6e55f | 1987 | |
9dd7eec6 GM |
1988 | item = XCAR (list); |
1989 | end = XCAR (XCDR (item)); | |
1990 | ||
1991 | if (EQ (end, old_end)) | |
f3fbd155 | 1992 | XSETCAR (XCDR (item), new_end); |
9dd7eec6 GM |
1993 | } |
1994 | } | |
1995 | ||
1996 | ||
318d2fa8 RS |
1997 | \f |
1998 | /* Call the modification hook functions in LIST, each with START and END. */ | |
1999 | ||
2000 | static void | |
2001 | call_mod_hooks (list, start, end) | |
2002 | Lisp_Object list, start, end; | |
2003 | { | |
2004 | struct gcpro gcpro1; | |
2005 | GCPRO1 (list); | |
2006 | while (!NILP (list)) | |
2007 | { | |
2008 | call2 (Fcar (list), start, end); | |
2009 | list = Fcdr (list); | |
2010 | } | |
2011 | UNGCPRO; | |
2012 | } | |
2013 | ||
96f90544 RS |
2014 | /* Check for read-only intervals between character positions START ... END, |
2015 | in BUF, and signal an error if we find one. | |
2016 | ||
2017 | Then check for any modification hooks in the range. | |
2018 | Create a list of all these hooks in lexicographic order, | |
2019 | eliminating consecutive extra copies of the same hook. Then call | |
2020 | those hooks in order, with START and END - 1 as arguments. */ | |
15e4954b | 2021 | |
318d2fa8 RS |
2022 | void |
2023 | verify_interval_modification (buf, start, end) | |
2024 | struct buffer *buf; | |
2025 | int start, end; | |
2026 | { | |
2027 | register INTERVAL intervals = BUF_INTERVALS (buf); | |
695f302f | 2028 | register INTERVAL i; |
318d2fa8 RS |
2029 | Lisp_Object hooks; |
2030 | register Lisp_Object prev_mod_hooks; | |
2031 | Lisp_Object mod_hooks; | |
2032 | struct gcpro gcpro1; | |
2033 | ||
2034 | hooks = Qnil; | |
2035 | prev_mod_hooks = Qnil; | |
2036 | mod_hooks = Qnil; | |
2037 | ||
2038 | interval_insert_behind_hooks = Qnil; | |
2039 | interval_insert_in_front_hooks = Qnil; | |
2040 | ||
2041 | if (NULL_INTERVAL_P (intervals)) | |
2042 | return; | |
2043 | ||
2044 | if (start > end) | |
2045 | { | |
2046 | int temp = start; | |
2047 | start = end; | |
2048 | end = temp; | |
2049 | } | |
2050 | ||
2051 | /* For an insert operation, check the two chars around the position. */ | |
2052 | if (start == end) | |
2053 | { | |
7cb66899 | 2054 | INTERVAL prev = NULL; |
318d2fa8 RS |
2055 | Lisp_Object before, after; |
2056 | ||
2057 | /* Set I to the interval containing the char after START, | |
2058 | and PREV to the interval containing the char before START. | |
2059 | Either one may be null. They may be equal. */ | |
2060 | i = find_interval (intervals, start); | |
2061 | ||
2062 | if (start == BUF_BEGV (buf)) | |
2063 | prev = 0; | |
2064 | else if (i->position == start) | |
2065 | prev = previous_interval (i); | |
2066 | else if (i->position < start) | |
2067 | prev = i; | |
2068 | if (start == BUF_ZV (buf)) | |
2069 | i = 0; | |
2070 | ||
2071 | /* If Vinhibit_read_only is set and is not a list, we can | |
2072 | skip the read_only checks. */ | |
2073 | if (NILP (Vinhibit_read_only) || CONSP (Vinhibit_read_only)) | |
2074 | { | |
2075 | /* If I and PREV differ we need to check for the read-only | |
cdf3e5a2 | 2076 | property together with its stickiness. If either I or |
318d2fa8 RS |
2077 | PREV are 0, this check is all we need. |
2078 | We have to take special care, since read-only may be | |
2079 | indirectly defined via the category property. */ | |
2080 | if (i != prev) | |
2081 | { | |
2082 | if (! NULL_INTERVAL_P (i)) | |
2083 | { | |
2084 | after = textget (i->plist, Qread_only); | |
81f6e55f | 2085 | |
318d2fa8 RS |
2086 | /* If interval I is read-only and read-only is |
2087 | front-sticky, inhibit insertion. | |
2088 | Check for read-only as well as category. */ | |
2089 | if (! NILP (after) | |
2090 | && NILP (Fmemq (after, Vinhibit_read_only))) | |
2091 | { | |
2092 | Lisp_Object tem; | |
2093 | ||
2094 | tem = textget (i->plist, Qfront_sticky); | |
2095 | if (TMEM (Qread_only, tem) | |
2096 | || (NILP (Fplist_get (i->plist, Qread_only)) | |
2097 | && TMEM (Qcategory, tem))) | |
bcf97349 | 2098 | text_read_only (after); |
318d2fa8 RS |
2099 | } |
2100 | } | |
2101 | ||
2102 | if (! NULL_INTERVAL_P (prev)) | |
2103 | { | |
2104 | before = textget (prev->plist, Qread_only); | |
81f6e55f | 2105 | |
318d2fa8 RS |
2106 | /* If interval PREV is read-only and read-only isn't |
2107 | rear-nonsticky, inhibit insertion. | |
2108 | Check for read-only as well as category. */ | |
2109 | if (! NILP (before) | |
2110 | && NILP (Fmemq (before, Vinhibit_read_only))) | |
2111 | { | |
2112 | Lisp_Object tem; | |
2113 | ||
2114 | tem = textget (prev->plist, Qrear_nonsticky); | |
2115 | if (! TMEM (Qread_only, tem) | |
2116 | && (! NILP (Fplist_get (prev->plist,Qread_only)) | |
2117 | || ! TMEM (Qcategory, tem))) | |
bcf97349 | 2118 | text_read_only (before); |
318d2fa8 RS |
2119 | } |
2120 | } | |
2121 | } | |
2122 | else if (! NULL_INTERVAL_P (i)) | |
2123 | { | |
2124 | after = textget (i->plist, Qread_only); | |
81f6e55f | 2125 | |
318d2fa8 RS |
2126 | /* If interval I is read-only and read-only is |
2127 | front-sticky, inhibit insertion. | |
2128 | Check for read-only as well as category. */ | |
2129 | if (! NILP (after) && NILP (Fmemq (after, Vinhibit_read_only))) | |
2130 | { | |
2131 | Lisp_Object tem; | |
2132 | ||
2133 | tem = textget (i->plist, Qfront_sticky); | |
2134 | if (TMEM (Qread_only, tem) | |
2135 | || (NILP (Fplist_get (i->plist, Qread_only)) | |
2136 | && TMEM (Qcategory, tem))) | |
bcf97349 | 2137 | text_read_only (after); |
318d2fa8 RS |
2138 | |
2139 | tem = textget (prev->plist, Qrear_nonsticky); | |
2140 | if (! TMEM (Qread_only, tem) | |
2141 | && (! NILP (Fplist_get (prev->plist, Qread_only)) | |
2142 | || ! TMEM (Qcategory, tem))) | |
bcf97349 | 2143 | text_read_only (after); |
318d2fa8 RS |
2144 | } |
2145 | } | |
2146 | } | |
2147 | ||
2148 | /* Run both insert hooks (just once if they're the same). */ | |
2149 | if (!NULL_INTERVAL_P (prev)) | |
2150 | interval_insert_behind_hooks | |
2151 | = textget (prev->plist, Qinsert_behind_hooks); | |
2152 | if (!NULL_INTERVAL_P (i)) | |
2153 | interval_insert_in_front_hooks | |
2154 | = textget (i->plist, Qinsert_in_front_hooks); | |
2155 | } | |
0ba7995b | 2156 | else |
318d2fa8 RS |
2157 | { |
2158 | /* Loop over intervals on or next to START...END, | |
2159 | collecting their hooks. */ | |
2160 | ||
2161 | i = find_interval (intervals, start); | |
2162 | do | |
2163 | { | |
2164 | if (! INTERVAL_WRITABLE_P (i)) | |
bcf97349 | 2165 | text_read_only (textget (i->plist, Qread_only)); |
318d2fa8 | 2166 | |
0ba7995b | 2167 | if (!inhibit_modification_hooks) |
318d2fa8 | 2168 | { |
0ba7995b GM |
2169 | mod_hooks = textget (i->plist, Qmodification_hooks); |
2170 | if (! NILP (mod_hooks) && ! EQ (mod_hooks, prev_mod_hooks)) | |
2171 | { | |
2172 | hooks = Fcons (mod_hooks, hooks); | |
2173 | prev_mod_hooks = mod_hooks; | |
2174 | } | |
318d2fa8 RS |
2175 | } |
2176 | ||
2177 | i = next_interval (i); | |
2178 | } | |
2179 | /* Keep going thru the interval containing the char before END. */ | |
2180 | while (! NULL_INTERVAL_P (i) && i->position < end); | |
2181 | ||
0ba7995b | 2182 | if (!inhibit_modification_hooks) |
318d2fa8 | 2183 | { |
0ba7995b GM |
2184 | GCPRO1 (hooks); |
2185 | hooks = Fnreverse (hooks); | |
2186 | while (! EQ (hooks, Qnil)) | |
2187 | { | |
2188 | call_mod_hooks (Fcar (hooks), make_number (start), | |
2189 | make_number (end)); | |
2190 | hooks = Fcdr (hooks); | |
2191 | } | |
2192 | UNGCPRO; | |
318d2fa8 | 2193 | } |
318d2fa8 RS |
2194 | } |
2195 | } | |
2196 | ||
96f90544 | 2197 | /* Run the interval hooks for an insertion on character range START ... END. |
318d2fa8 RS |
2198 | verify_interval_modification chose which hooks to run; |
2199 | this function is called after the insertion happens | |
2200 | so it can indicate the range of inserted text. */ | |
2201 | ||
2202 | void | |
2203 | report_interval_modification (start, end) | |
2204 | Lisp_Object start, end; | |
2205 | { | |
2206 | if (! NILP (interval_insert_behind_hooks)) | |
2e34157c | 2207 | call_mod_hooks (interval_insert_behind_hooks, start, end); |
318d2fa8 RS |
2208 | if (! NILP (interval_insert_in_front_hooks) |
2209 | && ! EQ (interval_insert_in_front_hooks, | |
2210 | interval_insert_behind_hooks)) | |
2e34157c | 2211 | call_mod_hooks (interval_insert_in_front_hooks, start, end); |
318d2fa8 RS |
2212 | } |
2213 | \f | |
d418ef42 JA |
2214 | void |
2215 | syms_of_textprop () | |
2216 | { | |
ad1b2f20 | 2217 | DEFVAR_LISP ("default-text-properties", &Vdefault_text_properties, |
8c1a1077 PJ |
2218 | doc: /* Property-list used as default values. |
2219 | The value of a property in this list is seen as the value for every | |
2220 | character that does not have its own value for that property. */); | |
ad1b2f20 | 2221 | Vdefault_text_properties = Qnil; |
c7dd82a3 | 2222 | |
49d110a8 CW |
2223 | DEFVAR_LISP ("char-property-alias-alist", &Vchar_property_alias_alist, |
2224 | doc: /* Alist of alternative properties for properties without a value. | |
2225 | Each element should look like (PROPERTY ALTERNATIVE1 ALTERNATIVE2...). | |
2226 | If a piece of text has no direct value for a particular property, then | |
2227 | this alist is consulted. If that property appears in the alist, then | |
2228 | the first non-nil value from the associated alternative properties is | |
2229 | returned. */); | |
2230 | Vchar_property_alias_alist = Qnil; | |
2231 | ||
688a5a0f | 2232 | DEFVAR_LISP ("inhibit-point-motion-hooks", &Vinhibit_point_motion_hooks, |
8c1a1077 PJ |
2233 | doc: /* If non-nil, don't run `point-left' and `point-entered' text properties. |
2234 | This also inhibits the use of the `intangible' text property. */); | |
688a5a0f | 2235 | Vinhibit_point_motion_hooks = Qnil; |
318d2fa8 | 2236 | |
abc2f676 KH |
2237 | DEFVAR_LISP ("text-property-default-nonsticky", |
2238 | &Vtext_property_default_nonsticky, | |
8c1a1077 PJ |
2239 | doc: /* Alist of properties vs the corresponding non-stickinesses. |
2240 | Each element has the form (PROPERTY . NONSTICKINESS). | |
2241 | ||
2242 | If a character in a buffer has PROPERTY, new text inserted adjacent to | |
2243 | the character doesn't inherit PROPERTY if NONSTICKINESS is non-nil, | |
2244 | inherits it if NONSTICKINESS is nil. The front-sticky and | |
2245 | rear-nonsticky properties of the character overrides NONSTICKINESS. */); | |
98ebf860 SM |
2246 | /* Text property `syntax-table' should be nonsticky by default. */ |
2247 | Vtext_property_default_nonsticky | |
2248 | = Fcons (Fcons (intern ("syntax-table"), Qt), Qnil); | |
abc2f676 | 2249 | |
318d2fa8 RS |
2250 | staticpro (&interval_insert_behind_hooks); |
2251 | staticpro (&interval_insert_in_front_hooks); | |
2252 | interval_insert_behind_hooks = Qnil; | |
2253 | interval_insert_in_front_hooks = Qnil; | |
2254 | ||
81f6e55f | 2255 | |
d418ef42 JA |
2256 | /* Common attributes one might give text */ |
2257 | ||
2258 | staticpro (&Qforeground); | |
2259 | Qforeground = intern ("foreground"); | |
2260 | staticpro (&Qbackground); | |
2261 | Qbackground = intern ("background"); | |
2262 | staticpro (&Qfont); | |
2263 | Qfont = intern ("font"); | |
2264 | staticpro (&Qstipple); | |
2265 | Qstipple = intern ("stipple"); | |
2266 | staticpro (&Qunderline); | |
2267 | Qunderline = intern ("underline"); | |
2268 | staticpro (&Qread_only); | |
2269 | Qread_only = intern ("read-only"); | |
2270 | staticpro (&Qinvisible); | |
2271 | Qinvisible = intern ("invisible"); | |
46b4e741 KH |
2272 | staticpro (&Qintangible); |
2273 | Qintangible = intern ("intangible"); | |
dc70cea7 RS |
2274 | staticpro (&Qcategory); |
2275 | Qcategory = intern ("category"); | |
2276 | staticpro (&Qlocal_map); | |
2277 | Qlocal_map = intern ("local-map"); | |
19e1c426 RS |
2278 | staticpro (&Qfront_sticky); |
2279 | Qfront_sticky = intern ("front-sticky"); | |
2280 | staticpro (&Qrear_nonsticky); | |
2281 | Qrear_nonsticky = intern ("rear-nonsticky"); | |
69bb837e RS |
2282 | staticpro (&Qmouse_face); |
2283 | Qmouse_face = intern ("mouse-face"); | |
d418ef42 JA |
2284 | |
2285 | /* Properties that text might use to specify certain actions */ | |
2286 | ||
2287 | staticpro (&Qmouse_left); | |
2288 | Qmouse_left = intern ("mouse-left"); | |
2289 | staticpro (&Qmouse_entered); | |
2290 | Qmouse_entered = intern ("mouse-entered"); | |
2291 | staticpro (&Qpoint_left); | |
2292 | Qpoint_left = intern ("point-left"); | |
2293 | staticpro (&Qpoint_entered); | |
2294 | Qpoint_entered = intern ("point-entered"); | |
d418ef42 JA |
2295 | |
2296 | defsubr (&Stext_properties_at); | |
5fbe2a44 | 2297 | defsubr (&Sget_text_property); |
eb769fd7 | 2298 | defsubr (&Sget_char_property); |
97a1bc63 | 2299 | defsubr (&Sget_char_property_and_overlay); |
fcab51aa RS |
2300 | defsubr (&Snext_char_property_change); |
2301 | defsubr (&Sprevious_char_property_change); | |
b7e047fb MB |
2302 | defsubr (&Snext_single_char_property_change); |
2303 | defsubr (&Sprevious_single_char_property_change); | |
d418ef42 | 2304 | defsubr (&Snext_property_change); |
9c79dd1b | 2305 | defsubr (&Snext_single_property_change); |
d418ef42 | 2306 | defsubr (&Sprevious_property_change); |
9c79dd1b | 2307 | defsubr (&Sprevious_single_property_change); |
d418ef42 | 2308 | defsubr (&Sadd_text_properties); |
d4b530ad | 2309 | defsubr (&Sput_text_property); |
d418ef42 JA |
2310 | defsubr (&Sset_text_properties); |
2311 | defsubr (&Sremove_text_properties); | |
11713b6d | 2312 | defsubr (&Sremove_list_of_text_properties); |
ad9c1940 JB |
2313 | defsubr (&Stext_property_any); |
2314 | defsubr (&Stext_property_not_all); | |
5fbe2a44 | 2315 | /* defsubr (&Serase_text_properties); */ |
15e4954b | 2316 | /* defsubr (&Scopy_text_properties); */ |
d418ef42 | 2317 | } |
ab5796a9 MB |
2318 | |
2319 | /* arch-tag: 454cdde8-5f86-4faa-a078-101e3625d479 | |
2320 | (do not change this comment) */ |