| 1 | /* Buffer manipulation primitives for GNU Emacs. |
| 2 | Copyright (C) 1985, 1986, 1987, 1988, 1989, 1993, 1994, |
| 3 | 1995, 1997, 1998, 1999, 2000, 2001, 2002, |
| 4 | 2003, 2004, 2005, 2006, 2007, 2008, 2009 |
| 5 | Free Software Foundation, Inc. |
| 6 | |
| 7 | This file is part of GNU Emacs. |
| 8 | |
| 9 | GNU Emacs is free software: you can redistribute it and/or modify |
| 10 | it under the terms of the GNU General Public License as published by |
| 11 | the Free Software Foundation, either version 3 of the License, or |
| 12 | (at your option) any later version. |
| 13 | |
| 14 | GNU Emacs is distributed in the hope that it will be useful, |
| 15 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 16 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 17 | GNU General Public License for more details. |
| 18 | |
| 19 | You should have received a copy of the GNU General Public License |
| 20 | along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>. */ |
| 21 | |
| 22 | #include <config.h> |
| 23 | |
| 24 | #include <sys/types.h> |
| 25 | #include <sys/stat.h> |
| 26 | #include <sys/param.h> |
| 27 | #include <errno.h> |
| 28 | #include <stdio.h> |
| 29 | |
| 30 | #ifndef USE_CRT_DLL |
| 31 | extern int errno; |
| 32 | #endif |
| 33 | |
| 34 | |
| 35 | #ifdef HAVE_UNISTD_H |
| 36 | #include <unistd.h> |
| 37 | #endif |
| 38 | |
| 39 | #include "lisp.h" |
| 40 | #include "intervals.h" |
| 41 | #include "window.h" |
| 42 | #include "commands.h" |
| 43 | #include "buffer.h" |
| 44 | #include "character.h" |
| 45 | #include "region-cache.h" |
| 46 | #include "indent.h" |
| 47 | #include "blockinput.h" |
| 48 | #include "keyboard.h" |
| 49 | #include "keymap.h" |
| 50 | #include "frame.h" |
| 51 | |
| 52 | struct buffer *current_buffer; /* the current buffer */ |
| 53 | |
| 54 | /* First buffer in chain of all buffers (in reverse order of creation). |
| 55 | Threaded through ->next. */ |
| 56 | |
| 57 | struct buffer *all_buffers; |
| 58 | |
| 59 | /* This structure holds the default values of the buffer-local variables |
| 60 | defined with DEFVAR_PER_BUFFER, that have special slots in each buffer. |
| 61 | The default value occupies the same slot in this structure |
| 62 | as an individual buffer's value occupies in that buffer. |
| 63 | Setting the default value also goes through the alist of buffers |
| 64 | and stores into each buffer that does not say it has a local value. */ |
| 65 | |
| 66 | DECL_ALIGN (struct buffer, buffer_defaults); |
| 67 | |
| 68 | /* A Lisp_Object pointer to the above, used for staticpro */ |
| 69 | |
| 70 | static Lisp_Object Vbuffer_defaults; |
| 71 | |
| 72 | /* This structure marks which slots in a buffer have corresponding |
| 73 | default values in buffer_defaults. |
| 74 | Each such slot has a nonzero value in this structure. |
| 75 | The value has only one nonzero bit. |
| 76 | |
| 77 | When a buffer has its own local value for a slot, |
| 78 | the entry for that slot (found in the same slot in this structure) |
| 79 | is turned on in the buffer's local_flags array. |
| 80 | |
| 81 | If a slot in this structure is -1, then even though there may |
| 82 | be a DEFVAR_PER_BUFFER for the slot, there is no default value for it; |
| 83 | and the corresponding slot in buffer_defaults is not used. |
| 84 | |
| 85 | If a slot is -2, then there is no DEFVAR_PER_BUFFER for it, |
| 86 | but there is a default value which is copied into each buffer. |
| 87 | |
| 88 | If a slot in this structure corresponding to a DEFVAR_PER_BUFFER is |
| 89 | zero, that is a bug */ |
| 90 | |
| 91 | struct buffer buffer_local_flags; |
| 92 | |
| 93 | /* This structure holds the names of symbols whose values may be |
| 94 | buffer-local. It is indexed and accessed in the same way as the above. */ |
| 95 | |
| 96 | DECL_ALIGN (struct buffer, buffer_local_symbols); |
| 97 | |
| 98 | /* A Lisp_Object pointer to the above, used for staticpro */ |
| 99 | static Lisp_Object Vbuffer_local_symbols; |
| 100 | |
| 101 | /* Flags indicating which built-in buffer-local variables |
| 102 | are permanent locals. */ |
| 103 | static char buffer_permanent_local_flags[MAX_PER_BUFFER_VARS]; |
| 104 | |
| 105 | /* Number of per-buffer variables used. */ |
| 106 | |
| 107 | int last_per_buffer_idx; |
| 108 | |
| 109 | EXFUN (Fset_buffer, 1); |
| 110 | void set_buffer_internal P_ ((struct buffer *b)); |
| 111 | void set_buffer_internal_1 P_ ((struct buffer *b)); |
| 112 | static void call_overlay_mod_hooks P_ ((Lisp_Object list, Lisp_Object overlay, |
| 113 | int after, Lisp_Object arg1, |
| 114 | Lisp_Object arg2, Lisp_Object arg3)); |
| 115 | static void swap_out_buffer_local_variables P_ ((struct buffer *b)); |
| 116 | static void reset_buffer_local_variables P_ ((struct buffer *b, int permanent_too)); |
| 117 | |
| 118 | /* Alist of all buffer names vs the buffers. */ |
| 119 | /* This used to be a variable, but is no longer, |
| 120 | to prevent lossage due to user rplac'ing this alist or its elements. */ |
| 121 | Lisp_Object Vbuffer_alist; |
| 122 | |
| 123 | /* Functions to call before and after each text change. */ |
| 124 | Lisp_Object Vbefore_change_functions; |
| 125 | Lisp_Object Vafter_change_functions; |
| 126 | |
| 127 | Lisp_Object Vtransient_mark_mode; |
| 128 | |
| 129 | /* t means ignore all read-only text properties. |
| 130 | A list means ignore such a property if its value is a member of the list. |
| 131 | Any non-nil value means ignore buffer-read-only. */ |
| 132 | Lisp_Object Vinhibit_read_only; |
| 133 | |
| 134 | /* List of functions to call that can query about killing a buffer. |
| 135 | If any of these functions returns nil, we don't kill it. */ |
| 136 | Lisp_Object Vkill_buffer_query_functions; |
| 137 | Lisp_Object Qkill_buffer_query_functions; |
| 138 | |
| 139 | /* Hook run before changing a major mode. */ |
| 140 | Lisp_Object Vchange_major_mode_hook, Qchange_major_mode_hook; |
| 141 | |
| 142 | /* List of functions to call before changing an unmodified buffer. */ |
| 143 | Lisp_Object Vfirst_change_hook; |
| 144 | |
| 145 | Lisp_Object Qfirst_change_hook; |
| 146 | Lisp_Object Qbefore_change_functions; |
| 147 | Lisp_Object Qafter_change_functions; |
| 148 | Lisp_Object Qucs_set_table_for_input; |
| 149 | |
| 150 | /* If nonzero, all modification hooks are suppressed. */ |
| 151 | int inhibit_modification_hooks; |
| 152 | |
| 153 | Lisp_Object Qfundamental_mode, Qmode_class, Qpermanent_local; |
| 154 | Lisp_Object Qpermanent_local_hook; |
| 155 | |
| 156 | Lisp_Object Qprotected_field; |
| 157 | |
| 158 | Lisp_Object QSFundamental; /* A string "Fundamental" */ |
| 159 | |
| 160 | Lisp_Object Qkill_buffer_hook; |
| 161 | |
| 162 | Lisp_Object Qget_file_buffer; |
| 163 | |
| 164 | Lisp_Object Qoverlayp; |
| 165 | |
| 166 | Lisp_Object Qpriority, Qwindow, Qevaporate, Qbefore_string, Qafter_string; |
| 167 | |
| 168 | Lisp_Object Qmodification_hooks; |
| 169 | Lisp_Object Qinsert_in_front_hooks; |
| 170 | Lisp_Object Qinsert_behind_hooks; |
| 171 | |
| 172 | static void alloc_buffer_text P_ ((struct buffer *, size_t)); |
| 173 | static void free_buffer_text P_ ((struct buffer *b)); |
| 174 | static struct Lisp_Overlay * copy_overlays P_ ((struct buffer *, struct Lisp_Overlay *)); |
| 175 | static void modify_overlay P_ ((struct buffer *, EMACS_INT, EMACS_INT)); |
| 176 | static Lisp_Object buffer_lisp_local_variables P_ ((struct buffer *)); |
| 177 | |
| 178 | extern char * emacs_strerror P_ ((int)); |
| 179 | |
| 180 | /* For debugging; temporary. See set_buffer_internal. */ |
| 181 | /* Lisp_Object Qlisp_mode, Vcheck_symbol; */ |
| 182 | |
| 183 | void |
| 184 | nsberror (spec) |
| 185 | Lisp_Object spec; |
| 186 | { |
| 187 | if (STRINGP (spec)) |
| 188 | error ("No buffer named %s", SDATA (spec)); |
| 189 | error ("Invalid buffer argument"); |
| 190 | } |
| 191 | \f |
| 192 | DEFUN ("buffer-live-p", Fbuffer_live_p, Sbuffer_live_p, 1, 1, 0, |
| 193 | doc: /* Return non-nil if OBJECT is a buffer which has not been killed. |
| 194 | Value is nil if OBJECT is not a buffer or if it has been killed. */) |
| 195 | (object) |
| 196 | Lisp_Object object; |
| 197 | { |
| 198 | return ((BUFFERP (object) && ! NILP (XBUFFER (object)->name)) |
| 199 | ? Qt : Qnil); |
| 200 | } |
| 201 | |
| 202 | DEFUN ("buffer-list", Fbuffer_list, Sbuffer_list, 0, 1, 0, |
| 203 | doc: /* Return a list of all existing live buffers. |
| 204 | If the optional arg FRAME is a frame, we return the buffer list |
| 205 | in the proper order for that frame: the buffers in FRAME's `buffer-list' |
| 206 | frame parameter come first, followed by the rest of the buffers. */) |
| 207 | (frame) |
| 208 | Lisp_Object frame; |
| 209 | { |
| 210 | Lisp_Object general; |
| 211 | general = Fmapcar (Qcdr, Vbuffer_alist); |
| 212 | |
| 213 | if (FRAMEP (frame)) |
| 214 | { |
| 215 | Lisp_Object framelist, prevlist, tail; |
| 216 | Lisp_Object args[3]; |
| 217 | |
| 218 | CHECK_FRAME (frame); |
| 219 | |
| 220 | framelist = Fcopy_sequence (XFRAME (frame)->buffer_list); |
| 221 | prevlist = Fnreverse (Fcopy_sequence (XFRAME (frame)->buried_buffer_list)); |
| 222 | |
| 223 | /* Remove from GENERAL any buffer that duplicates one in |
| 224 | FRAMELIST or PREVLIST. */ |
| 225 | tail = framelist; |
| 226 | while (CONSP (tail)) |
| 227 | { |
| 228 | general = Fdelq (XCAR (tail), general); |
| 229 | tail = XCDR (tail); |
| 230 | } |
| 231 | tail = prevlist; |
| 232 | while (CONSP (tail)) |
| 233 | { |
| 234 | general = Fdelq (XCAR (tail), general); |
| 235 | tail = XCDR (tail); |
| 236 | } |
| 237 | |
| 238 | args[0] = framelist; |
| 239 | args[1] = general; |
| 240 | args[2] = prevlist; |
| 241 | return Fnconc (3, args); |
| 242 | } |
| 243 | |
| 244 | return general; |
| 245 | } |
| 246 | |
| 247 | /* Like Fassoc, but use Fstring_equal to compare |
| 248 | (which ignores text properties), |
| 249 | and don't ever QUIT. */ |
| 250 | |
| 251 | static Lisp_Object |
| 252 | assoc_ignore_text_properties (key, list) |
| 253 | register Lisp_Object key; |
| 254 | Lisp_Object list; |
| 255 | { |
| 256 | register Lisp_Object tail; |
| 257 | for (tail = list; CONSP (tail); tail = XCDR (tail)) |
| 258 | { |
| 259 | register Lisp_Object elt, tem; |
| 260 | elt = XCAR (tail); |
| 261 | tem = Fstring_equal (Fcar (elt), key); |
| 262 | if (!NILP (tem)) |
| 263 | return elt; |
| 264 | } |
| 265 | return Qnil; |
| 266 | } |
| 267 | |
| 268 | DEFUN ("get-buffer", Fget_buffer, Sget_buffer, 1, 1, 0, |
| 269 | doc: /* Return the buffer named BUFFER-OR-NAME. |
| 270 | BUFFER-OR-NAME must be either a string or a buffer. If BUFFER-OR-NAME |
| 271 | is a string and there is no buffer with that name, return nil. If |
| 272 | BUFFER-OR-NAME is a buffer, return it as given. */) |
| 273 | (buffer_or_name) |
| 274 | register Lisp_Object buffer_or_name; |
| 275 | { |
| 276 | if (BUFFERP (buffer_or_name)) |
| 277 | return buffer_or_name; |
| 278 | CHECK_STRING (buffer_or_name); |
| 279 | |
| 280 | return Fcdr (assoc_ignore_text_properties (buffer_or_name, Vbuffer_alist)); |
| 281 | } |
| 282 | |
| 283 | DEFUN ("get-file-buffer", Fget_file_buffer, Sget_file_buffer, 1, 1, 0, |
| 284 | doc: /* Return the buffer visiting file FILENAME (a string). |
| 285 | The buffer's `buffer-file-name' must match exactly the expansion of FILENAME. |
| 286 | If there is no such live buffer, return nil. |
| 287 | See also `find-buffer-visiting'. */) |
| 288 | (filename) |
| 289 | register Lisp_Object filename; |
| 290 | { |
| 291 | register Lisp_Object tail, buf, tem; |
| 292 | Lisp_Object handler; |
| 293 | |
| 294 | CHECK_STRING (filename); |
| 295 | filename = Fexpand_file_name (filename, Qnil); |
| 296 | |
| 297 | /* If the file name has special constructs in it, |
| 298 | call the corresponding file handler. */ |
| 299 | handler = Ffind_file_name_handler (filename, Qget_file_buffer); |
| 300 | if (!NILP (handler)) |
| 301 | return call2 (handler, Qget_file_buffer, filename); |
| 302 | |
| 303 | for (tail = Vbuffer_alist; CONSP (tail); tail = XCDR (tail)) |
| 304 | { |
| 305 | buf = Fcdr (XCAR (tail)); |
| 306 | if (!BUFFERP (buf)) continue; |
| 307 | if (!STRINGP (XBUFFER (buf)->filename)) continue; |
| 308 | tem = Fstring_equal (XBUFFER (buf)->filename, filename); |
| 309 | if (!NILP (tem)) |
| 310 | return buf; |
| 311 | } |
| 312 | return Qnil; |
| 313 | } |
| 314 | |
| 315 | Lisp_Object |
| 316 | get_truename_buffer (filename) |
| 317 | register Lisp_Object filename; |
| 318 | { |
| 319 | register Lisp_Object tail, buf, tem; |
| 320 | |
| 321 | for (tail = Vbuffer_alist; CONSP (tail); tail = XCDR (tail)) |
| 322 | { |
| 323 | buf = Fcdr (XCAR (tail)); |
| 324 | if (!BUFFERP (buf)) continue; |
| 325 | if (!STRINGP (XBUFFER (buf)->file_truename)) continue; |
| 326 | tem = Fstring_equal (XBUFFER (buf)->file_truename, filename); |
| 327 | if (!NILP (tem)) |
| 328 | return buf; |
| 329 | } |
| 330 | return Qnil; |
| 331 | } |
| 332 | |
| 333 | /* Incremented for each buffer created, to assign the buffer number. */ |
| 334 | int buffer_count; |
| 335 | |
| 336 | DEFUN ("get-buffer-create", Fget_buffer_create, Sget_buffer_create, 1, 1, 0, |
| 337 | doc: /* Return the buffer specified by BUFFER-OR-NAME, creating a new one if needed. |
| 338 | If BUFFER-OR-NAME is a string and a live buffer with that name exists, |
| 339 | return that buffer. If no such buffer exists, create a new buffer with |
| 340 | that name and return it. If BUFFER-OR-NAME starts with a space, the new |
| 341 | buffer does not keep undo information. |
| 342 | |
| 343 | If BUFFER-OR-NAME is a buffer instead of a string, return it as given, |
| 344 | even if it is dead. The return value is never nil. */) |
| 345 | (buffer_or_name) |
| 346 | register Lisp_Object buffer_or_name; |
| 347 | { |
| 348 | register Lisp_Object buffer, name; |
| 349 | register struct buffer *b; |
| 350 | |
| 351 | buffer = Fget_buffer (buffer_or_name); |
| 352 | if (!NILP (buffer)) |
| 353 | return buffer; |
| 354 | |
| 355 | if (SCHARS (buffer_or_name) == 0) |
| 356 | error ("Empty string for buffer name is not allowed"); |
| 357 | |
| 358 | b = allocate_buffer (); |
| 359 | |
| 360 | /* An ordinary buffer uses its own struct buffer_text. */ |
| 361 | b->text = &b->own_text; |
| 362 | b->base_buffer = 0; |
| 363 | |
| 364 | BUF_GAP_SIZE (b) = 20; |
| 365 | BLOCK_INPUT; |
| 366 | /* We allocate extra 1-byte at the tail and keep it always '\0' for |
| 367 | anchoring a search. */ |
| 368 | alloc_buffer_text (b, BUF_GAP_SIZE (b) + 1); |
| 369 | UNBLOCK_INPUT; |
| 370 | if (! BUF_BEG_ADDR (b)) |
| 371 | buffer_memory_full (); |
| 372 | |
| 373 | BUF_PT (b) = BEG; |
| 374 | BUF_GPT (b) = BEG; |
| 375 | BUF_BEGV (b) = BEG; |
| 376 | BUF_ZV (b) = BEG; |
| 377 | BUF_Z (b) = BEG; |
| 378 | BUF_PT_BYTE (b) = BEG_BYTE; |
| 379 | BUF_GPT_BYTE (b) = BEG_BYTE; |
| 380 | BUF_BEGV_BYTE (b) = BEG_BYTE; |
| 381 | BUF_ZV_BYTE (b) = BEG_BYTE; |
| 382 | BUF_Z_BYTE (b) = BEG_BYTE; |
| 383 | BUF_MODIFF (b) = 1; |
| 384 | BUF_CHARS_MODIFF (b) = 1; |
| 385 | BUF_OVERLAY_MODIFF (b) = 1; |
| 386 | BUF_SAVE_MODIFF (b) = 1; |
| 387 | BUF_INTERVALS (b) = 0; |
| 388 | BUF_UNCHANGED_MODIFIED (b) = 1; |
| 389 | BUF_OVERLAY_UNCHANGED_MODIFIED (b) = 1; |
| 390 | BUF_END_UNCHANGED (b) = 0; |
| 391 | BUF_BEG_UNCHANGED (b) = 0; |
| 392 | *(BUF_GPT_ADDR (b)) = *(BUF_Z_ADDR (b)) = 0; /* Put an anchor '\0'. */ |
| 393 | |
| 394 | b->newline_cache = 0; |
| 395 | b->width_run_cache = 0; |
| 396 | b->width_table = Qnil; |
| 397 | b->prevent_redisplay_optimizations_p = 1; |
| 398 | |
| 399 | /* Put this on the chain of all buffers including killed ones. */ |
| 400 | b->next = all_buffers; |
| 401 | all_buffers = b; |
| 402 | |
| 403 | /* An ordinary buffer normally doesn't need markers |
| 404 | to handle BEGV and ZV. */ |
| 405 | b->pt_marker = Qnil; |
| 406 | b->begv_marker = Qnil; |
| 407 | b->zv_marker = Qnil; |
| 408 | |
| 409 | name = Fcopy_sequence (buffer_or_name); |
| 410 | STRING_SET_INTERVALS (name, NULL_INTERVAL); |
| 411 | b->name = name; |
| 412 | |
| 413 | b->undo_list = (SREF (name, 0) != ' ') ? Qnil : Qt; |
| 414 | |
| 415 | reset_buffer (b); |
| 416 | reset_buffer_local_variables (b, 1); |
| 417 | |
| 418 | b->mark = Fmake_marker (); |
| 419 | BUF_MARKERS (b) = NULL; |
| 420 | b->name = name; |
| 421 | |
| 422 | /* Put this in the alist of all live buffers. */ |
| 423 | XSETBUFFER (buffer, b); |
| 424 | Vbuffer_alist = nconc2 (Vbuffer_alist, Fcons (Fcons (name, buffer), Qnil)); |
| 425 | |
| 426 | /* An error in calling the function here (should someone redefine it) |
| 427 | can lead to infinite regress until you run out of stack. rms |
| 428 | says that's not worth protecting against. */ |
| 429 | if (!NILP (Ffboundp (Qucs_set_table_for_input))) |
| 430 | /* buffer is on buffer-alist, so no gcpro. */ |
| 431 | call1 (Qucs_set_table_for_input, buffer); |
| 432 | |
| 433 | return buffer; |
| 434 | } |
| 435 | |
| 436 | |
| 437 | /* Return a list of overlays which is a copy of the overlay list |
| 438 | LIST, but for buffer B. */ |
| 439 | |
| 440 | static struct Lisp_Overlay * |
| 441 | copy_overlays (b, list) |
| 442 | struct buffer *b; |
| 443 | struct Lisp_Overlay *list; |
| 444 | { |
| 445 | Lisp_Object buffer; |
| 446 | struct Lisp_Overlay *result = NULL, *tail = NULL; |
| 447 | |
| 448 | XSETBUFFER (buffer, b); |
| 449 | |
| 450 | for (; list; list = list->next) |
| 451 | { |
| 452 | Lisp_Object overlay, start, end, old_overlay; |
| 453 | EMACS_INT charpos; |
| 454 | |
| 455 | XSETMISC (old_overlay, list); |
| 456 | charpos = marker_position (OVERLAY_START (old_overlay)); |
| 457 | start = Fmake_marker (); |
| 458 | Fset_marker (start, make_number (charpos), buffer); |
| 459 | XMARKER (start)->insertion_type |
| 460 | = XMARKER (OVERLAY_START (old_overlay))->insertion_type; |
| 461 | |
| 462 | charpos = marker_position (OVERLAY_END (old_overlay)); |
| 463 | end = Fmake_marker (); |
| 464 | Fset_marker (end, make_number (charpos), buffer); |
| 465 | XMARKER (end)->insertion_type |
| 466 | = XMARKER (OVERLAY_END (old_overlay))->insertion_type; |
| 467 | |
| 468 | overlay = allocate_misc (); |
| 469 | XMISCTYPE (overlay) = Lisp_Misc_Overlay; |
| 470 | OVERLAY_START (overlay) = start; |
| 471 | OVERLAY_END (overlay) = end; |
| 472 | OVERLAY_PLIST (overlay) = Fcopy_sequence (OVERLAY_PLIST (old_overlay)); |
| 473 | XOVERLAY (overlay)->next = NULL; |
| 474 | |
| 475 | if (tail) |
| 476 | tail = tail->next = XOVERLAY (overlay); |
| 477 | else |
| 478 | result = tail = XOVERLAY (overlay); |
| 479 | } |
| 480 | |
| 481 | return result; |
| 482 | } |
| 483 | |
| 484 | |
| 485 | /* Clone per-buffer values of buffer FROM. |
| 486 | |
| 487 | Buffer TO gets the same per-buffer values as FROM, with the |
| 488 | following exceptions: (1) TO's name is left untouched, (2) markers |
| 489 | are copied and made to refer to TO, and (3) overlay lists are |
| 490 | copied. */ |
| 491 | |
| 492 | static void |
| 493 | clone_per_buffer_values (from, to) |
| 494 | struct buffer *from, *to; |
| 495 | { |
| 496 | Lisp_Object to_buffer; |
| 497 | int offset; |
| 498 | |
| 499 | XSETBUFFER (to_buffer, to); |
| 500 | |
| 501 | /* buffer-local Lisp variables start at `undo_list', |
| 502 | tho only the ones from `name' on are GC'd normally. */ |
| 503 | for (offset = PER_BUFFER_VAR_OFFSET (undo_list); |
| 504 | offset < sizeof *to; |
| 505 | offset += sizeof (Lisp_Object)) |
| 506 | { |
| 507 | Lisp_Object obj; |
| 508 | |
| 509 | /* Don't touch the `name' which should be unique for every buffer. */ |
| 510 | if (offset == PER_BUFFER_VAR_OFFSET (name)) |
| 511 | continue; |
| 512 | |
| 513 | obj = PER_BUFFER_VALUE (from, offset); |
| 514 | if (MARKERP (obj)) |
| 515 | { |
| 516 | struct Lisp_Marker *m = XMARKER (obj); |
| 517 | obj = Fmake_marker (); |
| 518 | XMARKER (obj)->insertion_type = m->insertion_type; |
| 519 | set_marker_both (obj, to_buffer, m->charpos, m->bytepos); |
| 520 | } |
| 521 | |
| 522 | PER_BUFFER_VALUE (to, offset) = obj; |
| 523 | } |
| 524 | |
| 525 | bcopy (from->local_flags, to->local_flags, sizeof to->local_flags); |
| 526 | |
| 527 | to->overlays_before = copy_overlays (to, from->overlays_before); |
| 528 | to->overlays_after = copy_overlays (to, from->overlays_after); |
| 529 | |
| 530 | /* Get (a copy of) the alist of Lisp-level local variables of FROM |
| 531 | and install that in TO. */ |
| 532 | to->local_var_alist = buffer_lisp_local_variables (from); |
| 533 | } |
| 534 | |
| 535 | DEFUN ("make-indirect-buffer", Fmake_indirect_buffer, Smake_indirect_buffer, |
| 536 | 2, 3, |
| 537 | "bMake indirect buffer (to buffer): \nBName of indirect buffer: ", |
| 538 | doc: /* Create and return an indirect buffer for buffer BASE-BUFFER, named NAME. |
| 539 | BASE-BUFFER should be a live buffer, or the name of an existing buffer. |
| 540 | NAME should be a string which is not the name of an existing buffer. |
| 541 | Optional argument CLONE non-nil means preserve BASE-BUFFER's state, |
| 542 | such as major and minor modes, in the indirect buffer. |
| 543 | CLONE nil means the indirect buffer's state is reset to default values. */) |
| 544 | (base_buffer, name, clone) |
| 545 | Lisp_Object base_buffer, name, clone; |
| 546 | { |
| 547 | Lisp_Object buf, tem; |
| 548 | struct buffer *b; |
| 549 | |
| 550 | CHECK_STRING (name); |
| 551 | buf = Fget_buffer (name); |
| 552 | if (!NILP (buf)) |
| 553 | error ("Buffer name `%s' is in use", SDATA (name)); |
| 554 | |
| 555 | tem = base_buffer; |
| 556 | base_buffer = Fget_buffer (base_buffer); |
| 557 | if (NILP (base_buffer)) |
| 558 | error ("No such buffer: `%s'", SDATA (tem)); |
| 559 | if (NILP (XBUFFER (base_buffer)->name)) |
| 560 | error ("Base buffer has been killed"); |
| 561 | |
| 562 | if (SCHARS (name) == 0) |
| 563 | error ("Empty string for buffer name is not allowed"); |
| 564 | |
| 565 | b = allocate_buffer (); |
| 566 | |
| 567 | b->base_buffer = (XBUFFER (base_buffer)->base_buffer |
| 568 | ? XBUFFER (base_buffer)->base_buffer |
| 569 | : XBUFFER (base_buffer)); |
| 570 | |
| 571 | /* Use the base buffer's text object. */ |
| 572 | b->text = b->base_buffer->text; |
| 573 | |
| 574 | BUF_BEGV (b) = BUF_BEGV (b->base_buffer); |
| 575 | BUF_ZV (b) = BUF_ZV (b->base_buffer); |
| 576 | BUF_PT (b) = BUF_PT (b->base_buffer); |
| 577 | BUF_BEGV_BYTE (b) = BUF_BEGV_BYTE (b->base_buffer); |
| 578 | BUF_ZV_BYTE (b) = BUF_ZV_BYTE (b->base_buffer); |
| 579 | BUF_PT_BYTE (b) = BUF_PT_BYTE (b->base_buffer); |
| 580 | |
| 581 | b->newline_cache = 0; |
| 582 | b->width_run_cache = 0; |
| 583 | b->width_table = Qnil; |
| 584 | |
| 585 | /* Put this on the chain of all buffers including killed ones. */ |
| 586 | b->next = all_buffers; |
| 587 | all_buffers = b; |
| 588 | |
| 589 | name = Fcopy_sequence (name); |
| 590 | STRING_SET_INTERVALS (name, NULL_INTERVAL); |
| 591 | b->name = name; |
| 592 | |
| 593 | reset_buffer (b); |
| 594 | reset_buffer_local_variables (b, 1); |
| 595 | |
| 596 | /* Put this in the alist of all live buffers. */ |
| 597 | XSETBUFFER (buf, b); |
| 598 | Vbuffer_alist = nconc2 (Vbuffer_alist, Fcons (Fcons (name, buf), Qnil)); |
| 599 | |
| 600 | b->mark = Fmake_marker (); |
| 601 | b->name = name; |
| 602 | |
| 603 | /* The multibyte status belongs to the base buffer. */ |
| 604 | b->enable_multibyte_characters = b->base_buffer->enable_multibyte_characters; |
| 605 | |
| 606 | /* Make sure the base buffer has markers for its narrowing. */ |
| 607 | if (NILP (b->base_buffer->pt_marker)) |
| 608 | { |
| 609 | b->base_buffer->pt_marker = Fmake_marker (); |
| 610 | set_marker_both (b->base_buffer->pt_marker, base_buffer, |
| 611 | BUF_PT (b->base_buffer), |
| 612 | BUF_PT_BYTE (b->base_buffer)); |
| 613 | } |
| 614 | if (NILP (b->base_buffer->begv_marker)) |
| 615 | { |
| 616 | b->base_buffer->begv_marker = Fmake_marker (); |
| 617 | set_marker_both (b->base_buffer->begv_marker, base_buffer, |
| 618 | BUF_BEGV (b->base_buffer), |
| 619 | BUF_BEGV_BYTE (b->base_buffer)); |
| 620 | } |
| 621 | if (NILP (b->base_buffer->zv_marker)) |
| 622 | { |
| 623 | b->base_buffer->zv_marker = Fmake_marker (); |
| 624 | set_marker_both (b->base_buffer->zv_marker, base_buffer, |
| 625 | BUF_ZV (b->base_buffer), |
| 626 | BUF_ZV_BYTE (b->base_buffer)); |
| 627 | XMARKER (b->base_buffer->zv_marker)->insertion_type = 1; |
| 628 | } |
| 629 | |
| 630 | if (NILP (clone)) |
| 631 | { |
| 632 | /* Give the indirect buffer markers for its narrowing. */ |
| 633 | b->pt_marker = Fmake_marker (); |
| 634 | set_marker_both (b->pt_marker, buf, BUF_PT (b), BUF_PT_BYTE (b)); |
| 635 | b->begv_marker = Fmake_marker (); |
| 636 | set_marker_both (b->begv_marker, buf, BUF_BEGV (b), BUF_BEGV_BYTE (b)); |
| 637 | b->zv_marker = Fmake_marker (); |
| 638 | set_marker_both (b->zv_marker, buf, BUF_ZV (b), BUF_ZV_BYTE (b)); |
| 639 | XMARKER (b->zv_marker)->insertion_type = 1; |
| 640 | } |
| 641 | else |
| 642 | { |
| 643 | struct buffer *old_b = current_buffer; |
| 644 | |
| 645 | clone_per_buffer_values (b->base_buffer, b); |
| 646 | b->filename = Qnil; |
| 647 | b->file_truename = Qnil; |
| 648 | b->display_count = make_number (0); |
| 649 | b->backed_up = Qnil; |
| 650 | b->auto_save_file_name = Qnil; |
| 651 | set_buffer_internal_1 (b); |
| 652 | Fset (intern ("buffer-save-without-query"), Qnil); |
| 653 | Fset (intern ("buffer-file-number"), Qnil); |
| 654 | Fset (intern ("buffer-stale-function"), Qnil); |
| 655 | set_buffer_internal_1 (old_b); |
| 656 | } |
| 657 | |
| 658 | return buf; |
| 659 | } |
| 660 | |
| 661 | void |
| 662 | delete_all_overlays (b) |
| 663 | struct buffer *b; |
| 664 | { |
| 665 | Lisp_Object overlay; |
| 666 | |
| 667 | /* `reset_buffer' blindly sets the list of overlays to NULL, so we |
| 668 | have to empty the list, otherwise we end up with overlays that |
| 669 | think they belong to this buffer while the buffer doesn't know about |
| 670 | them any more. */ |
| 671 | while (b->overlays_before) |
| 672 | { |
| 673 | XSETMISC (overlay, b->overlays_before); |
| 674 | Fdelete_overlay (overlay); |
| 675 | } |
| 676 | while (b->overlays_after) |
| 677 | { |
| 678 | XSETMISC (overlay, b->overlays_after); |
| 679 | Fdelete_overlay (overlay); |
| 680 | } |
| 681 | eassert (b->overlays_before == NULL); |
| 682 | eassert (b->overlays_after == NULL); |
| 683 | } |
| 684 | |
| 685 | /* Reinitialize everything about a buffer except its name and contents |
| 686 | and local variables. |
| 687 | If called on an already-initialized buffer, the list of overlays |
| 688 | should be deleted before calling this function, otherwise we end up |
| 689 | with overlays that claim to belong to the buffer but the buffer |
| 690 | claims it doesn't belong to it. */ |
| 691 | |
| 692 | void |
| 693 | reset_buffer (b) |
| 694 | register struct buffer *b; |
| 695 | { |
| 696 | b->filename = Qnil; |
| 697 | b->file_truename = Qnil; |
| 698 | b->directory = (current_buffer) ? current_buffer->directory : Qnil; |
| 699 | b->modtime = 0; |
| 700 | XSETFASTINT (b->save_length, 0); |
| 701 | b->last_window_start = 1; |
| 702 | /* It is more conservative to start out "changed" than "unchanged". */ |
| 703 | b->clip_changed = 0; |
| 704 | b->prevent_redisplay_optimizations_p = 1; |
| 705 | b->backed_up = Qnil; |
| 706 | b->auto_save_modified = 0; |
| 707 | b->auto_save_failure_time = -1; |
| 708 | b->auto_save_file_name = Qnil; |
| 709 | b->read_only = Qnil; |
| 710 | b->overlays_before = NULL; |
| 711 | b->overlays_after = NULL; |
| 712 | b->overlay_center = BEG; |
| 713 | b->mark_active = Qnil; |
| 714 | b->point_before_scroll = Qnil; |
| 715 | b->file_format = Qnil; |
| 716 | b->auto_save_file_format = Qt; |
| 717 | b->last_selected_window = Qnil; |
| 718 | XSETINT (b->display_count, 0); |
| 719 | b->display_time = Qnil; |
| 720 | b->enable_multibyte_characters = buffer_defaults.enable_multibyte_characters; |
| 721 | b->cursor_type = buffer_defaults.cursor_type; |
| 722 | b->extra_line_spacing = buffer_defaults.extra_line_spacing; |
| 723 | |
| 724 | b->display_error_modiff = 0; |
| 725 | } |
| 726 | |
| 727 | /* Reset buffer B's local variables info. |
| 728 | Don't use this on a buffer that has already been in use; |
| 729 | it does not treat permanent locals consistently. |
| 730 | Instead, use Fkill_all_local_variables. |
| 731 | |
| 732 | If PERMANENT_TOO is 1, then we reset permanent |
| 733 | buffer-local variables. If PERMANENT_TOO is 0, |
| 734 | we preserve those. */ |
| 735 | |
| 736 | static void |
| 737 | reset_buffer_local_variables (b, permanent_too) |
| 738 | register struct buffer *b; |
| 739 | int permanent_too; |
| 740 | { |
| 741 | register int offset; |
| 742 | int i; |
| 743 | |
| 744 | /* Reset the major mode to Fundamental, together with all the |
| 745 | things that depend on the major mode. |
| 746 | default-major-mode is handled at a higher level. |
| 747 | We ignore it here. */ |
| 748 | b->major_mode = Qfundamental_mode; |
| 749 | b->keymap = Qnil; |
| 750 | b->mode_name = QSFundamental; |
| 751 | b->minor_modes = Qnil; |
| 752 | |
| 753 | /* If the standard case table has been altered and invalidated, |
| 754 | fix up its insides first. */ |
| 755 | if (! (CHAR_TABLE_P (XCHAR_TABLE (Vascii_downcase_table)->extras[0]) |
| 756 | && CHAR_TABLE_P (XCHAR_TABLE (Vascii_downcase_table)->extras[1]) |
| 757 | && CHAR_TABLE_P (XCHAR_TABLE (Vascii_downcase_table)->extras[2]))) |
| 758 | Fset_standard_case_table (Vascii_downcase_table); |
| 759 | |
| 760 | b->downcase_table = Vascii_downcase_table; |
| 761 | b->upcase_table = XCHAR_TABLE (Vascii_downcase_table)->extras[0]; |
| 762 | b->case_canon_table = XCHAR_TABLE (Vascii_downcase_table)->extras[1]; |
| 763 | b->case_eqv_table = XCHAR_TABLE (Vascii_downcase_table)->extras[2]; |
| 764 | b->invisibility_spec = Qt; |
| 765 | #ifndef DOS_NT |
| 766 | b->buffer_file_type = Qnil; |
| 767 | #endif |
| 768 | |
| 769 | /* Reset all (or most) per-buffer variables to their defaults. */ |
| 770 | if (permanent_too) |
| 771 | b->local_var_alist = Qnil; |
| 772 | else |
| 773 | { |
| 774 | Lisp_Object tmp, prop, last = Qnil; |
| 775 | for (tmp = b->local_var_alist; CONSP (tmp); tmp = XCDR (tmp)) |
| 776 | if (CONSP (XCAR (tmp)) |
| 777 | && SYMBOLP (XCAR (XCAR (tmp))) |
| 778 | && !NILP (prop = Fget (XCAR (XCAR (tmp)), Qpermanent_local))) |
| 779 | { |
| 780 | /* If permanent-local, keep it. */ |
| 781 | last = tmp; |
| 782 | if (EQ (prop, Qpermanent_local_hook)) |
| 783 | { |
| 784 | /* This is a partially permanent hook variable. |
| 785 | Preserve only the elements that want to be preserved. */ |
| 786 | Lisp_Object list, newlist; |
| 787 | list = XCDR (XCAR (tmp)); |
| 788 | if (!CONSP (list)) |
| 789 | newlist = list; |
| 790 | else |
| 791 | for (newlist = Qnil; CONSP (list); list = XCDR (list)) |
| 792 | { |
| 793 | Lisp_Object elt = XCAR (list); |
| 794 | /* Preserve element ELT if it's t, |
| 795 | if it is a function with a `permanent-local-hook' property, |
| 796 | or if it's not a symbol. */ |
| 797 | if (! SYMBOLP (elt) |
| 798 | || EQ (elt, Qt) |
| 799 | || !NILP (Fget (elt, Qpermanent_local_hook))) |
| 800 | newlist = Fcons (elt, newlist); |
| 801 | } |
| 802 | XSETCDR (XCAR (tmp), Fnreverse (newlist)); |
| 803 | } |
| 804 | } |
| 805 | /* Delete this local variable. */ |
| 806 | else if (NILP (last)) |
| 807 | b->local_var_alist = XCDR (tmp); |
| 808 | else |
| 809 | XSETCDR (last, XCDR (tmp)); |
| 810 | } |
| 811 | |
| 812 | for (i = 0; i < last_per_buffer_idx; ++i) |
| 813 | if (permanent_too || buffer_permanent_local_flags[i] == 0) |
| 814 | SET_PER_BUFFER_VALUE_P (b, i, 0); |
| 815 | |
| 816 | /* For each slot that has a default value, |
| 817 | copy that into the slot. */ |
| 818 | |
| 819 | /* buffer-local Lisp variables start at `undo_list', |
| 820 | tho only the ones from `name' on are GC'd normally. */ |
| 821 | for (offset = PER_BUFFER_VAR_OFFSET (undo_list); |
| 822 | offset < sizeof *b; |
| 823 | offset += sizeof (Lisp_Object)) |
| 824 | { |
| 825 | int idx = PER_BUFFER_IDX (offset); |
| 826 | if ((idx > 0 |
| 827 | && (permanent_too |
| 828 | || buffer_permanent_local_flags[idx] == 0)) |
| 829 | /* Is -2 used anywhere? */ |
| 830 | || idx == -2) |
| 831 | PER_BUFFER_VALUE (b, offset) = PER_BUFFER_DEFAULT (offset); |
| 832 | } |
| 833 | } |
| 834 | |
| 835 | /* We split this away from generate-new-buffer, because rename-buffer |
| 836 | and set-visited-file-name ought to be able to use this to really |
| 837 | rename the buffer properly. */ |
| 838 | |
| 839 | DEFUN ("generate-new-buffer-name", Fgenerate_new_buffer_name, Sgenerate_new_buffer_name, |
| 840 | 1, 2, 0, |
| 841 | doc: /* Return a string that is the name of no existing buffer based on NAME. |
| 842 | If there is no live buffer named NAME, then return NAME. |
| 843 | Otherwise modify name by appending `<NUMBER>', incrementing NUMBER |
| 844 | \(starting at 2) until an unused name is found, and then return that name. |
| 845 | Optional second argument IGNORE specifies a name that is okay to use (if |
| 846 | it is in the sequence to be tried) even if a buffer with that name exists. */) |
| 847 | (name, ignore) |
| 848 | register Lisp_Object name, ignore; |
| 849 | { |
| 850 | register Lisp_Object gentemp, tem; |
| 851 | int count; |
| 852 | char number[10]; |
| 853 | |
| 854 | CHECK_STRING (name); |
| 855 | |
| 856 | tem = Fstring_equal (name, ignore); |
| 857 | if (!NILP (tem)) |
| 858 | return name; |
| 859 | tem = Fget_buffer (name); |
| 860 | if (NILP (tem)) |
| 861 | return name; |
| 862 | |
| 863 | count = 1; |
| 864 | while (1) |
| 865 | { |
| 866 | sprintf (number, "<%d>", ++count); |
| 867 | gentemp = concat2 (name, build_string (number)); |
| 868 | tem = Fstring_equal (gentemp, ignore); |
| 869 | if (!NILP (tem)) |
| 870 | return gentemp; |
| 871 | tem = Fget_buffer (gentemp); |
| 872 | if (NILP (tem)) |
| 873 | return gentemp; |
| 874 | } |
| 875 | } |
| 876 | |
| 877 | \f |
| 878 | DEFUN ("buffer-name", Fbuffer_name, Sbuffer_name, 0, 1, 0, |
| 879 | doc: /* Return the name of BUFFER, as a string. |
| 880 | With no argument or nil as argument, return the name of the current buffer. */) |
| 881 | (buffer) |
| 882 | register Lisp_Object buffer; |
| 883 | { |
| 884 | if (NILP (buffer)) |
| 885 | return current_buffer->name; |
| 886 | CHECK_BUFFER (buffer); |
| 887 | return XBUFFER (buffer)->name; |
| 888 | } |
| 889 | |
| 890 | DEFUN ("buffer-file-name", Fbuffer_file_name, Sbuffer_file_name, 0, 1, 0, |
| 891 | doc: /* Return name of file BUFFER is visiting, or nil if none. |
| 892 | No argument or nil as argument means use the current buffer. */) |
| 893 | (buffer) |
| 894 | register Lisp_Object buffer; |
| 895 | { |
| 896 | if (NILP (buffer)) |
| 897 | return current_buffer->filename; |
| 898 | CHECK_BUFFER (buffer); |
| 899 | return XBUFFER (buffer)->filename; |
| 900 | } |
| 901 | |
| 902 | DEFUN ("buffer-base-buffer", Fbuffer_base_buffer, Sbuffer_base_buffer, |
| 903 | 0, 1, 0, |
| 904 | doc: /* Return the base buffer of indirect buffer BUFFER. |
| 905 | If BUFFER is not indirect, return nil. |
| 906 | BUFFER defaults to the current buffer. */) |
| 907 | (buffer) |
| 908 | register Lisp_Object buffer; |
| 909 | { |
| 910 | struct buffer *base; |
| 911 | Lisp_Object base_buffer; |
| 912 | |
| 913 | if (NILP (buffer)) |
| 914 | base = current_buffer->base_buffer; |
| 915 | else |
| 916 | { |
| 917 | CHECK_BUFFER (buffer); |
| 918 | base = XBUFFER (buffer)->base_buffer; |
| 919 | } |
| 920 | |
| 921 | if (! base) |
| 922 | return Qnil; |
| 923 | XSETBUFFER (base_buffer, base); |
| 924 | return base_buffer; |
| 925 | } |
| 926 | |
| 927 | DEFUN ("buffer-local-value", Fbuffer_local_value, |
| 928 | Sbuffer_local_value, 2, 2, 0, |
| 929 | doc: /* Return the value of VARIABLE in BUFFER. |
| 930 | If VARIABLE does not have a buffer-local binding in BUFFER, the value |
| 931 | is the default binding of the variable. */) |
| 932 | (variable, buffer) |
| 933 | register Lisp_Object variable; |
| 934 | register Lisp_Object buffer; |
| 935 | { |
| 936 | register struct buffer *buf; |
| 937 | register Lisp_Object result; |
| 938 | struct Lisp_Symbol *sym; |
| 939 | |
| 940 | CHECK_SYMBOL (variable); |
| 941 | CHECK_BUFFER (buffer); |
| 942 | buf = XBUFFER (buffer); |
| 943 | |
| 944 | sym = indirect_variable (XSYMBOL (variable)); |
| 945 | XSETSYMBOL (variable, sym); |
| 946 | |
| 947 | /* Look in local_var_list */ |
| 948 | result = Fassoc (variable, buf->local_var_alist); |
| 949 | if (NILP (result)) |
| 950 | { |
| 951 | int offset, idx; |
| 952 | int found = 0; |
| 953 | |
| 954 | /* Look in special slots */ |
| 955 | /* buffer-local Lisp variables start at `undo_list', |
| 956 | tho only the ones from `name' on are GC'd normally. */ |
| 957 | for (offset = PER_BUFFER_VAR_OFFSET (undo_list); |
| 958 | offset < sizeof (struct buffer); |
| 959 | /* sizeof EMACS_INT == sizeof Lisp_Object */ |
| 960 | offset += (sizeof (EMACS_INT))) |
| 961 | { |
| 962 | idx = PER_BUFFER_IDX (offset); |
| 963 | if ((idx == -1 || PER_BUFFER_VALUE_P (buf, idx)) |
| 964 | && SYMBOLP (PER_BUFFER_SYMBOL (offset)) |
| 965 | && EQ (PER_BUFFER_SYMBOL (offset), variable)) |
| 966 | { |
| 967 | result = PER_BUFFER_VALUE (buf, offset); |
| 968 | found = 1; |
| 969 | break; |
| 970 | } |
| 971 | } |
| 972 | |
| 973 | if (!found) |
| 974 | result = Fdefault_value (variable); |
| 975 | } |
| 976 | else |
| 977 | { |
| 978 | Lisp_Object valcontents; |
| 979 | Lisp_Object current_alist_element; |
| 980 | |
| 981 | /* What binding is loaded right now? */ |
| 982 | valcontents = sym->value; |
| 983 | current_alist_element |
| 984 | = XCAR (XBUFFER_LOCAL_VALUE (valcontents)->cdr); |
| 985 | |
| 986 | /* The value of the currently loaded binding is not |
| 987 | stored in it, but rather in the realvalue slot. |
| 988 | Store that value into the binding it belongs to |
| 989 | in case that is the one we are about to use. */ |
| 990 | |
| 991 | Fsetcdr (current_alist_element, |
| 992 | do_symval_forwarding (XBUFFER_LOCAL_VALUE (valcontents)->realvalue)); |
| 993 | |
| 994 | /* Now get the (perhaps updated) value out of the binding. */ |
| 995 | result = XCDR (result); |
| 996 | } |
| 997 | |
| 998 | if (!EQ (result, Qunbound)) |
| 999 | return result; |
| 1000 | |
| 1001 | xsignal1 (Qvoid_variable, variable); |
| 1002 | } |
| 1003 | |
| 1004 | /* Return an alist of the Lisp-level buffer-local bindings of |
| 1005 | buffer BUF. That is, don't include the variables maintained |
| 1006 | in special slots in the buffer object. */ |
| 1007 | |
| 1008 | static Lisp_Object |
| 1009 | buffer_lisp_local_variables (buf) |
| 1010 | struct buffer *buf; |
| 1011 | { |
| 1012 | Lisp_Object result = Qnil; |
| 1013 | register Lisp_Object tail; |
| 1014 | for (tail = buf->local_var_alist; CONSP (tail); tail = XCDR (tail)) |
| 1015 | { |
| 1016 | Lisp_Object val, elt; |
| 1017 | |
| 1018 | elt = XCAR (tail); |
| 1019 | |
| 1020 | /* Reference each variable in the alist in buf. |
| 1021 | If inquiring about the current buffer, this gets the current values, |
| 1022 | so store them into the alist so the alist is up to date. |
| 1023 | If inquiring about some other buffer, this swaps out any values |
| 1024 | for that buffer, making the alist up to date automatically. */ |
| 1025 | val = find_symbol_value (XCAR (elt)); |
| 1026 | /* Use the current buffer value only if buf is the current buffer. */ |
| 1027 | if (buf != current_buffer) |
| 1028 | val = XCDR (elt); |
| 1029 | |
| 1030 | /* If symbol is unbound, put just the symbol in the list. */ |
| 1031 | if (EQ (val, Qunbound)) |
| 1032 | result = Fcons (XCAR (elt), result); |
| 1033 | /* Otherwise, put (symbol . value) in the list. */ |
| 1034 | else |
| 1035 | result = Fcons (Fcons (XCAR (elt), val), result); |
| 1036 | } |
| 1037 | |
| 1038 | return result; |
| 1039 | } |
| 1040 | |
| 1041 | DEFUN ("buffer-local-variables", Fbuffer_local_variables, |
| 1042 | Sbuffer_local_variables, 0, 1, 0, |
| 1043 | doc: /* Return an alist of variables that are buffer-local in BUFFER. |
| 1044 | Most elements look like (SYMBOL . VALUE), describing one variable. |
| 1045 | For a symbol that is locally unbound, just the symbol appears in the value. |
| 1046 | Note that storing new VALUEs in these elements doesn't change the variables. |
| 1047 | No argument or nil as argument means use current buffer as BUFFER. */) |
| 1048 | (buffer) |
| 1049 | register Lisp_Object buffer; |
| 1050 | { |
| 1051 | register struct buffer *buf; |
| 1052 | register Lisp_Object result; |
| 1053 | |
| 1054 | if (NILP (buffer)) |
| 1055 | buf = current_buffer; |
| 1056 | else |
| 1057 | { |
| 1058 | CHECK_BUFFER (buffer); |
| 1059 | buf = XBUFFER (buffer); |
| 1060 | } |
| 1061 | |
| 1062 | result = buffer_lisp_local_variables (buf); |
| 1063 | |
| 1064 | /* Add on all the variables stored in special slots. */ |
| 1065 | { |
| 1066 | int offset, idx; |
| 1067 | |
| 1068 | /* buffer-local Lisp variables start at `undo_list', |
| 1069 | tho only the ones from `name' on are GC'd normally. */ |
| 1070 | for (offset = PER_BUFFER_VAR_OFFSET (undo_list); |
| 1071 | offset < sizeof (struct buffer); |
| 1072 | /* sizeof EMACS_INT == sizeof Lisp_Object */ |
| 1073 | offset += (sizeof (EMACS_INT))) |
| 1074 | { |
| 1075 | idx = PER_BUFFER_IDX (offset); |
| 1076 | if ((idx == -1 || PER_BUFFER_VALUE_P (buf, idx)) |
| 1077 | && SYMBOLP (PER_BUFFER_SYMBOL (offset))) |
| 1078 | result = Fcons (Fcons (PER_BUFFER_SYMBOL (offset), |
| 1079 | PER_BUFFER_VALUE (buf, offset)), |
| 1080 | result); |
| 1081 | } |
| 1082 | } |
| 1083 | |
| 1084 | return result; |
| 1085 | } |
| 1086 | \f |
| 1087 | DEFUN ("buffer-modified-p", Fbuffer_modified_p, Sbuffer_modified_p, |
| 1088 | 0, 1, 0, |
| 1089 | doc: /* Return t if BUFFER was modified since its file was last read or saved. |
| 1090 | No argument or nil as argument means use current buffer as BUFFER. */) |
| 1091 | (buffer) |
| 1092 | register Lisp_Object buffer; |
| 1093 | { |
| 1094 | register struct buffer *buf; |
| 1095 | if (NILP (buffer)) |
| 1096 | buf = current_buffer; |
| 1097 | else |
| 1098 | { |
| 1099 | CHECK_BUFFER (buffer); |
| 1100 | buf = XBUFFER (buffer); |
| 1101 | } |
| 1102 | |
| 1103 | return BUF_SAVE_MODIFF (buf) < BUF_MODIFF (buf) ? Qt : Qnil; |
| 1104 | } |
| 1105 | |
| 1106 | DEFUN ("set-buffer-modified-p", Fset_buffer_modified_p, Sset_buffer_modified_p, |
| 1107 | 1, 1, 0, |
| 1108 | doc: /* Mark current buffer as modified or unmodified according to FLAG. |
| 1109 | A non-nil FLAG means mark the buffer modified. */) |
| 1110 | (flag) |
| 1111 | register Lisp_Object flag; |
| 1112 | { |
| 1113 | register int already; |
| 1114 | register Lisp_Object fn; |
| 1115 | Lisp_Object buffer, window; |
| 1116 | |
| 1117 | #ifdef CLASH_DETECTION |
| 1118 | /* If buffer becoming modified, lock the file. |
| 1119 | If buffer becoming unmodified, unlock the file. */ |
| 1120 | |
| 1121 | fn = current_buffer->file_truename; |
| 1122 | /* Test buffer-file-name so that binding it to nil is effective. */ |
| 1123 | if (!NILP (fn) && ! NILP (current_buffer->filename)) |
| 1124 | { |
| 1125 | already = SAVE_MODIFF < MODIFF; |
| 1126 | if (!already && !NILP (flag)) |
| 1127 | lock_file (fn); |
| 1128 | else if (already && NILP (flag)) |
| 1129 | unlock_file (fn); |
| 1130 | } |
| 1131 | #endif /* CLASH_DETECTION */ |
| 1132 | |
| 1133 | SAVE_MODIFF = NILP (flag) ? MODIFF : 0; |
| 1134 | |
| 1135 | /* Set update_mode_lines only if buffer is displayed in some window. |
| 1136 | Packages like jit-lock or lazy-lock preserve a buffer's modified |
| 1137 | state by recording/restoring the state around blocks of code. |
| 1138 | Setting update_mode_lines makes redisplay consider all windows |
| 1139 | (on all frames). Stealth fontification of buffers not displayed |
| 1140 | would incur additional redisplay costs if we'd set |
| 1141 | update_modes_lines unconditionally. |
| 1142 | |
| 1143 | Ideally, I think there should be another mechanism for fontifying |
| 1144 | buffers without "modifying" buffers, or redisplay should be |
| 1145 | smarter about updating the `*' in mode lines. --gerd */ |
| 1146 | XSETBUFFER (buffer, current_buffer); |
| 1147 | window = Fget_buffer_window (buffer, Qt); |
| 1148 | if (WINDOWP (window)) |
| 1149 | { |
| 1150 | ++update_mode_lines; |
| 1151 | current_buffer->prevent_redisplay_optimizations_p = 1; |
| 1152 | } |
| 1153 | |
| 1154 | return flag; |
| 1155 | } |
| 1156 | |
| 1157 | DEFUN ("restore-buffer-modified-p", Frestore_buffer_modified_p, |
| 1158 | Srestore_buffer_modified_p, 1, 1, 0, |
| 1159 | doc: /* Like `set-buffer-modified-p', with a difference concerning redisplay. |
| 1160 | It is not ensured that mode lines will be updated to show the modified |
| 1161 | state of the current buffer. Use with care. */) |
| 1162 | (flag) |
| 1163 | Lisp_Object flag; |
| 1164 | { |
| 1165 | #ifdef CLASH_DETECTION |
| 1166 | Lisp_Object fn; |
| 1167 | |
| 1168 | /* If buffer becoming modified, lock the file. |
| 1169 | If buffer becoming unmodified, unlock the file. */ |
| 1170 | |
| 1171 | fn = current_buffer->file_truename; |
| 1172 | /* Test buffer-file-name so that binding it to nil is effective. */ |
| 1173 | if (!NILP (fn) && ! NILP (current_buffer->filename)) |
| 1174 | { |
| 1175 | int already = SAVE_MODIFF < MODIFF; |
| 1176 | if (!already && !NILP (flag)) |
| 1177 | lock_file (fn); |
| 1178 | else if (already && NILP (flag)) |
| 1179 | unlock_file (fn); |
| 1180 | } |
| 1181 | #endif /* CLASH_DETECTION */ |
| 1182 | |
| 1183 | SAVE_MODIFF = NILP (flag) ? MODIFF : 0; |
| 1184 | return flag; |
| 1185 | } |
| 1186 | |
| 1187 | DEFUN ("buffer-modified-tick", Fbuffer_modified_tick, Sbuffer_modified_tick, |
| 1188 | 0, 1, 0, |
| 1189 | doc: /* Return BUFFER's tick counter, incremented for each change in text. |
| 1190 | Each buffer has a tick counter which is incremented each time the |
| 1191 | text in that buffer is changed. It wraps around occasionally. |
| 1192 | No argument or nil as argument means use current buffer as BUFFER. */) |
| 1193 | (buffer) |
| 1194 | register Lisp_Object buffer; |
| 1195 | { |
| 1196 | register struct buffer *buf; |
| 1197 | if (NILP (buffer)) |
| 1198 | buf = current_buffer; |
| 1199 | else |
| 1200 | { |
| 1201 | CHECK_BUFFER (buffer); |
| 1202 | buf = XBUFFER (buffer); |
| 1203 | } |
| 1204 | |
| 1205 | return make_number (BUF_MODIFF (buf)); |
| 1206 | } |
| 1207 | |
| 1208 | DEFUN ("buffer-chars-modified-tick", Fbuffer_chars_modified_tick, |
| 1209 | Sbuffer_chars_modified_tick, 0, 1, 0, |
| 1210 | doc: /* Return BUFFER's character-change tick counter. |
| 1211 | Each buffer has a character-change tick counter, which is set to the |
| 1212 | value of the buffer's tick counter \(see `buffer-modified-tick'), each |
| 1213 | time text in that buffer is inserted or deleted. By comparing the |
| 1214 | values returned by two individual calls of `buffer-chars-modified-tick', |
| 1215 | you can tell whether a character change occurred in that buffer in |
| 1216 | between these calls. No argument or nil as argument means use current |
| 1217 | buffer as BUFFER. */) |
| 1218 | (buffer) |
| 1219 | register Lisp_Object buffer; |
| 1220 | { |
| 1221 | register struct buffer *buf; |
| 1222 | if (NILP (buffer)) |
| 1223 | buf = current_buffer; |
| 1224 | else |
| 1225 | { |
| 1226 | CHECK_BUFFER (buffer); |
| 1227 | buf = XBUFFER (buffer); |
| 1228 | } |
| 1229 | |
| 1230 | return make_number (BUF_CHARS_MODIFF (buf)); |
| 1231 | } |
| 1232 | \f |
| 1233 | DEFUN ("rename-buffer", Frename_buffer, Srename_buffer, 1, 2, |
| 1234 | "(list (read-string \"Rename buffer (to new name): \" \ |
| 1235 | nil 'buffer-name-history (buffer-name (current-buffer))) \ |
| 1236 | current-prefix-arg)", |
| 1237 | doc: /* Change current buffer's name to NEWNAME (a string). |
| 1238 | If second arg UNIQUE is nil or omitted, it is an error if a |
| 1239 | buffer named NEWNAME already exists. |
| 1240 | If UNIQUE is non-nil, come up with a new name using |
| 1241 | `generate-new-buffer-name'. |
| 1242 | Interactively, you can set UNIQUE with a prefix argument. |
| 1243 | We return the name we actually gave the buffer. |
| 1244 | This does not change the name of the visited file (if any). */) |
| 1245 | (newname, unique) |
| 1246 | register Lisp_Object newname, unique; |
| 1247 | { |
| 1248 | register Lisp_Object tem, buf; |
| 1249 | |
| 1250 | CHECK_STRING (newname); |
| 1251 | |
| 1252 | if (SCHARS (newname) == 0) |
| 1253 | error ("Empty string is invalid as a buffer name"); |
| 1254 | |
| 1255 | tem = Fget_buffer (newname); |
| 1256 | if (!NILP (tem)) |
| 1257 | { |
| 1258 | /* Don't short-circuit if UNIQUE is t. That is a useful way to |
| 1259 | rename the buffer automatically so you can create another |
| 1260 | with the original name. It makes UNIQUE equivalent to |
| 1261 | (rename-buffer (generate-new-buffer-name NEWNAME)). */ |
| 1262 | if (NILP (unique) && XBUFFER (tem) == current_buffer) |
| 1263 | return current_buffer->name; |
| 1264 | if (!NILP (unique)) |
| 1265 | newname = Fgenerate_new_buffer_name (newname, current_buffer->name); |
| 1266 | else |
| 1267 | error ("Buffer name `%s' is in use", SDATA (newname)); |
| 1268 | } |
| 1269 | |
| 1270 | current_buffer->name = newname; |
| 1271 | |
| 1272 | /* Catch redisplay's attention. Unless we do this, the mode lines for |
| 1273 | any windows displaying current_buffer will stay unchanged. */ |
| 1274 | update_mode_lines++; |
| 1275 | |
| 1276 | XSETBUFFER (buf, current_buffer); |
| 1277 | Fsetcar (Frassq (buf, Vbuffer_alist), newname); |
| 1278 | if (NILP (current_buffer->filename) |
| 1279 | && !NILP (current_buffer->auto_save_file_name)) |
| 1280 | call0 (intern ("rename-auto-save-file")); |
| 1281 | /* Refetch since that last call may have done GC. */ |
| 1282 | return current_buffer->name; |
| 1283 | } |
| 1284 | |
| 1285 | DEFUN ("other-buffer", Fother_buffer, Sother_buffer, 0, 3, 0, |
| 1286 | doc: /* Return most recently selected buffer other than BUFFER. |
| 1287 | Buffers not visible in windows are preferred to visible buffers, |
| 1288 | unless optional second argument VISIBLE-OK is non-nil. |
| 1289 | If the optional third argument FRAME is non-nil, use that frame's |
| 1290 | buffer list instead of the selected frame's buffer list. |
| 1291 | If no other buffer exists, the buffer `*scratch*' is returned. |
| 1292 | If BUFFER is omitted or nil, some interesting buffer is returned. */) |
| 1293 | (buffer, visible_ok, frame) |
| 1294 | register Lisp_Object buffer, visible_ok, frame; |
| 1295 | { |
| 1296 | Lisp_Object Fset_buffer_major_mode (); |
| 1297 | register Lisp_Object tail, buf, notsogood, tem, pred, add_ons; |
| 1298 | notsogood = Qnil; |
| 1299 | |
| 1300 | if (NILP (frame)) |
| 1301 | frame = selected_frame; |
| 1302 | |
| 1303 | tail = Vbuffer_alist; |
| 1304 | pred = frame_buffer_predicate (frame); |
| 1305 | |
| 1306 | /* Consider buffers that have been seen in the selected frame |
| 1307 | before other buffers. */ |
| 1308 | |
| 1309 | tem = frame_buffer_list (frame); |
| 1310 | add_ons = Qnil; |
| 1311 | while (CONSP (tem)) |
| 1312 | { |
| 1313 | if (BUFFERP (XCAR (tem))) |
| 1314 | add_ons = Fcons (Fcons (Qnil, XCAR (tem)), add_ons); |
| 1315 | tem = XCDR (tem); |
| 1316 | } |
| 1317 | tail = nconc2 (Fnreverse (add_ons), tail); |
| 1318 | |
| 1319 | for (; CONSP (tail); tail = XCDR (tail)) |
| 1320 | { |
| 1321 | buf = Fcdr (XCAR (tail)); |
| 1322 | if (EQ (buf, buffer)) |
| 1323 | continue; |
| 1324 | if (NILP (buf)) |
| 1325 | continue; |
| 1326 | if (NILP (XBUFFER (buf)->name)) |
| 1327 | continue; |
| 1328 | if (SREF (XBUFFER (buf)->name, 0) == ' ') |
| 1329 | continue; |
| 1330 | /* If the selected frame has a buffer_predicate, |
| 1331 | disregard buffers that don't fit the predicate. */ |
| 1332 | if (!NILP (pred)) |
| 1333 | { |
| 1334 | tem = call1 (pred, buf); |
| 1335 | if (NILP (tem)) |
| 1336 | continue; |
| 1337 | } |
| 1338 | |
| 1339 | if (NILP (visible_ok)) |
| 1340 | tem = Fget_buffer_window (buf, Qvisible); |
| 1341 | else |
| 1342 | tem = Qnil; |
| 1343 | if (NILP (tem)) |
| 1344 | return buf; |
| 1345 | if (NILP (notsogood)) |
| 1346 | notsogood = buf; |
| 1347 | } |
| 1348 | if (!NILP (notsogood)) |
| 1349 | return notsogood; |
| 1350 | buf = Fget_buffer (build_string ("*scratch*")); |
| 1351 | if (NILP (buf)) |
| 1352 | { |
| 1353 | buf = Fget_buffer_create (build_string ("*scratch*")); |
| 1354 | Fset_buffer_major_mode (buf); |
| 1355 | } |
| 1356 | return buf; |
| 1357 | } |
| 1358 | \f |
| 1359 | DEFUN ("buffer-enable-undo", Fbuffer_enable_undo, Sbuffer_enable_undo, |
| 1360 | 0, 1, "", |
| 1361 | doc: /* Start keeping undo information for buffer BUFFER. |
| 1362 | No argument or nil as argument means do this for the current buffer. */) |
| 1363 | (buffer) |
| 1364 | register Lisp_Object buffer; |
| 1365 | { |
| 1366 | Lisp_Object real_buffer; |
| 1367 | |
| 1368 | if (NILP (buffer)) |
| 1369 | XSETBUFFER (real_buffer, current_buffer); |
| 1370 | else |
| 1371 | { |
| 1372 | real_buffer = Fget_buffer (buffer); |
| 1373 | if (NILP (real_buffer)) |
| 1374 | nsberror (buffer); |
| 1375 | } |
| 1376 | |
| 1377 | if (EQ (XBUFFER (real_buffer)->undo_list, Qt)) |
| 1378 | XBUFFER (real_buffer)->undo_list = Qnil; |
| 1379 | |
| 1380 | return Qnil; |
| 1381 | } |
| 1382 | |
| 1383 | /* |
| 1384 | DEFVAR_LISP ("kill-buffer-hook", no_cell, "\ |
| 1385 | Hook to be run (by `run-hooks', which see) when a buffer is killed.\n\ |
| 1386 | The buffer being killed will be current while the hook is running.\n\ |
| 1387 | See `kill-buffer'." |
| 1388 | */ |
| 1389 | DEFUN ("kill-buffer", Fkill_buffer, Skill_buffer, 0, 1, "bKill buffer: ", |
| 1390 | doc: /* Kill buffer BUFFER-OR-NAME. |
| 1391 | The argument may be a buffer or the name of an existing buffer. |
| 1392 | Argument nil or omitted means kill the current buffer. Return t if the |
| 1393 | buffer is actually killed, nil otherwise. |
| 1394 | |
| 1395 | This function calls `replace-buffer-in-windows' for cleaning up all |
| 1396 | windows currently displaying the buffer to be killed. The functions in |
| 1397 | `kill-buffer-query-functions' are called with the buffer to be killed as |
| 1398 | the current buffer. If any of them returns nil, the buffer is not |
| 1399 | killed. The hook `kill-buffer-hook' is run before the buffer is |
| 1400 | actually killed. The buffer being killed will be current while the hook |
| 1401 | is running. |
| 1402 | |
| 1403 | Any processes that have this buffer as the `process-buffer' are killed |
| 1404 | with SIGHUP. */) |
| 1405 | (buffer_or_name) |
| 1406 | Lisp_Object buffer_or_name; |
| 1407 | { |
| 1408 | Lisp_Object buffer; |
| 1409 | register struct buffer *b; |
| 1410 | register Lisp_Object tem; |
| 1411 | register struct Lisp_Marker *m; |
| 1412 | struct gcpro gcpro1; |
| 1413 | |
| 1414 | if (NILP (buffer_or_name)) |
| 1415 | buffer = Fcurrent_buffer (); |
| 1416 | else |
| 1417 | buffer = Fget_buffer (buffer_or_name); |
| 1418 | if (NILP (buffer)) |
| 1419 | nsberror (buffer_or_name); |
| 1420 | |
| 1421 | b = XBUFFER (buffer); |
| 1422 | |
| 1423 | /* Avoid trouble for buffer already dead. */ |
| 1424 | if (NILP (b->name)) |
| 1425 | return Qnil; |
| 1426 | |
| 1427 | /* Query if the buffer is still modified. */ |
| 1428 | if (INTERACTIVE && !NILP (b->filename) |
| 1429 | && BUF_MODIFF (b) > BUF_SAVE_MODIFF (b)) |
| 1430 | { |
| 1431 | GCPRO1 (buffer); |
| 1432 | tem = do_yes_or_no_p (format2 ("Buffer %s modified; kill anyway? ", |
| 1433 | b->name, make_number (0))); |
| 1434 | UNGCPRO; |
| 1435 | if (NILP (tem)) |
| 1436 | return Qnil; |
| 1437 | } |
| 1438 | |
| 1439 | /* Run hooks with the buffer to be killed the current buffer. */ |
| 1440 | { |
| 1441 | int count = SPECPDL_INDEX (); |
| 1442 | Lisp_Object arglist[1]; |
| 1443 | |
| 1444 | record_unwind_protect (save_excursion_restore, save_excursion_save ()); |
| 1445 | set_buffer_internal (b); |
| 1446 | |
| 1447 | /* First run the query functions; if any query is answered no, |
| 1448 | don't kill the buffer. */ |
| 1449 | arglist[0] = Qkill_buffer_query_functions; |
| 1450 | tem = Frun_hook_with_args_until_failure (1, arglist); |
| 1451 | if (NILP (tem)) |
| 1452 | return unbind_to (count, Qnil); |
| 1453 | |
| 1454 | /* Then run the hooks. */ |
| 1455 | Frun_hooks (1, &Qkill_buffer_hook); |
| 1456 | unbind_to (count, Qnil); |
| 1457 | } |
| 1458 | |
| 1459 | /* We have no more questions to ask. Verify that it is valid |
| 1460 | to kill the buffer. This must be done after the questions |
| 1461 | since anything can happen within do_yes_or_no_p. */ |
| 1462 | |
| 1463 | /* Don't kill the minibuffer now current. */ |
| 1464 | if (EQ (buffer, XWINDOW (minibuf_window)->buffer)) |
| 1465 | return Qnil; |
| 1466 | |
| 1467 | if (NILP (b->name)) |
| 1468 | return Qnil; |
| 1469 | |
| 1470 | /* When we kill a base buffer, kill all its indirect buffers. |
| 1471 | We do it at this stage so nothing terrible happens if they |
| 1472 | ask questions or their hooks get errors. */ |
| 1473 | if (! b->base_buffer) |
| 1474 | { |
| 1475 | struct buffer *other; |
| 1476 | |
| 1477 | GCPRO1 (buffer); |
| 1478 | |
| 1479 | for (other = all_buffers; other; other = other->next) |
| 1480 | /* all_buffers contains dead buffers too; |
| 1481 | don't re-kill them. */ |
| 1482 | if (other->base_buffer == b && !NILP (other->name)) |
| 1483 | { |
| 1484 | Lisp_Object buffer; |
| 1485 | XSETBUFFER (buffer, other); |
| 1486 | Fkill_buffer (buffer); |
| 1487 | } |
| 1488 | |
| 1489 | UNGCPRO; |
| 1490 | } |
| 1491 | |
| 1492 | /* Make this buffer not be current. |
| 1493 | In the process, notice if this is the sole visible buffer |
| 1494 | and give up if so. */ |
| 1495 | if (b == current_buffer) |
| 1496 | { |
| 1497 | tem = Fother_buffer (buffer, Qnil, Qnil); |
| 1498 | Fset_buffer (tem); |
| 1499 | if (b == current_buffer) |
| 1500 | return Qnil; |
| 1501 | } |
| 1502 | |
| 1503 | /* Notice if the buffer to kill is the sole visible buffer |
| 1504 | when we're currently in the mini-buffer, and give up if so. */ |
| 1505 | XSETBUFFER (tem, current_buffer); |
| 1506 | if (EQ (tem, XWINDOW (minibuf_window)->buffer)) |
| 1507 | { |
| 1508 | tem = Fother_buffer (buffer, Qnil, Qnil); |
| 1509 | if (EQ (buffer, tem)) |
| 1510 | return Qnil; |
| 1511 | } |
| 1512 | |
| 1513 | /* Now there is no question: we can kill the buffer. */ |
| 1514 | |
| 1515 | #ifdef CLASH_DETECTION |
| 1516 | /* Unlock this buffer's file, if it is locked. */ |
| 1517 | unlock_buffer (b); |
| 1518 | #endif /* CLASH_DETECTION */ |
| 1519 | |
| 1520 | GCPRO1 (buffer); |
| 1521 | kill_buffer_processes (buffer); |
| 1522 | UNGCPRO; |
| 1523 | |
| 1524 | /* Killing buffer processes may run sentinels which may |
| 1525 | have called kill-buffer. */ |
| 1526 | |
| 1527 | if (NILP (b->name)) |
| 1528 | return Qnil; |
| 1529 | |
| 1530 | clear_charpos_cache (b); |
| 1531 | |
| 1532 | tem = Vinhibit_quit; |
| 1533 | Vinhibit_quit = Qt; |
| 1534 | replace_buffer_in_all_windows (buffer); |
| 1535 | Vbuffer_alist = Fdelq (Frassq (buffer, Vbuffer_alist), Vbuffer_alist); |
| 1536 | frames_discard_buffer (buffer); |
| 1537 | Vinhibit_quit = tem; |
| 1538 | |
| 1539 | /* Delete any auto-save file, if we saved it in this session. |
| 1540 | But not if the buffer is modified. */ |
| 1541 | if (STRINGP (b->auto_save_file_name) |
| 1542 | && b->auto_save_modified != 0 |
| 1543 | && BUF_SAVE_MODIFF (b) < b->auto_save_modified |
| 1544 | && BUF_SAVE_MODIFF (b) < BUF_MODIFF (b) |
| 1545 | && NILP (Fsymbol_value (intern ("auto-save-visited-file-name")))) |
| 1546 | { |
| 1547 | Lisp_Object tem; |
| 1548 | tem = Fsymbol_value (intern ("delete-auto-save-files")); |
| 1549 | if (! NILP (tem)) |
| 1550 | internal_delete_file (b->auto_save_file_name); |
| 1551 | } |
| 1552 | |
| 1553 | if (b->base_buffer) |
| 1554 | { |
| 1555 | /* Unchain all markers that belong to this indirect buffer. |
| 1556 | Don't unchain the markers that belong to the base buffer |
| 1557 | or its other indirect buffers. */ |
| 1558 | for (m = BUF_MARKERS (b); m; ) |
| 1559 | { |
| 1560 | struct Lisp_Marker *next = m->next; |
| 1561 | if (m->buffer == b) |
| 1562 | unchain_marker (m); |
| 1563 | m = next; |
| 1564 | } |
| 1565 | } |
| 1566 | else |
| 1567 | { |
| 1568 | /* Unchain all markers of this buffer and its indirect buffers. |
| 1569 | and leave them pointing nowhere. */ |
| 1570 | for (m = BUF_MARKERS (b); m; ) |
| 1571 | { |
| 1572 | struct Lisp_Marker *next = m->next; |
| 1573 | m->buffer = 0; |
| 1574 | m->next = NULL; |
| 1575 | m = next; |
| 1576 | } |
| 1577 | BUF_MARKERS (b) = NULL; |
| 1578 | BUF_INTERVALS (b) = NULL_INTERVAL; |
| 1579 | |
| 1580 | /* Perhaps we should explicitly free the interval tree here... */ |
| 1581 | } |
| 1582 | |
| 1583 | /* Reset the local variables, so that this buffer's local values |
| 1584 | won't be protected from GC. They would be protected |
| 1585 | if they happened to remain encached in their symbols. |
| 1586 | This gets rid of them for certain. */ |
| 1587 | swap_out_buffer_local_variables (b); |
| 1588 | reset_buffer_local_variables (b, 1); |
| 1589 | |
| 1590 | b->name = Qnil; |
| 1591 | |
| 1592 | BLOCK_INPUT; |
| 1593 | if (! b->base_buffer) |
| 1594 | free_buffer_text (b); |
| 1595 | |
| 1596 | if (b->newline_cache) |
| 1597 | { |
| 1598 | free_region_cache (b->newline_cache); |
| 1599 | b->newline_cache = 0; |
| 1600 | } |
| 1601 | if (b->width_run_cache) |
| 1602 | { |
| 1603 | free_region_cache (b->width_run_cache); |
| 1604 | b->width_run_cache = 0; |
| 1605 | } |
| 1606 | b->width_table = Qnil; |
| 1607 | UNBLOCK_INPUT; |
| 1608 | b->undo_list = Qnil; |
| 1609 | |
| 1610 | return Qt; |
| 1611 | } |
| 1612 | \f |
| 1613 | /* Move the assoc for buffer BUF to the front of buffer-alist. Since |
| 1614 | we do this each time BUF is selected visibly, the more recently |
| 1615 | selected buffers are always closer to the front of the list. This |
| 1616 | means that other_buffer is more likely to choose a relevant buffer. */ |
| 1617 | |
| 1618 | void |
| 1619 | record_buffer (buf) |
| 1620 | Lisp_Object buf; |
| 1621 | { |
| 1622 | register Lisp_Object link, prev; |
| 1623 | Lisp_Object frame; |
| 1624 | frame = selected_frame; |
| 1625 | |
| 1626 | prev = Qnil; |
| 1627 | for (link = Vbuffer_alist; CONSP (link); link = XCDR (link)) |
| 1628 | { |
| 1629 | if (EQ (XCDR (XCAR (link)), buf)) |
| 1630 | break; |
| 1631 | prev = link; |
| 1632 | } |
| 1633 | |
| 1634 | /* Effectively do Vbuffer_alist = Fdelq (link, Vbuffer_alist); |
| 1635 | we cannot use Fdelq itself here because it allows quitting. */ |
| 1636 | |
| 1637 | if (NILP (prev)) |
| 1638 | Vbuffer_alist = XCDR (Vbuffer_alist); |
| 1639 | else |
| 1640 | XSETCDR (prev, XCDR (XCDR (prev))); |
| 1641 | |
| 1642 | XSETCDR (link, Vbuffer_alist); |
| 1643 | Vbuffer_alist = link; |
| 1644 | |
| 1645 | /* Effectively do a delq on buried_buffer_list. */ |
| 1646 | |
| 1647 | prev = Qnil; |
| 1648 | for (link = XFRAME (frame)->buried_buffer_list; CONSP (link); |
| 1649 | link = XCDR (link)) |
| 1650 | { |
| 1651 | if (EQ (XCAR (link), buf)) |
| 1652 | { |
| 1653 | if (NILP (prev)) |
| 1654 | XFRAME (frame)->buried_buffer_list = XCDR (link); |
| 1655 | else |
| 1656 | XSETCDR (prev, XCDR (XCDR (prev))); |
| 1657 | break; |
| 1658 | } |
| 1659 | prev = link; |
| 1660 | } |
| 1661 | |
| 1662 | /* Now move this buffer to the front of frame_buffer_list also. */ |
| 1663 | |
| 1664 | prev = Qnil; |
| 1665 | for (link = frame_buffer_list (frame); CONSP (link); |
| 1666 | link = XCDR (link)) |
| 1667 | { |
| 1668 | if (EQ (XCAR (link), buf)) |
| 1669 | break; |
| 1670 | prev = link; |
| 1671 | } |
| 1672 | |
| 1673 | /* Effectively do delq. */ |
| 1674 | |
| 1675 | if (CONSP (link)) |
| 1676 | { |
| 1677 | if (NILP (prev)) |
| 1678 | set_frame_buffer_list (frame, |
| 1679 | XCDR (frame_buffer_list (frame))); |
| 1680 | else |
| 1681 | XSETCDR (prev, XCDR (XCDR (prev))); |
| 1682 | |
| 1683 | XSETCDR (link, frame_buffer_list (frame)); |
| 1684 | set_frame_buffer_list (frame, link); |
| 1685 | } |
| 1686 | else |
| 1687 | set_frame_buffer_list (frame, Fcons (buf, frame_buffer_list (frame))); |
| 1688 | } |
| 1689 | |
| 1690 | DEFUN ("set-buffer-major-mode", Fset_buffer_major_mode, Sset_buffer_major_mode, 1, 1, 0, |
| 1691 | doc: /* Set an appropriate major mode for BUFFER. |
| 1692 | For the *scratch* buffer, use `initial-major-mode', otherwise choose a mode |
| 1693 | according to `default-major-mode'. |
| 1694 | Use this function before selecting the buffer, since it may need to inspect |
| 1695 | the current buffer's major mode. */) |
| 1696 | (buffer) |
| 1697 | Lisp_Object buffer; |
| 1698 | { |
| 1699 | int count; |
| 1700 | Lisp_Object function; |
| 1701 | |
| 1702 | CHECK_BUFFER (buffer); |
| 1703 | |
| 1704 | if (STRINGP (XBUFFER (buffer)->name) |
| 1705 | && strcmp (SDATA (XBUFFER (buffer)->name), "*scratch*") == 0) |
| 1706 | function = find_symbol_value (intern ("initial-major-mode")); |
| 1707 | else |
| 1708 | { |
| 1709 | function = buffer_defaults.major_mode; |
| 1710 | if (NILP (function) |
| 1711 | && NILP (Fget (current_buffer->major_mode, Qmode_class))) |
| 1712 | function = current_buffer->major_mode; |
| 1713 | } |
| 1714 | |
| 1715 | if (NILP (function) || EQ (function, Qfundamental_mode)) |
| 1716 | return Qnil; |
| 1717 | |
| 1718 | count = SPECPDL_INDEX (); |
| 1719 | |
| 1720 | /* To select a nonfundamental mode, |
| 1721 | select the buffer temporarily and then call the mode function. */ |
| 1722 | |
| 1723 | record_unwind_protect (save_excursion_restore, save_excursion_save ()); |
| 1724 | |
| 1725 | Fset_buffer (buffer); |
| 1726 | call0 (function); |
| 1727 | |
| 1728 | return unbind_to (count, Qnil); |
| 1729 | } |
| 1730 | |
| 1731 | /* Switch to buffer BUFFER in the selected window. |
| 1732 | If NORECORD is non-nil, don't call record_buffer. */ |
| 1733 | |
| 1734 | Lisp_Object |
| 1735 | switch_to_buffer_1 (buffer_or_name, norecord) |
| 1736 | Lisp_Object buffer_or_name, norecord; |
| 1737 | { |
| 1738 | register Lisp_Object buffer; |
| 1739 | |
| 1740 | if (NILP (buffer_or_name)) |
| 1741 | buffer = Fother_buffer (Fcurrent_buffer (), Qnil, Qnil); |
| 1742 | else |
| 1743 | { |
| 1744 | buffer = Fget_buffer (buffer_or_name); |
| 1745 | if (NILP (buffer)) |
| 1746 | { |
| 1747 | buffer = Fget_buffer_create (buffer_or_name); |
| 1748 | Fset_buffer_major_mode (buffer); |
| 1749 | } |
| 1750 | } |
| 1751 | Fset_buffer (buffer); |
| 1752 | if (NILP (norecord)) |
| 1753 | record_buffer (buffer); |
| 1754 | |
| 1755 | Fset_window_buffer (EQ (selected_window, minibuf_window) |
| 1756 | ? Fnext_window (minibuf_window, Qnil, Qnil) |
| 1757 | : selected_window, |
| 1758 | buffer, Qnil); |
| 1759 | |
| 1760 | return buffer; |
| 1761 | } |
| 1762 | |
| 1763 | DEFUN ("switch-to-buffer", Fswitch_to_buffer, Sswitch_to_buffer, 1, 2, |
| 1764 | "(list (read-buffer-to-switch \"Switch to buffer: \"))", |
| 1765 | doc: /* Make BUFFER-OR-NAME current and display it in selected window. |
| 1766 | BUFFER-OR-NAME may be a buffer, a string \(a buffer name), or |
| 1767 | nil. Return the buffer switched to. |
| 1768 | |
| 1769 | If BUFFER-OR-NAME is a string and does not identify an existing |
| 1770 | buffer, create a new buffer with that name. Interactively, if |
| 1771 | `confirm-nonexistent-file-or-buffer' is non-nil, request |
| 1772 | confirmation before creating a new buffer. If BUFFER-OR-NAME is |
| 1773 | nil, switch to buffer returned by `other-buffer'. |
| 1774 | |
| 1775 | Optional second arg NORECORD non-nil means do not put this buffer |
| 1776 | at the front of the list of recently selected ones. This |
| 1777 | function returns the buffer it switched to as a Lisp object. |
| 1778 | |
| 1779 | If the selected window is the minibuffer window or dedicated to |
| 1780 | its buffer, use `pop-to-buffer' for displaying the buffer. |
| 1781 | |
| 1782 | WARNING: This is NOT the way to work on another buffer temporarily |
| 1783 | within a Lisp program! Use `set-buffer' instead. That avoids |
| 1784 | messing with the window-buffer correspondences. */) |
| 1785 | (buffer_or_name, norecord) |
| 1786 | Lisp_Object buffer_or_name, norecord; |
| 1787 | { |
| 1788 | char *err; |
| 1789 | |
| 1790 | if (EQ (buffer_or_name, Fwindow_buffer (selected_window))) |
| 1791 | { |
| 1792 | /* Basically a NOP. Avoid signalling an error in the case where |
| 1793 | the selected window is dedicated, or a minibuffer. */ |
| 1794 | |
| 1795 | /* But do put this buffer at the front of the buffer list, unless |
| 1796 | that has been inhibited. Note that even if BUFFER-OR-NAME is |
| 1797 | at the front of the main buffer-list already, we still want to |
| 1798 | move it to the front of the frame's buffer list. */ |
| 1799 | if (NILP (norecord)) |
| 1800 | record_buffer (buffer_or_name); |
| 1801 | return Fset_buffer (buffer_or_name); |
| 1802 | } |
| 1803 | else if (EQ (minibuf_window, selected_window) |
| 1804 | /* If `dedicated' is neither nil nor t, it means it's |
| 1805 | dedicatedness can be overridden by an explicit request |
| 1806 | such as a call to switch-to-buffer. */ |
| 1807 | || EQ (Fwindow_dedicated_p (selected_window), Qt)) |
| 1808 | /* We can't use the selected window so let `pop-to-buffer' try some |
| 1809 | other window. */ |
| 1810 | return call3 (intern ("pop-to-buffer"), buffer_or_name, Qnil, norecord); |
| 1811 | else |
| 1812 | return switch_to_buffer_1 (buffer_or_name, norecord); |
| 1813 | } |
| 1814 | |
| 1815 | DEFUN ("current-buffer", Fcurrent_buffer, Scurrent_buffer, 0, 0, 0, |
| 1816 | doc: /* Return the current buffer as a Lisp object. */) |
| 1817 | () |
| 1818 | { |
| 1819 | register Lisp_Object buf; |
| 1820 | XSETBUFFER (buf, current_buffer); |
| 1821 | return buf; |
| 1822 | } |
| 1823 | \f |
| 1824 | /* Set the current buffer to B. |
| 1825 | |
| 1826 | We previously set windows_or_buffers_changed here to invalidate |
| 1827 | global unchanged information in beg_unchanged and end_unchanged. |
| 1828 | This is no longer necessary because we now compute unchanged |
| 1829 | information on a buffer-basis. Every action affecting other |
| 1830 | windows than the selected one requires a select_window at some |
| 1831 | time, and that increments windows_or_buffers_changed. */ |
| 1832 | |
| 1833 | void |
| 1834 | set_buffer_internal (b) |
| 1835 | register struct buffer *b; |
| 1836 | { |
| 1837 | if (current_buffer != b) |
| 1838 | set_buffer_internal_1 (b); |
| 1839 | } |
| 1840 | |
| 1841 | /* Set the current buffer to B, and do not set windows_or_buffers_changed. |
| 1842 | This is used by redisplay. */ |
| 1843 | |
| 1844 | void |
| 1845 | set_buffer_internal_1 (b) |
| 1846 | register struct buffer *b; |
| 1847 | { |
| 1848 | register struct buffer *old_buf; |
| 1849 | register Lisp_Object tail, valcontents; |
| 1850 | Lisp_Object tem; |
| 1851 | |
| 1852 | #ifdef USE_MMAP_FOR_BUFFERS |
| 1853 | if (b->text->beg == NULL) |
| 1854 | enlarge_buffer_text (b, 0); |
| 1855 | #endif /* USE_MMAP_FOR_BUFFERS */ |
| 1856 | |
| 1857 | if (current_buffer == b) |
| 1858 | return; |
| 1859 | |
| 1860 | old_buf = current_buffer; |
| 1861 | current_buffer = b; |
| 1862 | last_known_column_point = -1; /* invalidate indentation cache */ |
| 1863 | |
| 1864 | if (old_buf) |
| 1865 | { |
| 1866 | /* Put the undo list back in the base buffer, so that it appears |
| 1867 | that an indirect buffer shares the undo list of its base. */ |
| 1868 | if (old_buf->base_buffer) |
| 1869 | old_buf->base_buffer->undo_list = old_buf->undo_list; |
| 1870 | |
| 1871 | /* If the old current buffer has markers to record PT, BEGV and ZV |
| 1872 | when it is not current, update them now. */ |
| 1873 | if (! NILP (old_buf->pt_marker)) |
| 1874 | { |
| 1875 | Lisp_Object obuf; |
| 1876 | XSETBUFFER (obuf, old_buf); |
| 1877 | set_marker_both (old_buf->pt_marker, obuf, |
| 1878 | BUF_PT (old_buf), BUF_PT_BYTE (old_buf)); |
| 1879 | } |
| 1880 | if (! NILP (old_buf->begv_marker)) |
| 1881 | { |
| 1882 | Lisp_Object obuf; |
| 1883 | XSETBUFFER (obuf, old_buf); |
| 1884 | set_marker_both (old_buf->begv_marker, obuf, |
| 1885 | BUF_BEGV (old_buf), BUF_BEGV_BYTE (old_buf)); |
| 1886 | } |
| 1887 | if (! NILP (old_buf->zv_marker)) |
| 1888 | { |
| 1889 | Lisp_Object obuf; |
| 1890 | XSETBUFFER (obuf, old_buf); |
| 1891 | set_marker_both (old_buf->zv_marker, obuf, |
| 1892 | BUF_ZV (old_buf), BUF_ZV_BYTE (old_buf)); |
| 1893 | } |
| 1894 | } |
| 1895 | |
| 1896 | /* Get the undo list from the base buffer, so that it appears |
| 1897 | that an indirect buffer shares the undo list of its base. */ |
| 1898 | if (b->base_buffer) |
| 1899 | b->undo_list = b->base_buffer->undo_list; |
| 1900 | |
| 1901 | /* If the new current buffer has markers to record PT, BEGV and ZV |
| 1902 | when it is not current, fetch them now. */ |
| 1903 | if (! NILP (b->pt_marker)) |
| 1904 | { |
| 1905 | BUF_PT (b) = marker_position (b->pt_marker); |
| 1906 | BUF_PT_BYTE (b) = marker_byte_position (b->pt_marker); |
| 1907 | } |
| 1908 | if (! NILP (b->begv_marker)) |
| 1909 | { |
| 1910 | BUF_BEGV (b) = marker_position (b->begv_marker); |
| 1911 | BUF_BEGV_BYTE (b) = marker_byte_position (b->begv_marker); |
| 1912 | } |
| 1913 | if (! NILP (b->zv_marker)) |
| 1914 | { |
| 1915 | BUF_ZV (b) = marker_position (b->zv_marker); |
| 1916 | BUF_ZV_BYTE (b) = marker_byte_position (b->zv_marker); |
| 1917 | } |
| 1918 | |
| 1919 | /* Look down buffer's list of local Lisp variables |
| 1920 | to find and update any that forward into C variables. */ |
| 1921 | |
| 1922 | for (tail = b->local_var_alist; CONSP (tail); tail = XCDR (tail)) |
| 1923 | { |
| 1924 | valcontents = SYMBOL_VALUE (XCAR (XCAR (tail))); |
| 1925 | if ((BUFFER_LOCAL_VALUEP (valcontents)) |
| 1926 | && (tem = XBUFFER_LOCAL_VALUE (valcontents)->realvalue, |
| 1927 | (BOOLFWDP (tem) || INTFWDP (tem) || OBJFWDP (tem)))) |
| 1928 | /* Just reference the variable |
| 1929 | to cause it to become set for this buffer. */ |
| 1930 | Fsymbol_value (XCAR (XCAR (tail))); |
| 1931 | } |
| 1932 | |
| 1933 | /* Do the same with any others that were local to the previous buffer */ |
| 1934 | |
| 1935 | if (old_buf) |
| 1936 | for (tail = old_buf->local_var_alist; CONSP (tail); tail = XCDR (tail)) |
| 1937 | { |
| 1938 | valcontents = SYMBOL_VALUE (XCAR (XCAR (tail))); |
| 1939 | if ((BUFFER_LOCAL_VALUEP (valcontents)) |
| 1940 | && (tem = XBUFFER_LOCAL_VALUE (valcontents)->realvalue, |
| 1941 | (BOOLFWDP (tem) || INTFWDP (tem) || OBJFWDP (tem)))) |
| 1942 | /* Just reference the variable |
| 1943 | to cause it to become set for this buffer. */ |
| 1944 | Fsymbol_value (XCAR (XCAR (tail))); |
| 1945 | } |
| 1946 | } |
| 1947 | |
| 1948 | /* Switch to buffer B temporarily for redisplay purposes. |
| 1949 | This avoids certain things that don't need to be done within redisplay. */ |
| 1950 | |
| 1951 | void |
| 1952 | set_buffer_temp (b) |
| 1953 | struct buffer *b; |
| 1954 | { |
| 1955 | register struct buffer *old_buf; |
| 1956 | |
| 1957 | if (current_buffer == b) |
| 1958 | return; |
| 1959 | |
| 1960 | old_buf = current_buffer; |
| 1961 | current_buffer = b; |
| 1962 | |
| 1963 | if (old_buf) |
| 1964 | { |
| 1965 | /* If the old current buffer has markers to record PT, BEGV and ZV |
| 1966 | when it is not current, update them now. */ |
| 1967 | if (! NILP (old_buf->pt_marker)) |
| 1968 | { |
| 1969 | Lisp_Object obuf; |
| 1970 | XSETBUFFER (obuf, old_buf); |
| 1971 | set_marker_both (old_buf->pt_marker, obuf, |
| 1972 | BUF_PT (old_buf), BUF_PT_BYTE (old_buf)); |
| 1973 | } |
| 1974 | if (! NILP (old_buf->begv_marker)) |
| 1975 | { |
| 1976 | Lisp_Object obuf; |
| 1977 | XSETBUFFER (obuf, old_buf); |
| 1978 | set_marker_both (old_buf->begv_marker, obuf, |
| 1979 | BUF_BEGV (old_buf), BUF_BEGV_BYTE (old_buf)); |
| 1980 | } |
| 1981 | if (! NILP (old_buf->zv_marker)) |
| 1982 | { |
| 1983 | Lisp_Object obuf; |
| 1984 | XSETBUFFER (obuf, old_buf); |
| 1985 | set_marker_both (old_buf->zv_marker, obuf, |
| 1986 | BUF_ZV (old_buf), BUF_ZV_BYTE (old_buf)); |
| 1987 | } |
| 1988 | } |
| 1989 | |
| 1990 | /* If the new current buffer has markers to record PT, BEGV and ZV |
| 1991 | when it is not current, fetch them now. */ |
| 1992 | if (! NILP (b->pt_marker)) |
| 1993 | { |
| 1994 | BUF_PT (b) = marker_position (b->pt_marker); |
| 1995 | BUF_PT_BYTE (b) = marker_byte_position (b->pt_marker); |
| 1996 | } |
| 1997 | if (! NILP (b->begv_marker)) |
| 1998 | { |
| 1999 | BUF_BEGV (b) = marker_position (b->begv_marker); |
| 2000 | BUF_BEGV_BYTE (b) = marker_byte_position (b->begv_marker); |
| 2001 | } |
| 2002 | if (! NILP (b->zv_marker)) |
| 2003 | { |
| 2004 | BUF_ZV (b) = marker_position (b->zv_marker); |
| 2005 | BUF_ZV_BYTE (b) = marker_byte_position (b->zv_marker); |
| 2006 | } |
| 2007 | } |
| 2008 | |
| 2009 | DEFUN ("set-buffer", Fset_buffer, Sset_buffer, 1, 1, 0, |
| 2010 | doc: /* Make buffer BUFFER-OR-NAME current for editing operations. |
| 2011 | BUFFER-OR-NAME may be a buffer or the name of an existing buffer. See |
| 2012 | also `save-excursion' when you want to make a buffer current |
| 2013 | temporarily. This function does not display the buffer, so its effect |
| 2014 | ends when the current command terminates. Use `switch-to-buffer' or |
| 2015 | `pop-to-buffer' to switch buffers permanently. */) |
| 2016 | (buffer_or_name) |
| 2017 | register Lisp_Object buffer_or_name; |
| 2018 | { |
| 2019 | register Lisp_Object buffer; |
| 2020 | buffer = Fget_buffer (buffer_or_name); |
| 2021 | if (NILP (buffer)) |
| 2022 | nsberror (buffer_or_name); |
| 2023 | if (NILP (XBUFFER (buffer)->name)) |
| 2024 | error ("Selecting deleted buffer"); |
| 2025 | set_buffer_internal (XBUFFER (buffer)); |
| 2026 | return buffer; |
| 2027 | } |
| 2028 | |
| 2029 | /* Set the current buffer to BUFFER provided it is alive. */ |
| 2030 | |
| 2031 | Lisp_Object |
| 2032 | set_buffer_if_live (buffer) |
| 2033 | Lisp_Object buffer; |
| 2034 | { |
| 2035 | if (! NILP (XBUFFER (buffer)->name)) |
| 2036 | Fset_buffer (buffer); |
| 2037 | return Qnil; |
| 2038 | } |
| 2039 | \f |
| 2040 | DEFUN ("barf-if-buffer-read-only", Fbarf_if_buffer_read_only, |
| 2041 | Sbarf_if_buffer_read_only, 0, 0, 0, |
| 2042 | doc: /* Signal a `buffer-read-only' error if the current buffer is read-only. */) |
| 2043 | () |
| 2044 | { |
| 2045 | if (!NILP (current_buffer->read_only) |
| 2046 | && NILP (Vinhibit_read_only)) |
| 2047 | xsignal1 (Qbuffer_read_only, Fcurrent_buffer ()); |
| 2048 | return Qnil; |
| 2049 | } |
| 2050 | |
| 2051 | DEFUN ("bury-buffer", Fbury_buffer, Sbury_buffer, 0, 1, "", |
| 2052 | doc: /* Put BUFFER-OR-NAME at the end of the list of all buffers. |
| 2053 | There it is the least likely candidate for `other-buffer' to return; |
| 2054 | thus, the least likely buffer for \\[switch-to-buffer] to select by |
| 2055 | default. |
| 2056 | |
| 2057 | The argument may be a buffer name or an actual buffer object. If |
| 2058 | BUFFER-OR-NAME is nil or omitted, bury the current buffer and remove it |
| 2059 | from the selected window if it is displayed there. If the selected |
| 2060 | window is dedicated to its buffer, delete that window if there are other |
| 2061 | windows on the same frame. If the selected window is the only window on |
| 2062 | its frame, iconify that frame. */) |
| 2063 | (buffer_or_name) |
| 2064 | register Lisp_Object buffer_or_name; |
| 2065 | { |
| 2066 | Lisp_Object buffer; |
| 2067 | |
| 2068 | /* Figure out what buffer we're going to bury. */ |
| 2069 | if (NILP (buffer_or_name)) |
| 2070 | { |
| 2071 | Lisp_Object tem; |
| 2072 | XSETBUFFER (buffer, current_buffer); |
| 2073 | |
| 2074 | tem = Fwindow_buffer (selected_window); |
| 2075 | /* If we're burying the current buffer, unshow it. */ |
| 2076 | if (EQ (buffer, tem)) |
| 2077 | { |
| 2078 | if (NILP (Fwindow_dedicated_p (selected_window))) |
| 2079 | Fswitch_to_buffer (Fother_buffer (buffer, Qnil, Qnil), Qnil); |
| 2080 | else if (NILP (XWINDOW (selected_window)->parent)) |
| 2081 | Ficonify_frame (Fwindow_frame (selected_window)); |
| 2082 | else |
| 2083 | Fdelete_window (selected_window); |
| 2084 | } |
| 2085 | } |
| 2086 | else |
| 2087 | { |
| 2088 | buffer = Fget_buffer (buffer_or_name); |
| 2089 | if (NILP (buffer)) |
| 2090 | nsberror (buffer_or_name); |
| 2091 | } |
| 2092 | |
| 2093 | /* Move buffer to the end of the buffer list. Do nothing if the |
| 2094 | buffer is killed. */ |
| 2095 | if (!NILP (XBUFFER (buffer)->name)) |
| 2096 | { |
| 2097 | Lisp_Object aelt, link; |
| 2098 | |
| 2099 | aelt = Frassq (buffer, Vbuffer_alist); |
| 2100 | link = Fmemq (aelt, Vbuffer_alist); |
| 2101 | Vbuffer_alist = Fdelq (aelt, Vbuffer_alist); |
| 2102 | XSETCDR (link, Qnil); |
| 2103 | Vbuffer_alist = nconc2 (Vbuffer_alist, link); |
| 2104 | |
| 2105 | XFRAME (selected_frame)->buffer_list |
| 2106 | = Fdelq (buffer, XFRAME (selected_frame)->buffer_list); |
| 2107 | XFRAME (selected_frame)->buried_buffer_list |
| 2108 | = Fcons (buffer, Fdelq (buffer, XFRAME (selected_frame)->buried_buffer_list)); |
| 2109 | } |
| 2110 | |
| 2111 | return Qnil; |
| 2112 | } |
| 2113 | \f |
| 2114 | DEFUN ("erase-buffer", Ferase_buffer, Serase_buffer, 0, 0, "*", |
| 2115 | doc: /* Delete the entire contents of the current buffer. |
| 2116 | Any narrowing restriction in effect (see `narrow-to-region') is removed, |
| 2117 | so the buffer is truly empty after this. */) |
| 2118 | () |
| 2119 | { |
| 2120 | Fwiden (); |
| 2121 | |
| 2122 | del_range (BEG, Z); |
| 2123 | |
| 2124 | current_buffer->last_window_start = 1; |
| 2125 | /* Prevent warnings, or suspension of auto saving, that would happen |
| 2126 | if future size is less than past size. Use of erase-buffer |
| 2127 | implies that the future text is not really related to the past text. */ |
| 2128 | XSETFASTINT (current_buffer->save_length, 0); |
| 2129 | return Qnil; |
| 2130 | } |
| 2131 | |
| 2132 | void |
| 2133 | validate_region (b, e) |
| 2134 | register Lisp_Object *b, *e; |
| 2135 | { |
| 2136 | CHECK_NUMBER_COERCE_MARKER (*b); |
| 2137 | CHECK_NUMBER_COERCE_MARKER (*e); |
| 2138 | |
| 2139 | if (XINT (*b) > XINT (*e)) |
| 2140 | { |
| 2141 | Lisp_Object tem; |
| 2142 | tem = *b; *b = *e; *e = tem; |
| 2143 | } |
| 2144 | |
| 2145 | if (!(BEGV <= XINT (*b) && XINT (*b) <= XINT (*e) |
| 2146 | && XINT (*e) <= ZV)) |
| 2147 | args_out_of_range (*b, *e); |
| 2148 | } |
| 2149 | \f |
| 2150 | /* Advance BYTE_POS up to a character boundary |
| 2151 | and return the adjusted position. */ |
| 2152 | |
| 2153 | static int |
| 2154 | advance_to_char_boundary (byte_pos) |
| 2155 | int byte_pos; |
| 2156 | { |
| 2157 | int c; |
| 2158 | |
| 2159 | if (byte_pos == BEG) |
| 2160 | /* Beginning of buffer is always a character boundary. */ |
| 2161 | return BEG; |
| 2162 | |
| 2163 | c = FETCH_BYTE (byte_pos); |
| 2164 | if (! CHAR_HEAD_P (c)) |
| 2165 | { |
| 2166 | /* We should advance BYTE_POS only when C is a constituent of a |
| 2167 | multibyte sequence. */ |
| 2168 | int orig_byte_pos = byte_pos; |
| 2169 | |
| 2170 | do |
| 2171 | { |
| 2172 | byte_pos--; |
| 2173 | c = FETCH_BYTE (byte_pos); |
| 2174 | } |
| 2175 | while (! CHAR_HEAD_P (c) && byte_pos > BEG); |
| 2176 | INC_POS (byte_pos); |
| 2177 | if (byte_pos < orig_byte_pos) |
| 2178 | byte_pos = orig_byte_pos; |
| 2179 | /* If C is a constituent of a multibyte sequence, BYTE_POS was |
| 2180 | surely advance to the correct character boundary. If C is |
| 2181 | not, BYTE_POS was unchanged. */ |
| 2182 | } |
| 2183 | |
| 2184 | return byte_pos; |
| 2185 | } |
| 2186 | |
| 2187 | #ifdef REL_ALLOC |
| 2188 | extern void r_alloc_reset_variable P_ ((POINTER_TYPE *, POINTER_TYPE *)); |
| 2189 | #endif /* REL_ALLOC */ |
| 2190 | |
| 2191 | DEFUN ("buffer-swap-text", Fbuffer_swap_text, Sbuffer_swap_text, |
| 2192 | 1, 1, 0, |
| 2193 | doc: /* Swap the text between current buffer and BUFFER. */) |
| 2194 | (buffer) |
| 2195 | Lisp_Object buffer; |
| 2196 | { |
| 2197 | struct buffer *other_buffer; |
| 2198 | CHECK_BUFFER (buffer); |
| 2199 | other_buffer = XBUFFER (buffer); |
| 2200 | |
| 2201 | if (NILP (other_buffer->name)) |
| 2202 | error ("Cannot swap a dead buffer's text"); |
| 2203 | |
| 2204 | /* Actually, it probably works just fine. |
| 2205 | * if (other_buffer == current_buffer) |
| 2206 | * error ("Cannot swap a buffer's text with itself"); */ |
| 2207 | |
| 2208 | /* Actually, this may be workable as well, tho probably only if they're |
| 2209 | *both* indirect. */ |
| 2210 | if (other_buffer->base_buffer |
| 2211 | || current_buffer->base_buffer) |
| 2212 | error ("Cannot swap indirect buffers's text"); |
| 2213 | |
| 2214 | { /* This is probably harder to make work. */ |
| 2215 | struct buffer *other; |
| 2216 | for (other = all_buffers; other; other = other->next) |
| 2217 | if (other->base_buffer == other_buffer |
| 2218 | || other->base_buffer == current_buffer) |
| 2219 | error ("One of the buffers to swap has indirect buffers"); |
| 2220 | } |
| 2221 | |
| 2222 | #define swapfield(field, type) \ |
| 2223 | do { \ |
| 2224 | type tmp##field = other_buffer->field; \ |
| 2225 | other_buffer->field = current_buffer->field; \ |
| 2226 | current_buffer->field = tmp##field; \ |
| 2227 | } while (0) |
| 2228 | |
| 2229 | swapfield (own_text, struct buffer_text); |
| 2230 | eassert (current_buffer->text == ¤t_buffer->own_text); |
| 2231 | eassert (other_buffer->text == &other_buffer->own_text); |
| 2232 | #ifdef REL_ALLOC |
| 2233 | r_alloc_reset_variable ((POINTER_TYPE **) ¤t_buffer->own_text.beg, |
| 2234 | (POINTER_TYPE **) &other_buffer->own_text.beg); |
| 2235 | r_alloc_reset_variable ((POINTER_TYPE **) &other_buffer->own_text.beg, |
| 2236 | (POINTER_TYPE **) ¤t_buffer->own_text.beg); |
| 2237 | #endif /* REL_ALLOC */ |
| 2238 | |
| 2239 | swapfield (pt, EMACS_INT); |
| 2240 | swapfield (pt_byte, EMACS_INT); |
| 2241 | swapfield (begv, EMACS_INT); |
| 2242 | swapfield (begv_byte, EMACS_INT); |
| 2243 | swapfield (zv, EMACS_INT); |
| 2244 | swapfield (zv_byte, EMACS_INT); |
| 2245 | eassert (!current_buffer->base_buffer); |
| 2246 | eassert (!other_buffer->base_buffer); |
| 2247 | current_buffer->clip_changed = 1; other_buffer->clip_changed = 1; |
| 2248 | swapfield (newline_cache, struct region_cache *); |
| 2249 | swapfield (width_run_cache, struct region_cache *); |
| 2250 | current_buffer->prevent_redisplay_optimizations_p = 1; |
| 2251 | other_buffer->prevent_redisplay_optimizations_p = 1; |
| 2252 | swapfield (overlays_before, struct Lisp_Overlay *); |
| 2253 | swapfield (overlays_after, struct Lisp_Overlay *); |
| 2254 | swapfield (overlay_center, EMACS_INT); |
| 2255 | swapfield (undo_list, Lisp_Object); |
| 2256 | swapfield (mark, Lisp_Object); |
| 2257 | swapfield (enable_multibyte_characters, Lisp_Object); |
| 2258 | /* FIXME: Not sure what we should do with these *_marker fields. |
| 2259 | Hopefully they're just nil anyway. */ |
| 2260 | swapfield (pt_marker, Lisp_Object); |
| 2261 | swapfield (begv_marker, Lisp_Object); |
| 2262 | swapfield (zv_marker, Lisp_Object); |
| 2263 | current_buffer->point_before_scroll = Qnil; |
| 2264 | other_buffer->point_before_scroll = Qnil; |
| 2265 | |
| 2266 | current_buffer->text->modiff++; other_buffer->text->modiff++; |
| 2267 | current_buffer->text->chars_modiff++; other_buffer->text->chars_modiff++; |
| 2268 | current_buffer->text->overlay_modiff++; other_buffer->text->overlay_modiff++; |
| 2269 | current_buffer->text->beg_unchanged = current_buffer->text->gpt; |
| 2270 | current_buffer->text->end_unchanged = current_buffer->text->gpt; |
| 2271 | other_buffer->text->beg_unchanged = other_buffer->text->gpt; |
| 2272 | other_buffer->text->end_unchanged = other_buffer->text->gpt; |
| 2273 | { |
| 2274 | struct Lisp_Marker *m; |
| 2275 | for (m = BUF_MARKERS (current_buffer); m; m = m->next) |
| 2276 | if (m->buffer == other_buffer) |
| 2277 | m->buffer = current_buffer; |
| 2278 | else |
| 2279 | /* Since there's no indirect buffer in sight, markers on |
| 2280 | BUF_MARKERS(buf) should either be for `buf' or dead. */ |
| 2281 | eassert (!m->buffer); |
| 2282 | for (m = BUF_MARKERS (other_buffer); m; m = m->next) |
| 2283 | if (m->buffer == current_buffer) |
| 2284 | m->buffer = other_buffer; |
| 2285 | else |
| 2286 | /* Since there's no indirect buffer in sight, markers on |
| 2287 | BUF_MARKERS(buf) should either be for `buf' or dead. */ |
| 2288 | eassert (!m->buffer); |
| 2289 | } |
| 2290 | { /* Some of the C code expects that w->buffer == w->pointm->buffer. |
| 2291 | So since we just swapped the markers between the two buffers, we need |
| 2292 | to undo the effect of this swap for window markers. */ |
| 2293 | Lisp_Object w = Fselected_window (), ws = Qnil; |
| 2294 | Lisp_Object buf1, buf2; |
| 2295 | XSETBUFFER (buf1, current_buffer); XSETBUFFER (buf2, other_buffer); |
| 2296 | |
| 2297 | while (NILP (Fmemq (w, ws))) |
| 2298 | { |
| 2299 | ws = Fcons (w, ws); |
| 2300 | if (MARKERP (XWINDOW (w)->pointm) |
| 2301 | && (EQ (XWINDOW (w)->buffer, buf1) |
| 2302 | || EQ (XWINDOW (w)->buffer, buf2))) |
| 2303 | Fset_marker (XWINDOW (w)->pointm, |
| 2304 | make_number (BUF_BEGV (XBUFFER (XWINDOW (w)->buffer))), |
| 2305 | XWINDOW (w)->buffer); |
| 2306 | w = Fnext_window (w, Qt, Qt); |
| 2307 | } |
| 2308 | } |
| 2309 | |
| 2310 | if (current_buffer->text->intervals) |
| 2311 | (eassert (EQ (current_buffer->text->intervals->up.obj, buffer)), |
| 2312 | XSETBUFFER (current_buffer->text->intervals->up.obj, current_buffer)); |
| 2313 | if (other_buffer->text->intervals) |
| 2314 | (eassert (EQ (other_buffer->text->intervals->up.obj, Fcurrent_buffer ())), |
| 2315 | XSETBUFFER (other_buffer->text->intervals->up.obj, other_buffer)); |
| 2316 | |
| 2317 | return Qnil; |
| 2318 | } |
| 2319 | |
| 2320 | DEFUN ("set-buffer-multibyte", Fset_buffer_multibyte, Sset_buffer_multibyte, |
| 2321 | 1, 1, 0, |
| 2322 | doc: /* Set the multibyte flag of the current buffer to FLAG. |
| 2323 | If FLAG is t, this makes the buffer a multibyte buffer. |
| 2324 | If FLAG is nil, this makes the buffer a single-byte buffer. |
| 2325 | In these cases, the buffer contents remain unchanged as a sequence of |
| 2326 | bytes but the contents viewed as characters do change. |
| 2327 | If FLAG is `to', this makes the buffer a multibyte buffer by changing |
| 2328 | all eight-bit bytes to eight-bit characters. |
| 2329 | If the multibyte flag was really changed, undo information of the |
| 2330 | current buffer is cleared. */) |
| 2331 | (flag) |
| 2332 | Lisp_Object flag; |
| 2333 | { |
| 2334 | struct Lisp_Marker *tail, *markers; |
| 2335 | struct buffer *other; |
| 2336 | int begv, zv; |
| 2337 | int narrowed = (BEG != BEGV || Z != ZV); |
| 2338 | int modified_p = !NILP (Fbuffer_modified_p (Qnil)); |
| 2339 | Lisp_Object old_undo = current_buffer->undo_list; |
| 2340 | struct gcpro gcpro1; |
| 2341 | |
| 2342 | if (current_buffer->base_buffer) |
| 2343 | error ("Cannot do `set-buffer-multibyte' on an indirect buffer"); |
| 2344 | |
| 2345 | /* Do nothing if nothing actually changes. */ |
| 2346 | if (NILP (flag) == NILP (current_buffer->enable_multibyte_characters)) |
| 2347 | return flag; |
| 2348 | |
| 2349 | GCPRO1 (old_undo); |
| 2350 | |
| 2351 | /* Don't record these buffer changes. We will put a special undo entry |
| 2352 | instead. */ |
| 2353 | current_buffer->undo_list = Qt; |
| 2354 | |
| 2355 | /* If the cached position is for this buffer, clear it out. */ |
| 2356 | clear_charpos_cache (current_buffer); |
| 2357 | |
| 2358 | if (NILP (flag)) |
| 2359 | begv = BEGV_BYTE, zv = ZV_BYTE; |
| 2360 | else |
| 2361 | begv = BEGV, zv = ZV; |
| 2362 | |
| 2363 | if (narrowed) |
| 2364 | Fwiden (); |
| 2365 | |
| 2366 | if (NILP (flag)) |
| 2367 | { |
| 2368 | int pos, stop; |
| 2369 | unsigned char *p; |
| 2370 | |
| 2371 | /* Do this first, so it can use CHAR_TO_BYTE |
| 2372 | to calculate the old correspondences. */ |
| 2373 | set_intervals_multibyte (0); |
| 2374 | |
| 2375 | current_buffer->enable_multibyte_characters = Qnil; |
| 2376 | |
| 2377 | Z = Z_BYTE; |
| 2378 | BEGV = BEGV_BYTE; |
| 2379 | ZV = ZV_BYTE; |
| 2380 | GPT = GPT_BYTE; |
| 2381 | TEMP_SET_PT_BOTH (PT_BYTE, PT_BYTE); |
| 2382 | |
| 2383 | |
| 2384 | for (tail = BUF_MARKERS (current_buffer); tail; tail = tail->next) |
| 2385 | tail->charpos = tail->bytepos; |
| 2386 | |
| 2387 | /* Convert multibyte form of 8-bit characters to unibyte. */ |
| 2388 | pos = BEG; |
| 2389 | stop = GPT; |
| 2390 | p = BEG_ADDR; |
| 2391 | while (1) |
| 2392 | { |
| 2393 | int c, bytes; |
| 2394 | |
| 2395 | if (pos == stop) |
| 2396 | { |
| 2397 | if (pos == Z) |
| 2398 | break; |
| 2399 | p = GAP_END_ADDR; |
| 2400 | stop = Z; |
| 2401 | } |
| 2402 | if (ASCII_BYTE_P (*p)) |
| 2403 | p++, pos++; |
| 2404 | else if (CHAR_BYTE8_HEAD_P (*p)) |
| 2405 | { |
| 2406 | c = STRING_CHAR_AND_LENGTH (p, stop - pos, bytes); |
| 2407 | /* Delete all bytes for this 8-bit character but the |
| 2408 | last one, and change the last one to the charcter |
| 2409 | code. */ |
| 2410 | bytes--; |
| 2411 | del_range_2 (pos, pos, pos + bytes, pos + bytes, 0); |
| 2412 | p = GAP_END_ADDR; |
| 2413 | *p++ = c; |
| 2414 | pos++; |
| 2415 | if (begv > pos) |
| 2416 | begv -= bytes; |
| 2417 | if (zv > pos) |
| 2418 | zv -= bytes; |
| 2419 | stop = Z; |
| 2420 | } |
| 2421 | else |
| 2422 | { |
| 2423 | bytes = BYTES_BY_CHAR_HEAD (*p); |
| 2424 | p += bytes, pos += bytes; |
| 2425 | } |
| 2426 | } |
| 2427 | if (narrowed) |
| 2428 | Fnarrow_to_region (make_number (begv), make_number (zv)); |
| 2429 | } |
| 2430 | else |
| 2431 | { |
| 2432 | int pt = PT; |
| 2433 | int pos, stop; |
| 2434 | unsigned char *p, *pend; |
| 2435 | |
| 2436 | /* Be sure not to have a multibyte sequence striding over the GAP. |
| 2437 | Ex: We change this: "...abc\302 _GAP_ \241def..." |
| 2438 | to: "...abc _GAP_ \302\241def..." */ |
| 2439 | |
| 2440 | if (EQ (flag, Qt) |
| 2441 | && GPT_BYTE > 1 && GPT_BYTE < Z_BYTE |
| 2442 | && ! CHAR_HEAD_P (*(GAP_END_ADDR))) |
| 2443 | { |
| 2444 | unsigned char *p = GPT_ADDR - 1; |
| 2445 | |
| 2446 | while (! CHAR_HEAD_P (*p) && p > BEG_ADDR) p--; |
| 2447 | if (BASE_LEADING_CODE_P (*p)) |
| 2448 | { |
| 2449 | int new_gpt = GPT_BYTE - (GPT_ADDR - p); |
| 2450 | |
| 2451 | move_gap_both (new_gpt, new_gpt); |
| 2452 | } |
| 2453 | } |
| 2454 | |
| 2455 | /* Make the buffer contents valid as multibyte by converting |
| 2456 | 8-bit characters to multibyte form. */ |
| 2457 | pos = BEG; |
| 2458 | stop = GPT; |
| 2459 | p = BEG_ADDR; |
| 2460 | pend = GPT_ADDR; |
| 2461 | while (1) |
| 2462 | { |
| 2463 | int bytes; |
| 2464 | |
| 2465 | if (pos == stop) |
| 2466 | { |
| 2467 | if (pos == Z) |
| 2468 | break; |
| 2469 | p = GAP_END_ADDR; |
| 2470 | pend = Z_ADDR; |
| 2471 | stop = Z; |
| 2472 | } |
| 2473 | |
| 2474 | if (ASCII_BYTE_P (*p)) |
| 2475 | p++, pos++; |
| 2476 | else if (EQ (flag, Qt) && (bytes = MULTIBYTE_LENGTH (p, pend)) > 0) |
| 2477 | p += bytes, pos += bytes; |
| 2478 | else |
| 2479 | { |
| 2480 | unsigned char tmp[MAX_MULTIBYTE_LENGTH]; |
| 2481 | int c; |
| 2482 | |
| 2483 | c = BYTE8_TO_CHAR (*p); |
| 2484 | bytes = CHAR_STRING (c, tmp); |
| 2485 | *p = tmp[0]; |
| 2486 | TEMP_SET_PT_BOTH (pos + 1, pos + 1); |
| 2487 | bytes--; |
| 2488 | insert_1_both (tmp + 1, bytes, bytes, 1, 0, 0); |
| 2489 | /* Now the gap is after the just inserted data. */ |
| 2490 | pos = GPT; |
| 2491 | p = GAP_END_ADDR; |
| 2492 | if (pos <= begv) |
| 2493 | begv += bytes; |
| 2494 | if (pos <= zv) |
| 2495 | zv += bytes; |
| 2496 | if (pos <= pt) |
| 2497 | pt += bytes; |
| 2498 | pend = Z_ADDR; |
| 2499 | stop = Z; |
| 2500 | } |
| 2501 | } |
| 2502 | |
| 2503 | if (pt != PT) |
| 2504 | TEMP_SET_PT (pt); |
| 2505 | |
| 2506 | if (narrowed) |
| 2507 | Fnarrow_to_region (make_number (begv), make_number (zv)); |
| 2508 | |
| 2509 | /* Do this first, so that chars_in_text asks the right question. |
| 2510 | set_intervals_multibyte needs it too. */ |
| 2511 | current_buffer->enable_multibyte_characters = Qt; |
| 2512 | |
| 2513 | GPT_BYTE = advance_to_char_boundary (GPT_BYTE); |
| 2514 | GPT = chars_in_text (BEG_ADDR, GPT_BYTE - BEG_BYTE) + BEG; |
| 2515 | |
| 2516 | Z = chars_in_text (GAP_END_ADDR, Z_BYTE - GPT_BYTE) + GPT; |
| 2517 | |
| 2518 | BEGV_BYTE = advance_to_char_boundary (BEGV_BYTE); |
| 2519 | if (BEGV_BYTE > GPT_BYTE) |
| 2520 | BEGV = chars_in_text (GAP_END_ADDR, BEGV_BYTE - GPT_BYTE) + GPT; |
| 2521 | else |
| 2522 | BEGV = chars_in_text (BEG_ADDR, BEGV_BYTE - BEG_BYTE) + BEG; |
| 2523 | |
| 2524 | ZV_BYTE = advance_to_char_boundary (ZV_BYTE); |
| 2525 | if (ZV_BYTE > GPT_BYTE) |
| 2526 | ZV = chars_in_text (GAP_END_ADDR, ZV_BYTE - GPT_BYTE) + GPT; |
| 2527 | else |
| 2528 | ZV = chars_in_text (BEG_ADDR, ZV_BYTE - BEG_BYTE) + BEG; |
| 2529 | |
| 2530 | { |
| 2531 | int pt_byte = advance_to_char_boundary (PT_BYTE); |
| 2532 | int pt; |
| 2533 | |
| 2534 | if (pt_byte > GPT_BYTE) |
| 2535 | pt = chars_in_text (GAP_END_ADDR, pt_byte - GPT_BYTE) + GPT; |
| 2536 | else |
| 2537 | pt = chars_in_text (BEG_ADDR, pt_byte - BEG_BYTE) + BEG; |
| 2538 | TEMP_SET_PT_BOTH (pt, pt_byte); |
| 2539 | } |
| 2540 | |
| 2541 | tail = markers = BUF_MARKERS (current_buffer); |
| 2542 | |
| 2543 | /* This prevents BYTE_TO_CHAR (that is, buf_bytepos_to_charpos) from |
| 2544 | getting confused by the markers that have not yet been updated. |
| 2545 | It is also a signal that it should never create a marker. */ |
| 2546 | BUF_MARKERS (current_buffer) = NULL; |
| 2547 | |
| 2548 | for (; tail; tail = tail->next) |
| 2549 | { |
| 2550 | tail->bytepos = advance_to_char_boundary (tail->bytepos); |
| 2551 | tail->charpos = BYTE_TO_CHAR (tail->bytepos); |
| 2552 | } |
| 2553 | |
| 2554 | /* Make sure no markers were put on the chain |
| 2555 | while the chain value was incorrect. */ |
| 2556 | if (BUF_MARKERS (current_buffer)) |
| 2557 | abort (); |
| 2558 | |
| 2559 | BUF_MARKERS (current_buffer) = markers; |
| 2560 | |
| 2561 | /* Do this last, so it can calculate the new correspondences |
| 2562 | between chars and bytes. */ |
| 2563 | set_intervals_multibyte (1); |
| 2564 | } |
| 2565 | |
| 2566 | if (!EQ (old_undo, Qt)) |
| 2567 | { |
| 2568 | /* Represent all the above changes by a special undo entry. */ |
| 2569 | extern Lisp_Object Qapply; |
| 2570 | current_buffer->undo_list = Fcons (list3 (Qapply, |
| 2571 | intern ("set-buffer-multibyte"), |
| 2572 | NILP (flag) ? Qt : Qnil), |
| 2573 | old_undo); |
| 2574 | } |
| 2575 | |
| 2576 | UNGCPRO; |
| 2577 | |
| 2578 | /* Changing the multibyteness of a buffer means that all windows |
| 2579 | showing that buffer must be updated thoroughly. */ |
| 2580 | current_buffer->prevent_redisplay_optimizations_p = 1; |
| 2581 | ++windows_or_buffers_changed; |
| 2582 | |
| 2583 | /* Copy this buffer's new multibyte status |
| 2584 | into all of its indirect buffers. */ |
| 2585 | for (other = all_buffers; other; other = other->next) |
| 2586 | if (other->base_buffer == current_buffer && !NILP (other->name)) |
| 2587 | { |
| 2588 | other->enable_multibyte_characters |
| 2589 | = current_buffer->enable_multibyte_characters; |
| 2590 | other->prevent_redisplay_optimizations_p = 1; |
| 2591 | } |
| 2592 | |
| 2593 | /* Restore the modifiedness of the buffer. */ |
| 2594 | if (!modified_p && !NILP (Fbuffer_modified_p (Qnil))) |
| 2595 | Fset_buffer_modified_p (Qnil); |
| 2596 | |
| 2597 | #ifdef subprocesses |
| 2598 | /* Update coding systems of this buffer's process (if any). */ |
| 2599 | { |
| 2600 | Lisp_Object process; |
| 2601 | |
| 2602 | process = Fget_buffer_process (Fcurrent_buffer ()); |
| 2603 | if (PROCESSP (process)) |
| 2604 | setup_process_coding_systems (process); |
| 2605 | } |
| 2606 | #endif /* subprocesses */ |
| 2607 | |
| 2608 | return flag; |
| 2609 | } |
| 2610 | \f |
| 2611 | DEFUN ("kill-all-local-variables", Fkill_all_local_variables, Skill_all_local_variables, |
| 2612 | 0, 0, 0, |
| 2613 | doc: /* Switch to Fundamental mode by killing current buffer's local variables. |
| 2614 | Most local variable bindings are eliminated so that the default values |
| 2615 | become effective once more. Also, the syntax table is set from |
| 2616 | `standard-syntax-table', the local keymap is set to nil, |
| 2617 | and the abbrev table from `fundamental-mode-abbrev-table'. |
| 2618 | This function also forces redisplay of the mode line. |
| 2619 | |
| 2620 | Every function to select a new major mode starts by |
| 2621 | calling this function. |
| 2622 | |
| 2623 | As a special exception, local variables whose names have |
| 2624 | a non-nil `permanent-local' property are not eliminated by this function. |
| 2625 | |
| 2626 | The first thing this function does is run |
| 2627 | the normal hook `change-major-mode-hook'. */) |
| 2628 | () |
| 2629 | { |
| 2630 | if (!NILP (Vrun_hooks)) |
| 2631 | call1 (Vrun_hooks, Qchange_major_mode_hook); |
| 2632 | |
| 2633 | /* Make sure none of the bindings in local_var_alist |
| 2634 | remain swapped in, in their symbols. */ |
| 2635 | |
| 2636 | swap_out_buffer_local_variables (current_buffer); |
| 2637 | |
| 2638 | /* Actually eliminate all local bindings of this buffer. */ |
| 2639 | |
| 2640 | reset_buffer_local_variables (current_buffer, 0); |
| 2641 | |
| 2642 | /* Force mode-line redisplay. Useful here because all major mode |
| 2643 | commands call this function. */ |
| 2644 | update_mode_lines++; |
| 2645 | |
| 2646 | return Qnil; |
| 2647 | } |
| 2648 | |
| 2649 | /* Make sure no local variables remain set up with buffer B |
| 2650 | for their current values. */ |
| 2651 | |
| 2652 | static void |
| 2653 | swap_out_buffer_local_variables (b) |
| 2654 | struct buffer *b; |
| 2655 | { |
| 2656 | Lisp_Object oalist, alist, sym, tem, buffer; |
| 2657 | |
| 2658 | XSETBUFFER (buffer, b); |
| 2659 | oalist = b->local_var_alist; |
| 2660 | |
| 2661 | for (alist = oalist; CONSP (alist); alist = XCDR (alist)) |
| 2662 | { |
| 2663 | sym = XCAR (XCAR (alist)); |
| 2664 | |
| 2665 | /* Need not do anything if some other buffer's binding is now encached. */ |
| 2666 | tem = XBUFFER_LOCAL_VALUE (SYMBOL_VALUE (sym))->buffer; |
| 2667 | if (EQ (tem, buffer)) |
| 2668 | { |
| 2669 | /* Symbol is set up for this buffer's old local value: |
| 2670 | swap it out! */ |
| 2671 | swap_in_global_binding (sym); |
| 2672 | } |
| 2673 | } |
| 2674 | } |
| 2675 | \f |
| 2676 | /* Find all the overlays in the current buffer that contain position POS. |
| 2677 | Return the number found, and store them in a vector in *VEC_PTR. |
| 2678 | Store in *LEN_PTR the size allocated for the vector. |
| 2679 | Store in *NEXT_PTR the next position after POS where an overlay starts, |
| 2680 | or ZV if there are no more overlays between POS and ZV. |
| 2681 | Store in *PREV_PTR the previous position before POS where an overlay ends, |
| 2682 | or where an overlay starts which ends at or after POS; |
| 2683 | or BEGV if there are no such overlays from BEGV to POS. |
| 2684 | NEXT_PTR and/or PREV_PTR may be 0, meaning don't store that info. |
| 2685 | |
| 2686 | *VEC_PTR and *LEN_PTR should contain a valid vector and size |
| 2687 | when this function is called. |
| 2688 | |
| 2689 | If EXTEND is non-zero, we make the vector bigger if necessary. |
| 2690 | If EXTEND is zero, we never extend the vector, |
| 2691 | and we store only as many overlays as will fit. |
| 2692 | But we still return the total number of overlays. |
| 2693 | |
| 2694 | If CHANGE_REQ is true, then any position written into *PREV_PTR or |
| 2695 | *NEXT_PTR is guaranteed to be not equal to POS, unless it is the |
| 2696 | default (BEGV or ZV). */ |
| 2697 | |
| 2698 | int |
| 2699 | overlays_at (pos, extend, vec_ptr, len_ptr, next_ptr, prev_ptr, change_req) |
| 2700 | EMACS_INT pos; |
| 2701 | int extend; |
| 2702 | Lisp_Object **vec_ptr; |
| 2703 | int *len_ptr; |
| 2704 | EMACS_INT *next_ptr; |
| 2705 | EMACS_INT *prev_ptr; |
| 2706 | int change_req; |
| 2707 | { |
| 2708 | Lisp_Object overlay, start, end; |
| 2709 | struct Lisp_Overlay *tail; |
| 2710 | int idx = 0; |
| 2711 | int len = *len_ptr; |
| 2712 | Lisp_Object *vec = *vec_ptr; |
| 2713 | int next = ZV; |
| 2714 | int prev = BEGV; |
| 2715 | int inhibit_storing = 0; |
| 2716 | |
| 2717 | for (tail = current_buffer->overlays_before; tail; tail = tail->next) |
| 2718 | { |
| 2719 | int startpos, endpos; |
| 2720 | |
| 2721 | XSETMISC (overlay, tail); |
| 2722 | |
| 2723 | start = OVERLAY_START (overlay); |
| 2724 | end = OVERLAY_END (overlay); |
| 2725 | endpos = OVERLAY_POSITION (end); |
| 2726 | if (endpos < pos) |
| 2727 | { |
| 2728 | if (prev < endpos) |
| 2729 | prev = endpos; |
| 2730 | break; |
| 2731 | } |
| 2732 | startpos = OVERLAY_POSITION (start); |
| 2733 | /* This one ends at or after POS |
| 2734 | so its start counts for PREV_PTR if it's before POS. */ |
| 2735 | if (prev < startpos && startpos < pos) |
| 2736 | prev = startpos; |
| 2737 | if (endpos == pos) |
| 2738 | continue; |
| 2739 | if (startpos <= pos) |
| 2740 | { |
| 2741 | if (idx == len) |
| 2742 | { |
| 2743 | /* The supplied vector is full. |
| 2744 | Either make it bigger, or don't store any more in it. */ |
| 2745 | if (extend) |
| 2746 | { |
| 2747 | /* Make it work with an initial len == 0. */ |
| 2748 | len *= 2; |
| 2749 | if (len == 0) |
| 2750 | len = 4; |
| 2751 | *len_ptr = len; |
| 2752 | vec = (Lisp_Object *) xrealloc (vec, len * sizeof (Lisp_Object)); |
| 2753 | *vec_ptr = vec; |
| 2754 | } |
| 2755 | else |
| 2756 | inhibit_storing = 1; |
| 2757 | } |
| 2758 | |
| 2759 | if (!inhibit_storing) |
| 2760 | vec[idx] = overlay; |
| 2761 | /* Keep counting overlays even if we can't return them all. */ |
| 2762 | idx++; |
| 2763 | } |
| 2764 | else if (startpos < next) |
| 2765 | next = startpos; |
| 2766 | } |
| 2767 | |
| 2768 | for (tail = current_buffer->overlays_after; tail; tail = tail->next) |
| 2769 | { |
| 2770 | int startpos, endpos; |
| 2771 | |
| 2772 | XSETMISC (overlay, tail); |
| 2773 | |
| 2774 | start = OVERLAY_START (overlay); |
| 2775 | end = OVERLAY_END (overlay); |
| 2776 | startpos = OVERLAY_POSITION (start); |
| 2777 | if (pos < startpos) |
| 2778 | { |
| 2779 | if (startpos < next) |
| 2780 | next = startpos; |
| 2781 | break; |
| 2782 | } |
| 2783 | endpos = OVERLAY_POSITION (end); |
| 2784 | if (pos < endpos) |
| 2785 | { |
| 2786 | if (idx == len) |
| 2787 | { |
| 2788 | if (extend) |
| 2789 | { |
| 2790 | /* Make it work with an initial len == 0. */ |
| 2791 | len *= 2; |
| 2792 | if (len == 0) |
| 2793 | len = 4; |
| 2794 | *len_ptr = len; |
| 2795 | vec = (Lisp_Object *) xrealloc (vec, len * sizeof (Lisp_Object)); |
| 2796 | *vec_ptr = vec; |
| 2797 | } |
| 2798 | else |
| 2799 | inhibit_storing = 1; |
| 2800 | } |
| 2801 | |
| 2802 | if (!inhibit_storing) |
| 2803 | vec[idx] = overlay; |
| 2804 | idx++; |
| 2805 | |
| 2806 | if (startpos < pos && startpos > prev) |
| 2807 | prev = startpos; |
| 2808 | } |
| 2809 | else if (endpos < pos && endpos > prev) |
| 2810 | prev = endpos; |
| 2811 | else if (endpos == pos && startpos > prev |
| 2812 | && (!change_req || startpos < pos)) |
| 2813 | prev = startpos; |
| 2814 | } |
| 2815 | |
| 2816 | if (next_ptr) |
| 2817 | *next_ptr = next; |
| 2818 | if (prev_ptr) |
| 2819 | *prev_ptr = prev; |
| 2820 | return idx; |
| 2821 | } |
| 2822 | \f |
| 2823 | /* Find all the overlays in the current buffer that overlap the range |
| 2824 | BEG-END, or are empty at BEG, or are empty at END provided END |
| 2825 | denotes the position at the end of the current buffer. |
| 2826 | |
| 2827 | Return the number found, and store them in a vector in *VEC_PTR. |
| 2828 | Store in *LEN_PTR the size allocated for the vector. |
| 2829 | Store in *NEXT_PTR the next position after POS where an overlay starts, |
| 2830 | or ZV if there are no more overlays. |
| 2831 | Store in *PREV_PTR the previous position before POS where an overlay ends, |
| 2832 | or BEGV if there are no previous overlays. |
| 2833 | NEXT_PTR and/or PREV_PTR may be 0, meaning don't store that info. |
| 2834 | |
| 2835 | *VEC_PTR and *LEN_PTR should contain a valid vector and size |
| 2836 | when this function is called. |
| 2837 | |
| 2838 | If EXTEND is non-zero, we make the vector bigger if necessary. |
| 2839 | If EXTEND is zero, we never extend the vector, |
| 2840 | and we store only as many overlays as will fit. |
| 2841 | But we still return the total number of overlays. */ |
| 2842 | |
| 2843 | static int |
| 2844 | overlays_in (beg, end, extend, vec_ptr, len_ptr, next_ptr, prev_ptr) |
| 2845 | int beg, end; |
| 2846 | int extend; |
| 2847 | Lisp_Object **vec_ptr; |
| 2848 | int *len_ptr; |
| 2849 | int *next_ptr; |
| 2850 | int *prev_ptr; |
| 2851 | { |
| 2852 | Lisp_Object overlay, ostart, oend; |
| 2853 | struct Lisp_Overlay *tail; |
| 2854 | int idx = 0; |
| 2855 | int len = *len_ptr; |
| 2856 | Lisp_Object *vec = *vec_ptr; |
| 2857 | int next = ZV; |
| 2858 | int prev = BEGV; |
| 2859 | int inhibit_storing = 0; |
| 2860 | int end_is_Z = end == Z; |
| 2861 | |
| 2862 | for (tail = current_buffer->overlays_before; tail; tail = tail->next) |
| 2863 | { |
| 2864 | int startpos, endpos; |
| 2865 | |
| 2866 | XSETMISC (overlay, tail); |
| 2867 | |
| 2868 | ostart = OVERLAY_START (overlay); |
| 2869 | oend = OVERLAY_END (overlay); |
| 2870 | endpos = OVERLAY_POSITION (oend); |
| 2871 | if (endpos < beg) |
| 2872 | { |
| 2873 | if (prev < endpos) |
| 2874 | prev = endpos; |
| 2875 | break; |
| 2876 | } |
| 2877 | startpos = OVERLAY_POSITION (ostart); |
| 2878 | /* Count an interval if it overlaps the range, is empty at the |
| 2879 | start of the range, or is empty at END provided END denotes the |
| 2880 | end of the buffer. */ |
| 2881 | if ((beg < endpos && startpos < end) |
| 2882 | || (startpos == endpos |
| 2883 | && (beg == endpos || (end_is_Z && endpos == end)))) |
| 2884 | { |
| 2885 | if (idx == len) |
| 2886 | { |
| 2887 | /* The supplied vector is full. |
| 2888 | Either make it bigger, or don't store any more in it. */ |
| 2889 | if (extend) |
| 2890 | { |
| 2891 | /* Make it work with an initial len == 0. */ |
| 2892 | len *= 2; |
| 2893 | if (len == 0) |
| 2894 | len = 4; |
| 2895 | *len_ptr = len; |
| 2896 | vec = (Lisp_Object *) xrealloc (vec, len * sizeof (Lisp_Object)); |
| 2897 | *vec_ptr = vec; |
| 2898 | } |
| 2899 | else |
| 2900 | inhibit_storing = 1; |
| 2901 | } |
| 2902 | |
| 2903 | if (!inhibit_storing) |
| 2904 | vec[idx] = overlay; |
| 2905 | /* Keep counting overlays even if we can't return them all. */ |
| 2906 | idx++; |
| 2907 | } |
| 2908 | else if (startpos < next) |
| 2909 | next = startpos; |
| 2910 | } |
| 2911 | |
| 2912 | for (tail = current_buffer->overlays_after; tail; tail = tail->next) |
| 2913 | { |
| 2914 | int startpos, endpos; |
| 2915 | |
| 2916 | XSETMISC (overlay, tail); |
| 2917 | |
| 2918 | ostart = OVERLAY_START (overlay); |
| 2919 | oend = OVERLAY_END (overlay); |
| 2920 | startpos = OVERLAY_POSITION (ostart); |
| 2921 | if (end < startpos) |
| 2922 | { |
| 2923 | if (startpos < next) |
| 2924 | next = startpos; |
| 2925 | break; |
| 2926 | } |
| 2927 | endpos = OVERLAY_POSITION (oend); |
| 2928 | /* Count an interval if it overlaps the range, is empty at the |
| 2929 | start of the range, or is empty at END provided END denotes the |
| 2930 | end of the buffer. */ |
| 2931 | if ((beg < endpos && startpos < end) |
| 2932 | || (startpos == endpos |
| 2933 | && (beg == endpos || (end_is_Z && endpos == end)))) |
| 2934 | { |
| 2935 | if (idx == len) |
| 2936 | { |
| 2937 | if (extend) |
| 2938 | { |
| 2939 | /* Make it work with an initial len == 0. */ |
| 2940 | len *= 2; |
| 2941 | if (len == 0) |
| 2942 | len = 4; |
| 2943 | *len_ptr = len; |
| 2944 | vec = (Lisp_Object *) xrealloc (vec, len * sizeof (Lisp_Object)); |
| 2945 | *vec_ptr = vec; |
| 2946 | } |
| 2947 | else |
| 2948 | inhibit_storing = 1; |
| 2949 | } |
| 2950 | |
| 2951 | if (!inhibit_storing) |
| 2952 | vec[idx] = overlay; |
| 2953 | idx++; |
| 2954 | } |
| 2955 | else if (endpos < beg && endpos > prev) |
| 2956 | prev = endpos; |
| 2957 | } |
| 2958 | |
| 2959 | if (next_ptr) |
| 2960 | *next_ptr = next; |
| 2961 | if (prev_ptr) |
| 2962 | *prev_ptr = prev; |
| 2963 | return idx; |
| 2964 | } |
| 2965 | |
| 2966 | |
| 2967 | /* Return non-zero if there exists an overlay with a non-nil |
| 2968 | `mouse-face' property overlapping OVERLAY. */ |
| 2969 | |
| 2970 | int |
| 2971 | mouse_face_overlay_overlaps (overlay) |
| 2972 | Lisp_Object overlay; |
| 2973 | { |
| 2974 | int start = OVERLAY_POSITION (OVERLAY_START (overlay)); |
| 2975 | int end = OVERLAY_POSITION (OVERLAY_END (overlay)); |
| 2976 | int n, i, size; |
| 2977 | Lisp_Object *v, tem; |
| 2978 | |
| 2979 | size = 10; |
| 2980 | v = (Lisp_Object *) alloca (size * sizeof *v); |
| 2981 | n = overlays_in (start, end, 0, &v, &size, NULL, NULL); |
| 2982 | if (n > size) |
| 2983 | { |
| 2984 | v = (Lisp_Object *) alloca (n * sizeof *v); |
| 2985 | overlays_in (start, end, 0, &v, &n, NULL, NULL); |
| 2986 | } |
| 2987 | |
| 2988 | for (i = 0; i < n; ++i) |
| 2989 | if (!EQ (v[i], overlay) |
| 2990 | && (tem = Foverlay_get (overlay, Qmouse_face), |
| 2991 | !NILP (tem))) |
| 2992 | break; |
| 2993 | |
| 2994 | return i < n; |
| 2995 | } |
| 2996 | |
| 2997 | |
| 2998 | \f |
| 2999 | /* Fast function to just test if we're at an overlay boundary. */ |
| 3000 | int |
| 3001 | overlay_touches_p (pos) |
| 3002 | int pos; |
| 3003 | { |
| 3004 | Lisp_Object overlay; |
| 3005 | struct Lisp_Overlay *tail; |
| 3006 | |
| 3007 | for (tail = current_buffer->overlays_before; tail; tail = tail->next) |
| 3008 | { |
| 3009 | int endpos; |
| 3010 | |
| 3011 | XSETMISC (overlay ,tail); |
| 3012 | if (!OVERLAYP (overlay)) |
| 3013 | abort (); |
| 3014 | |
| 3015 | endpos = OVERLAY_POSITION (OVERLAY_END (overlay)); |
| 3016 | if (endpos < pos) |
| 3017 | break; |
| 3018 | if (endpos == pos || OVERLAY_POSITION (OVERLAY_START (overlay)) == pos) |
| 3019 | return 1; |
| 3020 | } |
| 3021 | |
| 3022 | for (tail = current_buffer->overlays_after; tail; tail = tail->next) |
| 3023 | { |
| 3024 | int startpos; |
| 3025 | |
| 3026 | XSETMISC (overlay, tail); |
| 3027 | if (!OVERLAYP (overlay)) |
| 3028 | abort (); |
| 3029 | |
| 3030 | startpos = OVERLAY_POSITION (OVERLAY_START (overlay)); |
| 3031 | if (pos < startpos) |
| 3032 | break; |
| 3033 | if (startpos == pos || OVERLAY_POSITION (OVERLAY_END (overlay)) == pos) |
| 3034 | return 1; |
| 3035 | } |
| 3036 | return 0; |
| 3037 | } |
| 3038 | \f |
| 3039 | struct sortvec |
| 3040 | { |
| 3041 | Lisp_Object overlay; |
| 3042 | int beg, end; |
| 3043 | int priority; |
| 3044 | }; |
| 3045 | |
| 3046 | static int |
| 3047 | compare_overlays (v1, v2) |
| 3048 | const void *v1, *v2; |
| 3049 | { |
| 3050 | const struct sortvec *s1 = (const struct sortvec *) v1; |
| 3051 | const struct sortvec *s2 = (const struct sortvec *) v2; |
| 3052 | if (s1->priority != s2->priority) |
| 3053 | return s1->priority - s2->priority; |
| 3054 | if (s1->beg != s2->beg) |
| 3055 | return s1->beg - s2->beg; |
| 3056 | if (s1->end != s2->end) |
| 3057 | return s2->end - s1->end; |
| 3058 | return 0; |
| 3059 | } |
| 3060 | |
| 3061 | /* Sort an array of overlays by priority. The array is modified in place. |
| 3062 | The return value is the new size; this may be smaller than the original |
| 3063 | size if some of the overlays were invalid or were window-specific. */ |
| 3064 | int |
| 3065 | sort_overlays (overlay_vec, noverlays, w) |
| 3066 | Lisp_Object *overlay_vec; |
| 3067 | int noverlays; |
| 3068 | struct window *w; |
| 3069 | { |
| 3070 | int i, j; |
| 3071 | struct sortvec *sortvec; |
| 3072 | sortvec = (struct sortvec *) alloca (noverlays * sizeof (struct sortvec)); |
| 3073 | |
| 3074 | /* Put the valid and relevant overlays into sortvec. */ |
| 3075 | |
| 3076 | for (i = 0, j = 0; i < noverlays; i++) |
| 3077 | { |
| 3078 | Lisp_Object tem; |
| 3079 | Lisp_Object overlay; |
| 3080 | |
| 3081 | overlay = overlay_vec[i]; |
| 3082 | if (OVERLAY_VALID (overlay) |
| 3083 | && OVERLAY_POSITION (OVERLAY_START (overlay)) > 0 |
| 3084 | && OVERLAY_POSITION (OVERLAY_END (overlay)) > 0) |
| 3085 | { |
| 3086 | /* If we're interested in a specific window, then ignore |
| 3087 | overlays that are limited to some other window. */ |
| 3088 | if (w) |
| 3089 | { |
| 3090 | Lisp_Object window; |
| 3091 | |
| 3092 | window = Foverlay_get (overlay, Qwindow); |
| 3093 | if (WINDOWP (window) && XWINDOW (window) != w) |
| 3094 | continue; |
| 3095 | } |
| 3096 | |
| 3097 | /* This overlay is good and counts: put it into sortvec. */ |
| 3098 | sortvec[j].overlay = overlay; |
| 3099 | sortvec[j].beg = OVERLAY_POSITION (OVERLAY_START (overlay)); |
| 3100 | sortvec[j].end = OVERLAY_POSITION (OVERLAY_END (overlay)); |
| 3101 | tem = Foverlay_get (overlay, Qpriority); |
| 3102 | if (INTEGERP (tem)) |
| 3103 | sortvec[j].priority = XINT (tem); |
| 3104 | else |
| 3105 | sortvec[j].priority = 0; |
| 3106 | j++; |
| 3107 | } |
| 3108 | } |
| 3109 | noverlays = j; |
| 3110 | |
| 3111 | /* Sort the overlays into the proper order: increasing priority. */ |
| 3112 | |
| 3113 | if (noverlays > 1) |
| 3114 | qsort (sortvec, noverlays, sizeof (struct sortvec), compare_overlays); |
| 3115 | |
| 3116 | for (i = 0; i < noverlays; i++) |
| 3117 | overlay_vec[i] = sortvec[i].overlay; |
| 3118 | return (noverlays); |
| 3119 | } |
| 3120 | \f |
| 3121 | struct sortstr |
| 3122 | { |
| 3123 | Lisp_Object string, string2; |
| 3124 | int size; |
| 3125 | int priority; |
| 3126 | }; |
| 3127 | |
| 3128 | struct sortstrlist |
| 3129 | { |
| 3130 | struct sortstr *buf; /* An array that expands as needed; never freed. */ |
| 3131 | int size; /* Allocated length of that array. */ |
| 3132 | int used; /* How much of the array is currently in use. */ |
| 3133 | int bytes; /* Total length of the strings in buf. */ |
| 3134 | }; |
| 3135 | |
| 3136 | /* Buffers for storing information about the overlays touching a given |
| 3137 | position. These could be automatic variables in overlay_strings, but |
| 3138 | it's more efficient to hold onto the memory instead of repeatedly |
| 3139 | allocating and freeing it. */ |
| 3140 | static struct sortstrlist overlay_heads, overlay_tails; |
| 3141 | static unsigned char *overlay_str_buf; |
| 3142 | |
| 3143 | /* Allocated length of overlay_str_buf. */ |
| 3144 | static int overlay_str_len; |
| 3145 | |
| 3146 | /* A comparison function suitable for passing to qsort. */ |
| 3147 | static int |
| 3148 | cmp_for_strings (as1, as2) |
| 3149 | char *as1, *as2; |
| 3150 | { |
| 3151 | struct sortstr *s1 = (struct sortstr *)as1; |
| 3152 | struct sortstr *s2 = (struct sortstr *)as2; |
| 3153 | if (s1->size != s2->size) |
| 3154 | return s2->size - s1->size; |
| 3155 | if (s1->priority != s2->priority) |
| 3156 | return s1->priority - s2->priority; |
| 3157 | return 0; |
| 3158 | } |
| 3159 | |
| 3160 | static void |
| 3161 | record_overlay_string (ssl, str, str2, pri, size) |
| 3162 | struct sortstrlist *ssl; |
| 3163 | Lisp_Object str, str2, pri; |
| 3164 | int size; |
| 3165 | { |
| 3166 | int nbytes; |
| 3167 | |
| 3168 | if (ssl->used == ssl->size) |
| 3169 | { |
| 3170 | if (ssl->buf) |
| 3171 | ssl->size *= 2; |
| 3172 | else |
| 3173 | ssl->size = 5; |
| 3174 | ssl->buf = ((struct sortstr *) |
| 3175 | xrealloc (ssl->buf, ssl->size * sizeof (struct sortstr))); |
| 3176 | } |
| 3177 | ssl->buf[ssl->used].string = str; |
| 3178 | ssl->buf[ssl->used].string2 = str2; |
| 3179 | ssl->buf[ssl->used].size = size; |
| 3180 | ssl->buf[ssl->used].priority = (INTEGERP (pri) ? XINT (pri) : 0); |
| 3181 | ssl->used++; |
| 3182 | |
| 3183 | if (NILP (current_buffer->enable_multibyte_characters)) |
| 3184 | nbytes = SCHARS (str); |
| 3185 | else if (! STRING_MULTIBYTE (str)) |
| 3186 | nbytes = count_size_as_multibyte (SDATA (str), |
| 3187 | SBYTES (str)); |
| 3188 | else |
| 3189 | nbytes = SBYTES (str); |
| 3190 | |
| 3191 | ssl->bytes += nbytes; |
| 3192 | |
| 3193 | if (STRINGP (str2)) |
| 3194 | { |
| 3195 | if (NILP (current_buffer->enable_multibyte_characters)) |
| 3196 | nbytes = SCHARS (str2); |
| 3197 | else if (! STRING_MULTIBYTE (str2)) |
| 3198 | nbytes = count_size_as_multibyte (SDATA (str2), |
| 3199 | SBYTES (str2)); |
| 3200 | else |
| 3201 | nbytes = SBYTES (str2); |
| 3202 | |
| 3203 | ssl->bytes += nbytes; |
| 3204 | } |
| 3205 | } |
| 3206 | |
| 3207 | /* Return the concatenation of the strings associated with overlays that |
| 3208 | begin or end at POS, ignoring overlays that are specific to a window |
| 3209 | other than W. The strings are concatenated in the appropriate order: |
| 3210 | shorter overlays nest inside longer ones, and higher priority inside |
| 3211 | lower. Normally all of the after-strings come first, but zero-sized |
| 3212 | overlays have their after-strings ride along with the before-strings |
| 3213 | because it would look strange to print them inside-out. |
| 3214 | |
| 3215 | Returns the string length, and stores the contents indirectly through |
| 3216 | PSTR, if that variable is non-null. The string may be overwritten by |
| 3217 | subsequent calls. */ |
| 3218 | |
| 3219 | int |
| 3220 | overlay_strings (pos, w, pstr) |
| 3221 | EMACS_INT pos; |
| 3222 | struct window *w; |
| 3223 | unsigned char **pstr; |
| 3224 | { |
| 3225 | Lisp_Object overlay, window, str; |
| 3226 | struct Lisp_Overlay *ov; |
| 3227 | int startpos, endpos; |
| 3228 | int multibyte = ! NILP (current_buffer->enable_multibyte_characters); |
| 3229 | |
| 3230 | overlay_heads.used = overlay_heads.bytes = 0; |
| 3231 | overlay_tails.used = overlay_tails.bytes = 0; |
| 3232 | for (ov = current_buffer->overlays_before; ov; ov = ov->next) |
| 3233 | { |
| 3234 | XSETMISC (overlay, ov); |
| 3235 | eassert (OVERLAYP (overlay)); |
| 3236 | |
| 3237 | startpos = OVERLAY_POSITION (OVERLAY_START (overlay)); |
| 3238 | endpos = OVERLAY_POSITION (OVERLAY_END (overlay)); |
| 3239 | if (endpos < pos) |
| 3240 | break; |
| 3241 | if (endpos != pos && startpos != pos) |
| 3242 | continue; |
| 3243 | window = Foverlay_get (overlay, Qwindow); |
| 3244 | if (WINDOWP (window) && XWINDOW (window) != w) |
| 3245 | continue; |
| 3246 | if (startpos == pos |
| 3247 | && (str = Foverlay_get (overlay, Qbefore_string), STRINGP (str))) |
| 3248 | record_overlay_string (&overlay_heads, str, |
| 3249 | (startpos == endpos |
| 3250 | ? Foverlay_get (overlay, Qafter_string) |
| 3251 | : Qnil), |
| 3252 | Foverlay_get (overlay, Qpriority), |
| 3253 | endpos - startpos); |
| 3254 | else if (endpos == pos |
| 3255 | && (str = Foverlay_get (overlay, Qafter_string), STRINGP (str))) |
| 3256 | record_overlay_string (&overlay_tails, str, Qnil, |
| 3257 | Foverlay_get (overlay, Qpriority), |
| 3258 | endpos - startpos); |
| 3259 | } |
| 3260 | for (ov = current_buffer->overlays_after; ov; ov = ov->next) |
| 3261 | { |
| 3262 | XSETMISC (overlay, ov); |
| 3263 | eassert (OVERLAYP (overlay)); |
| 3264 | |
| 3265 | startpos = OVERLAY_POSITION (OVERLAY_START (overlay)); |
| 3266 | endpos = OVERLAY_POSITION (OVERLAY_END (overlay)); |
| 3267 | if (startpos > pos) |
| 3268 | break; |
| 3269 | if (endpos != pos && startpos != pos) |
| 3270 | continue; |
| 3271 | window = Foverlay_get (overlay, Qwindow); |
| 3272 | if (WINDOWP (window) && XWINDOW (window) != w) |
| 3273 | continue; |
| 3274 | if (startpos == pos |
| 3275 | && (str = Foverlay_get (overlay, Qbefore_string), STRINGP (str))) |
| 3276 | record_overlay_string (&overlay_heads, str, |
| 3277 | (startpos == endpos |
| 3278 | ? Foverlay_get (overlay, Qafter_string) |
| 3279 | : Qnil), |
| 3280 | Foverlay_get (overlay, Qpriority), |
| 3281 | endpos - startpos); |
| 3282 | else if (endpos == pos |
| 3283 | && (str = Foverlay_get (overlay, Qafter_string), STRINGP (str))) |
| 3284 | record_overlay_string (&overlay_tails, str, Qnil, |
| 3285 | Foverlay_get (overlay, Qpriority), |
| 3286 | endpos - startpos); |
| 3287 | } |
| 3288 | if (overlay_tails.used > 1) |
| 3289 | qsort (overlay_tails.buf, overlay_tails.used, sizeof (struct sortstr), |
| 3290 | cmp_for_strings); |
| 3291 | if (overlay_heads.used > 1) |
| 3292 | qsort (overlay_heads.buf, overlay_heads.used, sizeof (struct sortstr), |
| 3293 | cmp_for_strings); |
| 3294 | if (overlay_heads.bytes || overlay_tails.bytes) |
| 3295 | { |
| 3296 | Lisp_Object tem; |
| 3297 | int i; |
| 3298 | unsigned char *p; |
| 3299 | int total = overlay_heads.bytes + overlay_tails.bytes; |
| 3300 | |
| 3301 | if (total > overlay_str_len) |
| 3302 | { |
| 3303 | overlay_str_len = total; |
| 3304 | overlay_str_buf = (unsigned char *)xrealloc (overlay_str_buf, |
| 3305 | total); |
| 3306 | } |
| 3307 | p = overlay_str_buf; |
| 3308 | for (i = overlay_tails.used; --i >= 0;) |
| 3309 | { |
| 3310 | int nbytes; |
| 3311 | tem = overlay_tails.buf[i].string; |
| 3312 | nbytes = copy_text (SDATA (tem), p, |
| 3313 | SBYTES (tem), |
| 3314 | STRING_MULTIBYTE (tem), multibyte); |
| 3315 | p += nbytes; |
| 3316 | } |
| 3317 | for (i = 0; i < overlay_heads.used; ++i) |
| 3318 | { |
| 3319 | int nbytes; |
| 3320 | tem = overlay_heads.buf[i].string; |
| 3321 | nbytes = copy_text (SDATA (tem), p, |
| 3322 | SBYTES (tem), |
| 3323 | STRING_MULTIBYTE (tem), multibyte); |
| 3324 | p += nbytes; |
| 3325 | tem = overlay_heads.buf[i].string2; |
| 3326 | if (STRINGP (tem)) |
| 3327 | { |
| 3328 | nbytes = copy_text (SDATA (tem), p, |
| 3329 | SBYTES (tem), |
| 3330 | STRING_MULTIBYTE (tem), multibyte); |
| 3331 | p += nbytes; |
| 3332 | } |
| 3333 | } |
| 3334 | if (p != overlay_str_buf + total) |
| 3335 | abort (); |
| 3336 | if (pstr) |
| 3337 | *pstr = overlay_str_buf; |
| 3338 | return total; |
| 3339 | } |
| 3340 | return 0; |
| 3341 | } |
| 3342 | \f |
| 3343 | /* Shift overlays in BUF's overlay lists, to center the lists at POS. */ |
| 3344 | |
| 3345 | void |
| 3346 | recenter_overlay_lists (buf, pos) |
| 3347 | struct buffer *buf; |
| 3348 | EMACS_INT pos; |
| 3349 | { |
| 3350 | Lisp_Object overlay, beg, end; |
| 3351 | struct Lisp_Overlay *prev, *tail, *next; |
| 3352 | |
| 3353 | /* See if anything in overlays_before should move to overlays_after. */ |
| 3354 | |
| 3355 | /* We don't strictly need prev in this loop; it should always be nil. |
| 3356 | But we use it for symmetry and in case that should cease to be true |
| 3357 | with some future change. */ |
| 3358 | prev = NULL; |
| 3359 | for (tail = buf->overlays_before; tail; prev = tail, tail = next) |
| 3360 | { |
| 3361 | next = tail->next; |
| 3362 | XSETMISC (overlay, tail); |
| 3363 | |
| 3364 | /* If the overlay is not valid, get rid of it. */ |
| 3365 | if (!OVERLAY_VALID (overlay)) |
| 3366 | #if 1 |
| 3367 | abort (); |
| 3368 | #else |
| 3369 | { |
| 3370 | /* Splice the cons cell TAIL out of overlays_before. */ |
| 3371 | if (!NILP (prev)) |
| 3372 | XCDR (prev) = next; |
| 3373 | else |
| 3374 | buf->overlays_before = next; |
| 3375 | tail = prev; |
| 3376 | continue; |
| 3377 | } |
| 3378 | #endif |
| 3379 | |
| 3380 | beg = OVERLAY_START (overlay); |
| 3381 | end = OVERLAY_END (overlay); |
| 3382 | |
| 3383 | if (OVERLAY_POSITION (end) > pos) |
| 3384 | { |
| 3385 | /* OVERLAY needs to be moved. */ |
| 3386 | int where = OVERLAY_POSITION (beg); |
| 3387 | struct Lisp_Overlay *other, *other_prev; |
| 3388 | |
| 3389 | /* Splice the cons cell TAIL out of overlays_before. */ |
| 3390 | if (prev) |
| 3391 | prev->next = next; |
| 3392 | else |
| 3393 | buf->overlays_before = next; |
| 3394 | |
| 3395 | /* Search thru overlays_after for where to put it. */ |
| 3396 | other_prev = NULL; |
| 3397 | for (other = buf->overlays_after; other; |
| 3398 | other_prev = other, other = other->next) |
| 3399 | { |
| 3400 | Lisp_Object otherbeg, otheroverlay; |
| 3401 | |
| 3402 | XSETMISC (otheroverlay, other); |
| 3403 | eassert (OVERLAY_VALID (otheroverlay)); |
| 3404 | |
| 3405 | otherbeg = OVERLAY_START (otheroverlay); |
| 3406 | if (OVERLAY_POSITION (otherbeg) >= where) |
| 3407 | break; |
| 3408 | } |
| 3409 | |
| 3410 | /* Add TAIL to overlays_after before OTHER. */ |
| 3411 | tail->next = other; |
| 3412 | if (other_prev) |
| 3413 | other_prev->next = tail; |
| 3414 | else |
| 3415 | buf->overlays_after = tail; |
| 3416 | tail = prev; |
| 3417 | } |
| 3418 | else |
| 3419 | /* We've reached the things that should stay in overlays_before. |
| 3420 | All the rest of overlays_before must end even earlier, |
| 3421 | so stop now. */ |
| 3422 | break; |
| 3423 | } |
| 3424 | |
| 3425 | /* See if anything in overlays_after should be in overlays_before. */ |
| 3426 | prev = NULL; |
| 3427 | for (tail = buf->overlays_after; tail; prev = tail, tail = next) |
| 3428 | { |
| 3429 | next = tail->next; |
| 3430 | XSETMISC (overlay, tail); |
| 3431 | |
| 3432 | /* If the overlay is not valid, get rid of it. */ |
| 3433 | if (!OVERLAY_VALID (overlay)) |
| 3434 | #if 1 |
| 3435 | abort (); |
| 3436 | #else |
| 3437 | { |
| 3438 | /* Splice the cons cell TAIL out of overlays_after. */ |
| 3439 | if (!NILP (prev)) |
| 3440 | XCDR (prev) = next; |
| 3441 | else |
| 3442 | buf->overlays_after = next; |
| 3443 | tail = prev; |
| 3444 | continue; |
| 3445 | } |
| 3446 | #endif |
| 3447 | |
| 3448 | beg = OVERLAY_START (overlay); |
| 3449 | end = OVERLAY_END (overlay); |
| 3450 | |
| 3451 | /* Stop looking, when we know that nothing further |
| 3452 | can possibly end before POS. */ |
| 3453 | if (OVERLAY_POSITION (beg) > pos) |
| 3454 | break; |
| 3455 | |
| 3456 | if (OVERLAY_POSITION (end) <= pos) |
| 3457 | { |
| 3458 | /* OVERLAY needs to be moved. */ |
| 3459 | int where = OVERLAY_POSITION (end); |
| 3460 | struct Lisp_Overlay *other, *other_prev; |
| 3461 | |
| 3462 | /* Splice the cons cell TAIL out of overlays_after. */ |
| 3463 | if (prev) |
| 3464 | prev->next = next; |
| 3465 | else |
| 3466 | buf->overlays_after = next; |
| 3467 | |
| 3468 | /* Search thru overlays_before for where to put it. */ |
| 3469 | other_prev = NULL; |
| 3470 | for (other = buf->overlays_before; other; |
| 3471 | other_prev = other, other = other->next) |
| 3472 | { |
| 3473 | Lisp_Object otherend, otheroverlay; |
| 3474 | |
| 3475 | XSETMISC (otheroverlay, other); |
| 3476 | eassert (OVERLAY_VALID (otheroverlay)); |
| 3477 | |
| 3478 | otherend = OVERLAY_END (otheroverlay); |
| 3479 | if (OVERLAY_POSITION (otherend) <= where) |
| 3480 | break; |
| 3481 | } |
| 3482 | |
| 3483 | /* Add TAIL to overlays_before before OTHER. */ |
| 3484 | tail->next = other; |
| 3485 | if (other_prev) |
| 3486 | other_prev->next = tail; |
| 3487 | else |
| 3488 | buf->overlays_before = tail; |
| 3489 | tail = prev; |
| 3490 | } |
| 3491 | } |
| 3492 | |
| 3493 | buf->overlay_center = pos; |
| 3494 | } |
| 3495 | |
| 3496 | void |
| 3497 | adjust_overlays_for_insert (pos, length) |
| 3498 | EMACS_INT pos; |
| 3499 | EMACS_INT length; |
| 3500 | { |
| 3501 | /* After an insertion, the lists are still sorted properly, |
| 3502 | but we may need to update the value of the overlay center. */ |
| 3503 | if (current_buffer->overlay_center >= pos) |
| 3504 | current_buffer->overlay_center += length; |
| 3505 | } |
| 3506 | |
| 3507 | void |
| 3508 | adjust_overlays_for_delete (pos, length) |
| 3509 | EMACS_INT pos; |
| 3510 | EMACS_INT length; |
| 3511 | { |
| 3512 | if (current_buffer->overlay_center < pos) |
| 3513 | /* The deletion was to our right. No change needed; the before- and |
| 3514 | after-lists are still consistent. */ |
| 3515 | ; |
| 3516 | else if (current_buffer->overlay_center > pos + length) |
| 3517 | /* The deletion was to our left. We need to adjust the center value |
| 3518 | to account for the change in position, but the lists are consistent |
| 3519 | given the new value. */ |
| 3520 | current_buffer->overlay_center -= length; |
| 3521 | else |
| 3522 | /* We're right in the middle. There might be things on the after-list |
| 3523 | that now belong on the before-list. Recentering will move them, |
| 3524 | and also update the center point. */ |
| 3525 | recenter_overlay_lists (current_buffer, pos); |
| 3526 | } |
| 3527 | |
| 3528 | /* Fix up overlays that were garbled as a result of permuting markers |
| 3529 | in the range START through END. Any overlay with at least one |
| 3530 | endpoint in this range will need to be unlinked from the overlay |
| 3531 | list and reinserted in its proper place. |
| 3532 | Such an overlay might even have negative size at this point. |
| 3533 | If so, we'll make the overlay empty. */ |
| 3534 | void |
| 3535 | fix_start_end_in_overlays (start, end) |
| 3536 | register int start, end; |
| 3537 | { |
| 3538 | Lisp_Object overlay; |
| 3539 | struct Lisp_Overlay *before_list, *after_list; |
| 3540 | /* These are either nil, indicating that before_list or after_list |
| 3541 | should be assigned, or the cons cell the cdr of which should be |
| 3542 | assigned. */ |
| 3543 | struct Lisp_Overlay *beforep = NULL, *afterp = NULL; |
| 3544 | /* 'Parent', likewise, indicates a cons cell or |
| 3545 | current_buffer->overlays_before or overlays_after, depending |
| 3546 | which loop we're in. */ |
| 3547 | struct Lisp_Overlay *tail, *parent; |
| 3548 | int startpos, endpos; |
| 3549 | |
| 3550 | /* This algorithm shifts links around instead of consing and GCing. |
| 3551 | The loop invariant is that before_list (resp. after_list) is a |
| 3552 | well-formed list except that its last element, the CDR of beforep |
| 3553 | (resp. afterp) if beforep (afterp) isn't nil or before_list |
| 3554 | (after_list) if it is, is still uninitialized. So it's not a bug |
| 3555 | that before_list isn't initialized, although it may look |
| 3556 | strange. */ |
| 3557 | for (parent = NULL, tail = current_buffer->overlays_before; tail;) |
| 3558 | { |
| 3559 | XSETMISC (overlay, tail); |
| 3560 | |
| 3561 | endpos = OVERLAY_POSITION (OVERLAY_END (overlay)); |
| 3562 | startpos = OVERLAY_POSITION (OVERLAY_START (overlay)); |
| 3563 | |
| 3564 | /* If the overlay is backwards, make it empty. */ |
| 3565 | if (endpos < startpos) |
| 3566 | { |
| 3567 | startpos = endpos; |
| 3568 | Fset_marker (OVERLAY_START (overlay), make_number (startpos), |
| 3569 | Qnil); |
| 3570 | } |
| 3571 | |
| 3572 | if (endpos < start) |
| 3573 | break; |
| 3574 | |
| 3575 | if (endpos < end |
| 3576 | || (startpos >= start && startpos < end)) |
| 3577 | { |
| 3578 | /* Add it to the end of the wrong list. Later on, |
| 3579 | recenter_overlay_lists will move it to the right place. */ |
| 3580 | if (endpos < current_buffer->overlay_center) |
| 3581 | { |
| 3582 | if (!afterp) |
| 3583 | after_list = tail; |
| 3584 | else |
| 3585 | afterp->next = tail; |
| 3586 | afterp = tail; |
| 3587 | } |
| 3588 | else |
| 3589 | { |
| 3590 | if (!beforep) |
| 3591 | before_list = tail; |
| 3592 | else |
| 3593 | beforep->next = tail; |
| 3594 | beforep = tail; |
| 3595 | } |
| 3596 | if (!parent) |
| 3597 | current_buffer->overlays_before = tail->next; |
| 3598 | else |
| 3599 | parent->next = tail->next; |
| 3600 | tail = tail->next; |
| 3601 | } |
| 3602 | else |
| 3603 | parent = tail, tail = parent->next; |
| 3604 | } |
| 3605 | for (parent = NULL, tail = current_buffer->overlays_after; tail;) |
| 3606 | { |
| 3607 | XSETMISC (overlay, tail); |
| 3608 | |
| 3609 | startpos = OVERLAY_POSITION (OVERLAY_START (overlay)); |
| 3610 | endpos = OVERLAY_POSITION (OVERLAY_END (overlay)); |
| 3611 | |
| 3612 | /* If the overlay is backwards, make it empty. */ |
| 3613 | if (endpos < startpos) |
| 3614 | { |
| 3615 | startpos = endpos; |
| 3616 | Fset_marker (OVERLAY_START (overlay), make_number (startpos), |
| 3617 | Qnil); |
| 3618 | } |
| 3619 | |
| 3620 | if (startpos >= end) |
| 3621 | break; |
| 3622 | |
| 3623 | if (startpos >= start |
| 3624 | || (endpos >= start && endpos < end)) |
| 3625 | { |
| 3626 | if (endpos < current_buffer->overlay_center) |
| 3627 | { |
| 3628 | if (!afterp) |
| 3629 | after_list = tail; |
| 3630 | else |
| 3631 | afterp->next = tail; |
| 3632 | afterp = tail; |
| 3633 | } |
| 3634 | else |
| 3635 | { |
| 3636 | if (!beforep) |
| 3637 | before_list = tail; |
| 3638 | else |
| 3639 | beforep->next = tail; |
| 3640 | beforep = tail; |
| 3641 | } |
| 3642 | if (!parent) |
| 3643 | current_buffer->overlays_after = tail->next; |
| 3644 | else |
| 3645 | parent->next = tail->next; |
| 3646 | tail = tail->next; |
| 3647 | } |
| 3648 | else |
| 3649 | parent = tail, tail = parent->next; |
| 3650 | } |
| 3651 | |
| 3652 | /* Splice the constructed (wrong) lists into the buffer's lists, |
| 3653 | and let the recenter function make it sane again. */ |
| 3654 | if (beforep) |
| 3655 | { |
| 3656 | beforep->next = current_buffer->overlays_before; |
| 3657 | current_buffer->overlays_before = before_list; |
| 3658 | } |
| 3659 | recenter_overlay_lists (current_buffer, current_buffer->overlay_center); |
| 3660 | |
| 3661 | if (afterp) |
| 3662 | { |
| 3663 | afterp->next = current_buffer->overlays_after; |
| 3664 | current_buffer->overlays_after = after_list; |
| 3665 | } |
| 3666 | recenter_overlay_lists (current_buffer, current_buffer->overlay_center); |
| 3667 | } |
| 3668 | |
| 3669 | /* We have two types of overlay: the one whose ending marker is |
| 3670 | after-insertion-marker (this is the usual case) and the one whose |
| 3671 | ending marker is before-insertion-marker. When `overlays_before' |
| 3672 | contains overlays of the latter type and the former type in this |
| 3673 | order and both overlays end at inserting position, inserting a text |
| 3674 | increases only the ending marker of the latter type, which results |
| 3675 | in incorrect ordering of `overlays_before'. |
| 3676 | |
| 3677 | This function fixes ordering of overlays in the slot |
| 3678 | `overlays_before' of the buffer *BP. Before the insertion, `point' |
| 3679 | was at PREV, and now is at POS. */ |
| 3680 | |
| 3681 | void |
| 3682 | fix_overlays_before (bp, prev, pos) |
| 3683 | struct buffer *bp; |
| 3684 | EMACS_INT prev, pos; |
| 3685 | { |
| 3686 | /* If parent is nil, replace overlays_before; otherwise, parent->next. */ |
| 3687 | struct Lisp_Overlay *tail = bp->overlays_before, *parent = NULL, *right_pair; |
| 3688 | Lisp_Object tem; |
| 3689 | EMACS_INT end; |
| 3690 | |
| 3691 | /* After the insertion, the several overlays may be in incorrect |
| 3692 | order. The possibility is that, in the list `overlays_before', |
| 3693 | an overlay which ends at POS appears after an overlay which ends |
| 3694 | at PREV. Since POS is greater than PREV, we must fix the |
| 3695 | ordering of these overlays, by moving overlays ends at POS before |
| 3696 | the overlays ends at PREV. */ |
| 3697 | |
| 3698 | /* At first, find a place where disordered overlays should be linked |
| 3699 | in. It is where an overlay which end before POS exists. (i.e. an |
| 3700 | overlay whose ending marker is after-insertion-marker if disorder |
| 3701 | exists). */ |
| 3702 | while (tail |
| 3703 | && (XSETMISC (tem, tail), |
| 3704 | (end = OVERLAY_POSITION (OVERLAY_END (tem))) >= pos)) |
| 3705 | { |
| 3706 | parent = tail; |
| 3707 | tail = tail->next; |
| 3708 | } |
| 3709 | |
| 3710 | /* If we don't find such an overlay, |
| 3711 | or the found one ends before PREV, |
| 3712 | or the found one is the last one in the list, |
| 3713 | we don't have to fix anything. */ |
| 3714 | if (!tail || end < prev || !tail->next) |
| 3715 | return; |
| 3716 | |
| 3717 | right_pair = parent; |
| 3718 | parent = tail; |
| 3719 | tail = tail->next; |
| 3720 | |
| 3721 | /* Now, end position of overlays in the list TAIL should be before |
| 3722 | or equal to PREV. In the loop, an overlay which ends at POS is |
| 3723 | moved ahead to the place indicated by the CDR of RIGHT_PAIR. If |
| 3724 | we found an overlay which ends before PREV, the remaining |
| 3725 | overlays are in correct order. */ |
| 3726 | while (tail) |
| 3727 | { |
| 3728 | XSETMISC (tem, tail); |
| 3729 | end = OVERLAY_POSITION (OVERLAY_END (tem)); |
| 3730 | |
| 3731 | if (end == pos) |
| 3732 | { /* This overlay is disordered. */ |
| 3733 | struct Lisp_Overlay *found = tail; |
| 3734 | |
| 3735 | /* Unlink the found overlay. */ |
| 3736 | tail = found->next; |
| 3737 | parent->next = tail; |
| 3738 | /* Move an overlay at RIGHT_PLACE to the next of the found one, |
| 3739 | and link it into the right place. */ |
| 3740 | if (!right_pair) |
| 3741 | { |
| 3742 | found->next = bp->overlays_before; |
| 3743 | bp->overlays_before = found; |
| 3744 | } |
| 3745 | else |
| 3746 | { |
| 3747 | found->next = right_pair->next; |
| 3748 | right_pair->next = found; |
| 3749 | } |
| 3750 | } |
| 3751 | else if (end == prev) |
| 3752 | { |
| 3753 | parent = tail; |
| 3754 | tail = tail->next; |
| 3755 | } |
| 3756 | else /* No more disordered overlay. */ |
| 3757 | break; |
| 3758 | } |
| 3759 | } |
| 3760 | \f |
| 3761 | DEFUN ("overlayp", Foverlayp, Soverlayp, 1, 1, 0, |
| 3762 | doc: /* Return t if OBJECT is an overlay. */) |
| 3763 | (object) |
| 3764 | Lisp_Object object; |
| 3765 | { |
| 3766 | return (OVERLAYP (object) ? Qt : Qnil); |
| 3767 | } |
| 3768 | |
| 3769 | DEFUN ("make-overlay", Fmake_overlay, Smake_overlay, 2, 5, 0, |
| 3770 | doc: /* Create a new overlay with range BEG to END in BUFFER. |
| 3771 | If omitted, BUFFER defaults to the current buffer. |
| 3772 | BEG and END may be integers or markers. |
| 3773 | The fourth arg FRONT-ADVANCE, if non-nil, makes the marker |
| 3774 | for the front of the overlay advance when text is inserted there |
| 3775 | \(which means the text *is not* included in the overlay). |
| 3776 | The fifth arg REAR-ADVANCE, if non-nil, makes the marker |
| 3777 | for the rear of the overlay advance when text is inserted there |
| 3778 | \(which means the text *is* included in the overlay). */) |
| 3779 | (beg, end, buffer, front_advance, rear_advance) |
| 3780 | Lisp_Object beg, end, buffer; |
| 3781 | Lisp_Object front_advance, rear_advance; |
| 3782 | { |
| 3783 | Lisp_Object overlay; |
| 3784 | struct buffer *b; |
| 3785 | |
| 3786 | if (NILP (buffer)) |
| 3787 | XSETBUFFER (buffer, current_buffer); |
| 3788 | else |
| 3789 | CHECK_BUFFER (buffer); |
| 3790 | if (MARKERP (beg) |
| 3791 | && ! EQ (Fmarker_buffer (beg), buffer)) |
| 3792 | error ("Marker points into wrong buffer"); |
| 3793 | if (MARKERP (end) |
| 3794 | && ! EQ (Fmarker_buffer (end), buffer)) |
| 3795 | error ("Marker points into wrong buffer"); |
| 3796 | |
| 3797 | CHECK_NUMBER_COERCE_MARKER (beg); |
| 3798 | CHECK_NUMBER_COERCE_MARKER (end); |
| 3799 | |
| 3800 | if (XINT (beg) > XINT (end)) |
| 3801 | { |
| 3802 | Lisp_Object temp; |
| 3803 | temp = beg; beg = end; end = temp; |
| 3804 | } |
| 3805 | |
| 3806 | b = XBUFFER (buffer); |
| 3807 | |
| 3808 | beg = Fset_marker (Fmake_marker (), beg, buffer); |
| 3809 | end = Fset_marker (Fmake_marker (), end, buffer); |
| 3810 | |
| 3811 | if (!NILP (front_advance)) |
| 3812 | XMARKER (beg)->insertion_type = 1; |
| 3813 | if (!NILP (rear_advance)) |
| 3814 | XMARKER (end)->insertion_type = 1; |
| 3815 | |
| 3816 | overlay = allocate_misc (); |
| 3817 | XMISCTYPE (overlay) = Lisp_Misc_Overlay; |
| 3818 | XOVERLAY (overlay)->start = beg; |
| 3819 | XOVERLAY (overlay)->end = end; |
| 3820 | XOVERLAY (overlay)->plist = Qnil; |
| 3821 | XOVERLAY (overlay)->next = NULL; |
| 3822 | |
| 3823 | /* Put the new overlay on the wrong list. */ |
| 3824 | end = OVERLAY_END (overlay); |
| 3825 | if (OVERLAY_POSITION (end) < b->overlay_center) |
| 3826 | { |
| 3827 | if (b->overlays_after) |
| 3828 | XOVERLAY (overlay)->next = b->overlays_after; |
| 3829 | b->overlays_after = XOVERLAY (overlay); |
| 3830 | } |
| 3831 | else |
| 3832 | { |
| 3833 | if (b->overlays_before) |
| 3834 | XOVERLAY (overlay)->next = b->overlays_before; |
| 3835 | b->overlays_before = XOVERLAY (overlay); |
| 3836 | } |
| 3837 | |
| 3838 | /* This puts it in the right list, and in the right order. */ |
| 3839 | recenter_overlay_lists (b, b->overlay_center); |
| 3840 | |
| 3841 | /* We don't need to redisplay the region covered by the overlay, because |
| 3842 | the overlay has no properties at the moment. */ |
| 3843 | |
| 3844 | return overlay; |
| 3845 | } |
| 3846 | \f |
| 3847 | /* Mark a section of BUF as needing redisplay because of overlays changes. */ |
| 3848 | |
| 3849 | static void |
| 3850 | modify_overlay (buf, start, end) |
| 3851 | struct buffer *buf; |
| 3852 | EMACS_INT start, end; |
| 3853 | { |
| 3854 | if (start > end) |
| 3855 | { |
| 3856 | int temp = start; |
| 3857 | start = end; |
| 3858 | end = temp; |
| 3859 | } |
| 3860 | |
| 3861 | BUF_COMPUTE_UNCHANGED (buf, start, end); |
| 3862 | |
| 3863 | /* If this is a buffer not in the selected window, |
| 3864 | we must do other windows. */ |
| 3865 | if (buf != XBUFFER (XWINDOW (selected_window)->buffer)) |
| 3866 | windows_or_buffers_changed = 1; |
| 3867 | /* If multiple windows show this buffer, we must do other windows. */ |
| 3868 | else if (buffer_shared > 1) |
| 3869 | windows_or_buffers_changed = 1; |
| 3870 | /* If we modify an overlay at the end of the buffer, we cannot |
| 3871 | be sure that window end is still valid. */ |
| 3872 | else if (end >= ZV && start <= ZV) |
| 3873 | windows_or_buffers_changed = 1; |
| 3874 | |
| 3875 | ++BUF_OVERLAY_MODIFF (buf); |
| 3876 | } |
| 3877 | |
| 3878 | \f |
| 3879 | Lisp_Object Fdelete_overlay (); |
| 3880 | |
| 3881 | static struct Lisp_Overlay * |
| 3882 | unchain_overlay (list, overlay) |
| 3883 | struct Lisp_Overlay *list, *overlay; |
| 3884 | { |
| 3885 | struct Lisp_Overlay *tmp, *prev; |
| 3886 | for (tmp = list, prev = NULL; tmp; prev = tmp, tmp = tmp->next) |
| 3887 | if (tmp == overlay) |
| 3888 | { |
| 3889 | if (prev) |
| 3890 | prev->next = tmp->next; |
| 3891 | else |
| 3892 | list = tmp->next; |
| 3893 | overlay->next = NULL; |
| 3894 | break; |
| 3895 | } |
| 3896 | return list; |
| 3897 | } |
| 3898 | |
| 3899 | DEFUN ("move-overlay", Fmove_overlay, Smove_overlay, 3, 4, 0, |
| 3900 | doc: /* Set the endpoints of OVERLAY to BEG and END in BUFFER. |
| 3901 | If BUFFER is omitted, leave OVERLAY in the same buffer it inhabits now. |
| 3902 | If BUFFER is omitted, and OVERLAY is in no buffer, put it in the current |
| 3903 | buffer. */) |
| 3904 | (overlay, beg, end, buffer) |
| 3905 | Lisp_Object overlay, beg, end, buffer; |
| 3906 | { |
| 3907 | struct buffer *b, *ob; |
| 3908 | Lisp_Object obuffer; |
| 3909 | int count = SPECPDL_INDEX (); |
| 3910 | |
| 3911 | CHECK_OVERLAY (overlay); |
| 3912 | if (NILP (buffer)) |
| 3913 | buffer = Fmarker_buffer (OVERLAY_START (overlay)); |
| 3914 | if (NILP (buffer)) |
| 3915 | XSETBUFFER (buffer, current_buffer); |
| 3916 | CHECK_BUFFER (buffer); |
| 3917 | |
| 3918 | if (MARKERP (beg) |
| 3919 | && ! EQ (Fmarker_buffer (beg), buffer)) |
| 3920 | error ("Marker points into wrong buffer"); |
| 3921 | if (MARKERP (end) |
| 3922 | && ! EQ (Fmarker_buffer (end), buffer)) |
| 3923 | error ("Marker points into wrong buffer"); |
| 3924 | |
| 3925 | CHECK_NUMBER_COERCE_MARKER (beg); |
| 3926 | CHECK_NUMBER_COERCE_MARKER (end); |
| 3927 | |
| 3928 | if (XINT (beg) == XINT (end) && ! NILP (Foverlay_get (overlay, Qevaporate))) |
| 3929 | return Fdelete_overlay (overlay); |
| 3930 | |
| 3931 | if (XINT (beg) > XINT (end)) |
| 3932 | { |
| 3933 | Lisp_Object temp; |
| 3934 | temp = beg; beg = end; end = temp; |
| 3935 | } |
| 3936 | |
| 3937 | specbind (Qinhibit_quit, Qt); |
| 3938 | |
| 3939 | obuffer = Fmarker_buffer (OVERLAY_START (overlay)); |
| 3940 | b = XBUFFER (buffer); |
| 3941 | ob = BUFFERP (obuffer) ? XBUFFER (obuffer) : (struct buffer *) 0; |
| 3942 | |
| 3943 | /* If the overlay has changed buffers, do a thorough redisplay. */ |
| 3944 | if (!EQ (buffer, obuffer)) |
| 3945 | { |
| 3946 | /* Redisplay where the overlay was. */ |
| 3947 | if (!NILP (obuffer)) |
| 3948 | { |
| 3949 | int o_beg; |
| 3950 | int o_end; |
| 3951 | |
| 3952 | o_beg = OVERLAY_POSITION (OVERLAY_START (overlay)); |
| 3953 | o_end = OVERLAY_POSITION (OVERLAY_END (overlay)); |
| 3954 | |
| 3955 | modify_overlay (ob, o_beg, o_end); |
| 3956 | } |
| 3957 | |
| 3958 | /* Redisplay where the overlay is going to be. */ |
| 3959 | modify_overlay (b, XINT (beg), XINT (end)); |
| 3960 | } |
| 3961 | else |
| 3962 | /* Redisplay the area the overlay has just left, or just enclosed. */ |
| 3963 | { |
| 3964 | int o_beg, o_end; |
| 3965 | |
| 3966 | o_beg = OVERLAY_POSITION (OVERLAY_START (overlay)); |
| 3967 | o_end = OVERLAY_POSITION (OVERLAY_END (overlay)); |
| 3968 | |
| 3969 | if (o_beg == XINT (beg)) |
| 3970 | modify_overlay (b, o_end, XINT (end)); |
| 3971 | else if (o_end == XINT (end)) |
| 3972 | modify_overlay (b, o_beg, XINT (beg)); |
| 3973 | else |
| 3974 | { |
| 3975 | if (XINT (beg) < o_beg) o_beg = XINT (beg); |
| 3976 | if (XINT (end) > o_end) o_end = XINT (end); |
| 3977 | modify_overlay (b, o_beg, o_end); |
| 3978 | } |
| 3979 | } |
| 3980 | |
| 3981 | if (!NILP (obuffer)) |
| 3982 | { |
| 3983 | ob->overlays_before |
| 3984 | = unchain_overlay (ob->overlays_before, XOVERLAY (overlay)); |
| 3985 | ob->overlays_after |
| 3986 | = unchain_overlay (ob->overlays_after, XOVERLAY (overlay)); |
| 3987 | eassert (XOVERLAY (overlay)->next == NULL); |
| 3988 | } |
| 3989 | |
| 3990 | Fset_marker (OVERLAY_START (overlay), beg, buffer); |
| 3991 | Fset_marker (OVERLAY_END (overlay), end, buffer); |
| 3992 | |
| 3993 | /* Put the overlay on the wrong list. */ |
| 3994 | end = OVERLAY_END (overlay); |
| 3995 | if (OVERLAY_POSITION (end) < b->overlay_center) |
| 3996 | { |
| 3997 | XOVERLAY (overlay)->next = b->overlays_after; |
| 3998 | b->overlays_after = XOVERLAY (overlay); |
| 3999 | } |
| 4000 | else |
| 4001 | { |
| 4002 | XOVERLAY (overlay)->next = b->overlays_before; |
| 4003 | b->overlays_before = XOVERLAY (overlay); |
| 4004 | } |
| 4005 | |
| 4006 | /* This puts it in the right list, and in the right order. */ |
| 4007 | recenter_overlay_lists (b, b->overlay_center); |
| 4008 | |
| 4009 | return unbind_to (count, overlay); |
| 4010 | } |
| 4011 | |
| 4012 | DEFUN ("delete-overlay", Fdelete_overlay, Sdelete_overlay, 1, 1, 0, |
| 4013 | doc: /* Delete the overlay OVERLAY from its buffer. */) |
| 4014 | (overlay) |
| 4015 | Lisp_Object overlay; |
| 4016 | { |
| 4017 | Lisp_Object buffer; |
| 4018 | struct buffer *b; |
| 4019 | int count = SPECPDL_INDEX (); |
| 4020 | |
| 4021 | CHECK_OVERLAY (overlay); |
| 4022 | |
| 4023 | buffer = Fmarker_buffer (OVERLAY_START (overlay)); |
| 4024 | if (NILP (buffer)) |
| 4025 | return Qnil; |
| 4026 | |
| 4027 | b = XBUFFER (buffer); |
| 4028 | specbind (Qinhibit_quit, Qt); |
| 4029 | |
| 4030 | b->overlays_before = unchain_overlay (b->overlays_before,XOVERLAY (overlay)); |
| 4031 | b->overlays_after = unchain_overlay (b->overlays_after, XOVERLAY (overlay)); |
| 4032 | eassert (XOVERLAY (overlay)->next == NULL); |
| 4033 | modify_overlay (b, |
| 4034 | marker_position (OVERLAY_START (overlay)), |
| 4035 | marker_position (OVERLAY_END (overlay))); |
| 4036 | Fset_marker (OVERLAY_START (overlay), Qnil, Qnil); |
| 4037 | Fset_marker (OVERLAY_END (overlay), Qnil, Qnil); |
| 4038 | |
| 4039 | /* When deleting an overlay with before or after strings, turn off |
| 4040 | display optimizations for the affected buffer, on the basis that |
| 4041 | these strings may contain newlines. This is easier to do than to |
| 4042 | check for that situation during redisplay. */ |
| 4043 | if (!windows_or_buffers_changed |
| 4044 | && (!NILP (Foverlay_get (overlay, Qbefore_string)) |
| 4045 | || !NILP (Foverlay_get (overlay, Qafter_string)))) |
| 4046 | b->prevent_redisplay_optimizations_p = 1; |
| 4047 | |
| 4048 | return unbind_to (count, Qnil); |
| 4049 | } |
| 4050 | \f |
| 4051 | /* Overlay dissection functions. */ |
| 4052 | |
| 4053 | DEFUN ("overlay-start", Foverlay_start, Soverlay_start, 1, 1, 0, |
| 4054 | doc: /* Return the position at which OVERLAY starts. */) |
| 4055 | (overlay) |
| 4056 | Lisp_Object overlay; |
| 4057 | { |
| 4058 | CHECK_OVERLAY (overlay); |
| 4059 | |
| 4060 | return (Fmarker_position (OVERLAY_START (overlay))); |
| 4061 | } |
| 4062 | |
| 4063 | DEFUN ("overlay-end", Foverlay_end, Soverlay_end, 1, 1, 0, |
| 4064 | doc: /* Return the position at which OVERLAY ends. */) |
| 4065 | (overlay) |
| 4066 | Lisp_Object overlay; |
| 4067 | { |
| 4068 | CHECK_OVERLAY (overlay); |
| 4069 | |
| 4070 | return (Fmarker_position (OVERLAY_END (overlay))); |
| 4071 | } |
| 4072 | |
| 4073 | DEFUN ("overlay-buffer", Foverlay_buffer, Soverlay_buffer, 1, 1, 0, |
| 4074 | doc: /* Return the buffer OVERLAY belongs to. |
| 4075 | Return nil if OVERLAY has been deleted. */) |
| 4076 | (overlay) |
| 4077 | Lisp_Object overlay; |
| 4078 | { |
| 4079 | CHECK_OVERLAY (overlay); |
| 4080 | |
| 4081 | return Fmarker_buffer (OVERLAY_START (overlay)); |
| 4082 | } |
| 4083 | |
| 4084 | DEFUN ("overlay-properties", Foverlay_properties, Soverlay_properties, 1, 1, 0, |
| 4085 | doc: /* Return a list of the properties on OVERLAY. |
| 4086 | This is a copy of OVERLAY's plist; modifying its conses has no effect on |
| 4087 | OVERLAY. */) |
| 4088 | (overlay) |
| 4089 | Lisp_Object overlay; |
| 4090 | { |
| 4091 | CHECK_OVERLAY (overlay); |
| 4092 | |
| 4093 | return Fcopy_sequence (XOVERLAY (overlay)->plist); |
| 4094 | } |
| 4095 | |
| 4096 | \f |
| 4097 | DEFUN ("overlays-at", Foverlays_at, Soverlays_at, 1, 1, 0, |
| 4098 | doc: /* Return a list of the overlays that contain the character at POS. */) |
| 4099 | (pos) |
| 4100 | Lisp_Object pos; |
| 4101 | { |
| 4102 | int noverlays; |
| 4103 | Lisp_Object *overlay_vec; |
| 4104 | int len; |
| 4105 | Lisp_Object result; |
| 4106 | |
| 4107 | CHECK_NUMBER_COERCE_MARKER (pos); |
| 4108 | |
| 4109 | len = 10; |
| 4110 | /* We can't use alloca here because overlays_at can call xrealloc. */ |
| 4111 | overlay_vec = (Lisp_Object *) xmalloc (len * sizeof (Lisp_Object)); |
| 4112 | |
| 4113 | /* Put all the overlays we want in a vector in overlay_vec. |
| 4114 | Store the length in len. */ |
| 4115 | noverlays = overlays_at (XINT (pos), 1, &overlay_vec, &len, |
| 4116 | (EMACS_INT *) 0, (EMACS_INT *) 0, 0); |
| 4117 | |
| 4118 | /* Make a list of them all. */ |
| 4119 | result = Flist (noverlays, overlay_vec); |
| 4120 | |
| 4121 | xfree (overlay_vec); |
| 4122 | return result; |
| 4123 | } |
| 4124 | |
| 4125 | DEFUN ("overlays-in", Foverlays_in, Soverlays_in, 2, 2, 0, |
| 4126 | doc: /* Return a list of the overlays that overlap the region BEG ... END. |
| 4127 | Overlap means that at least one character is contained within the overlay |
| 4128 | and also contained within the specified region. |
| 4129 | Empty overlays are included in the result if they are located at BEG, |
| 4130 | between BEG and END, or at END provided END denotes the position at the |
| 4131 | end of the buffer. */) |
| 4132 | (beg, end) |
| 4133 | Lisp_Object beg, end; |
| 4134 | { |
| 4135 | int noverlays; |
| 4136 | Lisp_Object *overlay_vec; |
| 4137 | int len; |
| 4138 | Lisp_Object result; |
| 4139 | |
| 4140 | CHECK_NUMBER_COERCE_MARKER (beg); |
| 4141 | CHECK_NUMBER_COERCE_MARKER (end); |
| 4142 | |
| 4143 | len = 10; |
| 4144 | overlay_vec = (Lisp_Object *) xmalloc (len * sizeof (Lisp_Object)); |
| 4145 | |
| 4146 | /* Put all the overlays we want in a vector in overlay_vec. |
| 4147 | Store the length in len. */ |
| 4148 | noverlays = overlays_in (XINT (beg), XINT (end), 1, &overlay_vec, &len, |
| 4149 | (int *) 0, (int *) 0); |
| 4150 | |
| 4151 | /* Make a list of them all. */ |
| 4152 | result = Flist (noverlays, overlay_vec); |
| 4153 | |
| 4154 | xfree (overlay_vec); |
| 4155 | return result; |
| 4156 | } |
| 4157 | |
| 4158 | DEFUN ("next-overlay-change", Fnext_overlay_change, Snext_overlay_change, |
| 4159 | 1, 1, 0, |
| 4160 | doc: /* Return the next position after POS where an overlay starts or ends. |
| 4161 | If there are no overlay boundaries from POS to (point-max), |
| 4162 | the value is (point-max). */) |
| 4163 | (pos) |
| 4164 | Lisp_Object pos; |
| 4165 | { |
| 4166 | int noverlays; |
| 4167 | EMACS_INT endpos; |
| 4168 | Lisp_Object *overlay_vec; |
| 4169 | int len; |
| 4170 | int i; |
| 4171 | |
| 4172 | CHECK_NUMBER_COERCE_MARKER (pos); |
| 4173 | |
| 4174 | len = 10; |
| 4175 | overlay_vec = (Lisp_Object *) xmalloc (len * sizeof (Lisp_Object)); |
| 4176 | |
| 4177 | /* Put all the overlays we want in a vector in overlay_vec. |
| 4178 | Store the length in len. |
| 4179 | endpos gets the position where the next overlay starts. */ |
| 4180 | noverlays = overlays_at (XINT (pos), 1, &overlay_vec, &len, |
| 4181 | &endpos, (EMACS_INT *) 0, 1); |
| 4182 | |
| 4183 | /* If any of these overlays ends before endpos, |
| 4184 | use its ending point instead. */ |
| 4185 | for (i = 0; i < noverlays; i++) |
| 4186 | { |
| 4187 | Lisp_Object oend; |
| 4188 | EMACS_INT oendpos; |
| 4189 | |
| 4190 | oend = OVERLAY_END (overlay_vec[i]); |
| 4191 | oendpos = OVERLAY_POSITION (oend); |
| 4192 | if (oendpos < endpos) |
| 4193 | endpos = oendpos; |
| 4194 | } |
| 4195 | |
| 4196 | xfree (overlay_vec); |
| 4197 | return make_number (endpos); |
| 4198 | } |
| 4199 | |
| 4200 | DEFUN ("previous-overlay-change", Fprevious_overlay_change, |
| 4201 | Sprevious_overlay_change, 1, 1, 0, |
| 4202 | doc: /* Return the previous position before POS where an overlay starts or ends. |
| 4203 | If there are no overlay boundaries from (point-min) to POS, |
| 4204 | the value is (point-min). */) |
| 4205 | (pos) |
| 4206 | Lisp_Object pos; |
| 4207 | { |
| 4208 | int noverlays; |
| 4209 | EMACS_INT prevpos; |
| 4210 | Lisp_Object *overlay_vec; |
| 4211 | int len; |
| 4212 | |
| 4213 | CHECK_NUMBER_COERCE_MARKER (pos); |
| 4214 | |
| 4215 | /* At beginning of buffer, we know the answer; |
| 4216 | avoid bug subtracting 1 below. */ |
| 4217 | if (XINT (pos) == BEGV) |
| 4218 | return pos; |
| 4219 | |
| 4220 | len = 10; |
| 4221 | overlay_vec = (Lisp_Object *) xmalloc (len * sizeof (Lisp_Object)); |
| 4222 | |
| 4223 | /* Put all the overlays we want in a vector in overlay_vec. |
| 4224 | Store the length in len. |
| 4225 | prevpos gets the position of the previous change. */ |
| 4226 | noverlays = overlays_at (XINT (pos), 1, &overlay_vec, &len, |
| 4227 | (EMACS_INT *) 0, &prevpos, 1); |
| 4228 | |
| 4229 | xfree (overlay_vec); |
| 4230 | return make_number (prevpos); |
| 4231 | } |
| 4232 | \f |
| 4233 | /* These functions are for debugging overlays. */ |
| 4234 | |
| 4235 | DEFUN ("overlay-lists", Foverlay_lists, Soverlay_lists, 0, 0, 0, |
| 4236 | doc: /* Return a pair of lists giving all the overlays of the current buffer. |
| 4237 | The car has all the overlays before the overlay center; |
| 4238 | the cdr has all the overlays after the overlay center. |
| 4239 | Recentering overlays moves overlays between these lists. |
| 4240 | The lists you get are copies, so that changing them has no effect. |
| 4241 | However, the overlays you get are the real objects that the buffer uses. */) |
| 4242 | () |
| 4243 | { |
| 4244 | struct Lisp_Overlay *ol; |
| 4245 | Lisp_Object before = Qnil, after = Qnil, tmp; |
| 4246 | for (ol = current_buffer->overlays_before; ol; ol = ol->next) |
| 4247 | { |
| 4248 | XSETMISC (tmp, ol); |
| 4249 | before = Fcons (tmp, before); |
| 4250 | } |
| 4251 | for (ol = current_buffer->overlays_after; ol; ol = ol->next) |
| 4252 | { |
| 4253 | XSETMISC (tmp, ol); |
| 4254 | after = Fcons (tmp, after); |
| 4255 | } |
| 4256 | return Fcons (Fnreverse (before), Fnreverse (after)); |
| 4257 | } |
| 4258 | |
| 4259 | DEFUN ("overlay-recenter", Foverlay_recenter, Soverlay_recenter, 1, 1, 0, |
| 4260 | doc: /* Recenter the overlays of the current buffer around position POS. |
| 4261 | That makes overlay lookup faster for positions near POS (but perhaps slower |
| 4262 | for positions far away from POS). */) |
| 4263 | (pos) |
| 4264 | Lisp_Object pos; |
| 4265 | { |
| 4266 | CHECK_NUMBER_COERCE_MARKER (pos); |
| 4267 | |
| 4268 | recenter_overlay_lists (current_buffer, XINT (pos)); |
| 4269 | return Qnil; |
| 4270 | } |
| 4271 | \f |
| 4272 | DEFUN ("overlay-get", Foverlay_get, Soverlay_get, 2, 2, 0, |
| 4273 | doc: /* Get the property of overlay OVERLAY with property name PROP. */) |
| 4274 | (overlay, prop) |
| 4275 | Lisp_Object overlay, prop; |
| 4276 | { |
| 4277 | CHECK_OVERLAY (overlay); |
| 4278 | return lookup_char_property (XOVERLAY (overlay)->plist, prop, 0); |
| 4279 | } |
| 4280 | |
| 4281 | DEFUN ("overlay-put", Foverlay_put, Soverlay_put, 3, 3, 0, |
| 4282 | doc: /* Set one property of overlay OVERLAY: give property PROP value VALUE. */) |
| 4283 | (overlay, prop, value) |
| 4284 | Lisp_Object overlay, prop, value; |
| 4285 | { |
| 4286 | Lisp_Object tail, buffer; |
| 4287 | int changed; |
| 4288 | |
| 4289 | CHECK_OVERLAY (overlay); |
| 4290 | |
| 4291 | buffer = Fmarker_buffer (OVERLAY_START (overlay)); |
| 4292 | |
| 4293 | for (tail = XOVERLAY (overlay)->plist; |
| 4294 | CONSP (tail) && CONSP (XCDR (tail)); |
| 4295 | tail = XCDR (XCDR (tail))) |
| 4296 | if (EQ (XCAR (tail), prop)) |
| 4297 | { |
| 4298 | changed = !EQ (XCAR (XCDR (tail)), value); |
| 4299 | XSETCAR (XCDR (tail), value); |
| 4300 | goto found; |
| 4301 | } |
| 4302 | /* It wasn't in the list, so add it to the front. */ |
| 4303 | changed = !NILP (value); |
| 4304 | XOVERLAY (overlay)->plist |
| 4305 | = Fcons (prop, Fcons (value, XOVERLAY (overlay)->plist)); |
| 4306 | found: |
| 4307 | if (! NILP (buffer)) |
| 4308 | { |
| 4309 | if (changed) |
| 4310 | modify_overlay (XBUFFER (buffer), |
| 4311 | marker_position (OVERLAY_START (overlay)), |
| 4312 | marker_position (OVERLAY_END (overlay))); |
| 4313 | if (EQ (prop, Qevaporate) && ! NILP (value) |
| 4314 | && (OVERLAY_POSITION (OVERLAY_START (overlay)) |
| 4315 | == OVERLAY_POSITION (OVERLAY_END (overlay)))) |
| 4316 | Fdelete_overlay (overlay); |
| 4317 | } |
| 4318 | |
| 4319 | return value; |
| 4320 | } |
| 4321 | \f |
| 4322 | /* Subroutine of report_overlay_modification. */ |
| 4323 | |
| 4324 | /* Lisp vector holding overlay hook functions to call. |
| 4325 | Vector elements come in pairs. |
| 4326 | Each even-index element is a list of hook functions. |
| 4327 | The following odd-index element is the overlay they came from. |
| 4328 | |
| 4329 | Before the buffer change, we fill in this vector |
| 4330 | as we call overlay hook functions. |
| 4331 | After the buffer change, we get the functions to call from this vector. |
| 4332 | This way we always call the same functions before and after the change. */ |
| 4333 | static Lisp_Object last_overlay_modification_hooks; |
| 4334 | |
| 4335 | /* Number of elements actually used in last_overlay_modification_hooks. */ |
| 4336 | static int last_overlay_modification_hooks_used; |
| 4337 | |
| 4338 | /* Add one functionlist/overlay pair |
| 4339 | to the end of last_overlay_modification_hooks. */ |
| 4340 | |
| 4341 | static void |
| 4342 | add_overlay_mod_hooklist (functionlist, overlay) |
| 4343 | Lisp_Object functionlist, overlay; |
| 4344 | { |
| 4345 | int oldsize = XVECTOR (last_overlay_modification_hooks)->size; |
| 4346 | |
| 4347 | if (last_overlay_modification_hooks_used == oldsize) |
| 4348 | last_overlay_modification_hooks = larger_vector |
| 4349 | (last_overlay_modification_hooks, oldsize * 2, Qnil); |
| 4350 | ASET (last_overlay_modification_hooks, last_overlay_modification_hooks_used, |
| 4351 | functionlist); last_overlay_modification_hooks_used++; |
| 4352 | ASET (last_overlay_modification_hooks, last_overlay_modification_hooks_used, |
| 4353 | overlay); last_overlay_modification_hooks_used++; |
| 4354 | } |
| 4355 | \f |
| 4356 | /* Run the modification-hooks of overlays that include |
| 4357 | any part of the text in START to END. |
| 4358 | If this change is an insertion, also |
| 4359 | run the insert-before-hooks of overlay starting at END, |
| 4360 | and the insert-after-hooks of overlay ending at START. |
| 4361 | |
| 4362 | This is called both before and after the modification. |
| 4363 | AFTER is nonzero when we call after the modification. |
| 4364 | |
| 4365 | ARG1, ARG2, ARG3 are arguments to pass to the hook functions. |
| 4366 | When AFTER is nonzero, they are the start position, |
| 4367 | the position after the inserted new text, |
| 4368 | and the length of deleted or replaced old text. */ |
| 4369 | |
| 4370 | void |
| 4371 | report_overlay_modification (start, end, after, arg1, arg2, arg3) |
| 4372 | Lisp_Object start, end; |
| 4373 | int after; |
| 4374 | Lisp_Object arg1, arg2, arg3; |
| 4375 | { |
| 4376 | Lisp_Object prop, overlay; |
| 4377 | struct Lisp_Overlay *tail; |
| 4378 | /* 1 if this change is an insertion. */ |
| 4379 | int insertion = (after ? XFASTINT (arg3) == 0 : EQ (start, end)); |
| 4380 | struct gcpro gcpro1, gcpro2, gcpro3, gcpro4; |
| 4381 | |
| 4382 | overlay = Qnil; |
| 4383 | tail = NULL; |
| 4384 | |
| 4385 | /* We used to run the functions as soon as we found them and only register |
| 4386 | them in last_overlay_modification_hooks for the purpose of the `after' |
| 4387 | case. But running elisp code as we traverse the list of overlays is |
| 4388 | painful because the list can be modified by the elisp code so we had to |
| 4389 | copy at several places. We now simply do a read-only traversal that |
| 4390 | only collects the functions to run and we run them afterwards. It's |
| 4391 | simpler, especially since all the code was already there. -stef */ |
| 4392 | |
| 4393 | if (!after) |
| 4394 | { |
| 4395 | /* We are being called before a change. |
| 4396 | Scan the overlays to find the functions to call. */ |
| 4397 | last_overlay_modification_hooks_used = 0; |
| 4398 | for (tail = current_buffer->overlays_before; tail; tail = tail->next) |
| 4399 | { |
| 4400 | int startpos, endpos; |
| 4401 | Lisp_Object ostart, oend; |
| 4402 | |
| 4403 | XSETMISC (overlay, tail); |
| 4404 | |
| 4405 | ostart = OVERLAY_START (overlay); |
| 4406 | oend = OVERLAY_END (overlay); |
| 4407 | endpos = OVERLAY_POSITION (oend); |
| 4408 | if (XFASTINT (start) > endpos) |
| 4409 | break; |
| 4410 | startpos = OVERLAY_POSITION (ostart); |
| 4411 | if (insertion && (XFASTINT (start) == startpos |
| 4412 | || XFASTINT (end) == startpos)) |
| 4413 | { |
| 4414 | prop = Foverlay_get (overlay, Qinsert_in_front_hooks); |
| 4415 | if (!NILP (prop)) |
| 4416 | add_overlay_mod_hooklist (prop, overlay); |
| 4417 | } |
| 4418 | if (insertion && (XFASTINT (start) == endpos |
| 4419 | || XFASTINT (end) == endpos)) |
| 4420 | { |
| 4421 | prop = Foverlay_get (overlay, Qinsert_behind_hooks); |
| 4422 | if (!NILP (prop)) |
| 4423 | add_overlay_mod_hooklist (prop, overlay); |
| 4424 | } |
| 4425 | /* Test for intersecting intervals. This does the right thing |
| 4426 | for both insertion and deletion. */ |
| 4427 | if (XFASTINT (end) > startpos && XFASTINT (start) < endpos) |
| 4428 | { |
| 4429 | prop = Foverlay_get (overlay, Qmodification_hooks); |
| 4430 | if (!NILP (prop)) |
| 4431 | add_overlay_mod_hooklist (prop, overlay); |
| 4432 | } |
| 4433 | } |
| 4434 | |
| 4435 | for (tail = current_buffer->overlays_after; tail; tail = tail->next) |
| 4436 | { |
| 4437 | int startpos, endpos; |
| 4438 | Lisp_Object ostart, oend; |
| 4439 | |
| 4440 | XSETMISC (overlay, tail); |
| 4441 | |
| 4442 | ostart = OVERLAY_START (overlay); |
| 4443 | oend = OVERLAY_END (overlay); |
| 4444 | startpos = OVERLAY_POSITION (ostart); |
| 4445 | endpos = OVERLAY_POSITION (oend); |
| 4446 | if (XFASTINT (end) < startpos) |
| 4447 | break; |
| 4448 | if (insertion && (XFASTINT (start) == startpos |
| 4449 | || XFASTINT (end) == startpos)) |
| 4450 | { |
| 4451 | prop = Foverlay_get (overlay, Qinsert_in_front_hooks); |
| 4452 | if (!NILP (prop)) |
| 4453 | add_overlay_mod_hooklist (prop, overlay); |
| 4454 | } |
| 4455 | if (insertion && (XFASTINT (start) == endpos |
| 4456 | || XFASTINT (end) == endpos)) |
| 4457 | { |
| 4458 | prop = Foverlay_get (overlay, Qinsert_behind_hooks); |
| 4459 | if (!NILP (prop)) |
| 4460 | add_overlay_mod_hooklist (prop, overlay); |
| 4461 | } |
| 4462 | /* Test for intersecting intervals. This does the right thing |
| 4463 | for both insertion and deletion. */ |
| 4464 | if (XFASTINT (end) > startpos && XFASTINT (start) < endpos) |
| 4465 | { |
| 4466 | prop = Foverlay_get (overlay, Qmodification_hooks); |
| 4467 | if (!NILP (prop)) |
| 4468 | add_overlay_mod_hooklist (prop, overlay); |
| 4469 | } |
| 4470 | } |
| 4471 | } |
| 4472 | |
| 4473 | GCPRO4 (overlay, arg1, arg2, arg3); |
| 4474 | { |
| 4475 | /* Call the functions recorded in last_overlay_modification_hooks. |
| 4476 | First copy the vector contents, in case some of these hooks |
| 4477 | do subsequent modification of the buffer. */ |
| 4478 | int size = last_overlay_modification_hooks_used; |
| 4479 | Lisp_Object *copy = (Lisp_Object *) alloca (size * sizeof (Lisp_Object)); |
| 4480 | int i; |
| 4481 | |
| 4482 | bcopy (XVECTOR (last_overlay_modification_hooks)->contents, |
| 4483 | copy, size * sizeof (Lisp_Object)); |
| 4484 | gcpro1.var = copy; |
| 4485 | gcpro1.nvars = size; |
| 4486 | |
| 4487 | for (i = 0; i < size;) |
| 4488 | { |
| 4489 | Lisp_Object prop, overlay; |
| 4490 | prop = copy[i++]; |
| 4491 | overlay = copy[i++]; |
| 4492 | call_overlay_mod_hooks (prop, overlay, after, arg1, arg2, arg3); |
| 4493 | } |
| 4494 | } |
| 4495 | UNGCPRO; |
| 4496 | } |
| 4497 | |
| 4498 | static void |
| 4499 | call_overlay_mod_hooks (list, overlay, after, arg1, arg2, arg3) |
| 4500 | Lisp_Object list, overlay; |
| 4501 | int after; |
| 4502 | Lisp_Object arg1, arg2, arg3; |
| 4503 | { |
| 4504 | struct gcpro gcpro1, gcpro2, gcpro3, gcpro4; |
| 4505 | |
| 4506 | GCPRO4 (list, arg1, arg2, arg3); |
| 4507 | |
| 4508 | while (CONSP (list)) |
| 4509 | { |
| 4510 | if (NILP (arg3)) |
| 4511 | call4 (XCAR (list), overlay, after ? Qt : Qnil, arg1, arg2); |
| 4512 | else |
| 4513 | call5 (XCAR (list), overlay, after ? Qt : Qnil, arg1, arg2, arg3); |
| 4514 | list = XCDR (list); |
| 4515 | } |
| 4516 | UNGCPRO; |
| 4517 | } |
| 4518 | |
| 4519 | /* Delete any zero-sized overlays at position POS, if the `evaporate' |
| 4520 | property is set. */ |
| 4521 | void |
| 4522 | evaporate_overlays (pos) |
| 4523 | EMACS_INT pos; |
| 4524 | { |
| 4525 | Lisp_Object overlay, hit_list; |
| 4526 | struct Lisp_Overlay *tail; |
| 4527 | |
| 4528 | hit_list = Qnil; |
| 4529 | if (pos <= current_buffer->overlay_center) |
| 4530 | for (tail = current_buffer->overlays_before; tail; tail = tail->next) |
| 4531 | { |
| 4532 | int endpos; |
| 4533 | XSETMISC (overlay, tail); |
| 4534 | endpos = OVERLAY_POSITION (OVERLAY_END (overlay)); |
| 4535 | if (endpos < pos) |
| 4536 | break; |
| 4537 | if (endpos == pos && OVERLAY_POSITION (OVERLAY_START (overlay)) == pos |
| 4538 | && ! NILP (Foverlay_get (overlay, Qevaporate))) |
| 4539 | hit_list = Fcons (overlay, hit_list); |
| 4540 | } |
| 4541 | else |
| 4542 | for (tail = current_buffer->overlays_after; tail; tail = tail->next) |
| 4543 | { |
| 4544 | int startpos; |
| 4545 | XSETMISC (overlay, tail); |
| 4546 | startpos = OVERLAY_POSITION (OVERLAY_START (overlay)); |
| 4547 | if (startpos > pos) |
| 4548 | break; |
| 4549 | if (startpos == pos && OVERLAY_POSITION (OVERLAY_END (overlay)) == pos |
| 4550 | && ! NILP (Foverlay_get (overlay, Qevaporate))) |
| 4551 | hit_list = Fcons (overlay, hit_list); |
| 4552 | } |
| 4553 | for (; CONSP (hit_list); hit_list = XCDR (hit_list)) |
| 4554 | Fdelete_overlay (XCAR (hit_list)); |
| 4555 | } |
| 4556 | \f |
| 4557 | /* Somebody has tried to store a value with an unacceptable type |
| 4558 | in the slot with offset OFFSET. */ |
| 4559 | |
| 4560 | void |
| 4561 | buffer_slot_type_mismatch (newval, type) |
| 4562 | Lisp_Object newval; |
| 4563 | int type; |
| 4564 | { |
| 4565 | Lisp_Object predicate; |
| 4566 | |
| 4567 | switch (type) |
| 4568 | { |
| 4569 | case Lisp_Int: predicate = Qintegerp; break; |
| 4570 | case Lisp_String: predicate = Qstringp; break; |
| 4571 | case Lisp_Symbol: predicate = Qsymbolp; break; |
| 4572 | default: abort (); |
| 4573 | } |
| 4574 | |
| 4575 | wrong_type_argument (predicate, newval); |
| 4576 | } |
| 4577 | |
| 4578 | \f |
| 4579 | /*********************************************************************** |
| 4580 | Allocation with mmap |
| 4581 | ***********************************************************************/ |
| 4582 | |
| 4583 | #ifdef USE_MMAP_FOR_BUFFERS |
| 4584 | |
| 4585 | #include <sys/types.h> |
| 4586 | #include <sys/mman.h> |
| 4587 | |
| 4588 | #ifndef MAP_ANON |
| 4589 | #ifdef MAP_ANONYMOUS |
| 4590 | #define MAP_ANON MAP_ANONYMOUS |
| 4591 | #else |
| 4592 | #define MAP_ANON 0 |
| 4593 | #endif |
| 4594 | #endif |
| 4595 | |
| 4596 | #ifndef MAP_FAILED |
| 4597 | #define MAP_FAILED ((void *) -1) |
| 4598 | #endif |
| 4599 | |
| 4600 | #include <stdio.h> |
| 4601 | #include <errno.h> |
| 4602 | |
| 4603 | #if MAP_ANON == 0 |
| 4604 | #include <fcntl.h> |
| 4605 | #endif |
| 4606 | |
| 4607 | #include "coding.h" |
| 4608 | |
| 4609 | |
| 4610 | /* Memory is allocated in regions which are mapped using mmap(2). |
| 4611 | The current implementation lets the system select mapped |
| 4612 | addresses; we're not using MAP_FIXED in general, except when |
| 4613 | trying to enlarge regions. |
| 4614 | |
| 4615 | Each mapped region starts with a mmap_region structure, the user |
| 4616 | area starts after that structure, aligned to MEM_ALIGN. |
| 4617 | |
| 4618 | +-----------------------+ |
| 4619 | | struct mmap_info + | |
| 4620 | | padding | |
| 4621 | +-----------------------+ |
| 4622 | | user data | |
| 4623 | | | |
| 4624 | | | |
| 4625 | +-----------------------+ */ |
| 4626 | |
| 4627 | struct mmap_region |
| 4628 | { |
| 4629 | /* User-specified size. */ |
| 4630 | size_t nbytes_specified; |
| 4631 | |
| 4632 | /* Number of bytes mapped */ |
| 4633 | size_t nbytes_mapped; |
| 4634 | |
| 4635 | /* Pointer to the location holding the address of the memory |
| 4636 | allocated with the mmap'd block. The variable actually points |
| 4637 | after this structure. */ |
| 4638 | POINTER_TYPE **var; |
| 4639 | |
| 4640 | /* Next and previous in list of all mmap'd regions. */ |
| 4641 | struct mmap_region *next, *prev; |
| 4642 | }; |
| 4643 | |
| 4644 | /* Doubly-linked list of mmap'd regions. */ |
| 4645 | |
| 4646 | static struct mmap_region *mmap_regions; |
| 4647 | |
| 4648 | /* File descriptor for mmap. If we don't have anonymous mapping, |
| 4649 | /dev/zero will be opened on it. */ |
| 4650 | |
| 4651 | static int mmap_fd; |
| 4652 | |
| 4653 | /* Temporary storage for mmap_set_vars, see there. */ |
| 4654 | |
| 4655 | static struct mmap_region *mmap_regions_1; |
| 4656 | static int mmap_fd_1; |
| 4657 | |
| 4658 | /* Page size on this system. */ |
| 4659 | |
| 4660 | static int mmap_page_size; |
| 4661 | |
| 4662 | /* 1 means mmap has been intialized. */ |
| 4663 | |
| 4664 | static int mmap_initialized_p; |
| 4665 | |
| 4666 | /* Value is X rounded up to the next multiple of N. */ |
| 4667 | |
| 4668 | #define ROUND(X, N) (((X) + (N) - 1) / (N) * (N)) |
| 4669 | |
| 4670 | /* Size of mmap_region structure plus padding. */ |
| 4671 | |
| 4672 | #define MMAP_REGION_STRUCT_SIZE \ |
| 4673 | ROUND (sizeof (struct mmap_region), MEM_ALIGN) |
| 4674 | |
| 4675 | /* Given a pointer P to the start of the user-visible part of a mapped |
| 4676 | region, return a pointer to the start of the region. */ |
| 4677 | |
| 4678 | #define MMAP_REGION(P) \ |
| 4679 | ((struct mmap_region *) ((char *) (P) - MMAP_REGION_STRUCT_SIZE)) |
| 4680 | |
| 4681 | /* Given a pointer P to the start of a mapped region, return a pointer |
| 4682 | to the start of the user-visible part of the region. */ |
| 4683 | |
| 4684 | #define MMAP_USER_AREA(P) \ |
| 4685 | ((POINTER_TYPE *) ((char *) (P) + MMAP_REGION_STRUCT_SIZE)) |
| 4686 | |
| 4687 | #define MEM_ALIGN sizeof (double) |
| 4688 | |
| 4689 | /* Predicate returning true if part of the address range [START .. END] |
| 4690 | is currently mapped. Used to prevent overwriting an existing |
| 4691 | memory mapping. |
| 4692 | |
| 4693 | Default is to conservativly assume the address range is occupied by |
| 4694 | something else. This can be overridden by system configuration |
| 4695 | files if system-specific means to determine this exists. */ |
| 4696 | |
| 4697 | #ifndef MMAP_ALLOCATED_P |
| 4698 | #define MMAP_ALLOCATED_P(start, end) 1 |
| 4699 | #endif |
| 4700 | |
| 4701 | /* Function prototypes. */ |
| 4702 | |
| 4703 | static int mmap_free_1 P_ ((struct mmap_region *)); |
| 4704 | static int mmap_enlarge P_ ((struct mmap_region *, int)); |
| 4705 | static struct mmap_region *mmap_find P_ ((POINTER_TYPE *, POINTER_TYPE *)); |
| 4706 | static POINTER_TYPE *mmap_alloc P_ ((POINTER_TYPE **, size_t)); |
| 4707 | static POINTER_TYPE *mmap_realloc P_ ((POINTER_TYPE **, size_t)); |
| 4708 | static void mmap_free P_ ((POINTER_TYPE **ptr)); |
| 4709 | static void mmap_init P_ ((void)); |
| 4710 | |
| 4711 | |
| 4712 | /* Return a region overlapping address range START...END, or null if |
| 4713 | none. END is not including, i.e. the last byte in the range |
| 4714 | is at END - 1. */ |
| 4715 | |
| 4716 | static struct mmap_region * |
| 4717 | mmap_find (start, end) |
| 4718 | POINTER_TYPE *start, *end; |
| 4719 | { |
| 4720 | struct mmap_region *r; |
| 4721 | char *s = (char *) start, *e = (char *) end; |
| 4722 | |
| 4723 | for (r = mmap_regions; r; r = r->next) |
| 4724 | { |
| 4725 | char *rstart = (char *) r; |
| 4726 | char *rend = rstart + r->nbytes_mapped; |
| 4727 | |
| 4728 | if (/* First byte of range, i.e. START, in this region? */ |
| 4729 | (s >= rstart && s < rend) |
| 4730 | /* Last byte of range, i.e. END - 1, in this region? */ |
| 4731 | || (e > rstart && e <= rend) |
| 4732 | /* First byte of this region in the range? */ |
| 4733 | || (rstart >= s && rstart < e) |
| 4734 | /* Last byte of this region in the range? */ |
| 4735 | || (rend > s && rend <= e)) |
| 4736 | break; |
| 4737 | } |
| 4738 | |
| 4739 | return r; |
| 4740 | } |
| 4741 | |
| 4742 | |
| 4743 | /* Unmap a region. P is a pointer to the start of the user-araa of |
| 4744 | the region. Value is non-zero if successful. */ |
| 4745 | |
| 4746 | static int |
| 4747 | mmap_free_1 (r) |
| 4748 | struct mmap_region *r; |
| 4749 | { |
| 4750 | if (r->next) |
| 4751 | r->next->prev = r->prev; |
| 4752 | if (r->prev) |
| 4753 | r->prev->next = r->next; |
| 4754 | else |
| 4755 | mmap_regions = r->next; |
| 4756 | |
| 4757 | if (munmap ((POINTER_TYPE *) r, r->nbytes_mapped) == -1) |
| 4758 | { |
| 4759 | fprintf (stderr, "munmap: %s\n", emacs_strerror (errno)); |
| 4760 | return 0; |
| 4761 | } |
| 4762 | |
| 4763 | return 1; |
| 4764 | } |
| 4765 | |
| 4766 | |
| 4767 | /* Enlarge region R by NPAGES pages. NPAGES < 0 means shrink R. |
| 4768 | Value is non-zero if successful. */ |
| 4769 | |
| 4770 | static int |
| 4771 | mmap_enlarge (r, npages) |
| 4772 | struct mmap_region *r; |
| 4773 | int npages; |
| 4774 | { |
| 4775 | char *region_end = (char *) r + r->nbytes_mapped; |
| 4776 | size_t nbytes; |
| 4777 | int success = 0; |
| 4778 | |
| 4779 | if (npages < 0) |
| 4780 | { |
| 4781 | /* Unmap pages at the end of the region. */ |
| 4782 | nbytes = - npages * mmap_page_size; |
| 4783 | if (munmap (region_end - nbytes, nbytes) == -1) |
| 4784 | fprintf (stderr, "munmap: %s\n", emacs_strerror (errno)); |
| 4785 | else |
| 4786 | { |
| 4787 | r->nbytes_mapped -= nbytes; |
| 4788 | success = 1; |
| 4789 | } |
| 4790 | } |
| 4791 | else if (npages > 0) |
| 4792 | { |
| 4793 | nbytes = npages * mmap_page_size; |
| 4794 | |
| 4795 | /* Try to map additional pages at the end of the region. We |
| 4796 | cannot do this if the address range is already occupied by |
| 4797 | something else because mmap deletes any previous mapping. |
| 4798 | I'm not sure this is worth doing, let's see. */ |
| 4799 | if (!MMAP_ALLOCATED_P (region_end, region_end + nbytes)) |
| 4800 | { |
| 4801 | POINTER_TYPE *p; |
| 4802 | |
| 4803 | p = mmap (region_end, nbytes, PROT_READ | PROT_WRITE, |
| 4804 | MAP_ANON | MAP_PRIVATE | MAP_FIXED, mmap_fd, 0); |
| 4805 | if (p == MAP_FAILED) |
| 4806 | ; /* fprintf (stderr, "mmap: %s\n", emacs_strerror (errno)); */ |
| 4807 | else if (p != (POINTER_TYPE *) region_end) |
| 4808 | { |
| 4809 | /* Kernels are free to choose a different address. In |
| 4810 | that case, unmap what we've mapped above; we have |
| 4811 | no use for it. */ |
| 4812 | if (munmap (p, nbytes) == -1) |
| 4813 | fprintf (stderr, "munmap: %s\n", emacs_strerror (errno)); |
| 4814 | } |
| 4815 | else |
| 4816 | { |
| 4817 | r->nbytes_mapped += nbytes; |
| 4818 | success = 1; |
| 4819 | } |
| 4820 | } |
| 4821 | } |
| 4822 | |
| 4823 | return success; |
| 4824 | } |
| 4825 | |
| 4826 | |
| 4827 | /* Set or reset variables holding references to mapped regions. If |
| 4828 | RESTORE_P is zero, set all variables to null. If RESTORE_P is |
| 4829 | non-zero, set all variables to the start of the user-areas |
| 4830 | of mapped regions. |
| 4831 | |
| 4832 | This function is called from Fdump_emacs to ensure that the dumped |
| 4833 | Emacs doesn't contain references to memory that won't be mapped |
| 4834 | when Emacs starts. */ |
| 4835 | |
| 4836 | void |
| 4837 | mmap_set_vars (restore_p) |
| 4838 | int restore_p; |
| 4839 | { |
| 4840 | struct mmap_region *r; |
| 4841 | |
| 4842 | if (restore_p) |
| 4843 | { |
| 4844 | mmap_regions = mmap_regions_1; |
| 4845 | mmap_fd = mmap_fd_1; |
| 4846 | for (r = mmap_regions; r; r = r->next) |
| 4847 | *r->var = MMAP_USER_AREA (r); |
| 4848 | } |
| 4849 | else |
| 4850 | { |
| 4851 | for (r = mmap_regions; r; r = r->next) |
| 4852 | *r->var = NULL; |
| 4853 | mmap_regions_1 = mmap_regions; |
| 4854 | mmap_regions = NULL; |
| 4855 | mmap_fd_1 = mmap_fd; |
| 4856 | mmap_fd = -1; |
| 4857 | } |
| 4858 | } |
| 4859 | |
| 4860 | |
| 4861 | /* Allocate a block of storage large enough to hold NBYTES bytes of |
| 4862 | data. A pointer to the data is returned in *VAR. VAR is thus the |
| 4863 | address of some variable which will use the data area. |
| 4864 | |
| 4865 | The allocation of 0 bytes is valid. |
| 4866 | |
| 4867 | If we can't allocate the necessary memory, set *VAR to null, and |
| 4868 | return null. */ |
| 4869 | |
| 4870 | static POINTER_TYPE * |
| 4871 | mmap_alloc (var, nbytes) |
| 4872 | POINTER_TYPE **var; |
| 4873 | size_t nbytes; |
| 4874 | { |
| 4875 | void *p; |
| 4876 | size_t map; |
| 4877 | |
| 4878 | mmap_init (); |
| 4879 | |
| 4880 | map = ROUND (nbytes + MMAP_REGION_STRUCT_SIZE, mmap_page_size); |
| 4881 | p = mmap (NULL, map, PROT_READ | PROT_WRITE, MAP_ANON | MAP_PRIVATE, |
| 4882 | mmap_fd, 0); |
| 4883 | |
| 4884 | if (p == MAP_FAILED) |
| 4885 | { |
| 4886 | if (errno != ENOMEM) |
| 4887 | fprintf (stderr, "mmap: %s\n", emacs_strerror (errno)); |
| 4888 | p = NULL; |
| 4889 | } |
| 4890 | else |
| 4891 | { |
| 4892 | struct mmap_region *r = (struct mmap_region *) p; |
| 4893 | |
| 4894 | r->nbytes_specified = nbytes; |
| 4895 | r->nbytes_mapped = map; |
| 4896 | r->var = var; |
| 4897 | r->prev = NULL; |
| 4898 | r->next = mmap_regions; |
| 4899 | if (r->next) |
| 4900 | r->next->prev = r; |
| 4901 | mmap_regions = r; |
| 4902 | |
| 4903 | p = MMAP_USER_AREA (p); |
| 4904 | } |
| 4905 | |
| 4906 | return *var = p; |
| 4907 | } |
| 4908 | |
| 4909 | |
| 4910 | /* Given a pointer at address VAR to data allocated with mmap_alloc, |
| 4911 | resize it to size NBYTES. Change *VAR to reflect the new block, |
| 4912 | and return this value. If more memory cannot be allocated, then |
| 4913 | leave *VAR unchanged, and return null. */ |
| 4914 | |
| 4915 | static POINTER_TYPE * |
| 4916 | mmap_realloc (var, nbytes) |
| 4917 | POINTER_TYPE **var; |
| 4918 | size_t nbytes; |
| 4919 | { |
| 4920 | POINTER_TYPE *result; |
| 4921 | |
| 4922 | mmap_init (); |
| 4923 | |
| 4924 | if (*var == NULL) |
| 4925 | result = mmap_alloc (var, nbytes); |
| 4926 | else if (nbytes == 0) |
| 4927 | { |
| 4928 | mmap_free (var); |
| 4929 | result = mmap_alloc (var, nbytes); |
| 4930 | } |
| 4931 | else |
| 4932 | { |
| 4933 | struct mmap_region *r = MMAP_REGION (*var); |
| 4934 | size_t room = r->nbytes_mapped - MMAP_REGION_STRUCT_SIZE; |
| 4935 | |
| 4936 | if (room < nbytes) |
| 4937 | { |
| 4938 | /* Must enlarge. */ |
| 4939 | POINTER_TYPE *old_ptr = *var; |
| 4940 | |
| 4941 | /* Try to map additional pages at the end of the region. |
| 4942 | If that fails, allocate a new region, copy data |
| 4943 | from the old region, then free it. */ |
| 4944 | if (mmap_enlarge (r, (ROUND (nbytes - room, mmap_page_size) |
| 4945 | / mmap_page_size))) |
| 4946 | { |
| 4947 | r->nbytes_specified = nbytes; |
| 4948 | *var = result = old_ptr; |
| 4949 | } |
| 4950 | else if (mmap_alloc (var, nbytes)) |
| 4951 | { |
| 4952 | bcopy (old_ptr, *var, r->nbytes_specified); |
| 4953 | mmap_free_1 (MMAP_REGION (old_ptr)); |
| 4954 | result = *var; |
| 4955 | r = MMAP_REGION (result); |
| 4956 | r->nbytes_specified = nbytes; |
| 4957 | } |
| 4958 | else |
| 4959 | { |
| 4960 | *var = old_ptr; |
| 4961 | result = NULL; |
| 4962 | } |
| 4963 | } |
| 4964 | else if (room - nbytes >= mmap_page_size) |
| 4965 | { |
| 4966 | /* Shrinking by at least a page. Let's give some |
| 4967 | memory back to the system. |
| 4968 | |
| 4969 | The extra parens are to make the division happens first, |
| 4970 | on positive values, so we know it will round towards |
| 4971 | zero. */ |
| 4972 | mmap_enlarge (r, - ((room - nbytes) / mmap_page_size)); |
| 4973 | result = *var; |
| 4974 | r->nbytes_specified = nbytes; |
| 4975 | } |
| 4976 | else |
| 4977 | { |
| 4978 | /* Leave it alone. */ |
| 4979 | result = *var; |
| 4980 | r->nbytes_specified = nbytes; |
| 4981 | } |
| 4982 | } |
| 4983 | |
| 4984 | return result; |
| 4985 | } |
| 4986 | |
| 4987 | |
| 4988 | /* Free a block of relocatable storage whose data is pointed to by |
| 4989 | PTR. Store 0 in *PTR to show there's no block allocated. */ |
| 4990 | |
| 4991 | static void |
| 4992 | mmap_free (var) |
| 4993 | POINTER_TYPE **var; |
| 4994 | { |
| 4995 | mmap_init (); |
| 4996 | |
| 4997 | if (*var) |
| 4998 | { |
| 4999 | mmap_free_1 (MMAP_REGION (*var)); |
| 5000 | *var = NULL; |
| 5001 | } |
| 5002 | } |
| 5003 | |
| 5004 | |
| 5005 | /* Perform necessary intializations for the use of mmap. */ |
| 5006 | |
| 5007 | static void |
| 5008 | mmap_init () |
| 5009 | { |
| 5010 | #if MAP_ANON == 0 |
| 5011 | /* The value of mmap_fd is initially 0 in temacs, and -1 |
| 5012 | in a dumped Emacs. */ |
| 5013 | if (mmap_fd <= 0) |
| 5014 | { |
| 5015 | /* No anonymous mmap -- we need the file descriptor. */ |
| 5016 | mmap_fd = open ("/dev/zero", O_RDONLY); |
| 5017 | if (mmap_fd == -1) |
| 5018 | fatal ("Cannot open /dev/zero: %s", emacs_strerror (errno)); |
| 5019 | } |
| 5020 | #endif /* MAP_ANON == 0 */ |
| 5021 | |
| 5022 | if (mmap_initialized_p) |
| 5023 | return; |
| 5024 | mmap_initialized_p = 1; |
| 5025 | |
| 5026 | #if MAP_ANON != 0 |
| 5027 | mmap_fd = -1; |
| 5028 | #endif |
| 5029 | |
| 5030 | mmap_page_size = getpagesize (); |
| 5031 | } |
| 5032 | |
| 5033 | #endif /* USE_MMAP_FOR_BUFFERS */ |
| 5034 | |
| 5035 | |
| 5036 | \f |
| 5037 | /*********************************************************************** |
| 5038 | Buffer-text Allocation |
| 5039 | ***********************************************************************/ |
| 5040 | |
| 5041 | #ifdef REL_ALLOC |
| 5042 | extern POINTER_TYPE *r_alloc P_ ((POINTER_TYPE **, size_t)); |
| 5043 | extern POINTER_TYPE *r_re_alloc P_ ((POINTER_TYPE **, size_t)); |
| 5044 | extern void r_alloc_free P_ ((POINTER_TYPE **ptr)); |
| 5045 | #endif /* REL_ALLOC */ |
| 5046 | |
| 5047 | |
| 5048 | /* Allocate NBYTES bytes for buffer B's text buffer. */ |
| 5049 | |
| 5050 | static void |
| 5051 | alloc_buffer_text (b, nbytes) |
| 5052 | struct buffer *b; |
| 5053 | size_t nbytes; |
| 5054 | { |
| 5055 | POINTER_TYPE *p; |
| 5056 | |
| 5057 | BLOCK_INPUT; |
| 5058 | #if defined USE_MMAP_FOR_BUFFERS |
| 5059 | p = mmap_alloc ((POINTER_TYPE **) &b->text->beg, nbytes); |
| 5060 | #elif defined REL_ALLOC |
| 5061 | p = r_alloc ((POINTER_TYPE **) &b->text->beg, nbytes); |
| 5062 | #else |
| 5063 | p = xmalloc (nbytes); |
| 5064 | #endif |
| 5065 | |
| 5066 | if (p == NULL) |
| 5067 | { |
| 5068 | UNBLOCK_INPUT; |
| 5069 | memory_full (); |
| 5070 | } |
| 5071 | |
| 5072 | b->text->beg = (unsigned char *) p; |
| 5073 | UNBLOCK_INPUT; |
| 5074 | } |
| 5075 | |
| 5076 | /* Enlarge buffer B's text buffer by DELTA bytes. DELTA < 0 means |
| 5077 | shrink it. */ |
| 5078 | |
| 5079 | void |
| 5080 | enlarge_buffer_text (struct buffer *b, EMACS_INT delta) |
| 5081 | { |
| 5082 | POINTER_TYPE *p; |
| 5083 | size_t nbytes = (BUF_Z_BYTE (b) - BUF_BEG_BYTE (b) + BUF_GAP_SIZE (b) + 1 |
| 5084 | + delta); |
| 5085 | BLOCK_INPUT; |
| 5086 | #if defined USE_MMAP_FOR_BUFFERS |
| 5087 | p = mmap_realloc ((POINTER_TYPE **) &b->text->beg, nbytes); |
| 5088 | #elif defined REL_ALLOC |
| 5089 | p = r_re_alloc ((POINTER_TYPE **) &b->text->beg, nbytes); |
| 5090 | #else |
| 5091 | p = xrealloc (b->text->beg, nbytes); |
| 5092 | #endif |
| 5093 | |
| 5094 | if (p == NULL) |
| 5095 | { |
| 5096 | UNBLOCK_INPUT; |
| 5097 | memory_full (); |
| 5098 | } |
| 5099 | |
| 5100 | BUF_BEG_ADDR (b) = (unsigned char *) p; |
| 5101 | UNBLOCK_INPUT; |
| 5102 | } |
| 5103 | |
| 5104 | |
| 5105 | /* Free buffer B's text buffer. */ |
| 5106 | |
| 5107 | static void |
| 5108 | free_buffer_text (b) |
| 5109 | struct buffer *b; |
| 5110 | { |
| 5111 | BLOCK_INPUT; |
| 5112 | |
| 5113 | #if defined USE_MMAP_FOR_BUFFERS |
| 5114 | mmap_free ((POINTER_TYPE **) &b->text->beg); |
| 5115 | #elif defined REL_ALLOC |
| 5116 | r_alloc_free ((POINTER_TYPE **) &b->text->beg); |
| 5117 | #else |
| 5118 | xfree (b->text->beg); |
| 5119 | #endif |
| 5120 | |
| 5121 | BUF_BEG_ADDR (b) = NULL; |
| 5122 | UNBLOCK_INPUT; |
| 5123 | } |
| 5124 | |
| 5125 | |
| 5126 | \f |
| 5127 | /*********************************************************************** |
| 5128 | Initialization |
| 5129 | ***********************************************************************/ |
| 5130 | |
| 5131 | void |
| 5132 | init_buffer_once () |
| 5133 | { |
| 5134 | int idx; |
| 5135 | |
| 5136 | bzero (buffer_permanent_local_flags, sizeof buffer_permanent_local_flags); |
| 5137 | |
| 5138 | /* Make sure all markable slots in buffer_defaults |
| 5139 | are initialized reasonably, so mark_buffer won't choke. */ |
| 5140 | reset_buffer (&buffer_defaults); |
| 5141 | reset_buffer_local_variables (&buffer_defaults, 1); |
| 5142 | reset_buffer (&buffer_local_symbols); |
| 5143 | reset_buffer_local_variables (&buffer_local_symbols, 1); |
| 5144 | /* Prevent GC from getting confused. */ |
| 5145 | buffer_defaults.text = &buffer_defaults.own_text; |
| 5146 | buffer_local_symbols.text = &buffer_local_symbols.own_text; |
| 5147 | BUF_INTERVALS (&buffer_defaults) = 0; |
| 5148 | BUF_INTERVALS (&buffer_local_symbols) = 0; |
| 5149 | XSETPVECTYPE (&buffer_defaults, PVEC_BUFFER); |
| 5150 | XSETBUFFER (Vbuffer_defaults, &buffer_defaults); |
| 5151 | XSETPVECTYPE (&buffer_local_symbols, PVEC_BUFFER); |
| 5152 | XSETBUFFER (Vbuffer_local_symbols, &buffer_local_symbols); |
| 5153 | |
| 5154 | /* Set up the default values of various buffer slots. */ |
| 5155 | /* Must do these before making the first buffer! */ |
| 5156 | |
| 5157 | /* real setup is done in bindings.el */ |
| 5158 | buffer_defaults.mode_line_format = build_string ("%-"); |
| 5159 | buffer_defaults.header_line_format = Qnil; |
| 5160 | buffer_defaults.abbrev_mode = Qnil; |
| 5161 | buffer_defaults.overwrite_mode = Qnil; |
| 5162 | buffer_defaults.case_fold_search = Qt; |
| 5163 | buffer_defaults.auto_fill_function = Qnil; |
| 5164 | buffer_defaults.selective_display = Qnil; |
| 5165 | #ifndef old |
| 5166 | buffer_defaults.selective_display_ellipses = Qt; |
| 5167 | #endif |
| 5168 | buffer_defaults.abbrev_table = Qnil; |
| 5169 | buffer_defaults.display_table = Qnil; |
| 5170 | buffer_defaults.undo_list = Qnil; |
| 5171 | buffer_defaults.mark_active = Qnil; |
| 5172 | buffer_defaults.file_format = Qnil; |
| 5173 | buffer_defaults.auto_save_file_format = Qt; |
| 5174 | buffer_defaults.overlays_before = NULL; |
| 5175 | buffer_defaults.overlays_after = NULL; |
| 5176 | buffer_defaults.overlay_center = BEG; |
| 5177 | |
| 5178 | XSETFASTINT (buffer_defaults.tab_width, 8); |
| 5179 | buffer_defaults.truncate_lines = Qnil; |
| 5180 | buffer_defaults.word_wrap = Qnil; |
| 5181 | buffer_defaults.ctl_arrow = Qt; |
| 5182 | buffer_defaults.direction_reversed = Qnil; |
| 5183 | buffer_defaults.cursor_type = Qt; |
| 5184 | buffer_defaults.extra_line_spacing = Qnil; |
| 5185 | buffer_defaults.cursor_in_non_selected_windows = Qt; |
| 5186 | |
| 5187 | #ifdef DOS_NT |
| 5188 | buffer_defaults.buffer_file_type = Qnil; /* TEXT */ |
| 5189 | #endif |
| 5190 | buffer_defaults.enable_multibyte_characters = Qt; |
| 5191 | buffer_defaults.buffer_file_coding_system = Qnil; |
| 5192 | XSETFASTINT (buffer_defaults.fill_column, 70); |
| 5193 | XSETFASTINT (buffer_defaults.left_margin, 0); |
| 5194 | buffer_defaults.cache_long_line_scans = Qnil; |
| 5195 | buffer_defaults.file_truename = Qnil; |
| 5196 | XSETFASTINT (buffer_defaults.display_count, 0); |
| 5197 | XSETFASTINT (buffer_defaults.left_margin_cols, 0); |
| 5198 | XSETFASTINT (buffer_defaults.right_margin_cols, 0); |
| 5199 | buffer_defaults.left_fringe_width = Qnil; |
| 5200 | buffer_defaults.right_fringe_width = Qnil; |
| 5201 | buffer_defaults.fringes_outside_margins = Qnil; |
| 5202 | buffer_defaults.scroll_bar_width = Qnil; |
| 5203 | buffer_defaults.vertical_scroll_bar_type = Qt; |
| 5204 | buffer_defaults.indicate_empty_lines = Qnil; |
| 5205 | buffer_defaults.indicate_buffer_boundaries = Qnil; |
| 5206 | buffer_defaults.fringe_indicator_alist = Qnil; |
| 5207 | buffer_defaults.fringe_cursor_alist = Qnil; |
| 5208 | buffer_defaults.scroll_up_aggressively = Qnil; |
| 5209 | buffer_defaults.scroll_down_aggressively = Qnil; |
| 5210 | buffer_defaults.display_time = Qnil; |
| 5211 | |
| 5212 | /* Assign the local-flags to the slots that have default values. |
| 5213 | The local flag is a bit that is used in the buffer |
| 5214 | to say that it has its own local value for the slot. |
| 5215 | The local flag bits are in the local_var_flags slot of the buffer. */ |
| 5216 | |
| 5217 | /* Nothing can work if this isn't true */ |
| 5218 | if (sizeof (EMACS_INT) != sizeof (Lisp_Object)) abort (); |
| 5219 | |
| 5220 | /* 0 means not a lisp var, -1 means always local, else mask */ |
| 5221 | bzero (&buffer_local_flags, sizeof buffer_local_flags); |
| 5222 | XSETINT (buffer_local_flags.filename, -1); |
| 5223 | XSETINT (buffer_local_flags.directory, -1); |
| 5224 | XSETINT (buffer_local_flags.backed_up, -1); |
| 5225 | XSETINT (buffer_local_flags.save_length, -1); |
| 5226 | XSETINT (buffer_local_flags.auto_save_file_name, -1); |
| 5227 | XSETINT (buffer_local_flags.read_only, -1); |
| 5228 | XSETINT (buffer_local_flags.major_mode, -1); |
| 5229 | XSETINT (buffer_local_flags.mode_name, -1); |
| 5230 | XSETINT (buffer_local_flags.undo_list, -1); |
| 5231 | XSETINT (buffer_local_flags.mark_active, -1); |
| 5232 | XSETINT (buffer_local_flags.point_before_scroll, -1); |
| 5233 | XSETINT (buffer_local_flags.file_truename, -1); |
| 5234 | XSETINT (buffer_local_flags.invisibility_spec, -1); |
| 5235 | XSETINT (buffer_local_flags.file_format, -1); |
| 5236 | XSETINT (buffer_local_flags.auto_save_file_format, -1); |
| 5237 | XSETINT (buffer_local_flags.display_count, -1); |
| 5238 | XSETINT (buffer_local_flags.display_time, -1); |
| 5239 | XSETINT (buffer_local_flags.enable_multibyte_characters, -1); |
| 5240 | |
| 5241 | idx = 1; |
| 5242 | XSETFASTINT (buffer_local_flags.mode_line_format, idx); ++idx; |
| 5243 | XSETFASTINT (buffer_local_flags.abbrev_mode, idx); ++idx; |
| 5244 | XSETFASTINT (buffer_local_flags.overwrite_mode, idx); ++idx; |
| 5245 | XSETFASTINT (buffer_local_flags.case_fold_search, idx); ++idx; |
| 5246 | XSETFASTINT (buffer_local_flags.auto_fill_function, idx); ++idx; |
| 5247 | XSETFASTINT (buffer_local_flags.selective_display, idx); ++idx; |
| 5248 | #ifndef old |
| 5249 | XSETFASTINT (buffer_local_flags.selective_display_ellipses, idx); ++idx; |
| 5250 | #endif |
| 5251 | XSETFASTINT (buffer_local_flags.tab_width, idx); ++idx; |
| 5252 | XSETFASTINT (buffer_local_flags.truncate_lines, idx); ++idx; |
| 5253 | XSETFASTINT (buffer_local_flags.word_wrap, idx); ++idx; |
| 5254 | XSETFASTINT (buffer_local_flags.ctl_arrow, idx); ++idx; |
| 5255 | XSETFASTINT (buffer_local_flags.fill_column, idx); ++idx; |
| 5256 | XSETFASTINT (buffer_local_flags.left_margin, idx); ++idx; |
| 5257 | XSETFASTINT (buffer_local_flags.abbrev_table, idx); ++idx; |
| 5258 | XSETFASTINT (buffer_local_flags.display_table, idx); ++idx; |
| 5259 | #ifdef DOS_NT |
| 5260 | XSETFASTINT (buffer_local_flags.buffer_file_type, idx); |
| 5261 | /* Make this one a permanent local. */ |
| 5262 | buffer_permanent_local_flags[idx++] = 1; |
| 5263 | #endif |
| 5264 | XSETFASTINT (buffer_local_flags.syntax_table, idx); ++idx; |
| 5265 | XSETFASTINT (buffer_local_flags.cache_long_line_scans, idx); ++idx; |
| 5266 | XSETFASTINT (buffer_local_flags.category_table, idx); ++idx; |
| 5267 | XSETFASTINT (buffer_local_flags.direction_reversed, idx); ++idx; |
| 5268 | XSETFASTINT (buffer_local_flags.buffer_file_coding_system, idx); |
| 5269 | /* Make this one a permanent local. */ |
| 5270 | buffer_permanent_local_flags[idx++] = 1; |
| 5271 | XSETFASTINT (buffer_local_flags.left_margin_cols, idx); ++idx; |
| 5272 | XSETFASTINT (buffer_local_flags.right_margin_cols, idx); ++idx; |
| 5273 | XSETFASTINT (buffer_local_flags.left_fringe_width, idx); ++idx; |
| 5274 | XSETFASTINT (buffer_local_flags.right_fringe_width, idx); ++idx; |
| 5275 | XSETFASTINT (buffer_local_flags.fringes_outside_margins, idx); ++idx; |
| 5276 | XSETFASTINT (buffer_local_flags.scroll_bar_width, idx); ++idx; |
| 5277 | XSETFASTINT (buffer_local_flags.vertical_scroll_bar_type, idx); ++idx; |
| 5278 | XSETFASTINT (buffer_local_flags.indicate_empty_lines, idx); ++idx; |
| 5279 | XSETFASTINT (buffer_local_flags.indicate_buffer_boundaries, idx); ++idx; |
| 5280 | XSETFASTINT (buffer_local_flags.fringe_indicator_alist, idx); ++idx; |
| 5281 | XSETFASTINT (buffer_local_flags.fringe_cursor_alist, idx); ++idx; |
| 5282 | XSETFASTINT (buffer_local_flags.scroll_up_aggressively, idx); ++idx; |
| 5283 | XSETFASTINT (buffer_local_flags.scroll_down_aggressively, idx); ++idx; |
| 5284 | XSETFASTINT (buffer_local_flags.header_line_format, idx); ++idx; |
| 5285 | XSETFASTINT (buffer_local_flags.cursor_type, idx); ++idx; |
| 5286 | XSETFASTINT (buffer_local_flags.extra_line_spacing, idx); ++idx; |
| 5287 | XSETFASTINT (buffer_local_flags.cursor_in_non_selected_windows, idx); ++idx; |
| 5288 | |
| 5289 | /* Need more room? */ |
| 5290 | if (idx >= MAX_PER_BUFFER_VARS) |
| 5291 | abort (); |
| 5292 | last_per_buffer_idx = idx; |
| 5293 | |
| 5294 | Vbuffer_alist = Qnil; |
| 5295 | current_buffer = 0; |
| 5296 | all_buffers = 0; |
| 5297 | |
| 5298 | QSFundamental = build_string ("Fundamental"); |
| 5299 | |
| 5300 | Qfundamental_mode = intern ("fundamental-mode"); |
| 5301 | buffer_defaults.major_mode = Qfundamental_mode; |
| 5302 | |
| 5303 | Qmode_class = intern ("mode-class"); |
| 5304 | |
| 5305 | Qprotected_field = intern ("protected-field"); |
| 5306 | |
| 5307 | Qpermanent_local = intern ("permanent-local"); |
| 5308 | |
| 5309 | Qkill_buffer_hook = intern ("kill-buffer-hook"); |
| 5310 | Fput (Qkill_buffer_hook, Qpermanent_local, Qt); |
| 5311 | |
| 5312 | Qucs_set_table_for_input = intern ("ucs-set-table-for-input"); |
| 5313 | |
| 5314 | /* super-magic invisible buffer */ |
| 5315 | Vprin1_to_string_buffer = Fget_buffer_create (build_string (" prin1")); |
| 5316 | Vbuffer_alist = Qnil; |
| 5317 | |
| 5318 | Fset_buffer (Fget_buffer_create (build_string ("*scratch*"))); |
| 5319 | |
| 5320 | inhibit_modification_hooks = 0; |
| 5321 | } |
| 5322 | |
| 5323 | void |
| 5324 | init_buffer () |
| 5325 | { |
| 5326 | char *pwd; |
| 5327 | Lisp_Object temp; |
| 5328 | int len; |
| 5329 | |
| 5330 | #ifdef USE_MMAP_FOR_BUFFERS |
| 5331 | { |
| 5332 | /* When using the ralloc implementation based on mmap(2), buffer |
| 5333 | text pointers will have been set to null in the dumped Emacs. |
| 5334 | Map new memory. */ |
| 5335 | struct buffer *b; |
| 5336 | |
| 5337 | for (b = all_buffers; b; b = b->next) |
| 5338 | if (b->text->beg == NULL) |
| 5339 | enlarge_buffer_text (b, 0); |
| 5340 | } |
| 5341 | #endif /* USE_MMAP_FOR_BUFFERS */ |
| 5342 | |
| 5343 | Fset_buffer (Fget_buffer_create (build_string ("*scratch*"))); |
| 5344 | if (NILP (buffer_defaults.enable_multibyte_characters)) |
| 5345 | Fset_buffer_multibyte (Qnil); |
| 5346 | |
| 5347 | pwd = get_current_dir_name (); |
| 5348 | |
| 5349 | if (!pwd) |
| 5350 | fatal ("`get_current_dir_name' failed: %s\n", strerror (errno)); |
| 5351 | |
| 5352 | /* Maybe this should really use some standard subroutine |
| 5353 | whose definition is filename syntax dependent. */ |
| 5354 | len = strlen (pwd); |
| 5355 | if (!(IS_DIRECTORY_SEP (pwd[len - 1]))) |
| 5356 | { |
| 5357 | /* Grow buffer to add directory separator and '\0'. */ |
| 5358 | pwd = (char *) realloc (pwd, len + 2); |
| 5359 | if (!pwd) |
| 5360 | fatal ("`get_current_dir_name' failed: %s\n", strerror (errno)); |
| 5361 | pwd[len] = DIRECTORY_SEP; |
| 5362 | pwd[len + 1] = '\0'; |
| 5363 | } |
| 5364 | |
| 5365 | current_buffer->directory = make_unibyte_string (pwd, strlen (pwd)); |
| 5366 | if (! NILP (buffer_defaults.enable_multibyte_characters)) |
| 5367 | /* At this moment, we still don't know how to decode the |
| 5368 | directory name. So, we keep the bytes in multibyte form so |
| 5369 | that ENCODE_FILE correctly gets the original bytes. */ |
| 5370 | current_buffer->directory |
| 5371 | = string_to_multibyte (current_buffer->directory); |
| 5372 | |
| 5373 | /* Add /: to the front of the name |
| 5374 | if it would otherwise be treated as magic. */ |
| 5375 | temp = Ffind_file_name_handler (current_buffer->directory, Qt); |
| 5376 | if (! NILP (temp) |
| 5377 | /* If the default dir is just /, TEMP is non-nil |
| 5378 | because of the ange-ftp completion handler. |
| 5379 | However, it is not necessary to turn / into /:/. |
| 5380 | So avoid doing that. */ |
| 5381 | && strcmp ("/", SDATA (current_buffer->directory))) |
| 5382 | current_buffer->directory |
| 5383 | = concat2 (build_string ("/:"), current_buffer->directory); |
| 5384 | |
| 5385 | temp = get_minibuffer (0); |
| 5386 | XBUFFER (temp)->directory = current_buffer->directory; |
| 5387 | |
| 5388 | free (pwd); |
| 5389 | } |
| 5390 | |
| 5391 | /* Similar to defvar_lisp but define a variable whose value is the Lisp |
| 5392 | Object stored in the current buffer. address is the address of the slot |
| 5393 | in the buffer that is current now. */ |
| 5394 | |
| 5395 | /* TYPE is nil for a general Lisp variable. |
| 5396 | An integer specifies a type; then only LIsp values |
| 5397 | with that type code are allowed (except that nil is allowed too). |
| 5398 | LNAME is the LIsp-level variable name. |
| 5399 | VNAME is the name of the buffer slot. |
| 5400 | DOC is a dummy where you write the doc string as a comment. */ |
| 5401 | #define DEFVAR_PER_BUFFER(lname, vname, type, doc) \ |
| 5402 | defvar_per_buffer (lname, vname, type, 0) |
| 5403 | |
| 5404 | static void |
| 5405 | defvar_per_buffer (namestring, address, type, doc) |
| 5406 | char *namestring; |
| 5407 | Lisp_Object *address; |
| 5408 | Lisp_Object type; |
| 5409 | char *doc; |
| 5410 | { |
| 5411 | Lisp_Object sym, val; |
| 5412 | int offset; |
| 5413 | |
| 5414 | sym = intern (namestring); |
| 5415 | val = allocate_misc (); |
| 5416 | offset = (char *)address - (char *)current_buffer; |
| 5417 | |
| 5418 | XMISCTYPE (val) = Lisp_Misc_Buffer_Objfwd; |
| 5419 | XBUFFER_OBJFWD (val)->offset = offset; |
| 5420 | XBUFFER_OBJFWD (val)->slottype = type; |
| 5421 | SET_SYMBOL_VALUE (sym, val); |
| 5422 | PER_BUFFER_SYMBOL (offset) = sym; |
| 5423 | |
| 5424 | if (PER_BUFFER_IDX (offset) == 0) |
| 5425 | /* Did a DEFVAR_PER_BUFFER without initializing the corresponding |
| 5426 | slot of buffer_local_flags */ |
| 5427 | abort (); |
| 5428 | } |
| 5429 | |
| 5430 | |
| 5431 | /* initialize the buffer routines */ |
| 5432 | void |
| 5433 | syms_of_buffer () |
| 5434 | { |
| 5435 | staticpro (&last_overlay_modification_hooks); |
| 5436 | last_overlay_modification_hooks |
| 5437 | = Fmake_vector (make_number (10), Qnil); |
| 5438 | |
| 5439 | staticpro (&Vbuffer_defaults); |
| 5440 | staticpro (&Vbuffer_local_symbols); |
| 5441 | staticpro (&Qfundamental_mode); |
| 5442 | staticpro (&Qmode_class); |
| 5443 | staticpro (&QSFundamental); |
| 5444 | staticpro (&Vbuffer_alist); |
| 5445 | staticpro (&Qprotected_field); |
| 5446 | staticpro (&Qpermanent_local); |
| 5447 | Qpermanent_local_hook = intern ("permanent-local-hook"); |
| 5448 | staticpro (&Qpermanent_local_hook); |
| 5449 | staticpro (&Qkill_buffer_hook); |
| 5450 | Qoverlayp = intern ("overlayp"); |
| 5451 | staticpro (&Qoverlayp); |
| 5452 | Qevaporate = intern ("evaporate"); |
| 5453 | staticpro (&Qevaporate); |
| 5454 | Qmodification_hooks = intern ("modification-hooks"); |
| 5455 | staticpro (&Qmodification_hooks); |
| 5456 | Qinsert_in_front_hooks = intern ("insert-in-front-hooks"); |
| 5457 | staticpro (&Qinsert_in_front_hooks); |
| 5458 | Qinsert_behind_hooks = intern ("insert-behind-hooks"); |
| 5459 | staticpro (&Qinsert_behind_hooks); |
| 5460 | Qget_file_buffer = intern ("get-file-buffer"); |
| 5461 | staticpro (&Qget_file_buffer); |
| 5462 | Qpriority = intern ("priority"); |
| 5463 | staticpro (&Qpriority); |
| 5464 | Qwindow = intern ("window"); |
| 5465 | staticpro (&Qwindow); |
| 5466 | Qbefore_string = intern ("before-string"); |
| 5467 | staticpro (&Qbefore_string); |
| 5468 | Qafter_string = intern ("after-string"); |
| 5469 | staticpro (&Qafter_string); |
| 5470 | Qfirst_change_hook = intern ("first-change-hook"); |
| 5471 | staticpro (&Qfirst_change_hook); |
| 5472 | Qbefore_change_functions = intern ("before-change-functions"); |
| 5473 | staticpro (&Qbefore_change_functions); |
| 5474 | Qafter_change_functions = intern ("after-change-functions"); |
| 5475 | staticpro (&Qafter_change_functions); |
| 5476 | /* The next one is initialized in init_buffer_once. */ |
| 5477 | staticpro (&Qucs_set_table_for_input); |
| 5478 | |
| 5479 | Qkill_buffer_query_functions = intern ("kill-buffer-query-functions"); |
| 5480 | staticpro (&Qkill_buffer_query_functions); |
| 5481 | |
| 5482 | Fput (Qprotected_field, Qerror_conditions, |
| 5483 | Fcons (Qprotected_field, Fcons (Qerror, Qnil))); |
| 5484 | Fput (Qprotected_field, Qerror_message, |
| 5485 | build_string ("Attempt to modify a protected field")); |
| 5486 | |
| 5487 | /* All these use DEFVAR_LISP_NOPRO because the slots in |
| 5488 | buffer_defaults will all be marked via Vbuffer_defaults. */ |
| 5489 | |
| 5490 | DEFVAR_LISP_NOPRO ("default-mode-line-format", |
| 5491 | &buffer_defaults.mode_line_format, |
| 5492 | doc: /* Default value of `mode-line-format' for buffers that don't override it. |
| 5493 | This is the same as (default-value 'mode-line-format). */); |
| 5494 | |
| 5495 | DEFVAR_LISP_NOPRO ("default-header-line-format", |
| 5496 | &buffer_defaults.header_line_format, |
| 5497 | doc: /* Default value of `header-line-format' for buffers that don't override it. |
| 5498 | This is the same as (default-value 'header-line-format). */); |
| 5499 | |
| 5500 | DEFVAR_LISP_NOPRO ("default-cursor-type", &buffer_defaults.cursor_type, |
| 5501 | doc: /* Default value of `cursor-type' for buffers that don't override it. |
| 5502 | This is the same as (default-value 'cursor-type). */); |
| 5503 | |
| 5504 | DEFVAR_LISP_NOPRO ("default-line-spacing", |
| 5505 | &buffer_defaults.extra_line_spacing, |
| 5506 | doc: /* Default value of `line-spacing' for buffers that don't override it. |
| 5507 | This is the same as (default-value 'line-spacing). */); |
| 5508 | |
| 5509 | DEFVAR_LISP_NOPRO ("default-cursor-in-non-selected-windows", |
| 5510 | &buffer_defaults.cursor_in_non_selected_windows, |
| 5511 | doc: /* Default value of `cursor-in-non-selected-windows'. |
| 5512 | This is the same as (default-value 'cursor-in-non-selected-windows). */); |
| 5513 | |
| 5514 | DEFVAR_LISP_NOPRO ("default-abbrev-mode", |
| 5515 | &buffer_defaults.abbrev_mode, |
| 5516 | doc: /* Default value of `abbrev-mode' for buffers that do not override it. |
| 5517 | This is the same as (default-value 'abbrev-mode). */); |
| 5518 | |
| 5519 | DEFVAR_LISP_NOPRO ("default-ctl-arrow", |
| 5520 | &buffer_defaults.ctl_arrow, |
| 5521 | doc: /* Default value of `ctl-arrow' for buffers that do not override it. |
| 5522 | This is the same as (default-value 'ctl-arrow). */); |
| 5523 | |
| 5524 | DEFVAR_LISP_NOPRO ("default-direction-reversed", |
| 5525 | &buffer_defaults.direction_reversed, |
| 5526 | doc: /* Default value of `direction-reversed' for buffers that do not override it. |
| 5527 | This is the same as (default-value 'direction-reversed). */); |
| 5528 | |
| 5529 | DEFVAR_LISP_NOPRO ("default-enable-multibyte-characters", |
| 5530 | &buffer_defaults.enable_multibyte_characters, |
| 5531 | doc: /* *Default value of `enable-multibyte-characters' for buffers not overriding it. |
| 5532 | This is the same as (default-value 'enable-multibyte-characters). */); |
| 5533 | |
| 5534 | DEFVAR_LISP_NOPRO ("default-buffer-file-coding-system", |
| 5535 | &buffer_defaults.buffer_file_coding_system, |
| 5536 | doc: /* Default value of `buffer-file-coding-system' for buffers not overriding it. |
| 5537 | This is the same as (default-value 'buffer-file-coding-system). */); |
| 5538 | |
| 5539 | DEFVAR_LISP_NOPRO ("default-truncate-lines", |
| 5540 | &buffer_defaults.truncate_lines, |
| 5541 | doc: /* Default value of `truncate-lines' for buffers that do not override it. |
| 5542 | This is the same as (default-value 'truncate-lines). */); |
| 5543 | |
| 5544 | DEFVAR_LISP_NOPRO ("default-fill-column", |
| 5545 | &buffer_defaults.fill_column, |
| 5546 | doc: /* Default value of `fill-column' for buffers that do not override it. |
| 5547 | This is the same as (default-value 'fill-column). */); |
| 5548 | |
| 5549 | DEFVAR_LISP_NOPRO ("default-left-margin", |
| 5550 | &buffer_defaults.left_margin, |
| 5551 | doc: /* Default value of `left-margin' for buffers that do not override it. |
| 5552 | This is the same as (default-value 'left-margin). */); |
| 5553 | |
| 5554 | DEFVAR_LISP_NOPRO ("default-tab-width", |
| 5555 | &buffer_defaults.tab_width, |
| 5556 | doc: /* Default value of `tab-width' for buffers that do not override it. |
| 5557 | This is the same as (default-value 'tab-width). */); |
| 5558 | |
| 5559 | DEFVAR_LISP_NOPRO ("default-case-fold-search", |
| 5560 | &buffer_defaults.case_fold_search, |
| 5561 | doc: /* Default value of `case-fold-search' for buffers that don't override it. |
| 5562 | This is the same as (default-value 'case-fold-search). */); |
| 5563 | |
| 5564 | #ifdef DOS_NT |
| 5565 | DEFVAR_LISP_NOPRO ("default-buffer-file-type", |
| 5566 | &buffer_defaults.buffer_file_type, |
| 5567 | doc: /* Default file type for buffers that do not override it. |
| 5568 | This is the same as (default-value 'buffer-file-type). |
| 5569 | The file type is nil for text, t for binary. */); |
| 5570 | #endif |
| 5571 | |
| 5572 | DEFVAR_LISP_NOPRO ("default-left-margin-width", |
| 5573 | &buffer_defaults.left_margin_cols, |
| 5574 | doc: /* Default value of `left-margin-width' for buffers that don't override it. |
| 5575 | This is the same as (default-value 'left-margin-width). */); |
| 5576 | |
| 5577 | DEFVAR_LISP_NOPRO ("default-right-margin-width", |
| 5578 | &buffer_defaults.right_margin_cols, |
| 5579 | doc: /* Default value of `right-margin-width' for buffers that don't override it. |
| 5580 | This is the same as (default-value 'right-margin-width). */); |
| 5581 | |
| 5582 | DEFVAR_LISP_NOPRO ("default-left-fringe-width", |
| 5583 | &buffer_defaults.left_fringe_width, |
| 5584 | doc: /* Default value of `left-fringe-width' for buffers that don't override it. |
| 5585 | This is the same as (default-value 'left-fringe-width). */); |
| 5586 | |
| 5587 | DEFVAR_LISP_NOPRO ("default-right-fringe-width", |
| 5588 | &buffer_defaults.right_fringe_width, |
| 5589 | doc: /* Default value of `right-fringe-width' for buffers that don't override it. |
| 5590 | This is the same as (default-value 'right-fringe-width). */); |
| 5591 | |
| 5592 | DEFVAR_LISP_NOPRO ("default-fringes-outside-margins", |
| 5593 | &buffer_defaults.fringes_outside_margins, |
| 5594 | doc: /* Default value of `fringes-outside-margins' for buffers that don't override it. |
| 5595 | This is the same as (default-value 'fringes-outside-margins). */); |
| 5596 | |
| 5597 | DEFVAR_LISP_NOPRO ("default-scroll-bar-width", |
| 5598 | &buffer_defaults.scroll_bar_width, |
| 5599 | doc: /* Default value of `scroll-bar-width' for buffers that don't override it. |
| 5600 | This is the same as (default-value 'scroll-bar-width). */); |
| 5601 | |
| 5602 | DEFVAR_LISP_NOPRO ("default-vertical-scroll-bar", |
| 5603 | &buffer_defaults.vertical_scroll_bar_type, |
| 5604 | doc: /* Default value of `vertical-scroll-bar' for buffers that don't override it. |
| 5605 | This is the same as (default-value 'vertical-scroll-bar). */); |
| 5606 | |
| 5607 | DEFVAR_LISP_NOPRO ("default-indicate-empty-lines", |
| 5608 | &buffer_defaults.indicate_empty_lines, |
| 5609 | doc: /* Default value of `indicate-empty-lines' for buffers that don't override it. |
| 5610 | This is the same as (default-value 'indicate-empty-lines). */); |
| 5611 | |
| 5612 | DEFVAR_LISP_NOPRO ("default-indicate-buffer-boundaries", |
| 5613 | &buffer_defaults.indicate_buffer_boundaries, |
| 5614 | doc: /* Default value of `indicate-buffer-boundaries' for buffers that don't override it. |
| 5615 | This is the same as (default-value 'indicate-buffer-boundaries). */); |
| 5616 | |
| 5617 | DEFVAR_LISP_NOPRO ("default-fringe-indicator-alist", |
| 5618 | &buffer_defaults.fringe_indicator_alist, |
| 5619 | doc: /* Default value of `fringe-indicator-alist' for buffers that don't override it. |
| 5620 | This is the same as (default-value 'fringe-indicator-alist'). */); |
| 5621 | |
| 5622 | DEFVAR_LISP_NOPRO ("default-fringe-cursor-alist", |
| 5623 | &buffer_defaults.fringe_cursor_alist, |
| 5624 | doc: /* Default value of `fringe-cursor-alist' for buffers that don't override it. |
| 5625 | This is the same as (default-value 'fringe-cursor-alist'). */); |
| 5626 | |
| 5627 | DEFVAR_LISP_NOPRO ("default-scroll-up-aggressively", |
| 5628 | &buffer_defaults.scroll_up_aggressively, |
| 5629 | doc: /* Default value of `scroll-up-aggressively'. |
| 5630 | This value applies in buffers that don't have their own local values. |
| 5631 | This is the same as (default-value 'scroll-up-aggressively). */); |
| 5632 | |
| 5633 | DEFVAR_LISP_NOPRO ("default-scroll-down-aggressively", |
| 5634 | &buffer_defaults.scroll_down_aggressively, |
| 5635 | doc: /* Default value of `scroll-down-aggressively'. |
| 5636 | This value applies in buffers that don't have their own local values. |
| 5637 | This is the same as (default-value 'scroll-down-aggressively). */); |
| 5638 | |
| 5639 | DEFVAR_PER_BUFFER ("header-line-format", |
| 5640 | ¤t_buffer->header_line_format, |
| 5641 | Qnil, |
| 5642 | doc: /* Analogous to `mode-line-format', but controls the header line. |
| 5643 | The header line appears, optionally, at the top of a window; |
| 5644 | the mode line appears at the bottom. */); |
| 5645 | |
| 5646 | DEFVAR_PER_BUFFER ("mode-line-format", ¤t_buffer->mode_line_format, |
| 5647 | Qnil, |
| 5648 | doc: /* Template for displaying mode line for current buffer. |
| 5649 | Each buffer has its own value of this variable. |
| 5650 | Value may be nil, a string, a symbol or a list or cons cell. |
| 5651 | A value of nil means don't display a mode line. |
| 5652 | For a symbol, its value is used (but it is ignored if t or nil). |
| 5653 | A string appearing directly as the value of a symbol is processed verbatim |
| 5654 | in that the %-constructs below are not recognized. |
| 5655 | Note that unless the symbol is marked as a `risky-local-variable', all |
| 5656 | properties in any strings, as well as all :eval and :propertize forms |
| 5657 | in the value of that symbol will be ignored. |
| 5658 | For a list of the form `(:eval FORM)', FORM is evaluated and the result |
| 5659 | is used as a mode line element. Be careful--FORM should not load any files, |
| 5660 | because that can cause an infinite recursion. |
| 5661 | For a list of the form `(:propertize ELT PROPS...)', ELT is displayed |
| 5662 | with the specified properties PROPS applied. |
| 5663 | For a list whose car is a symbol, the symbol's value is taken, |
| 5664 | and if that is non-nil, the cadr of the list is processed recursively. |
| 5665 | Otherwise, the caddr of the list (if there is one) is processed. |
| 5666 | For a list whose car is a string or list, each element is processed |
| 5667 | recursively and the results are effectively concatenated. |
| 5668 | For a list whose car is an integer, the cdr of the list is processed |
| 5669 | and padded (if the number is positive) or truncated (if negative) |
| 5670 | to the width specified by that number. |
| 5671 | A string is printed verbatim in the mode line except for %-constructs: |
| 5672 | (%-constructs are allowed when the string is the entire mode-line-format |
| 5673 | or when it is found in a cons-cell or a list) |
| 5674 | %b -- print buffer name. %f -- print visited file name. |
| 5675 | %F -- print frame name. |
| 5676 | %* -- print %, * or hyphen. %+ -- print *, % or hyphen. |
| 5677 | %& is like %*, but ignore read-only-ness. |
| 5678 | % means buffer is read-only and * means it is modified. |
| 5679 | For a modified read-only buffer, %* gives % and %+ gives *. |
| 5680 | %s -- print process status. %l -- print the current line number. |
| 5681 | %c -- print the current column number (this makes editing slower). |
| 5682 | To make the column number update correctly in all cases, |
| 5683 | `column-number-mode' must be non-nil. |
| 5684 | %i -- print the size of the buffer. |
| 5685 | %I -- like %i, but use k, M, G, etc., to abbreviate. |
| 5686 | %p -- print percent of buffer above top of window, or Top, Bot or All. |
| 5687 | %P -- print percent of buffer above bottom of window, perhaps plus Top, |
| 5688 | or print Bottom or All. |
| 5689 | %n -- print Narrow if appropriate. |
| 5690 | %t -- visited file is text or binary (if OS supports this distinction). |
| 5691 | %z -- print mnemonics of keyboard, terminal, and buffer coding systems. |
| 5692 | %Z -- like %z, but including the end-of-line format. |
| 5693 | %e -- print error message about full memory. |
| 5694 | %@ -- print @ or hyphen. @ means that default-directory is on a |
| 5695 | remote machine. |
| 5696 | %[ -- print one [ for each recursive editing level. %] similar. |
| 5697 | %% -- print %. %- -- print infinitely many dashes. |
| 5698 | Decimal digits after the % specify field width to which to pad. */); |
| 5699 | |
| 5700 | DEFVAR_LISP_NOPRO ("default-major-mode", &buffer_defaults.major_mode, |
| 5701 | doc: /* *Major mode for new buffers. Defaults to `fundamental-mode'. |
| 5702 | A value of nil means use current buffer's major mode, |
| 5703 | provided it is not marked as "special". |
| 5704 | |
| 5705 | When a mode is used by default, `find-file' switches to it |
| 5706 | before it reads the contents into the buffer and before |
| 5707 | it finishes setting up the buffer. Thus, the mode and |
| 5708 | its hooks should not expect certain variables such as |
| 5709 | `buffer-read-only' and `buffer-file-coding-system' to be set up. */); |
| 5710 | |
| 5711 | DEFVAR_PER_BUFFER ("major-mode", ¤t_buffer->major_mode, |
| 5712 | make_number (Lisp_Symbol), |
| 5713 | doc: /* Symbol for current buffer's major mode. */); |
| 5714 | |
| 5715 | DEFVAR_PER_BUFFER ("mode-name", ¤t_buffer->mode_name, |
| 5716 | Qnil, |
| 5717 | doc: /* Pretty name of current buffer's major mode. |
| 5718 | Usually a string, but can use any of the constructs for `mode-line-format', |
| 5719 | which see. |
| 5720 | Format with `format-mode-line' to produce a string value. */); |
| 5721 | |
| 5722 | DEFVAR_PER_BUFFER ("local-abbrev-table", ¤t_buffer->abbrev_table, Qnil, |
| 5723 | doc: /* Local (mode-specific) abbrev table of current buffer. */); |
| 5724 | |
| 5725 | DEFVAR_PER_BUFFER ("abbrev-mode", ¤t_buffer->abbrev_mode, Qnil, |
| 5726 | doc: /* Non-nil turns on automatic expansion of abbrevs as they are inserted. */); |
| 5727 | |
| 5728 | DEFVAR_PER_BUFFER ("case-fold-search", ¤t_buffer->case_fold_search, |
| 5729 | Qnil, |
| 5730 | doc: /* *Non-nil if searches and matches should ignore case. */); |
| 5731 | |
| 5732 | DEFVAR_PER_BUFFER ("fill-column", ¤t_buffer->fill_column, |
| 5733 | make_number (Lisp_Int), |
| 5734 | doc: /* *Column beyond which automatic line-wrapping should happen. |
| 5735 | Interactively, you can set the buffer local value using \\[set-fill-column]. */); |
| 5736 | |
| 5737 | DEFVAR_PER_BUFFER ("left-margin", ¤t_buffer->left_margin, |
| 5738 | make_number (Lisp_Int), |
| 5739 | doc: /* *Column for the default `indent-line-function' to indent to. |
| 5740 | Linefeed indents to this column in Fundamental mode. */); |
| 5741 | |
| 5742 | DEFVAR_PER_BUFFER ("tab-width", ¤t_buffer->tab_width, |
| 5743 | make_number (Lisp_Int), |
| 5744 | doc: /* *Distance between tab stops (for display of tab characters), in columns. */); |
| 5745 | |
| 5746 | DEFVAR_PER_BUFFER ("ctl-arrow", ¤t_buffer->ctl_arrow, Qnil, |
| 5747 | doc: /* *Non-nil means display control chars with uparrow. |
| 5748 | A value of nil means use backslash and octal digits. |
| 5749 | This variable does not apply to characters whose display is specified |
| 5750 | in the current display table (if there is one). */); |
| 5751 | |
| 5752 | DEFVAR_PER_BUFFER ("enable-multibyte-characters", |
| 5753 | ¤t_buffer->enable_multibyte_characters, |
| 5754 | Qnil, |
| 5755 | doc: /* Non-nil means the buffer contents are regarded as multi-byte characters. |
| 5756 | Otherwise they are regarded as unibyte. This affects the display, |
| 5757 | file I/O and the behavior of various editing commands. |
| 5758 | |
| 5759 | This variable is buffer-local but you cannot set it directly; |
| 5760 | use the function `set-buffer-multibyte' to change a buffer's representation. |
| 5761 | Changing its default value with `setq-default' is supported. |
| 5762 | See also variable `default-enable-multibyte-characters' and Info node |
| 5763 | `(elisp)Text Representations'. */); |
| 5764 | XSYMBOL (intern ("enable-multibyte-characters"))->constant = 1; |
| 5765 | |
| 5766 | DEFVAR_PER_BUFFER ("buffer-file-coding-system", |
| 5767 | ¤t_buffer->buffer_file_coding_system, Qnil, |
| 5768 | doc: /* Coding system to be used for encoding the buffer contents on saving. |
| 5769 | This variable applies to saving the buffer, and also to `write-region' |
| 5770 | and other functions that use `write-region'. |
| 5771 | It does not apply to sending output to subprocesses, however. |
| 5772 | |
| 5773 | If this is nil, the buffer is saved without any code conversion |
| 5774 | unless some coding system is specified in `file-coding-system-alist' |
| 5775 | for the buffer file. |
| 5776 | |
| 5777 | If the text to be saved cannot be encoded as specified by this variable, |
| 5778 | an alternative encoding is selected by `select-safe-coding-system', which see. |
| 5779 | |
| 5780 | The variable `coding-system-for-write', if non-nil, overrides this variable. |
| 5781 | |
| 5782 | This variable is never applied to a way of decoding a file while reading it. */); |
| 5783 | |
| 5784 | DEFVAR_PER_BUFFER ("direction-reversed", ¤t_buffer->direction_reversed, |
| 5785 | Qnil, |
| 5786 | doc: /* *Non-nil means lines in the buffer are displayed right to left. */); |
| 5787 | |
| 5788 | DEFVAR_PER_BUFFER ("truncate-lines", ¤t_buffer->truncate_lines, Qnil, |
| 5789 | doc: /* *Non-nil means do not display continuation lines. |
| 5790 | Instead, give each line of text just one screen line. |
| 5791 | |
| 5792 | Note that this is overridden by the variable |
| 5793 | `truncate-partial-width-windows' if that variable is non-nil |
| 5794 | and this buffer is not full-frame width. */); |
| 5795 | |
| 5796 | DEFVAR_PER_BUFFER ("word-wrap", ¤t_buffer->word_wrap, Qnil, |
| 5797 | doc: /* *Non-nil means to use word-wrapping for continuation lines. |
| 5798 | When word-wrapping is on, continuation lines are wrapped at the space |
| 5799 | or tab character nearest to the right window edge. |
| 5800 | If nil, continuation lines are wrapped at the right screen edge. |
| 5801 | |
| 5802 | This variable has no effect if long lines are truncated (see |
| 5803 | `truncate-lines' and `truncate-partial-width-windows'). If you use |
| 5804 | word-wrapping, you might want to reduce the value of |
| 5805 | `truncate-partial-width-windows', since wrapping can make text readable |
| 5806 | in narrower windows. */); |
| 5807 | |
| 5808 | #ifdef DOS_NT |
| 5809 | DEFVAR_PER_BUFFER ("buffer-file-type", ¤t_buffer->buffer_file_type, |
| 5810 | Qnil, |
| 5811 | doc: /* Non-nil if the visited file is a binary file. |
| 5812 | This variable is meaningful on MS-DOG and Windows NT. |
| 5813 | On those systems, it is automatically local in every buffer. |
| 5814 | On other systems, this variable is normally always nil. */); |
| 5815 | #endif |
| 5816 | |
| 5817 | DEFVAR_PER_BUFFER ("default-directory", ¤t_buffer->directory, |
| 5818 | make_number (Lisp_String), |
| 5819 | doc: /* Name of default directory of current buffer. Should end with slash. |
| 5820 | To interactively change the default directory, use command `cd'. */); |
| 5821 | |
| 5822 | DEFVAR_PER_BUFFER ("auto-fill-function", ¤t_buffer->auto_fill_function, |
| 5823 | Qnil, |
| 5824 | doc: /* Function called (if non-nil) to perform auto-fill. |
| 5825 | It is called after self-inserting any character specified in |
| 5826 | the `auto-fill-chars' table. |
| 5827 | NOTE: This variable is not a hook; |
| 5828 | its value may not be a list of functions. */); |
| 5829 | |
| 5830 | DEFVAR_PER_BUFFER ("buffer-file-name", ¤t_buffer->filename, |
| 5831 | make_number (Lisp_String), |
| 5832 | doc: /* Name of file visited in current buffer, or nil if not visiting a file. */); |
| 5833 | |
| 5834 | DEFVAR_PER_BUFFER ("buffer-file-truename", ¤t_buffer->file_truename, |
| 5835 | make_number (Lisp_String), |
| 5836 | doc: /* Abbreviated truename of file visited in current buffer, or nil if none. |
| 5837 | The truename of a file is calculated by `file-truename' |
| 5838 | and then abbreviated with `abbreviate-file-name'. */); |
| 5839 | |
| 5840 | DEFVAR_PER_BUFFER ("buffer-auto-save-file-name", |
| 5841 | ¤t_buffer->auto_save_file_name, |
| 5842 | make_number (Lisp_String), |
| 5843 | doc: /* Name of file for auto-saving current buffer. |
| 5844 | If it is nil, that means don't auto-save this buffer. */); |
| 5845 | |
| 5846 | DEFVAR_PER_BUFFER ("buffer-read-only", ¤t_buffer->read_only, Qnil, |
| 5847 | doc: /* Non-nil if this buffer is read-only. */); |
| 5848 | |
| 5849 | DEFVAR_PER_BUFFER ("buffer-backed-up", ¤t_buffer->backed_up, Qnil, |
| 5850 | doc: /* Non-nil if this buffer's file has been backed up. |
| 5851 | Backing up is done before the first time the file is saved. */); |
| 5852 | |
| 5853 | DEFVAR_PER_BUFFER ("buffer-saved-size", ¤t_buffer->save_length, |
| 5854 | make_number (Lisp_Int), |
| 5855 | doc: /* Length of current buffer when last read in, saved or auto-saved. |
| 5856 | 0 initially. */); |
| 5857 | |
| 5858 | DEFVAR_PER_BUFFER ("selective-display", ¤t_buffer->selective_display, |
| 5859 | Qnil, |
| 5860 | doc: /* Non-nil enables selective display. |
| 5861 | An integer N as value means display only lines |
| 5862 | that start with less than N columns of space. |
| 5863 | A value of t means that the character ^M makes itself and |
| 5864 | all the rest of the line invisible; also, when saving the buffer |
| 5865 | in a file, save the ^M as a newline. */); |
| 5866 | |
| 5867 | #ifndef old |
| 5868 | DEFVAR_PER_BUFFER ("selective-display-ellipses", |
| 5869 | ¤t_buffer->selective_display_ellipses, |
| 5870 | Qnil, |
| 5871 | doc: /* Non-nil means display ... on previous line when a line is invisible. */); |
| 5872 | #endif |
| 5873 | |
| 5874 | DEFVAR_PER_BUFFER ("overwrite-mode", ¤t_buffer->overwrite_mode, Qnil, |
| 5875 | doc: /* Non-nil if self-insertion should replace existing text. |
| 5876 | The value should be one of `overwrite-mode-textual', |
| 5877 | `overwrite-mode-binary', or nil. |
| 5878 | If it is `overwrite-mode-textual', self-insertion still |
| 5879 | inserts at the end of a line, and inserts when point is before a tab, |
| 5880 | until the tab is filled in. |
| 5881 | If `overwrite-mode-binary', self-insertion replaces newlines and tabs too. */); |
| 5882 | |
| 5883 | DEFVAR_PER_BUFFER ("buffer-display-table", ¤t_buffer->display_table, |
| 5884 | Qnil, |
| 5885 | doc: /* Display table that controls display of the contents of current buffer. |
| 5886 | |
| 5887 | If this variable is nil, the value of `standard-display-table' is used. |
| 5888 | Each window can have its own, overriding display table, see |
| 5889 | `set-window-display-table' and `window-display-table'. |
| 5890 | |
| 5891 | The display table is a char-table created with `make-display-table'. |
| 5892 | A char-table is an array indexed by character codes. Normal array |
| 5893 | primitives `aref' and `aset' can be used to access elements of a char-table. |
| 5894 | |
| 5895 | Each of the char-table elements control how to display the corresponding |
| 5896 | text character: the element at index C in the table says how to display |
| 5897 | the character whose code is C. Each element should be a vector of |
| 5898 | characters or nil. The value nil means display the character in the |
| 5899 | default fashion; otherwise, the characters from the vector are delivered |
| 5900 | to the screen instead of the original character. |
| 5901 | |
| 5902 | For example, (aset buffer-display-table ?X [?Y]) tells Emacs |
| 5903 | to display a capital Y instead of each X character. |
| 5904 | |
| 5905 | In addition, a char-table has six extra slots to control the display of: |
| 5906 | |
| 5907 | the end of a truncated screen line (extra-slot 0, a single character); |
| 5908 | the end of a continued line (extra-slot 1, a single character); |
| 5909 | the escape character used to display character codes in octal |
| 5910 | (extra-slot 2, a single character); |
| 5911 | the character used as an arrow for control characters (extra-slot 3, |
| 5912 | a single character); |
| 5913 | the decoration indicating the presence of invisible lines (extra-slot 4, |
| 5914 | a vector of characters); |
| 5915 | the character used to draw the border between side-by-side windows |
| 5916 | (extra-slot 5, a single character). |
| 5917 | |
| 5918 | See also the functions `display-table-slot' and `set-display-table-slot'. */); |
| 5919 | |
| 5920 | DEFVAR_PER_BUFFER ("left-margin-width", ¤t_buffer->left_margin_cols, |
| 5921 | Qnil, |
| 5922 | doc: /* *Width of left marginal area for display of a buffer. |
| 5923 | A value of nil means no marginal area. */); |
| 5924 | |
| 5925 | DEFVAR_PER_BUFFER ("right-margin-width", ¤t_buffer->right_margin_cols, |
| 5926 | Qnil, |
| 5927 | doc: /* *Width of right marginal area for display of a buffer. |
| 5928 | A value of nil means no marginal area. */); |
| 5929 | |
| 5930 | DEFVAR_PER_BUFFER ("left-fringe-width", ¤t_buffer->left_fringe_width, |
| 5931 | Qnil, |
| 5932 | doc: /* *Width of this buffer's left fringe (in pixels). |
| 5933 | A value of 0 means no left fringe is shown in this buffer's window. |
| 5934 | A value of nil means to use the left fringe width from the window's frame. */); |
| 5935 | |
| 5936 | DEFVAR_PER_BUFFER ("right-fringe-width", ¤t_buffer->right_fringe_width, |
| 5937 | Qnil, |
| 5938 | doc: /* *Width of this buffer's right fringe (in pixels). |
| 5939 | A value of 0 means no right fringe is shown in this buffer's window. |
| 5940 | A value of nil means to use the right fringe width from the window's frame. */); |
| 5941 | |
| 5942 | DEFVAR_PER_BUFFER ("fringes-outside-margins", ¤t_buffer->fringes_outside_margins, |
| 5943 | Qnil, |
| 5944 | doc: /* *Non-nil means to display fringes outside display margins. |
| 5945 | A value of nil means to display fringes between margins and buffer text. */); |
| 5946 | |
| 5947 | DEFVAR_PER_BUFFER ("scroll-bar-width", ¤t_buffer->scroll_bar_width, |
| 5948 | Qnil, |
| 5949 | doc: /* *Width of this buffer's scroll bars in pixels. |
| 5950 | A value of nil means to use the scroll bar width from the window's frame. */); |
| 5951 | |
| 5952 | DEFVAR_PER_BUFFER ("vertical-scroll-bar", ¤t_buffer->vertical_scroll_bar_type, |
| 5953 | Qnil, |
| 5954 | doc: /* *Position of this buffer's vertical scroll bar. |
| 5955 | The value takes effect whenever you tell a window to display this buffer; |
| 5956 | for instance, with `set-window-buffer' or when `display-buffer' displays it. |
| 5957 | |
| 5958 | A value of `left' or `right' means put the vertical scroll bar at that side |
| 5959 | of the window; a value of nil means don't show any vertical scroll bars. |
| 5960 | A value of t (the default) means do whatever the window's frame specifies. */); |
| 5961 | |
| 5962 | DEFVAR_PER_BUFFER ("indicate-empty-lines", |
| 5963 | ¤t_buffer->indicate_empty_lines, Qnil, |
| 5964 | doc: /* *Visually indicate empty lines after the buffer end. |
| 5965 | If non-nil, a bitmap is displayed in the left fringe of a window on |
| 5966 | window-systems. */); |
| 5967 | |
| 5968 | DEFVAR_PER_BUFFER ("indicate-buffer-boundaries", |
| 5969 | ¤t_buffer->indicate_buffer_boundaries, Qnil, |
| 5970 | doc: /* *Visually indicate buffer boundaries and scrolling. |
| 5971 | If non-nil, the first and last line of the buffer are marked in the fringe |
| 5972 | of a window on window-systems with angle bitmaps, or if the window can be |
| 5973 | scrolled, the top and bottom line of the window are marked with up and down |
| 5974 | arrow bitmaps. |
| 5975 | |
| 5976 | If value is a symbol `left' or `right', both angle and arrow bitmaps |
| 5977 | are displayed in the left or right fringe, resp. Any other value |
| 5978 | that doesn't look like an alist means display the angle bitmaps in |
| 5979 | the left fringe but no arrows. |
| 5980 | |
| 5981 | You can exercise more precise control by using an alist as the |
| 5982 | value. Each alist element (INDICATOR . POSITION) specifies |
| 5983 | where to show one of the indicators. INDICATOR is one of `top', |
| 5984 | `bottom', `up', `down', or t, which specifies the default position, |
| 5985 | and POSITION is one of `left', `right', or nil, meaning do not show |
| 5986 | this indicator. |
| 5987 | |
| 5988 | For example, ((top . left) (t . right)) places the top angle bitmap in |
| 5989 | left fringe, the bottom angle bitmap in right fringe, and both arrow |
| 5990 | bitmaps in right fringe. To show just the angle bitmaps in the left |
| 5991 | fringe, but no arrow bitmaps, use ((top . left) (bottom . left)). */); |
| 5992 | |
| 5993 | DEFVAR_PER_BUFFER ("fringe-indicator-alist", |
| 5994 | ¤t_buffer->fringe_indicator_alist, Qnil, |
| 5995 | doc: /* *Mapping from logical to physical fringe indicator bitmaps. |
| 5996 | The value is an alist where each element (INDICATOR . BITMAPS) |
| 5997 | specifies the fringe bitmaps used to display a specific logical |
| 5998 | fringe indicator. |
| 5999 | |
| 6000 | INDICATOR specifies the logical indicator type which is one of the |
| 6001 | following symbols: `truncation' , `continuation', `overlay-arrow', |
| 6002 | `top', `bottom', `up', `down', `one-line', `empty-line', or `unknown'. |
| 6003 | |
| 6004 | BITMAPS is list of symbols (LEFT RIGHT [LEFT1 RIGHT1]) which specifies |
| 6005 | the actual bitmap shown in the left or right fringe for the logical |
| 6006 | indicator. LEFT and RIGHT are the bitmaps shown in the left and/or |
| 6007 | right fringe for the specific indicator. The LEFT1 or RIGHT1 bitmaps |
| 6008 | are used only for the `bottom' and `one-line' indicators when the last |
| 6009 | \(only) line in has no final newline. BITMAPS may also be a single |
| 6010 | symbol which is used in both left and right fringes. */); |
| 6011 | |
| 6012 | DEFVAR_PER_BUFFER ("fringe-cursor-alist", |
| 6013 | ¤t_buffer->fringe_cursor_alist, Qnil, |
| 6014 | doc: /* *Mapping from logical to physical fringe cursor bitmaps. |
| 6015 | The value is an alist where each element (CURSOR . BITMAP) |
| 6016 | specifies the fringe bitmaps used to display a specific logical |
| 6017 | cursor type in the fringe. |
| 6018 | |
| 6019 | CURSOR specifies the logical cursor type which is one of the following |
| 6020 | symbols: `box' , `hollow', `bar', `hbar', or `hollow-small'. The last |
| 6021 | one is used to show a hollow cursor on narrow lines display lines |
| 6022 | where the normal hollow cursor will not fit. |
| 6023 | |
| 6024 | BITMAP is the corresponding fringe bitmap shown for the logical |
| 6025 | cursor type. */); |
| 6026 | |
| 6027 | DEFVAR_PER_BUFFER ("scroll-up-aggressively", |
| 6028 | ¤t_buffer->scroll_up_aggressively, Qnil, |
| 6029 | doc: /* How far to scroll windows upward. |
| 6030 | If you move point off the bottom, the window scrolls automatically. |
| 6031 | This variable controls how far it scrolls. The value nil, the default, |
| 6032 | means scroll to center point. A fraction means scroll to put point |
| 6033 | that fraction of the window's height from the bottom of the window. |
| 6034 | When the value is 0.0, point goes at the bottom line, which in the |
| 6035 | simple case that you moved off with C-f means scrolling just one line. |
| 6036 | 1.0 means point goes at the top, so that in that simple case, the |
| 6037 | window scrolls by a full window height. Meaningful values are |
| 6038 | between 0.0 and 1.0, inclusive. */); |
| 6039 | |
| 6040 | DEFVAR_PER_BUFFER ("scroll-down-aggressively", |
| 6041 | ¤t_buffer->scroll_down_aggressively, Qnil, |
| 6042 | doc: /* How far to scroll windows downward. |
| 6043 | If you move point off the top, the window scrolls automatically. |
| 6044 | This variable controls how far it scrolls. The value nil, the default, |
| 6045 | means scroll to center point. A fraction means scroll to put point |
| 6046 | that fraction of the window's height from the top of the window. |
| 6047 | When the value is 0.0, point goes at the top line, which in the |
| 6048 | simple case that you moved off with C-b means scrolling just one line. |
| 6049 | 1.0 means point goes at the bottom, so that in that simple case, the |
| 6050 | window scrolls by a full window height. Meaningful values are |
| 6051 | between 0.0 and 1.0, inclusive. */); |
| 6052 | |
| 6053 | /*DEFVAR_LISP ("debug-check-symbol", &Vcheck_symbol, |
| 6054 | "Don't ask."); |
| 6055 | */ |
| 6056 | |
| 6057 | DEFVAR_LISP ("before-change-functions", &Vbefore_change_functions, |
| 6058 | doc: /* List of functions to call before each text change. |
| 6059 | Two arguments are passed to each function: the positions of |
| 6060 | the beginning and end of the range of old text to be changed. |
| 6061 | \(For an insertion, the beginning and end are at the same place.) |
| 6062 | No information is given about the length of the text after the change. |
| 6063 | |
| 6064 | Buffer changes made while executing the `before-change-functions' |
| 6065 | don't call any before-change or after-change functions. |
| 6066 | That's because these variables are temporarily set to nil. |
| 6067 | As a result, a hook function cannot straightforwardly alter the |
| 6068 | value of these variables. See the Emacs Lisp manual for a way of |
| 6069 | accomplishing an equivalent result by using other variables. |
| 6070 | |
| 6071 | If an unhandled error happens in running these functions, |
| 6072 | the variable's value remains nil. That prevents the error |
| 6073 | from happening repeatedly and making Emacs nonfunctional. */); |
| 6074 | Vbefore_change_functions = Qnil; |
| 6075 | |
| 6076 | DEFVAR_LISP ("after-change-functions", &Vafter_change_functions, |
| 6077 | doc: /* List of functions to call after each text change. |
| 6078 | Three arguments are passed to each function: the positions of |
| 6079 | the beginning and end of the range of changed text, |
| 6080 | and the length in bytes of the pre-change text replaced by that range. |
| 6081 | \(For an insertion, the pre-change length is zero; |
| 6082 | for a deletion, that length is the number of bytes deleted, |
| 6083 | and the post-change beginning and end are at the same place.) |
| 6084 | |
| 6085 | Buffer changes made while executing the `after-change-functions' |
| 6086 | don't call any before-change or after-change functions. |
| 6087 | That's because these variables are temporarily set to nil. |
| 6088 | As a result, a hook function cannot straightforwardly alter the |
| 6089 | value of these variables. See the Emacs Lisp manual for a way of |
| 6090 | accomplishing an equivalent result by using other variables. |
| 6091 | |
| 6092 | If an unhandled error happens in running these functions, |
| 6093 | the variable's value remains nil. That prevents the error |
| 6094 | from happening repeatedly and making Emacs nonfunctional. */); |
| 6095 | Vafter_change_functions = Qnil; |
| 6096 | |
| 6097 | DEFVAR_LISP ("first-change-hook", &Vfirst_change_hook, |
| 6098 | doc: /* A list of functions to call before changing a buffer which is unmodified. |
| 6099 | The functions are run using the `run-hooks' function. */); |
| 6100 | Vfirst_change_hook = Qnil; |
| 6101 | |
| 6102 | DEFVAR_PER_BUFFER ("buffer-undo-list", ¤t_buffer->undo_list, Qnil, |
| 6103 | doc: /* List of undo entries in current buffer. |
| 6104 | Recent changes come first; older changes follow newer. |
| 6105 | |
| 6106 | An entry (BEG . END) represents an insertion which begins at |
| 6107 | position BEG and ends at position END. |
| 6108 | |
| 6109 | An entry (TEXT . POSITION) represents the deletion of the string TEXT |
| 6110 | from (abs POSITION). If POSITION is positive, point was at the front |
| 6111 | of the text being deleted; if negative, point was at the end. |
| 6112 | |
| 6113 | An entry (t HIGH . LOW) indicates that the buffer previously had |
| 6114 | \"unmodified\" status. HIGH and LOW are the high and low 16-bit portions |
| 6115 | of the visited file's modification time, as of that time. If the |
| 6116 | modification time of the most recent save is different, this entry is |
| 6117 | obsolete. |
| 6118 | |
| 6119 | An entry (nil PROPERTY VALUE BEG . END) indicates that a text property |
| 6120 | was modified between BEG and END. PROPERTY is the property name, |
| 6121 | and VALUE is the old value. |
| 6122 | |
| 6123 | An entry (apply FUN-NAME . ARGS) means undo the change with |
| 6124 | \(apply FUN-NAME ARGS). |
| 6125 | |
| 6126 | An entry (apply DELTA BEG END FUN-NAME . ARGS) supports selective undo |
| 6127 | in the active region. BEG and END is the range affected by this entry |
| 6128 | and DELTA is the number of bytes added or deleted in that range by |
| 6129 | this change. |
| 6130 | |
| 6131 | An entry (MARKER . DISTANCE) indicates that the marker MARKER |
| 6132 | was adjusted in position by the offset DISTANCE (an integer). |
| 6133 | |
| 6134 | An entry of the form POSITION indicates that point was at the buffer |
| 6135 | location given by the integer. Undoing an entry of this form places |
| 6136 | point at POSITION. |
| 6137 | |
| 6138 | Entries with value `nil' mark undo boundaries. The undo command treats |
| 6139 | the changes between two undo boundaries as a single step to be undone. |
| 6140 | |
| 6141 | If the value of the variable is t, undo information is not recorded. */); |
| 6142 | |
| 6143 | DEFVAR_PER_BUFFER ("mark-active", ¤t_buffer->mark_active, Qnil, |
| 6144 | doc: /* Non-nil means the mark and region are currently active in this buffer. */); |
| 6145 | |
| 6146 | DEFVAR_PER_BUFFER ("cache-long-line-scans", ¤t_buffer->cache_long_line_scans, Qnil, |
| 6147 | doc: /* Non-nil means that Emacs should use caches to handle long lines more quickly. |
| 6148 | |
| 6149 | Normally, the line-motion functions work by scanning the buffer for |
| 6150 | newlines. Columnar operations (like `move-to-column' and |
| 6151 | `compute-motion') also work by scanning the buffer, summing character |
| 6152 | widths as they go. This works well for ordinary text, but if the |
| 6153 | buffer's lines are very long (say, more than 500 characters), these |
| 6154 | motion functions will take longer to execute. Emacs may also take |
| 6155 | longer to update the display. |
| 6156 | |
| 6157 | If `cache-long-line-scans' is non-nil, these motion functions cache the |
| 6158 | results of their scans, and consult the cache to avoid rescanning |
| 6159 | regions of the buffer until the text is modified. The caches are most |
| 6160 | beneficial when they prevent the most searching---that is, when the |
| 6161 | buffer contains long lines and large regions of characters with the |
| 6162 | same, fixed screen width. |
| 6163 | |
| 6164 | When `cache-long-line-scans' is non-nil, processing short lines will |
| 6165 | become slightly slower (because of the overhead of consulting the |
| 6166 | cache), and the caches will use memory roughly proportional to the |
| 6167 | number of newlines and characters whose screen width varies. |
| 6168 | |
| 6169 | The caches require no explicit maintenance; their accuracy is |
| 6170 | maintained internally by the Emacs primitives. Enabling or disabling |
| 6171 | the cache should not affect the behavior of any of the motion |
| 6172 | functions; it should only affect their performance. */); |
| 6173 | |
| 6174 | DEFVAR_PER_BUFFER ("point-before-scroll", ¤t_buffer->point_before_scroll, Qnil, |
| 6175 | doc: /* Value of point before the last series of scroll operations, or nil. */); |
| 6176 | |
| 6177 | DEFVAR_PER_BUFFER ("buffer-file-format", ¤t_buffer->file_format, Qnil, |
| 6178 | doc: /* List of formats to use when saving this buffer. |
| 6179 | Formats are defined by `format-alist'. This variable is |
| 6180 | set when a file is visited. */); |
| 6181 | |
| 6182 | DEFVAR_PER_BUFFER ("buffer-auto-save-file-format", |
| 6183 | ¤t_buffer->auto_save_file_format, Qnil, |
| 6184 | doc: /* *Format in which to write auto-save files. |
| 6185 | Should be a list of symbols naming formats that are defined in `format-alist'. |
| 6186 | If it is t, which is the default, auto-save files are written in the |
| 6187 | same format as a regular save would use. */); |
| 6188 | |
| 6189 | DEFVAR_PER_BUFFER ("buffer-invisibility-spec", |
| 6190 | ¤t_buffer->invisibility_spec, Qnil, |
| 6191 | doc: /* Invisibility spec of this buffer. |
| 6192 | The default is t, which means that text is invisible |
| 6193 | if it has a non-nil `invisible' property. |
| 6194 | If the value is a list, a text character is invisible if its `invisible' |
| 6195 | property is an element in that list (or is a list with members in common). |
| 6196 | If an element is a cons cell of the form (PROP . ELLIPSIS), |
| 6197 | then characters with property value PROP are invisible, |
| 6198 | and they have an ellipsis as well if ELLIPSIS is non-nil. */); |
| 6199 | |
| 6200 | DEFVAR_PER_BUFFER ("buffer-display-count", |
| 6201 | ¤t_buffer->display_count, Qnil, |
| 6202 | doc: /* A number incremented each time this buffer is displayed in a window. |
| 6203 | The function `set-window-buffer' increments it. */); |
| 6204 | |
| 6205 | DEFVAR_PER_BUFFER ("buffer-display-time", |
| 6206 | ¤t_buffer->display_time, Qnil, |
| 6207 | doc: /* Time stamp updated each time this buffer is displayed in a window. |
| 6208 | The function `set-window-buffer' updates this variable |
| 6209 | to the value obtained by calling `current-time'. |
| 6210 | If the buffer has never been shown in a window, the value is nil. */); |
| 6211 | |
| 6212 | DEFVAR_LISP ("transient-mark-mode", &Vtransient_mark_mode, |
| 6213 | doc: /* */); |
| 6214 | Vtransient_mark_mode = Qnil; |
| 6215 | /* The docstring is in simple.el. If we put it here, it would be |
| 6216 | overwritten when transient-mark-mode is defined using |
| 6217 | define-minor-mode. */ |
| 6218 | |
| 6219 | DEFVAR_LISP ("inhibit-read-only", &Vinhibit_read_only, |
| 6220 | doc: /* *Non-nil means disregard read-only status of buffers or characters. |
| 6221 | If the value is t, disregard `buffer-read-only' and all `read-only' |
| 6222 | text properties. If the value is a list, disregard `buffer-read-only' |
| 6223 | and disregard a `read-only' text property if the property value |
| 6224 | is a member of the list. */); |
| 6225 | Vinhibit_read_only = Qnil; |
| 6226 | |
| 6227 | DEFVAR_PER_BUFFER ("cursor-type", ¤t_buffer->cursor_type, Qnil, |
| 6228 | doc: /* Cursor to use when this buffer is in the selected window. |
| 6229 | Values are interpreted as follows: |
| 6230 | |
| 6231 | t use the cursor specified for the frame |
| 6232 | nil don't display a cursor |
| 6233 | box display a filled box cursor |
| 6234 | hollow display a hollow box cursor |
| 6235 | bar display a vertical bar cursor with default width |
| 6236 | (bar . WIDTH) display a vertical bar cursor with width WIDTH |
| 6237 | hbar display a horizontal bar cursor with default height |
| 6238 | (hbar . HEIGHT) display a horizontal bar cursor with height HEIGHT |
| 6239 | ANYTHING ELSE display a hollow box cursor |
| 6240 | |
| 6241 | When the buffer is displayed in a non-selected window, the |
| 6242 | cursor's appearance is instead controlled by the variable |
| 6243 | `cursor-in-non-selected-windows'. */); |
| 6244 | |
| 6245 | DEFVAR_PER_BUFFER ("line-spacing", |
| 6246 | ¤t_buffer->extra_line_spacing, Qnil, |
| 6247 | doc: /* Additional space to put between lines when displaying a buffer. |
| 6248 | The space is measured in pixels, and put below lines on graphic displays, |
| 6249 | see `display-graphic-p'. |
| 6250 | If value is a floating point number, it specifies the spacing relative |
| 6251 | to the default frame line height. A value of nil means add no extra space. */); |
| 6252 | |
| 6253 | DEFVAR_PER_BUFFER ("cursor-in-non-selected-windows", |
| 6254 | ¤t_buffer->cursor_in_non_selected_windows, Qnil, |
| 6255 | doc: /* *Cursor type to display in non-selected windows. |
| 6256 | The value t means to use hollow box cursor. See `cursor-type' for other values. */); |
| 6257 | |
| 6258 | DEFVAR_LISP ("kill-buffer-query-functions", &Vkill_buffer_query_functions, |
| 6259 | doc: /* List of functions called with no args to query before killing a buffer. |
| 6260 | The buffer being killed will be current while the functions are running. |
| 6261 | If any of them returns nil, the buffer is not killed. */); |
| 6262 | Vkill_buffer_query_functions = Qnil; |
| 6263 | |
| 6264 | DEFVAR_LISP ("change-major-mode-hook", &Vchange_major_mode_hook, |
| 6265 | doc: /* Normal hook run before changing the major mode of a buffer. |
| 6266 | The function `kill-all-local-variables' runs this before doing anything else. */); |
| 6267 | Vchange_major_mode_hook = Qnil; |
| 6268 | Qchange_major_mode_hook = intern ("change-major-mode-hook"); |
| 6269 | staticpro (&Qchange_major_mode_hook); |
| 6270 | |
| 6271 | defsubr (&Sbuffer_live_p); |
| 6272 | defsubr (&Sbuffer_list); |
| 6273 | defsubr (&Sget_buffer); |
| 6274 | defsubr (&Sget_file_buffer); |
| 6275 | defsubr (&Sget_buffer_create); |
| 6276 | defsubr (&Smake_indirect_buffer); |
| 6277 | defsubr (&Sgenerate_new_buffer_name); |
| 6278 | defsubr (&Sbuffer_name); |
| 6279 | /*defsubr (&Sbuffer_number);*/ |
| 6280 | defsubr (&Sbuffer_file_name); |
| 6281 | defsubr (&Sbuffer_base_buffer); |
| 6282 | defsubr (&Sbuffer_local_value); |
| 6283 | defsubr (&Sbuffer_local_variables); |
| 6284 | defsubr (&Sbuffer_modified_p); |
| 6285 | defsubr (&Sset_buffer_modified_p); |
| 6286 | defsubr (&Sbuffer_modified_tick); |
| 6287 | defsubr (&Sbuffer_chars_modified_tick); |
| 6288 | defsubr (&Srename_buffer); |
| 6289 | defsubr (&Sother_buffer); |
| 6290 | defsubr (&Sbuffer_enable_undo); |
| 6291 | defsubr (&Skill_buffer); |
| 6292 | defsubr (&Sset_buffer_major_mode); |
| 6293 | defsubr (&Sswitch_to_buffer); |
| 6294 | defsubr (&Scurrent_buffer); |
| 6295 | defsubr (&Sset_buffer); |
| 6296 | defsubr (&Sbarf_if_buffer_read_only); |
| 6297 | defsubr (&Sbury_buffer); |
| 6298 | defsubr (&Serase_buffer); |
| 6299 | defsubr (&Sbuffer_swap_text); |
| 6300 | defsubr (&Sset_buffer_multibyte); |
| 6301 | defsubr (&Skill_all_local_variables); |
| 6302 | |
| 6303 | defsubr (&Soverlayp); |
| 6304 | defsubr (&Smake_overlay); |
| 6305 | defsubr (&Sdelete_overlay); |
| 6306 | defsubr (&Smove_overlay); |
| 6307 | defsubr (&Soverlay_start); |
| 6308 | defsubr (&Soverlay_end); |
| 6309 | defsubr (&Soverlay_buffer); |
| 6310 | defsubr (&Soverlay_properties); |
| 6311 | defsubr (&Soverlays_at); |
| 6312 | defsubr (&Soverlays_in); |
| 6313 | defsubr (&Snext_overlay_change); |
| 6314 | defsubr (&Sprevious_overlay_change); |
| 6315 | defsubr (&Soverlay_recenter); |
| 6316 | defsubr (&Soverlay_lists); |
| 6317 | defsubr (&Soverlay_get); |
| 6318 | defsubr (&Soverlay_put); |
| 6319 | defsubr (&Srestore_buffer_modified_p); |
| 6320 | } |
| 6321 | |
| 6322 | void |
| 6323 | keys_of_buffer () |
| 6324 | { |
| 6325 | initial_define_key (control_x_map, 'b', "switch-to-buffer"); |
| 6326 | initial_define_key (control_x_map, 'k', "kill-buffer"); |
| 6327 | |
| 6328 | /* This must not be in syms_of_buffer, because Qdisabled is not |
| 6329 | initialized when that function gets called. */ |
| 6330 | Fput (intern ("erase-buffer"), Qdisabled, Qt); |
| 6331 | } |
| 6332 | |
| 6333 | /* arch-tag: e48569bf-69a9-4b65-a23b-8e68769436e1 |
| 6334 | (do not change this comment) */ |