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