Commit | Line | Data |
---|---|---|
4588ec20 | 1 | /* Updating of data structures for redisplay. |
da024910 | 2 | Copyright (C) 1985, 86, 87, 88, 93, 94, 95, 97, 98, 1999, 2000, 2001 |
ba704fd4 | 3 | Free Software Foundation, Inc. |
4588ec20 JB |
4 | |
5 | This file is part of GNU Emacs. | |
6 | ||
7 | GNU Emacs is free software; you can redistribute it and/or modify | |
8 | it under the terms of the GNU General Public License as published by | |
fa61c701 | 9 | the Free Software Foundation; either version 2, or (at your option) |
4588ec20 JB |
10 | any later version. |
11 | ||
12 | GNU Emacs is distributed in the hope that it will be useful, | |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
18 | along with GNU Emacs; see the file COPYING. If not, write to | |
3b7ad313 EN |
19 | the Free Software Foundation, Inc., 59 Temple Place - Suite 330, |
20 | Boston, MA 02111-1307, USA. */ | |
4588ec20 | 21 | |
18160b98 | 22 | #include <config.h> |
68c45bf0 | 23 | #include <signal.h> |
565620a5 | 24 | #include <stdio.h> |
4588ec20 JB |
25 | #include <ctype.h> |
26 | ||
dfcf069d AS |
27 | #ifdef HAVE_UNISTD_H |
28 | #include <unistd.h> | |
29 | #endif | |
30 | ||
47099d6f | 31 | #include "lisp.h" |
4588ec20 JB |
32 | #include "termchar.h" |
33 | #include "termopts.h" | |
3be08bea | 34 | #include "termhooks.h" |
a0879520 | 35 | /* cm.h must come after dispextern.h on Windows. */ |
fd2e066a GV |
36 | #include "dispextern.h" |
37 | #include "cm.h" | |
4588ec20 | 38 | #include "buffer.h" |
24e86043 | 39 | #include "charset.h" |
d43721a2 | 40 | #include "keyboard.h" |
502b9b64 | 41 | #include "frame.h" |
4588ec20 JB |
42 | #include "window.h" |
43 | #include "commands.h" | |
44 | #include "disptab.h" | |
45 | #include "indent.h" | |
d169fe39 | 46 | #include "intervals.h" |
97cf50e7 | 47 | #include "blockinput.h" |
dfcf069d | 48 | #include "process.h" |
4588ec20 | 49 | |
24e86043 KH |
50 | /* I don't know why DEC Alpha OSF1 fail to compile this file if we |
51 | include the following file. */ | |
52 | /* #include "systty.h" */ | |
58b2bb63 | 53 | #include "syssignal.h" |
a41f8bed | 54 | |
4588ec20 JB |
55 | #ifdef HAVE_X_WINDOWS |
56 | #include "xterm.h" | |
5f5c8ee5 | 57 | #endif /* HAVE_X_WINDOWS */ |
4588ec20 | 58 | |
fd2e066a GV |
59 | #ifdef HAVE_NTGUI |
60 | #include "w32term.h" | |
61 | #endif /* HAVE_NTGUI */ | |
62 | ||
1a578e9b AC |
63 | #ifdef macintosh |
64 | #include "macterm.h" | |
65 | #endif /* macintosh */ | |
66 | ||
5f5c8ee5 | 67 | /* Include systime.h after xterm.h to avoid double inclusion of time.h. */ |
6cbd1643 | 68 | |
5f5c8ee5 | 69 | #include "systime.h" |
3883a901 RS |
70 | #include <errno.h> |
71 | ||
5f5c8ee5 GM |
72 | /* To get the prototype for `sleep'. */ |
73 | ||
74 | #ifdef HAVE_UNISTD_H | |
75 | #include <unistd.h> | |
76 | #endif | |
77 | ||
4588ec20 | 78 | /* Get number of chars of output now in the buffer of a stdio stream. |
5f5c8ee5 GM |
79 | This ought to be built in in stdio, but it isn't. Some s- files |
80 | override this because their stdio internals differ. */ | |
81 | ||
e3271ae5 | 82 | #ifdef __GNU_LIBRARY__ |
5f5c8ee5 GM |
83 | |
84 | /* The s- file might have overridden the definition with one that | |
85 | works for the system's C library. But we are using the GNU C | |
86 | library, so this is the right definition for every system. */ | |
87 | ||
3883a901 RS |
88 | #ifdef GNU_LIBRARY_PENDING_OUTPUT_COUNT |
89 | #define PENDING_OUTPUT_COUNT GNU_LIBRARY_PENDING_OUTPUT_COUNT | |
90 | #else | |
cb5558ff | 91 | #undef PENDING_OUTPUT_COUNT |
e3271ae5 | 92 | #define PENDING_OUTPUT_COUNT(FILE) ((FILE)->__bufp - (FILE)->__buffer) |
3883a901 RS |
93 | #endif |
94 | #else /* not __GNU_LIBRARY__ */ | |
68c45bf0 PE |
95 | #if !defined (PENDING_OUTPUT_COUNT) && HAVE_STDIO_EXT_H && HAVE___FPENDING |
96 | #include <stdio_ext.h> | |
97 | #define PENDING_OUTPUT_COUNT(FILE) __fpending (FILE) | |
98 | #endif | |
cb5558ff | 99 | #ifndef PENDING_OUTPUT_COUNT |
4588ec20 JB |
100 | #define PENDING_OUTPUT_COUNT(FILE) ((FILE)->_ptr - (FILE)->_base) |
101 | #endif | |
5f5c8ee5 GM |
102 | #endif /* not __GNU_LIBRARY__ */ |
103 | ||
8a2a6032 | 104 | #if defined(HAVE_TERM_H) && defined (GNU_LINUX) && defined (HAVE_LIBNCURSES) |
fa0ec9f4 DL |
105 | #include <term.h> /* for tgetent */ |
106 | #endif | |
5f5c8ee5 GM |
107 | \f |
108 | /* Structure to pass dimensions around. Used for character bounding | |
109 | boxes, glyph matrix dimensions and alike. */ | |
110 | ||
111 | struct dim | |
112 | { | |
113 | int width; | |
114 | int height; | |
115 | }; | |
116 | ||
117 | \f | |
118 | /* Function prototypes. */ | |
119 | ||
bccee4f2 GM |
120 | static struct glyph_matrix *save_current_matrix P_ ((struct frame *)); |
121 | static void restore_current_matrix P_ ((struct frame *, struct glyph_matrix *)); | |
c9f00270 | 122 | static void fake_current_matrices P_ ((Lisp_Object)); |
408f5064 GM |
123 | static void redraw_overlapping_rows P_ ((struct window *, int)); |
124 | static void redraw_overlapped_rows P_ ((struct window *, int)); | |
5f5c8ee5 GM |
125 | static int count_blanks P_ ((struct glyph *, int)); |
126 | static int count_match P_ ((struct glyph *, struct glyph *, | |
127 | struct glyph *, struct glyph *)); | |
128 | static unsigned line_draw_cost P_ ((struct glyph_matrix *, int)); | |
129 | static void update_frame_line P_ ((struct frame *, int)); | |
130 | static struct dim allocate_matrices_for_frame_redisplay | |
5d3cc43c GM |
131 | P_ ((Lisp_Object, int, int, int, int *)); |
132 | static void allocate_matrices_for_window_redisplay P_ ((struct window *)); | |
5f5c8ee5 GM |
133 | static int realloc_glyph_pool P_ ((struct glyph_pool *, struct dim)); |
134 | static void adjust_frame_glyphs P_ ((struct frame *)); | |
135 | struct glyph_matrix *new_glyph_matrix P_ ((struct glyph_pool *)); | |
136 | static void free_glyph_matrix P_ ((struct glyph_matrix *)); | |
137 | static void adjust_glyph_matrix P_ ((struct window *, struct glyph_matrix *, | |
138 | int, int, struct dim)); | |
b96fd3e8 | 139 | static void change_frame_size_1 P_ ((struct frame *, int, int, int, int, int)); |
5f5c8ee5 | 140 | static void swap_glyph_pointers P_ ((struct glyph_row *, struct glyph_row *)); |
f1d2ce7f | 141 | #if GLYPH_DEBUG |
5f5c8ee5 | 142 | static int glyph_row_slice_p P_ ((struct glyph_row *, struct glyph_row *)); |
9339e87f | 143 | #endif |
5f5c8ee5 GM |
144 | static void fill_up_frame_row_with_spaces P_ ((struct glyph_row *, int)); |
145 | static void build_frame_matrix_from_window_tree P_ ((struct glyph_matrix *, | |
146 | struct window *)); | |
147 | static void build_frame_matrix_from_leaf_window P_ ((struct glyph_matrix *, | |
148 | struct window *)); | |
149 | static struct glyph_pool *new_glyph_pool P_ ((void)); | |
150 | static void free_glyph_pool P_ ((struct glyph_pool *)); | |
151 | static void adjust_frame_glyphs_initially P_ ((void)); | |
152 | static void adjust_frame_message_buffer P_ ((struct frame *)); | |
153 | static void adjust_decode_mode_spec_buffer P_ ((struct frame *)); | |
154 | static void fill_up_glyph_row_with_spaces P_ ((struct glyph_row *)); | |
155 | static void build_frame_matrix P_ ((struct frame *)); | |
156 | void clear_current_matrices P_ ((struct frame *)); | |
157 | void scroll_glyph_matrix_range P_ ((struct glyph_matrix *, int, int, | |
158 | int, int)); | |
159 | static void clear_window_matrices P_ ((struct window *, int)); | |
160 | static void fill_up_glyph_row_area_with_spaces P_ ((struct glyph_row *, int)); | |
161 | static int scrolling_window P_ ((struct window *, int)); | |
e876ff42 | 162 | static int update_window_line P_ ((struct window *, int, int *)); |
5f5c8ee5 | 163 | static void update_marginal_area P_ ((struct window *, int, int)); |
408f5064 | 164 | static int update_text_area P_ ((struct window *, int)); |
5f5c8ee5 GM |
165 | static void make_current P_ ((struct glyph_matrix *, struct glyph_matrix *, |
166 | int)); | |
167 | static void mirror_make_current P_ ((struct window *, int)); | |
168 | void check_window_matrix_pointers P_ ((struct window *)); | |
b96fd3e8 | 169 | #if GLYPH_DEBUG |
5f5c8ee5 GM |
170 | static void check_matrix_pointers P_ ((struct glyph_matrix *, |
171 | struct glyph_matrix *)); | |
b96fd3e8 | 172 | #endif |
5f5c8ee5 GM |
173 | static void mirror_line_dance P_ ((struct window *, int, int, int *, char *)); |
174 | static int update_window_tree P_ ((struct window *, int)); | |
175 | static int update_window P_ ((struct window *, int)); | |
176 | static int update_frame_1 P_ ((struct frame *, int, int)); | |
177 | static void set_window_cursor_after_update P_ ((struct window *)); | |
178 | static int row_equal_p P_ ((struct window *, struct glyph_row *, | |
e4e0bee9 | 179 | struct glyph_row *, int)); |
5f5c8ee5 GM |
180 | static void adjust_frame_glyphs_for_window_redisplay P_ ((struct frame *)); |
181 | static void adjust_frame_glyphs_for_frame_redisplay P_ ((struct frame *)); | |
182 | static void reverse_rows P_ ((struct glyph_matrix *, int, int)); | |
183 | static int margin_glyphs_to_reserve P_ ((struct window *, int, Lisp_Object)); | |
a13396c9 GM |
184 | static void sync_window_with_frame_matrix_rows P_ ((struct window *)); |
185 | struct window *frame_row_to_window P_ ((struct window *, int)); | |
5f5c8ee5 | 186 | |
5f5c8ee5 GM |
187 | \f |
188 | /* Non-zero means don't pause redisplay for pending input. (This is | |
189 | for debugging and for a future implementation of EDT-like | |
190 | scrolling. */ | |
4588ec20 | 191 | |
5f5c8ee5 | 192 | int redisplay_dont_pause; |
45140e01 | 193 | |
a41f8bed | 194 | /* Nonzero upon entry to redisplay means do not assume anything about |
502b9b64 | 195 | current contents of actual terminal frame; clear and redraw it. */ |
4588ec20 | 196 | |
502b9b64 | 197 | int frame_garbaged; |
4588ec20 | 198 | |
5f5c8ee5 | 199 | /* Nonzero means last display completed. Zero means it was preempted. */ |
4588ec20 JB |
200 | |
201 | int display_completed; | |
202 | ||
5f5c8ee5 GM |
203 | /* Lisp variable visible-bell; enables use of screen-flash instead of |
204 | audible bell. */ | |
4588ec20 JB |
205 | |
206 | int visible_bell; | |
207 | ||
502b9b64 | 208 | /* Invert the color of the whole frame, at a low level. */ |
4588ec20 JB |
209 | |
210 | int inverse_video; | |
211 | ||
212 | /* Line speed of the terminal. */ | |
213 | ||
214 | int baud_rate; | |
215 | ||
5f5c8ee5 GM |
216 | /* Either nil or a symbol naming the window system under which Emacs |
217 | is running. */ | |
4588ec20 JB |
218 | |
219 | Lisp_Object Vwindow_system; | |
220 | ||
221 | /* Version number of X windows: 10, 11 or nil. */ | |
5f5c8ee5 | 222 | |
4588ec20 JB |
223 | Lisp_Object Vwindow_system_version; |
224 | ||
5f5c8ee5 GM |
225 | /* Vector of glyph definitions. Indexed by glyph number, the contents |
226 | are a string which is how to output the glyph. | |
4588ec20 JB |
227 | |
228 | If Vglyph_table is nil, a glyph is output by using its low 8 bits | |
5f5c8ee5 GM |
229 | as a character code. |
230 | ||
231 | This is an obsolete feature that is no longer used. The variable | |
232 | is retained for compatibility. */ | |
4588ec20 JB |
233 | |
234 | Lisp_Object Vglyph_table; | |
235 | ||
236 | /* Display table to use for vectors that don't specify their own. */ | |
237 | ||
238 | Lisp_Object Vstandard_display_table; | |
239 | ||
5f5c8ee5 GM |
240 | /* Nonzero means reading single-character input with prompt so put |
241 | cursor on mini-buffer after the prompt. positive means at end of | |
242 | text in echo area; negative means at beginning of line. */ | |
243 | ||
4588ec20 | 244 | int cursor_in_echo_area; |
9cda4f7c | 245 | |
e7067d00 | 246 | Lisp_Object Qdisplay_table, Qredisplay_dont_pause; |
5f5c8ee5 | 247 | |
4588ec20 | 248 | \f |
5f5c8ee5 | 249 | /* The currently selected frame. In a single-frame version, this |
91fb7e1b | 250 | variable always equals the_only_frame. */ |
4588ec20 | 251 | |
91fb7e1b | 252 | Lisp_Object selected_frame; |
4588ec20 | 253 | |
5f5c8ee5 | 254 | /* A frame which is not just a mini-buffer, or 0 if there are no such |
502b9b64 | 255 | frames. This is usually the most recent such frame that was |
87485d6f MW |
256 | selected. In a single-frame version, this variable always holds |
257 | the address of the_only_frame. */ | |
4588ec20 | 258 | |
5f5c8ee5 | 259 | struct frame *last_nonminibuf_frame; |
d52bad65 | 260 | |
5f5c8ee5 | 261 | /* Stdio stream being used for copy of all output. */ |
4588ec20 | 262 | |
5f5c8ee5 | 263 | FILE *termscript; |
502b9b64 | 264 | |
5f5c8ee5 | 265 | /* Structure for info on cursor positioning. */ |
4588ec20 | 266 | |
5f5c8ee5 | 267 | struct cm Wcm; |
4588ec20 | 268 | |
5f5c8ee5 | 269 | /* 1 means SIGWINCH happened when not safe. */ |
4588ec20 | 270 | |
5f5c8ee5 | 271 | int delayed_size_change; |
4588ec20 | 272 | |
5f5c8ee5 | 273 | /* 1 means glyph initialization has been completed at startup. */ |
4588ec20 | 274 | |
5f5c8ee5 | 275 | static int glyphs_initialized_initially_p; |
4588ec20 | 276 | |
5f5c8ee5 | 277 | /* Updated window if != 0. Set by update_window. */ |
4588ec20 | 278 | |
5f5c8ee5 | 279 | struct window *updated_window; |
4588ec20 | 280 | |
5f5c8ee5 | 281 | /* Glyph row updated in update_window_line, and area that is updated. */ |
4588ec20 | 282 | |
5f5c8ee5 GM |
283 | struct glyph_row *updated_row; |
284 | int updated_area; | |
4588ec20 | 285 | |
5f5c8ee5 | 286 | /* A glyph for a space. */ |
4588ec20 | 287 | |
5f5c8ee5 | 288 | struct glyph space_glyph; |
4588ec20 | 289 | |
5f5c8ee5 GM |
290 | /* Non-zero means update has been performed directly, so that there's |
291 | no need for redisplay_internal to do much work. Set by | |
292 | direct_output_for_insert. */ | |
4588ec20 | 293 | |
5f5c8ee5 | 294 | int redisplay_performed_directly_p; |
4588ec20 | 295 | |
5f5c8ee5 GM |
296 | /* Counts of allocated structures. These counts serve to diagnose |
297 | memory leaks and double frees. */ | |
4588ec20 | 298 | |
5f5c8ee5 GM |
299 | int glyph_matrix_count; |
300 | int glyph_pool_count; | |
4588ec20 | 301 | |
5f5c8ee5 GM |
302 | /* If non-null, the frame whose frame matrices are manipulated. If |
303 | null, window matrices are worked on. */ | |
4588ec20 | 304 | |
5f5c8ee5 | 305 | static struct frame *frame_matrix_frame; |
4588ec20 | 306 | |
5f5c8ee5 GM |
307 | /* Current interface for window-based redisplay. Set from init_xterm. |
308 | A null value means we are not using window-based redisplay. */ | |
4588ec20 | 309 | |
5f5c8ee5 | 310 | struct redisplay_interface *rif; |
4588ec20 | 311 | |
5f5c8ee5 GM |
312 | /* Non-zero means that fonts have been loaded since the last glyph |
313 | matrix adjustments. Redisplay must stop, and glyph matrices must | |
314 | be adjusted when this flag becomes non-zero during display. The | |
315 | reason fonts can be loaded so late is that fonts of fontsets are | |
316 | loaded on demand. */ | |
836d2cde | 317 | |
5f5c8ee5 | 318 | int fonts_changed_p; |
836d2cde | 319 | |
5f5c8ee5 GM |
320 | /* Convert vpos and hpos from frame to window and vice versa. |
321 | This may only be used for terminal frames. */ | |
836d2cde | 322 | |
5f5c8ee5 | 323 | #if GLYPH_DEBUG |
4588ec20 | 324 | |
5f5c8ee5 GM |
325 | static int window_to_frame_vpos P_ ((struct window *, int)); |
326 | static int window_to_frame_hpos P_ ((struct window *, int)); | |
327 | #define WINDOW_TO_FRAME_VPOS(W, VPOS) window_to_frame_vpos ((W), (VPOS)) | |
328 | #define WINDOW_TO_FRAME_HPOS(W, HPOS) window_to_frame_hpos ((W), (HPOS)) | |
4588ec20 | 329 | |
9b0e97aa GM |
330 | /* One element of the ring buffer containing redisplay history |
331 | information. */ | |
332 | ||
333 | struct redisplay_history | |
334 | { | |
335 | char trace[512 + 100]; | |
336 | }; | |
337 | ||
338 | /* The size of the history buffer. */ | |
339 | ||
340 | #define REDISPLAY_HISTORY_SIZE 30 | |
341 | ||
342 | /* The redisplay history buffer. */ | |
343 | ||
344 | static struct redisplay_history redisplay_history[REDISPLAY_HISTORY_SIZE]; | |
345 | ||
346 | /* Next free entry in redisplay_history. */ | |
347 | ||
348 | static int history_idx; | |
349 | ||
350 | /* A tick that's incremented each time something is added to the | |
351 | history. */ | |
352 | ||
353 | static unsigned history_tick; | |
354 | ||
355 | static void add_frame_display_history P_ ((struct frame *, int)); | |
356 | static void add_window_display_history P_ ((struct window *, char *, int)); | |
357 | ||
358 | ||
359 | /* Add to the redisplay history how window W has been displayed. | |
360 | MSG is a trace containing the information how W's glyph matrix | |
361 | has been contructed. PAUSED_P non-zero means that the update | |
362 | has been interrupted for pending input. */ | |
363 | ||
364 | static void | |
365 | add_window_display_history (w, msg, paused_p) | |
366 | struct window *w; | |
367 | char *msg; | |
368 | int paused_p; | |
369 | { | |
370 | char *buf; | |
371 | ||
372 | if (history_idx >= REDISPLAY_HISTORY_SIZE) | |
373 | history_idx = 0; | |
374 | buf = redisplay_history[history_idx].trace; | |
375 | ++history_idx; | |
376 | ||
377 | sprintf (buf, "%d: window %p (`%s')%s\n", | |
378 | history_tick++, | |
379 | w, | |
380 | ((BUFFERP (w->buffer) | |
381 | && STRINGP (XBUFFER (w->buffer)->name)) | |
382 | ? (char *) XSTRING (XBUFFER (w->buffer)->name)->data | |
383 | : "???"), | |
384 | paused_p ? " ***paused***" : ""); | |
385 | strcat (buf, msg); | |
386 | } | |
387 | ||
388 | ||
389 | /* Add to the redisplay history that frame F has been displayed. | |
390 | PAUSED_P non-zero means that the update has been interrupted for | |
391 | pending input. */ | |
392 | ||
393 | static void | |
394 | add_frame_display_history (f, paused_p) | |
395 | struct frame *f; | |
396 | int paused_p; | |
397 | { | |
398 | char *buf; | |
399 | ||
400 | if (history_idx >= REDISPLAY_HISTORY_SIZE) | |
401 | history_idx = 0; | |
402 | buf = redisplay_history[history_idx].trace; | |
403 | ++history_idx; | |
404 | ||
405 | sprintf (buf, "%d: update frame %p%s", | |
406 | history_tick++, | |
407 | f, paused_p ? " ***paused***" : ""); | |
408 | } | |
409 | ||
410 | ||
411 | DEFUN ("dump-redisplay-history", Fdump_redisplay_history, | |
412 | Sdump_redisplay_history, 0, 0, "", | |
7ee72033 MB |
413 | doc: /* Dump redisplay history to stderr. */) |
414 | () | |
9b0e97aa GM |
415 | { |
416 | int i; | |
417 | ||
418 | for (i = history_idx - 1; i != history_idx; --i) | |
419 | { | |
420 | if (i < 0) | |
421 | i = REDISPLAY_HISTORY_SIZE - 1; | |
422 | fprintf (stderr, "%s\n", redisplay_history[i].trace); | |
423 | } | |
424 | ||
425 | return Qnil; | |
426 | } | |
427 | ||
428 | ||
5f5c8ee5 | 429 | #else /* GLYPH_DEBUG == 0 */ |
4588ec20 | 430 | |
5f5c8ee5 GM |
431 | #define WINDOW_TO_FRAME_VPOS(W, VPOS) ((VPOS) + XFASTINT ((W)->top)) |
432 | #define WINDOW_TO_FRAME_HPOS(W, HPOS) ((HPOS) + XFASTINT ((W)->left)) | |
4588ec20 | 433 | |
5f5c8ee5 | 434 | #endif /* GLYPH_DEBUG == 0 */ |
4588ec20 | 435 | |
4588ec20 | 436 | |
5f5c8ee5 GM |
437 | /* Like bcopy except never gets confused by overlap. Let this be the |
438 | first function defined in this file, or change emacs.c where the | |
439 | address of this function is used. */ | |
4588ec20 JB |
440 | |
441 | void | |
442 | safe_bcopy (from, to, size) | |
443 | char *from, *to; | |
444 | int size; | |
445 | { | |
b5c685f4 | 446 | if (size <= 0 || from == to) |
4588ec20 JB |
447 | return; |
448 | ||
b5c685f4 JB |
449 | /* If the source and destination don't overlap, then bcopy can |
450 | handle it. If they do overlap, but the destination is lower in | |
451 | memory than the source, we'll assume bcopy can handle that. */ | |
452 | if (to < from || from + size <= to) | |
453 | bcopy (from, to, size); | |
454 | ||
455 | /* Otherwise, we'll copy from the end. */ | |
456 | else | |
4588ec20 | 457 | { |
b5c685f4 JB |
458 | register char *endf = from + size; |
459 | register char *endt = to + size; | |
4588ec20 JB |
460 | |
461 | /* If TO - FROM is large, then we should break the copy into | |
462 | nonoverlapping chunks of TO - FROM bytes each. However, if | |
463 | TO - FROM is small, then the bcopy function call overhead | |
464 | makes this not worth it. The crossover point could be about | |
b5c685f4 JB |
465 | anywhere. Since I don't think the obvious copy loop is too |
466 | bad, I'm trying to err in its favor. */ | |
4588ec20 JB |
467 | if (to - from < 64) |
468 | { | |
469 | do | |
470 | *--endt = *--endf; | |
471 | while (endf != from); | |
472 | } | |
473 | else | |
474 | { | |
b5c685f4 | 475 | for (;;) |
4588ec20 JB |
476 | { |
477 | endt -= (to - from); | |
478 | endf -= (to - from); | |
479 | ||
b5c685f4 JB |
480 | if (endt < to) |
481 | break; | |
482 | ||
4588ec20 JB |
483 | bcopy (endf, endt, to - from); |
484 | } | |
b5c685f4 JB |
485 | |
486 | /* If SIZE wasn't a multiple of TO - FROM, there will be a | |
5f5c8ee5 GM |
487 | little left over. The amount left over is (endt + (to - |
488 | from)) - to, which is endt - from. */ | |
4588ec20 JB |
489 | bcopy (from, to, endt - from); |
490 | } | |
491 | } | |
4588ec20 JB |
492 | } |
493 | ||
4588ec20 | 494 | |
5f5c8ee5 GM |
495 | \f |
496 | /*********************************************************************** | |
497 | Glyph Matrices | |
498 | ***********************************************************************/ | |
499 | ||
500 | /* Allocate and return a glyph_matrix structure. POOL is the glyph | |
501 | pool from which memory for the matrix should be allocated, or null | |
502 | for window-based redisplay where no glyph pools are used. The | |
503 | member `pool' of the glyph matrix structure returned is set to | |
504 | POOL, the structure is otherwise zeroed. */ | |
505 | ||
506 | struct glyph_matrix * | |
507 | new_glyph_matrix (pool) | |
508 | struct glyph_pool *pool; | |
4588ec20 | 509 | { |
5f5c8ee5 GM |
510 | struct glyph_matrix *result; |
511 | ||
512 | /* Allocate and clear. */ | |
513 | result = (struct glyph_matrix *) xmalloc (sizeof *result); | |
514 | bzero (result, sizeof *result); | |
4588ec20 | 515 | |
5f5c8ee5 GM |
516 | /* Increment number of allocated matrices. This count is used |
517 | to detect memory leaks. */ | |
518 | ++glyph_matrix_count; | |
4588ec20 | 519 | |
5f5c8ee5 GM |
520 | /* Set pool and return. */ |
521 | result->pool = pool; | |
522 | return result; | |
4588ec20 JB |
523 | } |
524 | ||
4588ec20 | 525 | |
5f5c8ee5 GM |
526 | /* Free glyph matrix MATRIX. Passing in a null MATRIX is allowed. |
527 | ||
528 | The global counter glyph_matrix_count is decremented when a matrix | |
529 | is freed. If the count gets negative, more structures were freed | |
530 | than allocated, i.e. one matrix was freed more than once or a bogus | |
531 | pointer was passed to this function. | |
532 | ||
533 | If MATRIX->pool is null, this means that the matrix manages its own | |
534 | glyph memory---this is done for matrices on X frames. Freeing the | |
535 | matrix also frees the glyph memory in this case. */ | |
536 | ||
537 | static void | |
538 | free_glyph_matrix (matrix) | |
539 | struct glyph_matrix *matrix; | |
4588ec20 | 540 | { |
5f5c8ee5 GM |
541 | if (matrix) |
542 | { | |
543 | int i; | |
544 | ||
545 | /* Detect the case that more matrices are freed than were | |
546 | allocated. */ | |
547 | if (--glyph_matrix_count < 0) | |
548 | abort (); | |
549 | ||
550 | /* Free glyph memory if MATRIX owns it. */ | |
551 | if (matrix->pool == NULL) | |
552 | for (i = 0; i < matrix->rows_allocated; ++i) | |
553 | xfree (matrix->rows[i].glyphs[LEFT_MARGIN_AREA]); | |
554 | ||
555 | /* Free row structures and the matrix itself. */ | |
556 | xfree (matrix->rows); | |
557 | xfree (matrix); | |
558 | } | |
559 | } | |
4588ec20 | 560 | |
4588ec20 | 561 | |
5f5c8ee5 GM |
562 | /* Return the number of glyphs to reserve for a marginal area of |
563 | window W. TOTAL_GLYPHS is the number of glyphs in a complete | |
564 | display line of window W. MARGIN gives the width of the marginal | |
565 | area in canonical character units. MARGIN should be an integer | |
566 | or a float. */ | |
567 | ||
568 | static int | |
569 | margin_glyphs_to_reserve (w, total_glyphs, margin) | |
570 | struct window *w; | |
571 | int total_glyphs; | |
572 | Lisp_Object margin; | |
573 | { | |
574 | int n; | |
4588ec20 | 575 | |
5f5c8ee5 | 576 | if (NUMBERP (margin)) |
4588ec20 | 577 | { |
5f5c8ee5 GM |
578 | int width = XFASTINT (w->width); |
579 | double d = max (0, XFLOATINT (margin)); | |
580 | d = min (width / 2 - 1, d); | |
581 | n = (int) ((double) total_glyphs / width * d); | |
582 | } | |
583 | else | |
584 | n = 0; | |
585 | ||
586 | return n; | |
587 | } | |
588 | ||
4588ec20 | 589 | |
5f5c8ee5 GM |
590 | /* Adjust glyph matrix MATRIX on window W or on a frame to changed |
591 | window sizes. | |
4588ec20 | 592 | |
5f5c8ee5 GM |
593 | W is null if the function is called for a frame glyph matrix. |
594 | Otherwise it is the window MATRIX is a member of. X and Y are the | |
595 | indices of the first column and row of MATRIX within the frame | |
596 | matrix, if such a matrix exists. They are zero for purely | |
597 | window-based redisplay. DIM is the needed size of the matrix. | |
d52bad65 | 598 | |
5f5c8ee5 GM |
599 | In window-based redisplay, where no frame matrices exist, glyph |
600 | matrices manage their own glyph storage. Otherwise, they allocate | |
601 | storage from a common frame glyph pool which can be found in | |
602 | MATRIX->pool. | |
23b0200c | 603 | |
5f5c8ee5 GM |
604 | The reason for this memory management strategy is to avoid complete |
605 | frame redraws if possible. When we allocate from a common pool, a | |
606 | change of the location or size of a sub-matrix within the pool | |
607 | requires a complete redisplay of the frame because we cannot easily | |
608 | make sure that the current matrices of all windows still agree with | |
609 | what is displayed on the screen. While this is usually fast, it | |
610 | leads to screen flickering. */ | |
23b0200c | 611 | |
5f5c8ee5 GM |
612 | static void |
613 | adjust_glyph_matrix (w, matrix, x, y, dim) | |
614 | struct window *w; | |
615 | struct glyph_matrix *matrix; | |
616 | int x, y; | |
617 | struct dim dim; | |
618 | { | |
619 | int i; | |
620 | int new_rows; | |
621 | int marginal_areas_changed_p = 0; | |
045dee35 GM |
622 | int header_line_changed_p = 0; |
623 | int header_line_p = 0; | |
5f5c8ee5 | 624 | int left = -1, right = -1; |
2b4ec4d7 | 625 | int window_x, window_y, window_width = -1, window_height; |
5f5c8ee5 GM |
626 | |
627 | /* See if W had a top line that has disappeared now, or vice versa. */ | |
628 | if (w) | |
629 | { | |
045dee35 GM |
630 | header_line_p = WINDOW_WANTS_HEADER_LINE_P (w); |
631 | header_line_changed_p = header_line_p != matrix->header_line_p; | |
5f5c8ee5 | 632 | } |
045dee35 | 633 | matrix->header_line_p = header_line_p; |
23b0200c | 634 | |
5f5c8ee5 GM |
635 | /* Do nothing if MATRIX' size, position, vscroll, and marginal areas |
636 | haven't changed. This optimization is important because preserving | |
637 | the matrix means preventing redisplay. */ | |
638 | if (matrix->pool == NULL) | |
639 | { | |
640 | window_box (w, -1, &window_x, &window_y, &window_width, &window_height); | |
641 | left = margin_glyphs_to_reserve (w, dim.width, w->left_margin_width); | |
642 | right = margin_glyphs_to_reserve (w, dim.width, w->right_margin_width); | |
643 | xassert (left >= 0 && right >= 0); | |
644 | marginal_areas_changed_p = (left != matrix->left_margin_glyphs | |
645 | || right != matrix->right_margin_glyphs); | |
646 | ||
647 | if (!marginal_areas_changed_p | |
648 | && !fonts_changed_p | |
045dee35 | 649 | && !header_line_changed_p |
d1c98adf | 650 | && matrix->window_left_x == XFASTINT (w->left) |
5f5c8ee5 GM |
651 | && matrix->window_top_y == XFASTINT (w->top) |
652 | && matrix->window_height == window_height | |
653 | && matrix->window_vscroll == w->vscroll | |
654 | && matrix->window_width == window_width) | |
655 | return; | |
656 | } | |
657 | ||
658 | /* Enlarge MATRIX->rows if necessary. New rows are cleared. */ | |
659 | if (matrix->rows_allocated < dim.height) | |
660 | { | |
661 | int size = dim.height * sizeof (struct glyph_row); | |
662 | new_rows = dim.height - matrix->rows_allocated; | |
663 | matrix->rows = (struct glyph_row *) xrealloc (matrix->rows, size); | |
664 | bzero (matrix->rows + matrix->rows_allocated, | |
665 | new_rows * sizeof *matrix->rows); | |
666 | matrix->rows_allocated = dim.height; | |
667 | } | |
668 | else | |
669 | new_rows = 0; | |
60a8948a | 670 | |
5f5c8ee5 GM |
671 | /* If POOL is not null, MATRIX is a frame matrix or a window matrix |
672 | on a frame not using window-based redisplay. Set up pointers for | |
673 | each row into the glyph pool. */ | |
674 | if (matrix->pool) | |
675 | { | |
676 | xassert (matrix->pool->glyphs); | |
677 | ||
678 | if (w) | |
60a8948a | 679 | { |
5f5c8ee5 GM |
680 | left = margin_glyphs_to_reserve (w, dim.width, |
681 | w->left_margin_width); | |
682 | right = margin_glyphs_to_reserve (w, dim.width, | |
683 | w->right_margin_width); | |
60a8948a | 684 | } |
5f5c8ee5 GM |
685 | else |
686 | left = right = 0; | |
687 | ||
688 | for (i = 0; i < dim.height; ++i) | |
60a8948a | 689 | { |
5f5c8ee5 GM |
690 | struct glyph_row *row = &matrix->rows[i]; |
691 | ||
692 | row->glyphs[LEFT_MARGIN_AREA] | |
693 | = (matrix->pool->glyphs | |
694 | + (y + i) * matrix->pool->ncolumns | |
695 | + x); | |
696 | ||
697 | if (w == NULL | |
698 | || row == matrix->rows + dim.height - 1 | |
045dee35 | 699 | || (row == matrix->rows && matrix->header_line_p)) |
5f5c8ee5 GM |
700 | { |
701 | row->glyphs[TEXT_AREA] | |
702 | = row->glyphs[LEFT_MARGIN_AREA]; | |
703 | row->glyphs[RIGHT_MARGIN_AREA] | |
704 | = row->glyphs[TEXT_AREA] + dim.width; | |
705 | row->glyphs[LAST_AREA] | |
706 | = row->glyphs[RIGHT_MARGIN_AREA]; | |
707 | } | |
708 | else | |
709 | { | |
710 | row->glyphs[TEXT_AREA] | |
711 | = row->glyphs[LEFT_MARGIN_AREA] + left; | |
712 | row->glyphs[RIGHT_MARGIN_AREA] | |
713 | = row->glyphs[TEXT_AREA] + dim.width - left - right; | |
714 | row->glyphs[LAST_AREA] | |
715 | = row->glyphs[LEFT_MARGIN_AREA] + dim.width; | |
716 | } | |
60a8948a | 717 | } |
5f5c8ee5 GM |
718 | |
719 | matrix->left_margin_glyphs = left; | |
720 | matrix->right_margin_glyphs = right; | |
721 | } | |
722 | else | |
723 | { | |
724 | /* If MATRIX->pool is null, MATRIX is responsible for managing | |
725 | its own memory. Allocate glyph memory from the heap. */ | |
726 | if (dim.width > matrix->matrix_w | |
727 | || new_rows | |
045dee35 | 728 | || header_line_changed_p |
5f5c8ee5 | 729 | || marginal_areas_changed_p) |
4588ec20 | 730 | { |
5f5c8ee5 GM |
731 | struct glyph_row *row = matrix->rows; |
732 | struct glyph_row *end = row + matrix->rows_allocated; | |
733 | ||
734 | while (row < end) | |
735 | { | |
736 | row->glyphs[LEFT_MARGIN_AREA] | |
737 | = (struct glyph *) xrealloc (row->glyphs[LEFT_MARGIN_AREA], | |
738 | (dim.width | |
739 | * sizeof (struct glyph))); | |
740 | ||
741 | /* The mode line never has marginal areas. */ | |
742 | if (row == matrix->rows + dim.height - 1 | |
045dee35 | 743 | || (row == matrix->rows && matrix->header_line_p)) |
5f5c8ee5 GM |
744 | { |
745 | row->glyphs[TEXT_AREA] | |
746 | = row->glyphs[LEFT_MARGIN_AREA]; | |
747 | row->glyphs[RIGHT_MARGIN_AREA] | |
748 | = row->glyphs[TEXT_AREA] + dim.width; | |
749 | row->glyphs[LAST_AREA] | |
750 | = row->glyphs[RIGHT_MARGIN_AREA]; | |
751 | } | |
752 | else | |
753 | { | |
754 | row->glyphs[TEXT_AREA] | |
755 | = row->glyphs[LEFT_MARGIN_AREA] + left; | |
756 | row->glyphs[RIGHT_MARGIN_AREA] | |
757 | = row->glyphs[TEXT_AREA] + dim.width - left - right; | |
758 | row->glyphs[LAST_AREA] | |
759 | = row->glyphs[LEFT_MARGIN_AREA] + dim.width; | |
760 | } | |
761 | ++row; | |
762 | } | |
4588ec20 JB |
763 | } |
764 | ||
5f5c8ee5 GM |
765 | xassert (left >= 0 && right >= 0); |
766 | matrix->left_margin_glyphs = left; | |
767 | matrix->right_margin_glyphs = right; | |
768 | } | |
769 | ||
770 | /* Number of rows to be used by MATRIX. */ | |
771 | matrix->nrows = dim.height; | |
3ed36514 | 772 | xassert (matrix->nrows >= 0); |
5f5c8ee5 | 773 | |
b7b20fbd | 774 | if (w) |
5f5c8ee5 | 775 | { |
b7b20fbd | 776 | if (matrix == w->current_matrix) |
4588ec20 | 777 | { |
b7b20fbd GM |
778 | /* Mark rows in a current matrix of a window as not having |
779 | valid contents. It's important to not do this for | |
780 | desired matrices. When Emacs starts, it may already be | |
781 | building desired matrices when this function runs. */ | |
782 | if (window_width < 0) | |
783 | window_width = window_box_width (w, -1); | |
784 | ||
785 | /* Optimize the case that only the height has changed (C-x 2, | |
786 | upper window). Invalidate all rows that are no longer part | |
787 | of the window. */ | |
788 | if (!marginal_areas_changed_p | |
73d75a62 GM |
789 | && !header_line_changed_p |
790 | && new_rows == 0 | |
791 | && dim.width == matrix->matrix_w | |
b7b20fbd GM |
792 | && matrix->window_left_x == XFASTINT (w->left) |
793 | && matrix->window_top_y == XFASTINT (w->top) | |
73d75a62 | 794 | && matrix->window_width == window_width) |
b7b20fbd | 795 | { |
dd42b31a GM |
796 | /* Find the last row in the window. */ |
797 | for (i = 0; i < matrix->nrows && matrix->rows[i].enabled_p; ++i) | |
798 | if (MATRIX_ROW_BOTTOM_Y (matrix->rows + i) >= window_height) | |
799 | { | |
26447967 | 800 | ++i; |
dd42b31a GM |
801 | break; |
802 | } | |
b7b20fbd GM |
803 | |
804 | /* Window end is invalid, if inside of the rows that | |
dd42b31a | 805 | are invalidated below. */ |
b7b20fbd GM |
806 | if (INTEGERP (w->window_end_vpos) |
807 | && XFASTINT (w->window_end_vpos) >= i) | |
808 | w->window_end_valid = Qnil; | |
5f5c8ee5 | 809 | |
b7b20fbd GM |
810 | while (i < matrix->nrows) |
811 | matrix->rows[i++].enabled_p = 0; | |
812 | } | |
813 | else | |
814 | { | |
815 | for (i = 0; i < matrix->nrows; ++i) | |
816 | matrix->rows[i].enabled_p = 0; | |
817 | } | |
5f5c8ee5 | 818 | } |
b7b20fbd | 819 | else if (matrix == w->desired_matrix) |
5f5c8ee5 | 820 | { |
b7b20fbd GM |
821 | /* Rows in desired matrices always have to be cleared; |
822 | redisplay expects this is the case when it runs, so it | |
823 | had better be the case when we adjust matrices between | |
824 | redisplays. */ | |
5f5c8ee5 GM |
825 | for (i = 0; i < matrix->nrows; ++i) |
826 | matrix->rows[i].enabled_p = 0; | |
4588ec20 | 827 | } |
4588ec20 | 828 | } |
b7b20fbd | 829 | |
5f5c8ee5 GM |
830 | |
831 | /* Remember last values to be able to optimize frame redraws. */ | |
832 | matrix->matrix_x = x; | |
833 | matrix->matrix_y = y; | |
834 | matrix->matrix_w = dim.width; | |
835 | matrix->matrix_h = dim.height; | |
836 | ||
837 | /* Record the top y location and height of W at the time the matrix | |
838 | was last adjusted. This is used to optimize redisplay above. */ | |
839 | if (w) | |
4588ec20 | 840 | { |
d1c98adf | 841 | matrix->window_left_x = XFASTINT (w->left); |
5f5c8ee5 GM |
842 | matrix->window_top_y = XFASTINT (w->top); |
843 | matrix->window_height = window_height; | |
844 | matrix->window_width = window_width; | |
845 | matrix->window_vscroll = w->vscroll; | |
846 | } | |
847 | } | |
4588ec20 | 848 | |
4588ec20 | 849 | |
5f5c8ee5 GM |
850 | /* Reverse the contents of rows in MATRIX between START and END. The |
851 | contents of the row at END - 1 end up at START, END - 2 at START + | |
852 | 1 etc. This is part of the implementation of rotate_matrix (see | |
853 | below). */ | |
d52bad65 | 854 | |
5f5c8ee5 GM |
855 | static void |
856 | reverse_rows (matrix, start, end) | |
857 | struct glyph_matrix *matrix; | |
858 | int start, end; | |
859 | { | |
860 | int i, j; | |
23b0200c | 861 | |
5f5c8ee5 GM |
862 | for (i = start, j = end - 1; i < j; ++i, --j) |
863 | { | |
864 | /* Non-ISO HP/UX compiler doesn't like auto struct | |
865 | initialization. */ | |
866 | struct glyph_row temp; | |
867 | temp = matrix->rows[i]; | |
868 | matrix->rows[i] = matrix->rows[j]; | |
869 | matrix->rows[j] = temp; | |
870 | } | |
871 | } | |
23b0200c | 872 | |
23b0200c | 873 | |
5f5c8ee5 GM |
874 | /* Rotate the contents of rows in MATRIX in the range FIRST .. LAST - |
875 | 1 by BY positions. BY < 0 means rotate left, i.e. towards lower | |
876 | indices. (Note: this does not copy glyphs, only glyph pointers in | |
877 | row structures are moved around). | |
60a8948a | 878 | |
5f5c8ee5 GM |
879 | The algorithm used for rotating the vector was, I believe, first |
880 | described by Kernighan. See the vector R as consisting of two | |
881 | sub-vectors AB, where A has length BY for BY >= 0. The result | |
882 | after rotating is then BA. Reverse both sub-vectors to get ArBr | |
883 | and reverse the result to get (ArBr)r which is BA. Similar for | |
884 | rotating right. */ | |
885 | ||
886 | void | |
887 | rotate_matrix (matrix, first, last, by) | |
888 | struct glyph_matrix *matrix; | |
889 | int first, last, by; | |
890 | { | |
891 | if (by < 0) | |
892 | { | |
893 | /* Up (rotate left, i.e. towards lower indices). */ | |
894 | by = -by; | |
895 | reverse_rows (matrix, first, first + by); | |
896 | reverse_rows (matrix, first + by, last); | |
897 | reverse_rows (matrix, first, last); | |
898 | } | |
899 | else if (by > 0) | |
900 | { | |
901 | /* Down (rotate right, i.e. towards higher indices). */ | |
902 | reverse_rows (matrix, last - by, last); | |
903 | reverse_rows (matrix, first, last - by); | |
904 | reverse_rows (matrix, first, last); | |
905 | } | |
906 | } | |
907 | ||
908 | ||
909 | /* Increment buffer positions in glyph rows of MATRIX. Do it for rows | |
910 | with indices START <= index < END. Increment positions by DELTA/ | |
911 | DELTA_BYTES. */ | |
912 | ||
913 | void | |
86c11ba1 | 914 | increment_matrix_positions (matrix, start, end, delta, delta_bytes) |
5f5c8ee5 GM |
915 | struct glyph_matrix *matrix; |
916 | int start, end, delta, delta_bytes; | |
917 | { | |
918 | /* Check that START and END are reasonable values. */ | |
919 | xassert (start >= 0 && start <= matrix->nrows); | |
920 | xassert (end >= 0 && end <= matrix->nrows); | |
921 | xassert (start <= end); | |
922 | ||
923 | for (; start < end; ++start) | |
86c11ba1 | 924 | increment_row_positions (matrix->rows + start, delta, delta_bytes); |
5f5c8ee5 GM |
925 | } |
926 | ||
927 | ||
928 | /* Enable a range of rows in glyph matrix MATRIX. START and END are | |
929 | the row indices of the first and last + 1 row to enable. If | |
930 | ENABLED_P is non-zero, enabled_p flags in rows will be set to 1. */ | |
931 | ||
932 | void | |
933 | enable_glyph_matrix_rows (matrix, start, end, enabled_p) | |
934 | struct glyph_matrix *matrix; | |
935 | int start, end; | |
936 | int enabled_p; | |
937 | { | |
3ed36514 GM |
938 | xassert (start <= end); |
939 | xassert (start >= 0 && start < matrix->nrows); | |
940 | xassert (end >= 0 && end <= matrix->nrows); | |
941 | ||
5f5c8ee5 GM |
942 | for (; start < end; ++start) |
943 | matrix->rows[start].enabled_p = enabled_p != 0; | |
944 | } | |
945 | ||
946 | ||
947 | /* Clear MATRIX. | |
948 | ||
949 | This empties all rows in MATRIX by setting the enabled_p flag for | |
950 | all rows of the matrix to zero. The function prepare_desired_row | |
951 | will eventually really clear a row when it sees one with a zero | |
952 | enabled_p flag. | |
953 | ||
954 | Resets update hints to defaults value. The only update hint | |
955 | currently present is the flag MATRIX->no_scrolling_p. */ | |
956 | ||
957 | void | |
958 | clear_glyph_matrix (matrix) | |
959 | struct glyph_matrix *matrix; | |
960 | { | |
961 | if (matrix) | |
962 | { | |
963 | enable_glyph_matrix_rows (matrix, 0, matrix->nrows, 0); | |
964 | matrix->no_scrolling_p = 0; | |
965 | } | |
966 | } | |
967 | ||
968 | ||
969 | /* Shift part of the glyph matrix MATRIX of window W up or down. | |
970 | Increment y-positions in glyph rows between START and END by DY, | |
971 | and recompute their visible height. */ | |
972 | ||
973 | void | |
974 | shift_glyph_matrix (w, matrix, start, end, dy) | |
975 | struct window *w; | |
976 | struct glyph_matrix *matrix; | |
977 | int start, end, dy; | |
978 | { | |
979 | int min_y, max_y; | |
980 | ||
981 | xassert (start <= end); | |
982 | xassert (start >= 0 && start < matrix->nrows); | |
983 | xassert (end >= 0 && end <= matrix->nrows); | |
984 | ||
045dee35 | 985 | min_y = WINDOW_DISPLAY_HEADER_LINE_HEIGHT (w); |
5f5c8ee5 GM |
986 | max_y = WINDOW_DISPLAY_HEIGHT_NO_MODE_LINE (w); |
987 | ||
988 | for (; start < end; ++start) | |
989 | { | |
990 | struct glyph_row *row = &matrix->rows[start]; | |
991 | ||
992 | row->y += dy; | |
d6c747a4 | 993 | row->visible_height = row->height; |
5f5c8ee5 GM |
994 | |
995 | if (row->y < min_y) | |
d6c747a4 GM |
996 | row->visible_height -= min_y - row->y; |
997 | if (row->y + row->height > max_y) | |
998 | row->visible_height -= row->y + row->height - max_y; | |
5f5c8ee5 GM |
999 | } |
1000 | } | |
1001 | ||
1002 | ||
1003 | /* Mark all rows in current matrices of frame F as invalid. Marking | |
1004 | invalid is done by setting enabled_p to zero for all rows in a | |
1005 | current matrix. */ | |
1006 | ||
1007 | void | |
1008 | clear_current_matrices (f) | |
1009 | register struct frame *f; | |
1010 | { | |
1011 | /* Clear frame current matrix, if we have one. */ | |
1012 | if (f->current_matrix) | |
1013 | clear_glyph_matrix (f->current_matrix); | |
1014 | ||
1015 | /* Clear the matrix of the menu bar window, if such a window exists. | |
1016 | The menu bar window is currently used to display menus on X when | |
1017 | no toolkit support is compiled in. */ | |
1018 | if (WINDOWP (f->menu_bar_window)) | |
1019 | clear_glyph_matrix (XWINDOW (f->menu_bar_window)->current_matrix); | |
1020 | ||
9ea173e8 GM |
1021 | /* Clear the matrix of the tool-bar window, if any. */ |
1022 | if (WINDOWP (f->tool_bar_window)) | |
1023 | clear_glyph_matrix (XWINDOW (f->tool_bar_window)->current_matrix); | |
5f5c8ee5 GM |
1024 | |
1025 | /* Clear current window matrices. */ | |
1026 | xassert (WINDOWP (FRAME_ROOT_WINDOW (f))); | |
1027 | clear_window_matrices (XWINDOW (FRAME_ROOT_WINDOW (f)), 0); | |
1028 | } | |
1029 | ||
1030 | ||
1031 | /* Clear out all display lines of F for a coming redisplay. */ | |
1032 | ||
1033 | void | |
1034 | clear_desired_matrices (f) | |
1035 | register struct frame *f; | |
1036 | { | |
1037 | if (f->desired_matrix) | |
1038 | clear_glyph_matrix (f->desired_matrix); | |
1039 | ||
1040 | if (WINDOWP (f->menu_bar_window)) | |
1041 | clear_glyph_matrix (XWINDOW (f->menu_bar_window)->desired_matrix); | |
1042 | ||
9ea173e8 GM |
1043 | if (WINDOWP (f->tool_bar_window)) |
1044 | clear_glyph_matrix (XWINDOW (f->tool_bar_window)->desired_matrix); | |
5f5c8ee5 GM |
1045 | |
1046 | /* Do it for window matrices. */ | |
1047 | xassert (WINDOWP (FRAME_ROOT_WINDOW (f))); | |
1048 | clear_window_matrices (XWINDOW (FRAME_ROOT_WINDOW (f)), 1); | |
1049 | } | |
1050 | ||
1051 | ||
1052 | /* Clear matrices in window tree rooted in W. If DESIRED_P is | |
1053 | non-zero clear desired matrices, otherwise clear current matrices. */ | |
1054 | ||
1055 | static void | |
1056 | clear_window_matrices (w, desired_p) | |
1057 | struct window *w; | |
1058 | int desired_p; | |
1059 | { | |
1060 | while (w) | |
1061 | { | |
1062 | if (!NILP (w->hchild)) | |
1063 | { | |
1064 | xassert (WINDOWP (w->hchild)); | |
1065 | clear_window_matrices (XWINDOW (w->hchild), desired_p); | |
1066 | } | |
1067 | else if (!NILP (w->vchild)) | |
1068 | { | |
1069 | xassert (WINDOWP (w->vchild)); | |
1070 | clear_window_matrices (XWINDOW (w->vchild), desired_p); | |
1071 | } | |
1072 | else | |
1073 | { | |
1074 | if (desired_p) | |
1075 | clear_glyph_matrix (w->desired_matrix); | |
1076 | else | |
1077 | { | |
1078 | clear_glyph_matrix (w->current_matrix); | |
1079 | w->window_end_valid = Qnil; | |
1080 | } | |
1081 | } | |
1082 | ||
1083 | w = NILP (w->next) ? 0 : XWINDOW (w->next); | |
1084 | } | |
1085 | } | |
1086 | ||
1087 | ||
1088 | \f | |
1089 | /*********************************************************************** | |
1090 | Glyph Rows | |
1091 | ||
1092 | See dispextern.h for an overall explanation of glyph rows. | |
1093 | ***********************************************************************/ | |
1094 | ||
1095 | /* Clear glyph row ROW. Do it in a way that makes it robust against | |
1096 | changes in the glyph_row structure, i.e. addition or removal of | |
1097 | structure members. */ | |
1098 | ||
2cca872d KH |
1099 | static struct glyph_row null_row; |
1100 | ||
5f5c8ee5 GM |
1101 | void |
1102 | clear_glyph_row (row) | |
1103 | struct glyph_row *row; | |
1104 | { | |
1105 | struct glyph *p[1 + LAST_AREA]; | |
5f5c8ee5 GM |
1106 | |
1107 | /* Save pointers. */ | |
1108 | p[LEFT_MARGIN_AREA] = row->glyphs[LEFT_MARGIN_AREA]; | |
1109 | p[TEXT_AREA] = row->glyphs[TEXT_AREA]; | |
1110 | p[RIGHT_MARGIN_AREA] = row->glyphs[RIGHT_MARGIN_AREA]; | |
1111 | p[LAST_AREA] = row->glyphs[LAST_AREA]; | |
1112 | ||
1113 | /* Clear. */ | |
1114 | *row = null_row; | |
1115 | ||
1116 | /* Restore pointers. */ | |
1117 | row->glyphs[LEFT_MARGIN_AREA] = p[LEFT_MARGIN_AREA]; | |
1118 | row->glyphs[TEXT_AREA] = p[TEXT_AREA]; | |
1119 | row->glyphs[RIGHT_MARGIN_AREA] = p[RIGHT_MARGIN_AREA]; | |
1120 | row->glyphs[LAST_AREA] = p[LAST_AREA]; | |
45560b1a GM |
1121 | |
1122 | #if 0 /* At some point, some bit-fields of struct glyph were not set, | |
1123 | which made glyphs unequal when compared with GLYPH_EQUAL_P. | |
1124 | Redisplay outputs such glyphs, and flickering effects were | |
1125 | the result. This also depended on the contents of memory | |
1126 | returned by xmalloc. If flickering happens again, activate | |
1127 | the code below If the flickering is gone with that, chances | |
1128 | are that the flickering has the same reason as here. */ | |
1129 | bzero (p[0], (char *) p[LAST_AREA] - (char *) p[0]); | |
1130 | #endif | |
5f5c8ee5 GM |
1131 | } |
1132 | ||
1133 | ||
1134 | /* Make ROW an empty, enabled row of canonical character height, | |
1135 | in window W starting at y-position Y. */ | |
1136 | ||
1137 | void | |
1138 | blank_row (w, row, y) | |
1139 | struct window *w; | |
1140 | struct glyph_row *row; | |
1141 | int y; | |
1142 | { | |
1143 | int min_y, max_y; | |
1144 | ||
045dee35 | 1145 | min_y = WINDOW_DISPLAY_HEADER_LINE_HEIGHT (w); |
5f5c8ee5 GM |
1146 | max_y = WINDOW_DISPLAY_HEIGHT_NO_MODE_LINE (w); |
1147 | ||
1148 | clear_glyph_row (row); | |
1149 | row->y = y; | |
408f5064 GM |
1150 | row->ascent = row->phys_ascent = 0; |
1151 | row->height = row->phys_height = CANON_Y_UNIT (XFRAME (w->frame)); | |
d6c747a4 GM |
1152 | row->visible_height = row->height; |
1153 | ||
5f5c8ee5 | 1154 | if (row->y < min_y) |
d6c747a4 GM |
1155 | row->visible_height -= min_y - row->y; |
1156 | if (row->y + row->height > max_y) | |
1157 | row->visible_height -= row->y + row->height - max_y; | |
5f5c8ee5 GM |
1158 | |
1159 | row->enabled_p = 1; | |
1160 | } | |
1161 | ||
1162 | ||
1163 | /* Increment buffer positions in glyph row ROW. DELTA and DELTA_BYTES | |
1164 | are the amounts by which to change positions. Note that the first | |
1165 | glyph of the text area of a row can have a buffer position even if | |
1166 | the used count of the text area is zero. Such rows display line | |
1167 | ends. */ | |
1168 | ||
1169 | void | |
86c11ba1 | 1170 | increment_row_positions (row, delta, delta_bytes) |
5f5c8ee5 GM |
1171 | struct glyph_row *row; |
1172 | int delta, delta_bytes; | |
1173 | { | |
1174 | int area, i; | |
1175 | ||
1176 | /* Increment start and end positions. */ | |
1177 | MATRIX_ROW_START_CHARPOS (row) += delta; | |
1178 | MATRIX_ROW_START_BYTEPOS (row) += delta_bytes; | |
1179 | MATRIX_ROW_END_CHARPOS (row) += delta; | |
1180 | MATRIX_ROW_END_BYTEPOS (row) += delta_bytes; | |
1181 | ||
1182 | /* Increment positions in glyphs. */ | |
1183 | for (area = 0; area < LAST_AREA; ++area) | |
1184 | for (i = 0; i < row->used[area]; ++i) | |
1185 | if (BUFFERP (row->glyphs[area][i].object) | |
1186 | && row->glyphs[area][i].charpos > 0) | |
1187 | row->glyphs[area][i].charpos += delta; | |
1188 | ||
1189 | /* Capture the case of rows displaying a line end. */ | |
1190 | if (row->used[TEXT_AREA] == 0 | |
1191 | && MATRIX_ROW_DISPLAYS_TEXT_P (row)) | |
1192 | row->glyphs[TEXT_AREA]->charpos += delta; | |
1193 | } | |
1194 | ||
1195 | ||
9af3e742 | 1196 | #if 0 |
5f5c8ee5 GM |
1197 | /* Swap glyphs between two glyph rows A and B. This exchanges glyph |
1198 | contents, i.e. glyph structure contents are exchanged between A and | |
1199 | B without changing glyph pointers in A and B. */ | |
1200 | ||
1201 | static void | |
1202 | swap_glyphs_in_rows (a, b) | |
1203 | struct glyph_row *a, *b; | |
1204 | { | |
1205 | int area; | |
1206 | ||
1207 | for (area = 0; area < LAST_AREA; ++area) | |
1208 | { | |
1209 | /* Number of glyphs to swap. */ | |
1210 | int max_used = max (a->used[area], b->used[area]); | |
1211 | ||
1212 | /* Start of glyphs in area of row A. */ | |
1213 | struct glyph *glyph_a = a->glyphs[area]; | |
1214 | ||
1215 | /* End + 1 of glyphs in area of row A. */ | |
1216 | struct glyph *glyph_a_end = a->glyphs[max_used]; | |
1217 | ||
1218 | /* Start of glyphs in area of row B. */ | |
1219 | struct glyph *glyph_b = b->glyphs[area]; | |
1220 | ||
1221 | while (glyph_a < glyph_a_end) | |
1222 | { | |
1223 | /* Non-ISO HP/UX compiler doesn't like auto struct | |
1224 | initialization. */ | |
1225 | struct glyph temp; | |
1226 | temp = *glyph_a; | |
1227 | *glyph_a = *glyph_b; | |
1228 | *glyph_b = temp; | |
1229 | ++glyph_a; | |
1230 | ++glyph_b; | |
1231 | } | |
1232 | } | |
1233 | } | |
1234 | ||
9af3e742 | 1235 | #endif /* 0 */ |
5f5c8ee5 GM |
1236 | |
1237 | /* Exchange pointers to glyph memory between glyph rows A and B. */ | |
1238 | ||
1239 | static INLINE void | |
1240 | swap_glyph_pointers (a, b) | |
1241 | struct glyph_row *a, *b; | |
1242 | { | |
1243 | int i; | |
1244 | for (i = 0; i < LAST_AREA + 1; ++i) | |
1245 | { | |
1246 | struct glyph *temp = a->glyphs[i]; | |
1247 | a->glyphs[i] = b->glyphs[i]; | |
1248 | b->glyphs[i] = temp; | |
1249 | } | |
1250 | } | |
1251 | ||
1252 | ||
1253 | /* Copy glyph row structure FROM to glyph row structure TO, except | |
1254 | that glyph pointers in the structures are left unchanged. */ | |
1255 | ||
1256 | INLINE void | |
1257 | copy_row_except_pointers (to, from) | |
1258 | struct glyph_row *to, *from; | |
1259 | { | |
1260 | struct glyph *pointers[1 + LAST_AREA]; | |
1261 | ||
1262 | /* Save glyph pointers of TO. */ | |
1263 | bcopy (to->glyphs, pointers, sizeof to->glyphs); | |
1264 | ||
1265 | /* Do a structure assignment. */ | |
1266 | *to = *from; | |
1267 | ||
1268 | /* Restore original pointers of TO. */ | |
1269 | bcopy (pointers, to->glyphs, sizeof to->glyphs); | |
1270 | } | |
1271 | ||
1272 | ||
1273 | /* Copy contents of glyph row FROM to glyph row TO. Glyph pointers in | |
1274 | TO and FROM are left unchanged. Glyph contents are copied from the | |
1275 | glyph memory of FROM to the glyph memory of TO. Increment buffer | |
1276 | positions in row TO by DELTA/ DELTA_BYTES. */ | |
1277 | ||
1278 | void | |
1279 | copy_glyph_row_contents (to, from, delta, delta_bytes) | |
1280 | struct glyph_row *to, *from; | |
1281 | int delta, delta_bytes; | |
1282 | { | |
1283 | int area; | |
1284 | ||
1285 | /* This is like a structure assignment TO = FROM, except that | |
1286 | glyph pointers in the rows are left unchanged. */ | |
1287 | copy_row_except_pointers (to, from); | |
1288 | ||
1289 | /* Copy glyphs from FROM to TO. */ | |
1290 | for (area = 0; area < LAST_AREA; ++area) | |
1291 | if (from->used[area]) | |
1292 | bcopy (from->glyphs[area], to->glyphs[area], | |
1293 | from->used[area] * sizeof (struct glyph)); | |
1294 | ||
1295 | /* Increment buffer positions in TO by DELTA. */ | |
86c11ba1 | 1296 | increment_row_positions (to, delta, delta_bytes); |
5f5c8ee5 GM |
1297 | } |
1298 | ||
1299 | ||
1300 | /* Assign glyph row FROM to glyph row TO. This works like a structure | |
1301 | assignment TO = FROM, except that glyph pointers are not copied but | |
1302 | exchanged between TO and FROM. Pointers must be exchanged to avoid | |
1303 | a memory leak. */ | |
1304 | ||
1305 | static INLINE void | |
1306 | assign_row (to, from) | |
1307 | struct glyph_row *to, *from; | |
1308 | { | |
1309 | swap_glyph_pointers (to, from); | |
1310 | copy_row_except_pointers (to, from); | |
1311 | } | |
1312 | ||
1313 | ||
1314 | /* Test whether the glyph memory of the glyph row WINDOW_ROW, which is | |
1315 | a row in a window matrix, is a slice of the glyph memory of the | |
1316 | glyph row FRAME_ROW which is a row in a frame glyph matrix. Value | |
1317 | is non-zero if the glyph memory of WINDOW_ROW is part of the glyph | |
1318 | memory of FRAME_ROW. */ | |
1319 | ||
2d5912c1 | 1320 | #if GLYPH_DEBUG |
9339e87f | 1321 | |
5f5c8ee5 GM |
1322 | static int |
1323 | glyph_row_slice_p (window_row, frame_row) | |
1324 | struct glyph_row *window_row, *frame_row; | |
1325 | { | |
1326 | struct glyph *window_glyph_start = window_row->glyphs[0]; | |
1327 | struct glyph *frame_glyph_start = frame_row->glyphs[0]; | |
1328 | struct glyph *frame_glyph_end = frame_row->glyphs[LAST_AREA]; | |
1329 | ||
1330 | return (frame_glyph_start <= window_glyph_start | |
1331 | && window_glyph_start < frame_glyph_end); | |
1332 | } | |
1333 | ||
9339e87f | 1334 | #endif /* GLYPH_DEBUG */ |
5f5c8ee5 | 1335 | |
9af3e742 GM |
1336 | #if 0 |
1337 | ||
5f5c8ee5 GM |
1338 | /* Find the row in the window glyph matrix WINDOW_MATRIX being a slice |
1339 | of ROW in the frame matrix FRAME_MATRIX. Value is null if no row | |
1340 | in WINDOW_MATRIX is found satisfying the condition. */ | |
1341 | ||
1342 | static struct glyph_row * | |
1343 | find_glyph_row_slice (window_matrix, frame_matrix, row) | |
1344 | struct glyph_matrix *window_matrix, *frame_matrix; | |
1345 | int row; | |
1346 | { | |
1347 | int i; | |
1348 | ||
1349 | xassert (row >= 0 && row < frame_matrix->nrows); | |
1350 | ||
1351 | for (i = 0; i < window_matrix->nrows; ++i) | |
1352 | if (glyph_row_slice_p (window_matrix->rows + i, | |
1353 | frame_matrix->rows + row)) | |
1354 | break; | |
1355 | ||
1356 | return i < window_matrix->nrows ? window_matrix->rows + i : 0; | |
1357 | } | |
1358 | ||
9af3e742 | 1359 | #endif /* 0 */ |
5f5c8ee5 GM |
1360 | |
1361 | /* Prepare ROW for display. Desired rows are cleared lazily, | |
1362 | i.e. they are only marked as to be cleared by setting their | |
1363 | enabled_p flag to zero. When a row is to be displayed, a prior | |
1364 | call to this function really clears it. */ | |
1365 | ||
1366 | void | |
1367 | prepare_desired_row (row) | |
1368 | struct glyph_row *row; | |
1369 | { | |
1370 | if (!row->enabled_p) | |
1371 | { | |
1372 | clear_glyph_row (row); | |
1373 | row->enabled_p = 1; | |
1374 | } | |
1375 | } | |
1376 | ||
1377 | ||
1378 | /* Return a hash code for glyph row ROW. */ | |
1379 | ||
1380 | int | |
1381 | line_hash_code (row) | |
1382 | struct glyph_row *row; | |
1383 | { | |
1384 | int hash = 0; | |
1385 | ||
1386 | if (row->enabled_p) | |
1387 | { | |
4cecaab8 MB |
1388 | struct glyph *glyph = row->glyphs[TEXT_AREA]; |
1389 | struct glyph *end = glyph + row->used[TEXT_AREA]; | |
1390 | ||
1391 | while (glyph < end) | |
1392 | { | |
1393 | int c = glyph->u.ch; | |
1394 | int face_id = glyph->face_id; | |
1395 | if (must_write_spaces) | |
1396 | c -= SPACEGLYPH; | |
1397 | hash = (((hash << 4) + (hash >> 24)) & 0x0fffffff) + c; | |
1398 | hash = (((hash << 4) + (hash >> 24)) & 0x0fffffff) + face_id; | |
1399 | ++glyph; | |
1400 | } | |
5f5c8ee5 | 1401 | |
4cecaab8 MB |
1402 | if (hash == 0) |
1403 | hash = 1; | |
5f5c8ee5 GM |
1404 | } |
1405 | ||
1406 | return hash; | |
1407 | } | |
1408 | ||
1409 | ||
1410 | /* Return the cost of drawing line VPOS In MATRIX. The cost equals | |
1411 | the number of characters in the line. If must_write_spaces is | |
1412 | zero, leading and trailing spaces are ignored. */ | |
1413 | ||
1414 | static unsigned int | |
1415 | line_draw_cost (matrix, vpos) | |
1416 | struct glyph_matrix *matrix; | |
1417 | int vpos; | |
1418 | { | |
1419 | struct glyph_row *row = matrix->rows + vpos; | |
1420 | struct glyph *beg = row->glyphs[TEXT_AREA]; | |
1421 | struct glyph *end = beg + row->used[TEXT_AREA]; | |
1422 | int len; | |
1423 | Lisp_Object *glyph_table_base = GLYPH_TABLE_BASE; | |
1424 | int glyph_table_len = GLYPH_TABLE_LENGTH; | |
1425 | ||
1426 | /* Ignore trailing and leading spaces if we can. */ | |
1427 | if (!must_write_spaces) | |
1428 | { | |
1429 | /* Skip from the end over trailing spaces. */ | |
2b4ec4d7 | 1430 | while (end > beg && CHAR_GLYPH_SPACE_P (*(end - 1))) |
5f5c8ee5 GM |
1431 | --end; |
1432 | ||
1433 | /* All blank line. */ | |
1434 | if (end == beg) | |
1435 | return 0; | |
1436 | ||
1437 | /* Skip over leading spaces. */ | |
1438 | while (CHAR_GLYPH_SPACE_P (*beg)) | |
1439 | ++beg; | |
1440 | } | |
1441 | ||
1442 | /* If we don't have a glyph-table, each glyph is one character, | |
1443 | so return the number of glyphs. */ | |
1444 | if (glyph_table_base == 0) | |
1445 | len = end - beg; | |
1446 | else | |
1447 | { | |
1448 | /* Otherwise, scan the glyphs and accumulate their total length | |
1449 | in LEN. */ | |
1450 | len = 0; | |
1451 | while (beg < end) | |
1452 | { | |
1453 | GLYPH g = GLYPH_FROM_CHAR_GLYPH (*beg); | |
1454 | ||
42186983 KH |
1455 | if (g < 0 |
1456 | || GLYPH_SIMPLE_P (glyph_table_base, glyph_table_len, g)) | |
5f5c8ee5 GM |
1457 | len += 1; |
1458 | else | |
1459 | len += GLYPH_LENGTH (glyph_table_base, g); | |
1460 | ||
1461 | ++beg; | |
1462 | } | |
1463 | } | |
1464 | ||
1465 | return len; | |
1466 | } | |
1467 | ||
1468 | ||
1469 | /* Test two glyph rows A and B for equality. Value is non-zero if A | |
1470 | and B have equal contents. W is the window to which the glyphs | |
1471 | rows A and B belong. It is needed here to test for partial row | |
e4e0bee9 GM |
1472 | visibility. MOUSE_FACE_P non-zero means compare the mouse_face_p |
1473 | flags of A and B, too. */ | |
5f5c8ee5 GM |
1474 | |
1475 | static INLINE int | |
e4e0bee9 | 1476 | row_equal_p (w, a, b, mouse_face_p) |
5f5c8ee5 GM |
1477 | struct window *w; |
1478 | struct glyph_row *a, *b; | |
e4e0bee9 | 1479 | int mouse_face_p; |
5f5c8ee5 GM |
1480 | { |
1481 | if (a == b) | |
1482 | return 1; | |
1483 | else if (a->hash != b->hash) | |
1484 | return 0; | |
1485 | else | |
1486 | { | |
1487 | struct glyph *a_glyph, *b_glyph, *a_end; | |
1488 | int area; | |
1489 | ||
e4e0bee9 GM |
1490 | if (mouse_face_p && a->mouse_face_p != b->mouse_face_p) |
1491 | return 0; | |
1492 | ||
5f5c8ee5 GM |
1493 | /* Compare glyphs. */ |
1494 | for (area = LEFT_MARGIN_AREA; area < LAST_AREA; ++area) | |
1495 | { | |
1496 | if (a->used[area] != b->used[area]) | |
1497 | return 0; | |
1498 | ||
1499 | a_glyph = a->glyphs[area]; | |
1500 | a_end = a_glyph + a->used[area]; | |
1501 | b_glyph = b->glyphs[area]; | |
1502 | ||
1503 | while (a_glyph < a_end | |
1504 | && GLYPH_EQUAL_P (a_glyph, b_glyph)) | |
1505 | ++a_glyph, ++b_glyph; | |
1506 | ||
1507 | if (a_glyph != a_end) | |
1508 | return 0; | |
1509 | } | |
1510 | ||
1511 | if (a->truncated_on_left_p != b->truncated_on_left_p | |
5f5c8ee5 GM |
1512 | || a->fill_line_p != b->fill_line_p |
1513 | || a->truncated_on_right_p != b->truncated_on_right_p | |
1514 | || a->overlay_arrow_p != b->overlay_arrow_p | |
1515 | || a->continued_p != b->continued_p | |
1516 | || a->indicate_empty_line_p != b->indicate_empty_line_p | |
408f5064 | 1517 | || a->overlapped_p != b->overlapped_p |
5f5c8ee5 GM |
1518 | || (MATRIX_ROW_CONTINUATION_LINE_P (a) |
1519 | != MATRIX_ROW_CONTINUATION_LINE_P (b)) | |
1520 | /* Different partially visible characters on left margin. */ | |
1521 | || a->x != b->x | |
1522 | /* Different height. */ | |
1523 | || a->ascent != b->ascent | |
408f5064 GM |
1524 | || a->phys_ascent != b->phys_ascent |
1525 | || a->phys_height != b->phys_height | |
5f5c8ee5 GM |
1526 | || a->visible_height != b->visible_height) |
1527 | return 0; | |
1528 | } | |
1529 | ||
1530 | return 1; | |
1531 | } | |
1532 | ||
1533 | ||
1534 | \f | |
1535 | /*********************************************************************** | |
1536 | Glyph Pool | |
1537 | ||
1538 | See dispextern.h for an overall explanation of glyph pools. | |
1539 | ***********************************************************************/ | |
1540 | ||
1541 | /* Allocate a glyph_pool structure. The structure returned is | |
1542 | initialized with zeros. The global variable glyph_pool_count is | |
1543 | incremented for each pool allocated. */ | |
1544 | ||
1545 | static struct glyph_pool * | |
1546 | new_glyph_pool () | |
1547 | { | |
1548 | struct glyph_pool *result; | |
1549 | ||
1550 | /* Allocate a new glyph_pool and clear it. */ | |
1551 | result = (struct glyph_pool *) xmalloc (sizeof *result); | |
1552 | bzero (result, sizeof *result); | |
1553 | ||
1554 | /* For memory leak and double deletion checking. */ | |
1555 | ++glyph_pool_count; | |
1556 | ||
1557 | return result; | |
1558 | } | |
1559 | ||
1560 | ||
1561 | /* Free a glyph_pool structure POOL. The function may be called with | |
1562 | a null POOL pointer. The global variable glyph_pool_count is | |
1563 | decremented with every pool structure freed. If this count gets | |
1564 | negative, more structures were freed than allocated, i.e. one | |
1565 | structure must have been freed more than once or a bogus pointer | |
1566 | was passed to free_glyph_pool. */ | |
1567 | ||
1568 | static void | |
1569 | free_glyph_pool (pool) | |
1570 | struct glyph_pool *pool; | |
1571 | { | |
1572 | if (pool) | |
1573 | { | |
1574 | /* More freed than allocated? */ | |
1575 | --glyph_pool_count; | |
1576 | xassert (glyph_pool_count >= 0); | |
1577 | ||
1578 | xfree (pool->glyphs); | |
1579 | xfree (pool); | |
1580 | } | |
1581 | } | |
1582 | ||
1583 | ||
1584 | /* Enlarge a glyph pool POOL. MATRIX_DIM gives the number of rows and | |
1585 | columns we need. This function never shrinks a pool. The only | |
1586 | case in which this would make sense, would be when a frame's size | |
1587 | is changed from a large value to a smaller one. But, if someone | |
1588 | does it once, we can expect that he will do it again. | |
1589 | ||
1590 | Value is non-zero if the pool changed in a way which makes | |
1591 | re-adjusting window glyph matrices necessary. */ | |
1592 | ||
1593 | static int | |
1594 | realloc_glyph_pool (pool, matrix_dim) | |
1595 | struct glyph_pool *pool; | |
1596 | struct dim matrix_dim; | |
1597 | { | |
1598 | int needed; | |
1599 | int changed_p; | |
1600 | ||
1601 | changed_p = (pool->glyphs == 0 | |
1602 | || matrix_dim.height != pool->nrows | |
1603 | || matrix_dim.width != pool->ncolumns); | |
1604 | ||
1605 | /* Enlarge the glyph pool. */ | |
1606 | needed = matrix_dim.width * matrix_dim.height; | |
1607 | if (needed > pool->nglyphs) | |
1608 | { | |
1609 | int size = needed * sizeof (struct glyph); | |
1610 | ||
1611 | if (pool->glyphs) | |
1612 | pool->glyphs = (struct glyph *) xrealloc (pool->glyphs, size); | |
1613 | else | |
1614 | { | |
1615 | pool->glyphs = (struct glyph *) xmalloc (size); | |
1616 | bzero (pool->glyphs, size); | |
1617 | } | |
1618 | ||
1619 | pool->nglyphs = needed; | |
1620 | } | |
1621 | ||
1622 | /* Remember the number of rows and columns because (a) we use then | |
1623 | to do sanity checks, and (b) the number of columns determines | |
1624 | where rows in the frame matrix start---this must be available to | |
1625 | determine pointers to rows of window sub-matrices. */ | |
1626 | pool->nrows = matrix_dim.height; | |
1627 | pool->ncolumns = matrix_dim.width; | |
1628 | ||
1629 | return changed_p; | |
1630 | } | |
1631 | ||
1632 | ||
1633 | \f | |
1634 | /*********************************************************************** | |
1635 | Debug Code | |
1636 | ***********************************************************************/ | |
1637 | ||
1638 | #if GLYPH_DEBUG | |
1639 | ||
a13396c9 GM |
1640 | |
1641 | /* Flush standard output. This is sometimes useful to call from | |
1642 | the debugger. */ | |
1643 | ||
1644 | void | |
1645 | flush_stdout () | |
1646 | { | |
1647 | fflush (stdout); | |
1648 | } | |
1649 | ||
1650 | ||
5f5c8ee5 GM |
1651 | /* Check that no glyph pointers have been lost in MATRIX. If a |
1652 | pointer has been lost, e.g. by using a structure assignment between | |
1653 | rows, at least one pointer must occur more than once in the rows of | |
1654 | MATRIX. */ | |
1655 | ||
1656 | void | |
1657 | check_matrix_pointer_lossage (matrix) | |
1658 | struct glyph_matrix *matrix; | |
1659 | { | |
1660 | int i, j; | |
1661 | ||
1662 | for (i = 0; i < matrix->nrows; ++i) | |
1663 | for (j = 0; j < matrix->nrows; ++j) | |
1664 | xassert (i == j | |
1665 | || (matrix->rows[i].glyphs[TEXT_AREA] | |
1666 | != matrix->rows[j].glyphs[TEXT_AREA])); | |
1667 | } | |
1668 | ||
1669 | ||
1670 | /* Get a pointer to glyph row ROW in MATRIX, with bounds checks. */ | |
1671 | ||
1672 | struct glyph_row * | |
1673 | matrix_row (matrix, row) | |
1674 | struct glyph_matrix *matrix; | |
1675 | int row; | |
1676 | { | |
1677 | xassert (matrix && matrix->rows); | |
1678 | xassert (row >= 0 && row < matrix->nrows); | |
1679 | ||
1680 | /* That's really too slow for normal testing because this function | |
1681 | is called almost everywhere. Although---it's still astonishingly | |
1682 | fast, so it is valuable to have for debugging purposes. */ | |
1683 | #if 0 | |
1684 | check_matrix_pointer_lossage (matrix); | |
1685 | #endif | |
1686 | ||
1687 | return matrix->rows + row; | |
1688 | } | |
1689 | ||
1690 | ||
1691 | #if 0 /* This function makes invalid assumptions when text is | |
1692 | partially invisible. But it might come handy for debugging | |
1693 | nevertheless. */ | |
1694 | ||
1695 | /* Check invariants that must hold for an up to date current matrix of | |
1696 | window W. */ | |
1697 | ||
1698 | static void | |
1699 | check_matrix_invariants (w) | |
1700 | struct window *w; | |
1701 | { | |
1702 | struct glyph_matrix *matrix = w->current_matrix; | |
1703 | int yb = window_text_bottom_y (w); | |
1704 | struct glyph_row *row = matrix->rows; | |
1705 | struct glyph_row *last_text_row = NULL; | |
1706 | struct buffer *saved = current_buffer; | |
1707 | struct buffer *buffer = XBUFFER (w->buffer); | |
1708 | int c; | |
1709 | ||
1710 | /* This can sometimes happen for a fresh window. */ | |
1711 | if (matrix->nrows < 2) | |
1712 | return; | |
1713 | ||
1714 | set_buffer_temp (buffer); | |
1715 | ||
1716 | /* Note: last row is always reserved for the mode line. */ | |
1717 | while (MATRIX_ROW_DISPLAYS_TEXT_P (row) | |
1718 | && MATRIX_ROW_BOTTOM_Y (row) < yb) | |
1719 | { | |
1720 | struct glyph_row *next = row + 1; | |
1721 | ||
1722 | if (MATRIX_ROW_DISPLAYS_TEXT_P (row)) | |
1723 | last_text_row = row; | |
1724 | ||
1725 | /* Check that character and byte positions are in sync. */ | |
1726 | xassert (MATRIX_ROW_START_BYTEPOS (row) | |
1727 | == CHAR_TO_BYTE (MATRIX_ROW_START_CHARPOS (row))); | |
1728 | ||
1729 | /* CHAR_TO_BYTE aborts when invoked for a position > Z. We can | |
1730 | have such a position temporarily in case of a minibuffer | |
1731 | displaying something like `[Sole completion]' at its end. */ | |
1732 | if (MATRIX_ROW_END_CHARPOS (row) < BUF_ZV (current_buffer)) | |
1733 | xassert (MATRIX_ROW_END_BYTEPOS (row) | |
1734 | == CHAR_TO_BYTE (MATRIX_ROW_END_CHARPOS (row))); | |
1735 | ||
1736 | /* Check that end position of `row' is equal to start position | |
1737 | of next row. */ | |
1738 | if (next->enabled_p && MATRIX_ROW_DISPLAYS_TEXT_P (next)) | |
1739 | { | |
1740 | xassert (MATRIX_ROW_END_CHARPOS (row) | |
1741 | == MATRIX_ROW_START_CHARPOS (next)); | |
1742 | xassert (MATRIX_ROW_END_BYTEPOS (row) | |
1743 | == MATRIX_ROW_START_BYTEPOS (next)); | |
1744 | } | |
1745 | row = next; | |
1746 | } | |
1747 | ||
1748 | xassert (w->current_matrix->nrows == w->desired_matrix->nrows); | |
1749 | xassert (w->desired_matrix->rows != NULL); | |
1750 | set_buffer_temp (saved); | |
1751 | } | |
1752 | ||
1753 | #endif /* 0 */ | |
1754 | ||
1755 | #endif /* GLYPH_DEBUG != 0 */ | |
1756 | ||
1757 | ||
1758 | \f | |
1759 | /********************************************************************** | |
1760 | Allocating/ Adjusting Glyph Matrices | |
1761 | **********************************************************************/ | |
1762 | ||
1763 | /* Allocate glyph matrices over a window tree for a frame-based | |
1764 | redisplay | |
1765 | ||
1766 | X and Y are column/row within the frame glyph matrix where | |
1767 | sub-matrices for the window tree rooted at WINDOW must be | |
1768 | allocated. CH_DIM contains the dimensions of the smallest | |
1769 | character that could be used during display. DIM_ONLY_P non-zero | |
1770 | means that the caller of this function is only interested in the | |
1771 | result matrix dimension, and matrix adjustments should not be | |
1772 | performed. | |
1773 | ||
1774 | The function returns the total width/height of the sub-matrices of | |
1775 | the window tree. If called on a frame root window, the computation | |
1776 | will take the mini-buffer window into account. | |
1777 | ||
1778 | *WINDOW_CHANGE_FLAGS is set to a bit mask with bits | |
1779 | ||
1780 | NEW_LEAF_MATRIX set if any window in the tree did not have a | |
1781 | glyph matrices yet, and | |
1782 | ||
1783 | CHANGED_LEAF_MATRIX set if the dimension or location of a matrix of | |
1784 | any window in the tree will be changed or have been changed (see | |
1785 | DIM_ONLY_P). | |
1786 | ||
1787 | *WINDOW_CHANGE_FLAGS must be initialized by the caller of this | |
1788 | function. | |
1789 | ||
1790 | Windows are arranged into chains of windows on the same level | |
1791 | through the next fields of window structures. Such a level can be | |
1792 | either a sequence of horizontally adjacent windows from left to | |
1793 | right, or a sequence of vertically adjacent windows from top to | |
1794 | bottom. Each window in a horizontal sequence can be either a leaf | |
1795 | window or a vertical sequence; a window in a vertical sequence can | |
1796 | be either a leaf or a horizontal sequence. All windows in a | |
1797 | horizontal sequence have the same height, and all windows in a | |
1798 | vertical sequence have the same width. | |
1799 | ||
1800 | This function uses, for historical reasons, a more general | |
1801 | algorithm to determine glyph matrix dimensions that would be | |
1802 | necessary. | |
1803 | ||
1804 | The matrix height of a horizontal sequence is determined by the | |
1805 | maximum height of any matrix in the sequence. The matrix width of | |
1806 | a horizontal sequence is computed by adding up matrix widths of | |
1807 | windows in the sequence. | |
1808 | ||
1809 | |<------- result width ------->| | |
1810 | +---------+----------+---------+ --- | |
1811 | | | | | | | |
1812 | | | | | | |
1813 | +---------+ | | result height | |
1814 | | +---------+ | |
1815 | | | | | |
1816 | +----------+ --- | |
1817 | ||
1818 | The matrix width of a vertical sequence is the maximum matrix width | |
1819 | of any window in the sequence. Its height is computed by adding up | |
1820 | matrix heights of windows in the sequence. | |
1821 | ||
1822 | |<---- result width -->| | |
1823 | +---------+ --- | |
1824 | | | | | |
1825 | | | | | |
1826 | +---------+--+ | | |
1827 | | | | | |
1828 | | | result height | |
1829 | | | | |
1830 | +------------+---------+ | | |
1831 | | | | | |
1832 | | | | | |
1833 | +------------+---------+ --- */ | |
1834 | ||
1835 | /* Bit indicating that a new matrix will be allocated or has been | |
1836 | allocated. */ | |
1837 | ||
1838 | #define NEW_LEAF_MATRIX (1 << 0) | |
1839 | ||
1840 | /* Bit indicating that a matrix will or has changed its location or | |
1841 | size. */ | |
1842 | ||
1843 | #define CHANGED_LEAF_MATRIX (1 << 1) | |
1844 | ||
1845 | static struct dim | |
5d3cc43c GM |
1846 | allocate_matrices_for_frame_redisplay (window, x, y, dim_only_p, |
1847 | window_change_flags) | |
5f5c8ee5 GM |
1848 | Lisp_Object window; |
1849 | int x, y; | |
5f5c8ee5 GM |
1850 | int dim_only_p; |
1851 | int *window_change_flags; | |
1852 | { | |
1853 | struct frame *f = XFRAME (WINDOW_FRAME (XWINDOW (window))); | |
1854 | int x0 = x, y0 = y; | |
1855 | int wmax = 0, hmax = 0; | |
1856 | struct dim total; | |
1857 | struct dim dim; | |
1858 | struct window *w; | |
1859 | int in_horz_combination_p; | |
1860 | ||
1861 | /* What combination is WINDOW part of? Compute this once since the | |
1862 | result is the same for all windows in the `next' chain. The | |
1863 | special case of a root window (parent equal to nil) is treated | |
1864 | like a vertical combination because a root window's `next' | |
1865 | points to the mini-buffer window, if any, which is arranged | |
1866 | vertically below other windows. */ | |
1867 | in_horz_combination_p | |
1868 | = (!NILP (XWINDOW (window)->parent) | |
1869 | && !NILP (XWINDOW (XWINDOW (window)->parent)->hchild)); | |
1870 | ||
1871 | /* For WINDOW and all windows on the same level. */ | |
1872 | do | |
1873 | { | |
1874 | w = XWINDOW (window); | |
1875 | ||
1876 | /* Get the dimension of the window sub-matrix for W, depending | |
1877 | on whether this a combination or a leaf window. */ | |
1878 | if (!NILP (w->hchild)) | |
5d3cc43c | 1879 | dim = allocate_matrices_for_frame_redisplay (w->hchild, x, y, |
5f5c8ee5 GM |
1880 | dim_only_p, |
1881 | window_change_flags); | |
1882 | else if (!NILP (w->vchild)) | |
5d3cc43c | 1883 | dim = allocate_matrices_for_frame_redisplay (w->vchild, x, y, |
5f5c8ee5 GM |
1884 | dim_only_p, |
1885 | window_change_flags); | |
1886 | else | |
1887 | { | |
1888 | /* If not already done, allocate sub-matrix structures. */ | |
1889 | if (w->desired_matrix == NULL) | |
1890 | { | |
1891 | w->desired_matrix = new_glyph_matrix (f->desired_pool); | |
1892 | w->current_matrix = new_glyph_matrix (f->current_pool); | |
1893 | *window_change_flags |= NEW_LEAF_MATRIX; | |
1894 | } | |
1895 | ||
1896 | /* Width and height MUST be chosen so that there are no | |
1897 | holes in the frame matrix. */ | |
5d3cc43c GM |
1898 | dim.width = required_matrix_width (w); |
1899 | dim.height = required_matrix_height (w); | |
5f5c8ee5 GM |
1900 | |
1901 | /* Will matrix be re-allocated? */ | |
1902 | if (x != w->desired_matrix->matrix_x | |
1903 | || y != w->desired_matrix->matrix_y | |
1904 | || dim.width != w->desired_matrix->matrix_w | |
1905 | || dim.height != w->desired_matrix->matrix_h | |
1906 | || (margin_glyphs_to_reserve (w, dim.width, | |
1907 | w->right_margin_width) | |
1908 | != w->desired_matrix->left_margin_glyphs) | |
1909 | || (margin_glyphs_to_reserve (w, dim.width, | |
1910 | w->left_margin_width) | |
1911 | != w->desired_matrix->right_margin_glyphs)) | |
1912 | *window_change_flags |= CHANGED_LEAF_MATRIX; | |
1913 | ||
1914 | /* Actually change matrices, if allowed. Do not consider | |
1915 | CHANGED_LEAF_MATRIX computed above here because the pool | |
1916 | may have been changed which we don't now here. We trust | |
1917 | that we only will be called with DIM_ONLY_P != 0 when | |
1918 | necessary. */ | |
1919 | if (!dim_only_p) | |
1920 | { | |
1921 | adjust_glyph_matrix (w, w->desired_matrix, x, y, dim); | |
1922 | adjust_glyph_matrix (w, w->current_matrix, x, y, dim); | |
1923 | } | |
1924 | } | |
1925 | ||
1926 | /* If we are part of a horizontal combination, advance x for | |
1927 | windows to the right of W; otherwise advance y for windows | |
1928 | below W. */ | |
1929 | if (in_horz_combination_p) | |
1930 | x += dim.width; | |
1931 | else | |
1932 | y += dim.height; | |
1933 | ||
1934 | /* Remember maximum glyph matrix dimensions. */ | |
1935 | wmax = max (wmax, dim.width); | |
1936 | hmax = max (hmax, dim.height); | |
1937 | ||
1938 | /* Next window on same level. */ | |
1939 | window = w->next; | |
1940 | } | |
1941 | while (!NILP (window)); | |
1942 | ||
1943 | /* Set `total' to the total glyph matrix dimension of this window | |
1944 | level. In a vertical combination, the width is the width of the | |
1945 | widest window; the height is the y we finally reached, corrected | |
1946 | by the y we started with. In a horizontal combination, the total | |
1947 | height is the height of the tallest window, and the width is the | |
1948 | x we finally reached, corrected by the x we started with. */ | |
1949 | if (in_horz_combination_p) | |
1950 | { | |
1951 | total.width = x - x0; | |
1952 | total.height = hmax; | |
1953 | } | |
1954 | else | |
1955 | { | |
1956 | total.width = wmax; | |
1957 | total.height = y - y0; | |
1958 | } | |
1959 | ||
1960 | return total; | |
1961 | } | |
1962 | ||
1963 | ||
5d3cc43c GM |
1964 | /* Return the required height of glyph matrices for window W. */ |
1965 | ||
1966 | int | |
1967 | required_matrix_height (w) | |
1968 | struct window *w; | |
1969 | { | |
1970 | #ifdef HAVE_WINDOW_SYSTEM | |
1971 | struct frame *f = XFRAME (w->frame); | |
1972 | ||
1973 | if (FRAME_WINDOW_P (f)) | |
1974 | { | |
1975 | int ch_height = FRAME_SMALLEST_FONT_HEIGHT (f); | |
1976 | int window_pixel_height = window_box_height (w) + abs (w->vscroll); | |
1977 | return (((window_pixel_height + ch_height - 1) | |
1978 | / ch_height) | |
1979 | /* One partially visible line at the top and | |
1980 | bottom of the window. */ | |
1981 | + 2 | |
1982 | /* 2 for top and mode line. */ | |
1983 | + 2); | |
1984 | } | |
1985 | #endif /* HAVE_WINDOW_SYSTEM */ | |
1986 | ||
1987 | return XINT (w->height); | |
1988 | } | |
1989 | ||
1990 | ||
1991 | /* Return the required width of glyph matrices for window W. */ | |
1992 | ||
1993 | int | |
1994 | required_matrix_width (w) | |
1995 | struct window *w; | |
1996 | { | |
1997 | #ifdef HAVE_WINDOW_SYSTEM | |
1998 | struct frame *f = XFRAME (w->frame); | |
1999 | if (FRAME_WINDOW_P (f)) | |
2000 | { | |
2001 | int ch_width = FRAME_SMALLEST_CHAR_WIDTH (f); | |
2002 | int window_pixel_width = XFLOATINT (w->width) * CANON_X_UNIT (f); | |
2003 | ||
2004 | /* Compute number of glyphs needed in a glyph row. */ | |
2005 | return (((window_pixel_width + ch_width - 1) | |
2006 | / ch_width) | |
2007 | /* 2 partially visible columns in the text area. */ | |
2008 | + 2 | |
2009 | /* One partially visible column at the right | |
2010 | edge of each marginal area. */ | |
2011 | + 1 + 1); | |
2012 | } | |
2013 | #endif /* HAVE_WINDOW_SYSTEM */ | |
2014 | ||
2015 | return XINT (w->width); | |
2016 | } | |
2017 | ||
2018 | ||
5f5c8ee5 GM |
2019 | /* Allocate window matrices for window-based redisplay. W is the |
2020 | window whose matrices must be allocated/reallocated. CH_DIM is the | |
2021 | size of the smallest character that could potentially be used on W. */ | |
2022 | ||
2023 | static void | |
5d3cc43c | 2024 | allocate_matrices_for_window_redisplay (w) |
5f5c8ee5 | 2025 | struct window *w; |
5f5c8ee5 | 2026 | { |
5f5c8ee5 GM |
2027 | while (w) |
2028 | { | |
2029 | if (!NILP (w->vchild)) | |
5d3cc43c | 2030 | allocate_matrices_for_window_redisplay (XWINDOW (w->vchild)); |
5f5c8ee5 | 2031 | else if (!NILP (w->hchild)) |
5d3cc43c | 2032 | allocate_matrices_for_window_redisplay (XWINDOW (w->hchild)); |
5f5c8ee5 GM |
2033 | else |
2034 | { | |
2035 | /* W is a leaf window. */ | |
5f5c8ee5 GM |
2036 | struct dim dim; |
2037 | ||
2038 | /* If matrices are not yet allocated, allocate them now. */ | |
2039 | if (w->desired_matrix == NULL) | |
2040 | { | |
2041 | w->desired_matrix = new_glyph_matrix (NULL); | |
2042 | w->current_matrix = new_glyph_matrix (NULL); | |
2043 | } | |
2044 | ||
5d3cc43c GM |
2045 | dim.width = required_matrix_width (w); |
2046 | dim.height = required_matrix_height (w); | |
5f5c8ee5 GM |
2047 | adjust_glyph_matrix (w, w->desired_matrix, 0, 0, dim); |
2048 | adjust_glyph_matrix (w, w->current_matrix, 0, 0, dim); | |
2049 | } | |
2050 | ||
2051 | w = NILP (w->next) ? NULL : XWINDOW (w->next); | |
2052 | } | |
2053 | } | |
2054 | ||
2055 | ||
2056 | /* Re-allocate/ re-compute glyph matrices on frame F. If F is null, | |
2057 | do it for all frames; otherwise do it just for the given frame. | |
2058 | This function must be called when a new frame is created, its size | |
2059 | changes, or its window configuration changes. */ | |
2060 | ||
2061 | void | |
2062 | adjust_glyphs (f) | |
2063 | struct frame *f; | |
2064 | { | |
408f5064 GM |
2065 | /* Block input so that expose events and other events that access |
2066 | glyph matrices are not processed while we are changing them. */ | |
2067 | BLOCK_INPUT; | |
2068 | ||
5f5c8ee5 GM |
2069 | if (f) |
2070 | adjust_frame_glyphs (f); | |
2071 | else | |
2072 | { | |
2073 | Lisp_Object tail, lisp_frame; | |
2074 | ||
2075 | FOR_EACH_FRAME (tail, lisp_frame) | |
2076 | adjust_frame_glyphs (XFRAME (lisp_frame)); | |
2077 | } | |
408f5064 GM |
2078 | |
2079 | UNBLOCK_INPUT; | |
5f5c8ee5 GM |
2080 | } |
2081 | ||
2082 | ||
2083 | /* Adjust frame glyphs when Emacs is initialized. | |
2084 | ||
2085 | To be called from init_display. | |
2086 | ||
2087 | We need a glyph matrix because redraw will happen soon. | |
2088 | Unfortunately, window sizes on selected_frame are not yet set to | |
2089 | meaningful values. I believe we can assume that there are only two | |
2090 | windows on the frame---the mini-buffer and the root window. Frame | |
2091 | height and width seem to be correct so far. So, set the sizes of | |
2092 | windows to estimated values. */ | |
2093 | ||
2094 | static void | |
2095 | adjust_frame_glyphs_initially () | |
2096 | { | |
91fb7e1b GM |
2097 | struct frame *sf = SELECTED_FRAME (); |
2098 | struct window *root = XWINDOW (sf->root_window); | |
5f5c8ee5 | 2099 | struct window *mini = XWINDOW (root->next); |
91fb7e1b GM |
2100 | int frame_height = FRAME_HEIGHT (sf); |
2101 | int frame_width = FRAME_WIDTH (sf); | |
2102 | int top_margin = FRAME_TOP_MARGIN (sf); | |
5f5c8ee5 GM |
2103 | |
2104 | /* Do it for the root window. */ | |
2105 | XSETFASTINT (root->top, top_margin); | |
2106 | XSETFASTINT (root->width, frame_width); | |
91fb7e1b | 2107 | set_window_height (sf->root_window, frame_height - 1 - top_margin, 0); |
5f5c8ee5 GM |
2108 | |
2109 | /* Do it for the mini-buffer window. */ | |
2110 | XSETFASTINT (mini->top, frame_height - 1); | |
2111 | XSETFASTINT (mini->width, frame_width); | |
2112 | set_window_height (root->next, 1, 0); | |
2113 | ||
91fb7e1b | 2114 | adjust_frame_glyphs (sf); |
5f5c8ee5 GM |
2115 | glyphs_initialized_initially_p = 1; |
2116 | } | |
2117 | ||
2118 | ||
2119 | /* Allocate/reallocate glyph matrices of a single frame F. */ | |
2120 | ||
2121 | static void | |
2122 | adjust_frame_glyphs (f) | |
2123 | struct frame *f; | |
2124 | { | |
2125 | if (FRAME_WINDOW_P (f)) | |
2126 | adjust_frame_glyphs_for_window_redisplay (f); | |
2127 | else | |
2128 | adjust_frame_glyphs_for_frame_redisplay (f); | |
2129 | ||
2130 | /* Don't forget the message buffer and the buffer for | |
2131 | decode_mode_spec. */ | |
2132 | adjust_frame_message_buffer (f); | |
2133 | adjust_decode_mode_spec_buffer (f); | |
2134 | ||
2135 | f->glyphs_initialized_p = 1; | |
2136 | } | |
2137 | ||
2138 | ||
c9f00270 GM |
2139 | /* In the window tree with root W, build current matrices of leaf |
2140 | windows from the frame's current matrix. */ | |
2141 | ||
2142 | static void | |
2143 | fake_current_matrices (window) | |
2144 | Lisp_Object window; | |
2145 | { | |
2146 | struct window *w; | |
2147 | ||
2148 | for (; !NILP (window); window = w->next) | |
2149 | { | |
2150 | w = XWINDOW (window); | |
2151 | ||
2152 | if (!NILP (w->hchild)) | |
2153 | fake_current_matrices (w->hchild); | |
2154 | else if (!NILP (w->vchild)) | |
2155 | fake_current_matrices (w->vchild); | |
2156 | else | |
2157 | { | |
2158 | int i; | |
2159 | struct frame *f = XFRAME (w->frame); | |
2160 | struct glyph_matrix *m = w->current_matrix; | |
2161 | struct glyph_matrix *fm = f->current_matrix; | |
2162 | ||
2163 | xassert (m->matrix_h == XFASTINT (w->height)); | |
2164 | xassert (m->matrix_w == XFASTINT (w->width)); | |
2165 | ||
2166 | for (i = 0; i < m->matrix_h; ++i) | |
2167 | { | |
2168 | struct glyph_row *r = m->rows + i; | |
2169 | struct glyph_row *fr = fm->rows + i + XFASTINT (w->top); | |
2170 | ||
2171 | xassert (r->glyphs[TEXT_AREA] >= fr->glyphs[TEXT_AREA] | |
2172 | && r->glyphs[LAST_AREA] <= fr->glyphs[LAST_AREA]); | |
2173 | ||
2174 | r->enabled_p = fr->enabled_p; | |
2175 | if (r->enabled_p) | |
2176 | { | |
2177 | r->used[LEFT_MARGIN_AREA] = m->left_margin_glyphs; | |
2178 | r->used[RIGHT_MARGIN_AREA] = m->right_margin_glyphs; | |
2179 | r->used[TEXT_AREA] = (m->matrix_w | |
2180 | - r->used[LEFT_MARGIN_AREA] | |
2181 | - r->used[RIGHT_MARGIN_AREA]); | |
2182 | r->mode_line_p = 0; | |
c9f00270 GM |
2183 | } |
2184 | } | |
2185 | } | |
2186 | } | |
2187 | } | |
2188 | ||
2189 | ||
bccee4f2 GM |
2190 | /* Save away the contents of frame F's current frame matrix. Value is |
2191 | a glyph matrix holding the contents of F's current frame matrix. '*/ | |
c9f00270 | 2192 | |
bccee4f2 GM |
2193 | static struct glyph_matrix * |
2194 | save_current_matrix (f) | |
31798cfe | 2195 | struct frame *f; |
c9f00270 | 2196 | { |
bccee4f2 GM |
2197 | int i; |
2198 | struct glyph_matrix *saved; | |
e797dea6 | 2199 | |
bccee4f2 GM |
2200 | saved = (struct glyph_matrix *) xmalloc (sizeof *saved); |
2201 | bzero (saved, sizeof *saved); | |
2202 | saved->nrows = f->current_matrix->nrows; | |
2203 | saved->rows = (struct glyph_row *) xmalloc (saved->nrows | |
2204 | * sizeof *saved->rows); | |
2205 | bzero (saved->rows, saved->nrows * sizeof *saved->rows); | |
2206 | ||
2207 | for (i = 0; i < saved->nrows; ++i) | |
31798cfe | 2208 | { |
bccee4f2 GM |
2209 | struct glyph_row *from = f->current_matrix->rows + i; |
2210 | struct glyph_row *to = saved->rows + i; | |
2211 | size_t nbytes = from->used[TEXT_AREA] * sizeof (struct glyph); | |
2212 | to->glyphs[TEXT_AREA] = (struct glyph *) xmalloc (nbytes); | |
2213 | bcopy (from->glyphs[TEXT_AREA], to->glyphs[TEXT_AREA], nbytes); | |
2214 | to->used[TEXT_AREA] = from->used[TEXT_AREA]; | |
e797dea6 | 2215 | } |
bccee4f2 GM |
2216 | |
2217 | return saved; | |
2218 | } | |
2219 | ||
2220 | ||
2221 | /* Restore the contents of frame F's current frame matrix from SAVED, | |
2222 | and free memory associated with SAVED. */ | |
2223 | ||
2224 | static void | |
2225 | restore_current_matrix (f, saved) | |
2226 | struct frame *f; | |
2227 | struct glyph_matrix *saved; | |
2228 | { | |
2229 | int i; | |
2230 | ||
2231 | for (i = 0; i < saved->nrows; ++i) | |
e797dea6 | 2232 | { |
bccee4f2 GM |
2233 | struct glyph_row *from = saved->rows + i; |
2234 | struct glyph_row *to = f->current_matrix->rows + i; | |
e797dea6 GM |
2235 | size_t nbytes = from->used[TEXT_AREA] * sizeof (struct glyph); |
2236 | bcopy (from->glyphs[TEXT_AREA], to->glyphs[TEXT_AREA], nbytes); | |
2237 | to->used[TEXT_AREA] = from->used[TEXT_AREA]; | |
bccee4f2 | 2238 | xfree (from->glyphs[TEXT_AREA]); |
e797dea6 | 2239 | } |
bccee4f2 GM |
2240 | |
2241 | xfree (saved->rows); | |
2242 | xfree (saved); | |
c9f00270 GM |
2243 | } |
2244 | ||
2245 | ||
bccee4f2 | 2246 | |
5f5c8ee5 GM |
2247 | /* Allocate/reallocate glyph matrices of a single frame F for |
2248 | frame-based redisplay. */ | |
2249 | ||
2250 | static void | |
2251 | adjust_frame_glyphs_for_frame_redisplay (f) | |
2252 | struct frame *f; | |
2253 | { | |
2254 | struct dim ch_dim; | |
2255 | struct dim matrix_dim; | |
2256 | int pool_changed_p; | |
2257 | int window_change_flags; | |
2258 | int top_window_y; | |
2259 | ||
2260 | if (!FRAME_LIVE_P (f)) | |
2261 | return; | |
2262 | ||
2263 | /* Determine the smallest character in any font for F. On | |
2264 | console windows, all characters have dimension (1, 1). */ | |
2265 | ch_dim.width = ch_dim.height = 1; | |
2266 | ||
2267 | top_window_y = FRAME_TOP_MARGIN (f); | |
2268 | ||
2269 | /* Allocate glyph pool structures if not already done. */ | |
2270 | if (f->desired_pool == NULL) | |
2271 | { | |
2272 | f->desired_pool = new_glyph_pool (); | |
2273 | f->current_pool = new_glyph_pool (); | |
2274 | } | |
2275 | ||
2276 | /* Allocate frames matrix structures if needed. */ | |
2277 | if (f->desired_matrix == NULL) | |
2278 | { | |
2279 | f->desired_matrix = new_glyph_matrix (f->desired_pool); | |
2280 | f->current_matrix = new_glyph_matrix (f->current_pool); | |
2281 | } | |
c9f00270 | 2282 | |
5f5c8ee5 GM |
2283 | /* Compute window glyph matrices. (This takes the mini-buffer |
2284 | window into account). The result is the size of the frame glyph | |
2285 | matrix needed. The variable window_change_flags is set to a bit | |
2286 | mask indicating whether new matrices will be allocated or | |
2287 | existing matrices change their size or location within the frame | |
2288 | matrix. */ | |
2289 | window_change_flags = 0; | |
2290 | matrix_dim | |
2291 | = allocate_matrices_for_frame_redisplay (FRAME_ROOT_WINDOW (f), | |
2292 | 0, top_window_y, | |
5d3cc43c | 2293 | 1, |
5f5c8ee5 GM |
2294 | &window_change_flags); |
2295 | ||
2296 | /* Add in menu bar lines, if any. */ | |
2297 | matrix_dim.height += top_window_y; | |
2298 | ||
2299 | /* Enlarge pools as necessary. */ | |
2300 | pool_changed_p = realloc_glyph_pool (f->desired_pool, matrix_dim); | |
2301 | realloc_glyph_pool (f->current_pool, matrix_dim); | |
2302 | ||
2303 | /* Set up glyph pointers within window matrices. Do this only if | |
2304 | absolutely necessary since it requires a frame redraw. */ | |
2305 | if (pool_changed_p || window_change_flags) | |
2306 | { | |
2307 | /* Do it for window matrices. */ | |
2308 | allocate_matrices_for_frame_redisplay (FRAME_ROOT_WINDOW (f), | |
5d3cc43c | 2309 | 0, top_window_y, 0, |
5f5c8ee5 GM |
2310 | &window_change_flags); |
2311 | ||
2312 | /* Size of frame matrices must equal size of frame. Note | |
2313 | that we are called for X frames with window widths NOT equal | |
2314 | to the frame width (from CHANGE_FRAME_SIZE_1). */ | |
2315 | xassert (matrix_dim.width == FRAME_WIDTH (f) | |
2316 | && matrix_dim.height == FRAME_HEIGHT (f)); | |
2317 | ||
e797dea6 GM |
2318 | /* Pointers to glyph memory in glyph rows are exchanged during |
2319 | the update phase of redisplay, which means in general that a | |
2320 | frame's current matrix consists of pointers into both the | |
2321 | desired and current glyph pool of the frame. Adjusting a | |
2322 | matrix sets the frame matrix up so that pointers are all into | |
2323 | the same pool. If we want to preserve glyph contents of the | |
2324 | current matrix over a call to adjust_glyph_matrix, we must | |
2325 | make a copy of the current glyphs, and restore the current | |
2326 | matrix' contents from that copy. */ | |
2327 | if (display_completed | |
2328 | && !FRAME_GARBAGED_P (f) | |
2329 | && matrix_dim.width == f->current_matrix->matrix_w | |
2330 | && matrix_dim.height == f->current_matrix->matrix_h) | |
2331 | { | |
bccee4f2 GM |
2332 | struct glyph_matrix *copy = save_current_matrix (f); |
2333 | adjust_glyph_matrix (NULL, f->desired_matrix, 0, 0, matrix_dim); | |
e797dea6 | 2334 | adjust_glyph_matrix (NULL, f->current_matrix, 0, 0, matrix_dim); |
bccee4f2 | 2335 | restore_current_matrix (f, copy); |
e797dea6 GM |
2336 | fake_current_matrices (FRAME_ROOT_WINDOW (f)); |
2337 | } | |
c9f00270 | 2338 | else |
e797dea6 | 2339 | { |
bccee4f2 | 2340 | adjust_glyph_matrix (NULL, f->desired_matrix, 0, 0, matrix_dim); |
e797dea6 GM |
2341 | adjust_glyph_matrix (NULL, f->current_matrix, 0, 0, matrix_dim); |
2342 | SET_FRAME_GARBAGED (f); | |
2343 | } | |
5f5c8ee5 GM |
2344 | } |
2345 | } | |
2346 | ||
2347 | ||
2348 | /* Allocate/reallocate glyph matrices of a single frame F for | |
2349 | window-based redisplay. */ | |
2350 | ||
2351 | static void | |
2352 | adjust_frame_glyphs_for_window_redisplay (f) | |
2353 | struct frame *f; | |
2354 | { | |
2355 | struct dim ch_dim; | |
2356 | struct window *w; | |
2357 | ||
2358 | xassert (FRAME_WINDOW_P (f) && FRAME_LIVE_P (f)); | |
2359 | ||
2360 | /* Get minimum sizes. */ | |
2361 | #ifdef HAVE_WINDOW_SYSTEM | |
2362 | ch_dim.width = FRAME_SMALLEST_CHAR_WIDTH (f); | |
2363 | ch_dim.height = FRAME_SMALLEST_FONT_HEIGHT (f); | |
2364 | #else | |
2365 | ch_dim.width = ch_dim.height = 1; | |
2366 | #endif | |
2367 | ||
2368 | /* Allocate/reallocate window matrices. */ | |
5d3cc43c | 2369 | allocate_matrices_for_window_redisplay (XWINDOW (FRAME_ROOT_WINDOW (f))); |
5f5c8ee5 GM |
2370 | |
2371 | /* Allocate/ reallocate matrices of the dummy window used to display | |
2372 | the menu bar under X when no X toolkit support is available. */ | |
2373 | #ifndef USE_X_TOOLKIT | |
2374 | { | |
2375 | /* Allocate a dummy window if not already done. */ | |
2376 | if (NILP (f->menu_bar_window)) | |
2377 | { | |
2378 | f->menu_bar_window = make_window (); | |
2379 | w = XWINDOW (f->menu_bar_window); | |
2380 | XSETFRAME (w->frame, f); | |
2381 | w->pseudo_window_p = 1; | |
2382 | } | |
2383 | else | |
2384 | w = XWINDOW (f->menu_bar_window); | |
2385 | ||
2386 | /* Set window dimensions to frame dimensions and allocate or | |
2387 | adjust glyph matrices of W. */ | |
2388 | XSETFASTINT (w->top, 0); | |
2389 | XSETFASTINT (w->left, 0); | |
2390 | XSETFASTINT (w->height, FRAME_MENU_BAR_LINES (f)); | |
2391 | XSETFASTINT (w->width, FRAME_WINDOW_WIDTH (f)); | |
5d3cc43c | 2392 | allocate_matrices_for_window_redisplay (w); |
5f5c8ee5 GM |
2393 | } |
2394 | #endif /* not USE_X_TOOLKIT */ | |
2395 | ||
9ea173e8 GM |
2396 | /* Allocate/ reallocate matrices of the tool bar window. If we |
2397 | don't have a tool bar window yet, make one. */ | |
2398 | if (NILP (f->tool_bar_window)) | |
5f5c8ee5 | 2399 | { |
9ea173e8 GM |
2400 | f->tool_bar_window = make_window (); |
2401 | w = XWINDOW (f->tool_bar_window); | |
5f5c8ee5 GM |
2402 | XSETFRAME (w->frame, f); |
2403 | w->pseudo_window_p = 1; | |
2404 | } | |
2405 | else | |
9ea173e8 | 2406 | w = XWINDOW (f->tool_bar_window); |
5f5c8ee5 GM |
2407 | |
2408 | XSETFASTINT (w->top, FRAME_MENU_BAR_LINES (f)); | |
2409 | XSETFASTINT (w->left, 0); | |
9ea173e8 | 2410 | XSETFASTINT (w->height, FRAME_TOOL_BAR_LINES (f)); |
5f5c8ee5 | 2411 | XSETFASTINT (w->width, FRAME_WINDOW_WIDTH (f)); |
5d3cc43c | 2412 | allocate_matrices_for_window_redisplay (w); |
5f5c8ee5 GM |
2413 | } |
2414 | ||
2415 | ||
2416 | /* Adjust/ allocate message buffer of frame F. | |
2417 | ||
5f5c8ee5 GM |
2418 | Note that the message buffer is never freed. Since I could not |
2419 | find a free in 19.34, I assume that freeing it would be | |
2420 | problematic in some way and don't do it either. | |
2421 | ||
2422 | (Implementation note: It should be checked if we can free it | |
2423 | eventually without causing trouble). */ | |
2424 | ||
2425 | static void | |
2426 | adjust_frame_message_buffer (f) | |
2427 | struct frame *f; | |
2428 | { | |
2429 | int size = FRAME_MESSAGE_BUF_SIZE (f) + 1; | |
2430 | ||
2431 | if (FRAME_MESSAGE_BUF (f)) | |
2432 | { | |
2433 | char *buffer = FRAME_MESSAGE_BUF (f); | |
2434 | char *new_buffer = (char *) xrealloc (buffer, size); | |
5f5c8ee5 GM |
2435 | FRAME_MESSAGE_BUF (f) = new_buffer; |
2436 | } | |
2437 | else | |
2438 | FRAME_MESSAGE_BUF (f) = (char *) xmalloc (size); | |
2439 | } | |
2440 | ||
2441 | ||
2442 | /* Re-allocate buffer for decode_mode_spec on frame F. */ | |
2443 | ||
2444 | static void | |
2445 | adjust_decode_mode_spec_buffer (f) | |
2446 | struct frame *f; | |
2447 | { | |
2448 | f->decode_mode_spec_buffer | |
2449 | = (char *) xrealloc (f->decode_mode_spec_buffer, | |
2450 | FRAME_MESSAGE_BUF_SIZE (f) + 1); | |
2451 | } | |
2452 | ||
2453 | ||
2454 | \f | |
2455 | /********************************************************************** | |
2456 | Freeing Glyph Matrices | |
2457 | **********************************************************************/ | |
2458 | ||
2459 | /* Free glyph memory for a frame F. F may be null. This function can | |
2460 | be called for the same frame more than once. The root window of | |
2461 | F may be nil when this function is called. This is the case when | |
2462 | the function is called when F is destroyed. */ | |
2463 | ||
2464 | void | |
2465 | free_glyphs (f) | |
2466 | struct frame *f; | |
2467 | { | |
2468 | if (f && f->glyphs_initialized_p) | |
2469 | { | |
42f55fe0 GM |
2470 | /* Block interrupt input so that we don't get surprised by an X |
2471 | event while we're in an inconsistent state. */ | |
2472 | BLOCK_INPUT; | |
5f5c8ee5 GM |
2473 | f->glyphs_initialized_p = 0; |
2474 | ||
2475 | /* Release window sub-matrices. */ | |
2476 | if (!NILP (f->root_window)) | |
2477 | free_window_matrices (XWINDOW (f->root_window)); | |
2478 | ||
2479 | /* Free the dummy window for menu bars without X toolkit and its | |
2480 | glyph matrices. */ | |
2481 | if (!NILP (f->menu_bar_window)) | |
2482 | { | |
2483 | struct window *w = XWINDOW (f->menu_bar_window); | |
2484 | free_glyph_matrix (w->desired_matrix); | |
2485 | free_glyph_matrix (w->current_matrix); | |
2486 | w->desired_matrix = w->current_matrix = NULL; | |
2487 | f->menu_bar_window = Qnil; | |
2488 | } | |
2489 | ||
9ea173e8 GM |
2490 | /* Free the tool bar window and its glyph matrices. */ |
2491 | if (!NILP (f->tool_bar_window)) | |
5f5c8ee5 | 2492 | { |
9ea173e8 | 2493 | struct window *w = XWINDOW (f->tool_bar_window); |
5f5c8ee5 GM |
2494 | free_glyph_matrix (w->desired_matrix); |
2495 | free_glyph_matrix (w->current_matrix); | |
2496 | w->desired_matrix = w->current_matrix = NULL; | |
9ea173e8 | 2497 | f->tool_bar_window = Qnil; |
5f5c8ee5 GM |
2498 | } |
2499 | ||
2500 | /* Release frame glyph matrices. Reset fields to zero in | |
2501 | case we are called a second time. */ | |
2502 | if (f->desired_matrix) | |
2503 | { | |
2504 | free_glyph_matrix (f->desired_matrix); | |
2505 | free_glyph_matrix (f->current_matrix); | |
2506 | f->desired_matrix = f->current_matrix = NULL; | |
2507 | } | |
2508 | ||
2509 | /* Release glyph pools. */ | |
2510 | if (f->desired_pool) | |
2511 | { | |
2512 | free_glyph_pool (f->desired_pool); | |
2513 | free_glyph_pool (f->current_pool); | |
2514 | f->desired_pool = f->current_pool = NULL; | |
2515 | } | |
42f55fe0 GM |
2516 | |
2517 | UNBLOCK_INPUT; | |
5f5c8ee5 GM |
2518 | } |
2519 | } | |
2520 | ||
2521 | ||
2522 | /* Free glyph sub-matrices in the window tree rooted at W. This | |
2523 | function may be called with a null pointer, and it may be called on | |
2524 | the same tree more than once. */ | |
2525 | ||
2526 | void | |
2527 | free_window_matrices (w) | |
2528 | struct window *w; | |
2529 | { | |
2530 | while (w) | |
2531 | { | |
2532 | if (!NILP (w->hchild)) | |
2533 | free_window_matrices (XWINDOW (w->hchild)); | |
2534 | else if (!NILP (w->vchild)) | |
2535 | free_window_matrices (XWINDOW (w->vchild)); | |
2536 | else | |
2537 | { | |
2538 | /* This is a leaf window. Free its memory and reset fields | |
2539 | to zero in case this function is called a second time for | |
2540 | W. */ | |
2541 | free_glyph_matrix (w->current_matrix); | |
2542 | free_glyph_matrix (w->desired_matrix); | |
2543 | w->current_matrix = w->desired_matrix = NULL; | |
2544 | } | |
2545 | ||
2546 | /* Next window on same level. */ | |
2547 | w = NILP (w->next) ? 0 : XWINDOW (w->next); | |
2548 | } | |
2549 | } | |
2550 | ||
2551 | ||
2552 | /* Check glyph memory leaks. This function is called from | |
2553 | shut_down_emacs. Note that frames are not destroyed when Emacs | |
2554 | exits. We therefore free all glyph memory for all active frames | |
2555 | explicitly and check that nothing is left allocated. */ | |
2556 | ||
2557 | void | |
2558 | check_glyph_memory () | |
2559 | { | |
2560 | Lisp_Object tail, frame; | |
2561 | ||
2562 | /* Free glyph memory for all frames. */ | |
2563 | FOR_EACH_FRAME (tail, frame) | |
2564 | free_glyphs (XFRAME (frame)); | |
2565 | ||
2566 | /* Check that nothing is left allocated. */ | |
2567 | if (glyph_matrix_count) | |
2568 | abort (); | |
2569 | if (glyph_pool_count) | |
2570 | abort (); | |
2571 | } | |
2572 | ||
2573 | ||
2574 | \f | |
2575 | /********************************************************************** | |
2576 | Building a Frame Matrix | |
2577 | **********************************************************************/ | |
2578 | ||
2579 | /* Most of the redisplay code works on glyph matrices attached to | |
2580 | windows. This is a good solution most of the time, but it is not | |
2581 | suitable for terminal code. Terminal output functions cannot rely | |
2582 | on being able to set an arbitrary terminal window. Instead they | |
2583 | must be provided with a view of the whole frame, i.e. the whole | |
2584 | screen. We build such a view by constructing a frame matrix from | |
2585 | window matrices in this section. | |
2586 | ||
2587 | Windows that must be updated have their must_be_update_p flag set. | |
2588 | For all such windows, their desired matrix is made part of the | |
2589 | desired frame matrix. For other windows, their current matrix is | |
2590 | made part of the desired frame matrix. | |
2591 | ||
2592 | +-----------------+----------------+ | |
2593 | | desired | desired | | |
2594 | | | | | |
2595 | +-----------------+----------------+ | |
2596 | | current | | |
2597 | | | | |
2598 | +----------------------------------+ | |
2599 | ||
2600 | Desired window matrices can be made part of the frame matrix in a | |
2601 | cheap way: We exploit the fact that the desired frame matrix and | |
2602 | desired window matrices share their glyph memory. This is not | |
2603 | possible for current window matrices. Their glyphs are copied to | |
2604 | the desired frame matrix. The latter is equivalent to | |
2605 | preserve_other_columns in the old redisplay. | |
2606 | ||
2607 | Used glyphs counters for frame matrix rows are the result of adding | |
2608 | up glyph lengths of the window matrices. A line in the frame | |
2609 | matrix is enabled, if a corresponding line in a window matrix is | |
2610 | enabled. | |
2611 | ||
2612 | After building the desired frame matrix, it will be passed to | |
2613 | terminal code, which will manipulate both the desired and current | |
2614 | frame matrix. Changes applied to the frame's current matrix have | |
2615 | to be visible in current window matrices afterwards, of course. | |
2616 | ||
2617 | This problem is solved like this: | |
2618 | ||
2619 | 1. Window and frame matrices share glyphs. Window matrices are | |
2620 | constructed in a way that their glyph contents ARE the glyph | |
2621 | contents needed in a frame matrix. Thus, any modification of | |
2622 | glyphs done in terminal code will be reflected in window matrices | |
2623 | automatically. | |
2624 | ||
2625 | 2. Exchanges of rows in a frame matrix done by terminal code are | |
2626 | intercepted by hook functions so that corresponding row operations | |
2627 | on window matrices can be performed. This is necessary because we | |
2628 | use pointers to glyphs in glyph row structures. To satisfy the | |
2629 | assumption of point 1 above that glyphs are updated implicitly in | |
2630 | window matrices when they are manipulated via the frame matrix, | |
2631 | window and frame matrix must of course agree where to find the | |
2632 | glyphs for their rows. Possible manipulations that must be | |
2633 | mirrored are assignments of rows of the desired frame matrix to the | |
2634 | current frame matrix and scrolling the current frame matrix. */ | |
2635 | ||
2636 | /* Build frame F's desired matrix from window matrices. Only windows | |
2637 | which have the flag must_be_updated_p set have to be updated. Menu | |
2638 | bar lines of a frame are not covered by window matrices, so make | |
2639 | sure not to touch them in this function. */ | |
2640 | ||
2641 | static void | |
2642 | build_frame_matrix (f) | |
2643 | struct frame *f; | |
2644 | { | |
2645 | int i; | |
2646 | ||
2647 | /* F must have a frame matrix when this function is called. */ | |
2648 | xassert (!FRAME_WINDOW_P (f)); | |
2649 | ||
2650 | /* Clear all rows in the frame matrix covered by window matrices. | |
2651 | Menu bar lines are not covered by windows. */ | |
2652 | for (i = FRAME_TOP_MARGIN (f); i < f->desired_matrix->nrows; ++i) | |
2653 | clear_glyph_row (MATRIX_ROW (f->desired_matrix, i)); | |
2654 | ||
2655 | /* Build the matrix by walking the window tree. */ | |
2656 | build_frame_matrix_from_window_tree (f->desired_matrix, | |
2657 | XWINDOW (FRAME_ROOT_WINDOW (f))); | |
2658 | } | |
2659 | ||
2660 | ||
2661 | /* Walk a window tree, building a frame matrix MATRIX from window | |
2662 | matrices. W is the root of a window tree. */ | |
2663 | ||
2664 | static void | |
2665 | build_frame_matrix_from_window_tree (matrix, w) | |
2666 | struct glyph_matrix *matrix; | |
2667 | struct window *w; | |
2668 | { | |
2669 | while (w) | |
2670 | { | |
2671 | if (!NILP (w->hchild)) | |
2672 | build_frame_matrix_from_window_tree (matrix, XWINDOW (w->hchild)); | |
2673 | else if (!NILP (w->vchild)) | |
2674 | build_frame_matrix_from_window_tree (matrix, XWINDOW (w->vchild)); | |
2675 | else | |
2676 | build_frame_matrix_from_leaf_window (matrix, w); | |
2677 | ||
2678 | w = NILP (w->next) ? 0 : XWINDOW (w->next); | |
2679 | } | |
2680 | } | |
2681 | ||
2682 | ||
2683 | /* Add a window's matrix to a frame matrix. FRAME_MATRIX is the | |
2684 | desired frame matrix built. W is a leaf window whose desired or | |
2685 | current matrix is to be added to FRAME_MATRIX. W's flag | |
2686 | must_be_updated_p determines which matrix it contributes to | |
2687 | FRAME_MATRIX. If must_be_updated_p is non-zero, W's desired matrix | |
2688 | is added to FRAME_MATRIX, otherwise W's current matrix is added. | |
2689 | Adding a desired matrix means setting up used counters and such in | |
2690 | frame rows, while adding a current window matrix to FRAME_MATRIX | |
2691 | means copying glyphs. The latter case corresponds to | |
2692 | preserve_other_columns in the old redisplay. */ | |
2693 | ||
2694 | static void | |
2695 | build_frame_matrix_from_leaf_window (frame_matrix, w) | |
2696 | struct glyph_matrix *frame_matrix; | |
2697 | struct window *w; | |
2698 | { | |
2699 | struct glyph_matrix *window_matrix; | |
2700 | int window_y, frame_y; | |
2701 | /* If non-zero, a glyph to insert at the right border of W. */ | |
2702 | GLYPH right_border_glyph = 0; | |
2703 | ||
2704 | /* Set window_matrix to the matrix we have to add to FRAME_MATRIX. */ | |
2705 | if (w->must_be_updated_p) | |
2706 | { | |
2707 | window_matrix = w->desired_matrix; | |
2708 | ||
2709 | /* Decide whether we want to add a vertical border glyph. */ | |
2710 | if (!WINDOW_RIGHTMOST_P (w)) | |
2711 | { | |
2712 | struct Lisp_Char_Table *dp = window_display_table (w); | |
2713 | right_border_glyph = (dp && INTEGERP (DISP_BORDER_GLYPH (dp)) | |
2714 | ? XINT (DISP_BORDER_GLYPH (dp)) | |
2715 | : '|'); | |
2716 | } | |
2717 | } | |
2718 | else | |
2719 | window_matrix = w->current_matrix; | |
2720 | ||
2721 | /* For all rows in the window matrix and corresponding rows in the | |
2722 | frame matrix. */ | |
2723 | window_y = 0; | |
2724 | frame_y = window_matrix->matrix_y; | |
2725 | while (window_y < window_matrix->nrows) | |
2726 | { | |
2727 | struct glyph_row *frame_row = frame_matrix->rows + frame_y; | |
2728 | struct glyph_row *window_row = window_matrix->rows + window_y; | |
2a8bd25f | 2729 | int current_row_p = window_matrix == w->current_matrix; |
5f5c8ee5 GM |
2730 | |
2731 | /* Fill up the frame row with spaces up to the left margin of the | |
2732 | window row. */ | |
2733 | fill_up_frame_row_with_spaces (frame_row, window_matrix->matrix_x); | |
2734 | ||
2735 | /* Fill up areas in the window matrix row with spaces. */ | |
2736 | fill_up_glyph_row_with_spaces (window_row); | |
2a8bd25f GM |
2737 | |
2738 | /* If only part of W's desired matrix has been built, and | |
2739 | window_row wasn't displayed, use the corresponding current | |
2740 | row instead. */ | |
2741 | if (window_matrix == w->desired_matrix | |
2742 | && !window_row->enabled_p) | |
2743 | { | |
2744 | window_row = w->current_matrix->rows + window_y; | |
2745 | current_row_p = 1; | |
2746 | } | |
5f5c8ee5 | 2747 | |
2a8bd25f | 2748 | if (current_row_p) |
5f5c8ee5 | 2749 | { |
2a8bd25f | 2750 | /* Copy window row to frame row. */ |
5f5c8ee5 GM |
2751 | bcopy (window_row->glyphs[0], |
2752 | frame_row->glyphs[TEXT_AREA] + window_matrix->matrix_x, | |
2753 | window_matrix->matrix_w * sizeof (struct glyph)); | |
2754 | } | |
2755 | else | |
2756 | { | |
2a8bd25f GM |
2757 | xassert (window_row->enabled_p); |
2758 | ||
2759 | /* Only when a desired row has been displayed, we want | |
2760 | the corresponding frame row to be updated. */ | |
2761 | frame_row->enabled_p = 1; | |
2762 | ||
5f5c8ee5 GM |
2763 | /* Maybe insert a vertical border between horizontally adjacent |
2764 | windows. */ | |
2765 | if (right_border_glyph) | |
2766 | { | |
2767 | struct glyph *border = window_row->glyphs[LAST_AREA] - 1; | |
2768 | SET_CHAR_GLYPH_FROM_GLYPH (*border, right_border_glyph); | |
2769 | } | |
2770 | ||
a13396c9 GM |
2771 | /* Window row window_y must be a slice of frame row |
2772 | frame_y. */ | |
5f5c8ee5 | 2773 | xassert (glyph_row_slice_p (window_row, frame_row)); |
a13396c9 | 2774 | |
5f5c8ee5 GM |
2775 | /* If rows are in sync, we don't have to copy glyphs because |
2776 | frame and window share glyphs. */ | |
a38634ff GM |
2777 | |
2778 | #if GLYPH_DEBUG | |
2779 | strcpy (w->current_matrix->method, w->desired_matrix->method); | |
9b0e97aa | 2780 | add_window_display_history (w, w->current_matrix->method, 0); |
a38634ff | 2781 | #endif |
5f5c8ee5 GM |
2782 | } |
2783 | ||
2784 | /* Set number of used glyphs in the frame matrix. Since we fill | |
2785 | up with spaces, and visit leaf windows from left to right it | |
2786 | can be done simply. */ | |
2787 | frame_row->used[TEXT_AREA] | |
2788 | = window_matrix->matrix_x + window_matrix->matrix_w; | |
2789 | ||
5f5c8ee5 GM |
2790 | /* Next row. */ |
2791 | ++window_y; | |
2792 | ++frame_y; | |
2793 | } | |
2794 | } | |
2795 | ||
2796 | ||
2797 | /* Add spaces to a glyph row ROW in a window matrix. | |
2798 | ||
2799 | Each row has the form: | |
2800 | ||
2801 | +---------+-----------------------------+------------+ | |
2802 | | left | text | right | | |
2803 | +---------+-----------------------------+------------+ | |
2804 | ||
2805 | Left and right marginal areas are optional. This function adds | |
2806 | spaces to areas so that there are no empty holes between areas. | |
2807 | In other words: If the right area is not empty, the text area | |
2808 | is filled up with spaces up to the right area. If the text area | |
2809 | is not empty, the left area is filled up. | |
2810 | ||
2811 | To be called for frame-based redisplay, only. */ | |
2812 | ||
2813 | static void | |
2814 | fill_up_glyph_row_with_spaces (row) | |
2815 | struct glyph_row *row; | |
2816 | { | |
2817 | fill_up_glyph_row_area_with_spaces (row, LEFT_MARGIN_AREA); | |
2818 | fill_up_glyph_row_area_with_spaces (row, TEXT_AREA); | |
2819 | fill_up_glyph_row_area_with_spaces (row, RIGHT_MARGIN_AREA); | |
2820 | } | |
2821 | ||
2822 | ||
2823 | /* Fill area AREA of glyph row ROW with spaces. To be called for | |
2824 | frame-based redisplay only. */ | |
2825 | ||
2826 | static void | |
2827 | fill_up_glyph_row_area_with_spaces (row, area) | |
2828 | struct glyph_row *row; | |
2829 | int area; | |
2830 | { | |
2831 | if (row->glyphs[area] < row->glyphs[area + 1]) | |
2832 | { | |
2833 | struct glyph *end = row->glyphs[area + 1]; | |
2834 | struct glyph *text = row->glyphs[area] + row->used[area]; | |
2835 | ||
2836 | while (text < end) | |
2837 | *text++ = space_glyph; | |
2838 | row->used[area] = text - row->glyphs[area]; | |
2839 | } | |
2840 | } | |
2841 | ||
2842 | ||
2843 | /* Add spaces to the end of ROW in a frame matrix until index UPTO is | |
2844 | reached. In frame matrices only one area, TEXT_AREA, is used. */ | |
2845 | ||
2846 | static void | |
2847 | fill_up_frame_row_with_spaces (row, upto) | |
2848 | struct glyph_row *row; | |
2849 | int upto; | |
2850 | { | |
2851 | int i = row->used[TEXT_AREA]; | |
2852 | struct glyph *glyph = row->glyphs[TEXT_AREA]; | |
2853 | ||
2854 | while (i < upto) | |
2855 | glyph[i++] = space_glyph; | |
2856 | ||
2857 | row->used[TEXT_AREA] = i; | |
2858 | } | |
2859 | ||
2860 | ||
2861 | \f | |
2862 | /********************************************************************** | |
2863 | Mirroring operations on frame matrices in window matrices | |
2864 | **********************************************************************/ | |
2865 | ||
2866 | /* Set frame being updated via frame-based redisplay to F. This | |
2867 | function must be called before updates to make explicit that we are | |
2868 | working on frame matrices or not. */ | |
2869 | ||
2870 | static INLINE void | |
2871 | set_frame_matrix_frame (f) | |
2872 | struct frame *f; | |
2873 | { | |
2874 | frame_matrix_frame = f; | |
2875 | } | |
2876 | ||
2877 | ||
2878 | /* Make sure glyph row ROW in CURRENT_MATRIX is up to date. | |
2879 | DESIRED_MATRIX is the desired matrix corresponding to | |
2880 | CURRENT_MATRIX. The update is done by exchanging glyph pointers | |
2881 | between rows in CURRENT_MATRIX and DESIRED_MATRIX. If | |
2882 | frame_matrix_frame is non-null, this indicates that the exchange is | |
2883 | done in frame matrices, and that we have to perform analogous | |
2884 | operations in window matrices of frame_matrix_frame. */ | |
2885 | ||
2886 | static INLINE void | |
2887 | make_current (desired_matrix, current_matrix, row) | |
2888 | struct glyph_matrix *desired_matrix, *current_matrix; | |
2889 | int row; | |
2890 | { | |
2891 | struct glyph_row *current_row = MATRIX_ROW (current_matrix, row); | |
2892 | struct glyph_row *desired_row = MATRIX_ROW (desired_matrix, row); | |
e876ff42 | 2893 | int mouse_face_p = current_row->mouse_face_p; |
5f5c8ee5 GM |
2894 | |
2895 | /* Do current_row = desired_row. This exchanges glyph pointers | |
2896 | between both rows, and does a structure assignment otherwise. */ | |
2897 | assign_row (current_row, desired_row); | |
2898 | ||
2899 | /* Enable current_row to mark it as valid. */ | |
2900 | current_row->enabled_p = 1; | |
e876ff42 | 2901 | current_row->mouse_face_p = mouse_face_p; |
5f5c8ee5 GM |
2902 | |
2903 | /* If we are called on frame matrices, perform analogous operations | |
2904 | for window matrices. */ | |
2905 | if (frame_matrix_frame) | |
2906 | mirror_make_current (XWINDOW (frame_matrix_frame->root_window), row); | |
2907 | } | |
2908 | ||
2909 | ||
2910 | /* W is the root of a window tree. FRAME_ROW is the index of a row in | |
2911 | W's frame which has been made current (by swapping pointers between | |
2912 | current and desired matrix). Perform analogous operations in the | |
2913 | matrices of leaf windows in the window tree rooted at W. */ | |
2914 | ||
2915 | static void | |
2916 | mirror_make_current (w, frame_row) | |
2917 | struct window *w; | |
2918 | int frame_row; | |
2919 | { | |
2920 | while (w) | |
2921 | { | |
2922 | if (!NILP (w->hchild)) | |
2923 | mirror_make_current (XWINDOW (w->hchild), frame_row); | |
2924 | else if (!NILP (w->vchild)) | |
2925 | mirror_make_current (XWINDOW (w->vchild), frame_row); | |
2926 | else | |
2927 | { | |
2928 | /* Row relative to window W. Don't use FRAME_TO_WINDOW_VPOS | |
2929 | here because the checks performed in debug mode there | |
2930 | will not allow the conversion. */ | |
2931 | int row = frame_row - w->desired_matrix->matrix_y; | |
2932 | ||
2933 | /* If FRAME_ROW is within W, assign the desired row to the | |
2934 | current row (exchanging glyph pointers). */ | |
2935 | if (row >= 0 && row < w->desired_matrix->matrix_h) | |
2936 | { | |
2937 | struct glyph_row *current_row | |
2938 | = MATRIX_ROW (w->current_matrix, row); | |
2939 | struct glyph_row *desired_row | |
2940 | = MATRIX_ROW (w->desired_matrix, row); | |
a38634ff GM |
2941 | |
2942 | if (desired_row->enabled_p) | |
2943 | assign_row (current_row, desired_row); | |
2944 | else | |
2945 | swap_glyph_pointers (desired_row, current_row); | |
5f5c8ee5 GM |
2946 | current_row->enabled_p = 1; |
2947 | } | |
2948 | } | |
2949 | ||
2950 | w = NILP (w->next) ? 0 : XWINDOW (w->next); | |
2951 | } | |
2952 | } | |
2953 | ||
2954 | ||
2955 | /* Perform row dance after scrolling. We are working on the range of | |
2956 | lines UNCHANGED_AT_TOP + 1 to UNCHANGED_AT_TOP + NLINES (not | |
2957 | including) in MATRIX. COPY_FROM is a vector containing, for each | |
2958 | row I in the range 0 <= I < NLINES, the index of the original line | |
2959 | to move to I. This index is relative to the row range, i.e. 0 <= | |
2960 | index < NLINES. RETAINED_P is a vector containing zero for each | |
2961 | row 0 <= I < NLINES which is empty. | |
2962 | ||
2963 | This function is called from do_scrolling and do_direct_scrolling. */ | |
2964 | ||
2965 | void | |
2966 | mirrored_line_dance (matrix, unchanged_at_top, nlines, copy_from, | |
2967 | retained_p) | |
2968 | struct glyph_matrix *matrix; | |
2969 | int unchanged_at_top, nlines; | |
2970 | int *copy_from; | |
2971 | char *retained_p; | |
2972 | { | |
2973 | /* A copy of original rows. */ | |
2974 | struct glyph_row *old_rows; | |
2975 | ||
2976 | /* Rows to assign to. */ | |
2977 | struct glyph_row *new_rows = MATRIX_ROW (matrix, unchanged_at_top); | |
2978 | ||
2979 | int i; | |
2980 | ||
2981 | /* Make a copy of the original rows. */ | |
2982 | old_rows = (struct glyph_row *) alloca (nlines * sizeof *old_rows); | |
2983 | bcopy (new_rows, old_rows, nlines * sizeof *old_rows); | |
2984 | ||
2985 | /* Assign new rows, maybe clear lines. */ | |
2986 | for (i = 0; i < nlines; ++i) | |
2987 | { | |
2988 | int enabled_before_p = new_rows[i].enabled_p; | |
2989 | ||
2990 | xassert (i + unchanged_at_top < matrix->nrows); | |
2991 | xassert (unchanged_at_top + copy_from[i] < matrix->nrows); | |
2992 | new_rows[i] = old_rows[copy_from[i]]; | |
2993 | new_rows[i].enabled_p = enabled_before_p; | |
2994 | ||
2995 | /* RETAINED_P is zero for empty lines. */ | |
2996 | if (!retained_p[copy_from[i]]) | |
2997 | new_rows[i].enabled_p = 0; | |
2998 | } | |
2999 | ||
3000 | /* Do the same for window matrices, if MATRIX Is a frame matrix. */ | |
3001 | if (frame_matrix_frame) | |
3002 | mirror_line_dance (XWINDOW (frame_matrix_frame->root_window), | |
3003 | unchanged_at_top, nlines, copy_from, retained_p); | |
3004 | } | |
3005 | ||
3006 | ||
a13396c9 | 3007 | /* Synchronize glyph pointers in the current matrix of window W with |
5cb88111 | 3008 | the current frame matrix. */ |
a13396c9 GM |
3009 | |
3010 | static void | |
3011 | sync_window_with_frame_matrix_rows (w) | |
3012 | struct window *w; | |
3013 | { | |
3014 | struct frame *f = XFRAME (w->frame); | |
3015 | struct glyph_row *window_row, *window_row_end, *frame_row; | |
075c507b | 3016 | int left, right, x, width; |
a13396c9 | 3017 | |
5cb88111 | 3018 | /* Preconditions: W must be a leaf window on a tty frame. */ |
a13396c9 | 3019 | xassert (NILP (w->hchild) && NILP (w->vchild)); |
a13396c9 GM |
3020 | xassert (!FRAME_WINDOW_P (f)); |
3021 | ||
5cb88111 GM |
3022 | left = margin_glyphs_to_reserve (w, 1, w->left_margin_width); |
3023 | right = margin_glyphs_to_reserve (w, 1, w->right_margin_width); | |
3024 | x = w->current_matrix->matrix_x; | |
3025 | width = w->current_matrix->matrix_w; | |
3026 | ||
a13396c9 GM |
3027 | window_row = w->current_matrix->rows; |
3028 | window_row_end = window_row + w->current_matrix->nrows; | |
3029 | frame_row = f->current_matrix->rows + XFASTINT (w->top); | |
5cb88111 GM |
3030 | |
3031 | for (; window_row < window_row_end; ++window_row, ++frame_row) | |
a13396c9 | 3032 | { |
5cb88111 GM |
3033 | window_row->glyphs[LEFT_MARGIN_AREA] |
3034 | = frame_row->glyphs[0] + x; | |
3035 | window_row->glyphs[TEXT_AREA] | |
3036 | = window_row->glyphs[LEFT_MARGIN_AREA] + left; | |
3037 | window_row->glyphs[LAST_AREA] | |
3038 | = window_row->glyphs[LEFT_MARGIN_AREA] + width; | |
3039 | window_row->glyphs[RIGHT_MARGIN_AREA] | |
3040 | = window_row->glyphs[LAST_AREA] - right; | |
a13396c9 GM |
3041 | } |
3042 | } | |
3043 | ||
3044 | ||
3045 | /* Return the window in the window tree rooted in W containing frame | |
3046 | row ROW. Value is null if none is found. */ | |
3047 | ||
3048 | struct window * | |
3049 | frame_row_to_window (w, row) | |
3050 | struct window *w; | |
3051 | int row; | |
3052 | { | |
3053 | struct window *found = NULL; | |
3054 | ||
3055 | while (w && !found) | |
3056 | { | |
3057 | if (!NILP (w->hchild)) | |
3058 | found = frame_row_to_window (XWINDOW (w->hchild), row); | |
3059 | else if (!NILP (w->vchild)) | |
3060 | found = frame_row_to_window (XWINDOW (w->vchild), row); | |
3061 | else if (row >= XFASTINT (w->top) | |
3062 | && row < XFASTINT (w->top) + XFASTINT (w->height)) | |
3063 | found = w; | |
3064 | ||
3065 | w = NILP (w->next) ? 0 : XWINDOW (w->next); | |
3066 | } | |
3067 | ||
3068 | return found; | |
3069 | } | |
3070 | ||
3071 | ||
5f5c8ee5 GM |
3072 | /* Perform a line dance in the window tree rooted at W, after |
3073 | scrolling a frame matrix in mirrored_line_dance. | |
3074 | ||
3075 | We are working on the range of lines UNCHANGED_AT_TOP + 1 to | |
3076 | UNCHANGED_AT_TOP + NLINES (not including) in W's frame matrix. | |
3077 | COPY_FROM is a vector containing, for each row I in the range 0 <= | |
3078 | I < NLINES, the index of the original line to move to I. This | |
3079 | index is relative to the row range, i.e. 0 <= index < NLINES. | |
3080 | RETAINED_P is a vector containing zero for each row 0 <= I < NLINES | |
3081 | which is empty. */ | |
3082 | ||
3083 | static void | |
3084 | mirror_line_dance (w, unchanged_at_top, nlines, copy_from, retained_p) | |
3085 | struct window *w; | |
3086 | int unchanged_at_top, nlines; | |
3087 | int *copy_from; | |
3088 | char *retained_p; | |
3089 | { | |
3090 | while (w) | |
3091 | { | |
3092 | if (!NILP (w->hchild)) | |
3093 | mirror_line_dance (XWINDOW (w->hchild), unchanged_at_top, | |
3094 | nlines, copy_from, retained_p); | |
3095 | else if (!NILP (w->vchild)) | |
3096 | mirror_line_dance (XWINDOW (w->vchild), unchanged_at_top, | |
3097 | nlines, copy_from, retained_p); | |
3098 | else | |
3099 | { | |
3100 | /* W is a leaf window, and we are working on its current | |
3101 | matrix m. */ | |
3102 | struct glyph_matrix *m = w->current_matrix; | |
a13396c9 | 3103 | int i, sync_p = 0; |
5f5c8ee5 GM |
3104 | struct glyph_row *old_rows; |
3105 | ||
3106 | /* Make a copy of the original rows of matrix m. */ | |
3107 | old_rows = (struct glyph_row *) alloca (m->nrows * sizeof *old_rows); | |
3108 | bcopy (m->rows, old_rows, m->nrows * sizeof *old_rows); | |
3109 | ||
3110 | for (i = 0; i < nlines; ++i) | |
3111 | { | |
3112 | /* Frame relative line assigned to. */ | |
3113 | int frame_to = i + unchanged_at_top; | |
3114 | ||
3115 | /* Frame relative line assigned. */ | |
3116 | int frame_from = copy_from[i] + unchanged_at_top; | |
3117 | ||
3118 | /* Window relative line assigned to. */ | |
3119 | int window_to = frame_to - m->matrix_y; | |
3120 | ||
3121 | /* Window relative line assigned. */ | |
3122 | int window_from = frame_from - m->matrix_y; | |
3123 | ||
3124 | /* Is assigned line inside window? */ | |
3125 | int from_inside_window_p | |
3126 | = window_from >= 0 && window_from < m->matrix_h; | |
3127 | ||
a13396c9 GM |
3128 | /* Is assigned to line inside window? */ |
3129 | int to_inside_window_p | |
3130 | = window_to >= 0 && window_to < m->matrix_h; | |
3131 | ||
3132 | if (from_inside_window_p && to_inside_window_p) | |
5f5c8ee5 | 3133 | { |
5f5c8ee5 GM |
3134 | /* Enabled setting before assignment. */ |
3135 | int enabled_before_p; | |
3136 | ||
5f5c8ee5 GM |
3137 | /* Do the assignment. The enabled_p flag is saved |
3138 | over the assignment because the old redisplay did | |
3139 | that. */ | |
3140 | enabled_before_p = m->rows[window_to].enabled_p; | |
3141 | m->rows[window_to] = old_rows[window_from]; | |
3142 | m->rows[window_to].enabled_p = enabled_before_p; | |
3143 | ||
3144 | /* If frame line is empty, window line is empty, too. */ | |
3145 | if (!retained_p[copy_from[i]]) | |
3146 | m->rows[window_to].enabled_p = 0; | |
3147 | } | |
a13396c9 GM |
3148 | else if (to_inside_window_p) |
3149 | { | |
3150 | /* A copy between windows. This is an infrequent | |
3151 | case not worth optimizing. */ | |
3152 | struct frame *f = XFRAME (w->frame); | |
3153 | struct window *root = XWINDOW (FRAME_ROOT_WINDOW (f)); | |
3154 | struct window *w2; | |
3155 | struct glyph_matrix *m2; | |
3156 | int m2_from; | |
3157 | ||
3158 | w2 = frame_row_to_window (root, frame_to); | |
3159 | m2 = w2->current_matrix; | |
3160 | m2_from = frame_from - m2->matrix_y; | |
3161 | copy_row_except_pointers (m->rows + window_to, | |
3162 | m2->rows + m2_from); | |
3163 | ||
3164 | /* If frame line is empty, window line is empty, too. */ | |
3165 | if (!retained_p[copy_from[i]]) | |
3166 | m->rows[window_to].enabled_p = 0; | |
3167 | sync_p = 1; | |
3168 | } | |
3169 | else if (from_inside_window_p) | |
3170 | sync_p = 1; | |
5f5c8ee5 | 3171 | } |
a13396c9 GM |
3172 | |
3173 | /* If there was a copy between windows, make sure glyph | |
3174 | pointers are in sync with the frame matrix. */ | |
3175 | if (sync_p) | |
3176 | sync_window_with_frame_matrix_rows (w); | |
5f5c8ee5 GM |
3177 | |
3178 | /* Check that no pointers are lost. */ | |
3179 | CHECK_MATRIX (m); | |
3180 | } | |
3181 | ||
3182 | /* Next window on same level. */ | |
3183 | w = NILP (w->next) ? 0 : XWINDOW (w->next); | |
3184 | } | |
3185 | } | |
3186 | ||
3187 | ||
3188 | #if GLYPH_DEBUG | |
3189 | ||
3190 | /* Check that window and frame matrices agree about their | |
3191 | understanding where glyphs of the rows are to find. For each | |
3192 | window in the window tree rooted at W, check that rows in the | |
3193 | matrices of leaf window agree with their frame matrices about | |
3194 | glyph pointers. */ | |
3195 | ||
3196 | void | |
3197 | check_window_matrix_pointers (w) | |
3198 | struct window *w; | |
3199 | { | |
3200 | while (w) | |
3201 | { | |
3202 | if (!NILP (w->hchild)) | |
3203 | check_window_matrix_pointers (XWINDOW (w->hchild)); | |
3204 | else if (!NILP (w->vchild)) | |
3205 | check_window_matrix_pointers (XWINDOW (w->vchild)); | |
3206 | else | |
60a8948a | 3207 | { |
5f5c8ee5 GM |
3208 | struct frame *f = XFRAME (w->frame); |
3209 | check_matrix_pointers (w->desired_matrix, f->desired_matrix); | |
3210 | check_matrix_pointers (w->current_matrix, f->current_matrix); | |
60a8948a | 3211 | } |
5f5c8ee5 GM |
3212 | |
3213 | w = NILP (w->next) ? 0 : XWINDOW (w->next); | |
3214 | } | |
3215 | } | |
3216 | ||
3217 | ||
3218 | /* Check that window rows are slices of frame rows. WINDOW_MATRIX is | |
3219 | a window and FRAME_MATRIX is the corresponding frame matrix. For | |
3220 | each row in WINDOW_MATRIX check that it's a slice of the | |
3221 | corresponding frame row. If it isn't, abort. */ | |
3222 | ||
3223 | static void | |
3224 | check_matrix_pointers (window_matrix, frame_matrix) | |
3225 | struct glyph_matrix *window_matrix, *frame_matrix; | |
3226 | { | |
3227 | /* Row number in WINDOW_MATRIX. */ | |
3228 | int i = 0; | |
3229 | ||
3230 | /* Row number corresponding to I in FRAME_MATRIX. */ | |
3231 | int j = window_matrix->matrix_y; | |
3232 | ||
3233 | /* For all rows check that the row in the window matrix is a | |
3234 | slice of the row in the frame matrix. If it isn't we didn't | |
3235 | mirror an operation on the frame matrix correctly. */ | |
3236 | while (i < window_matrix->nrows) | |
3237 | { | |
3238 | if (!glyph_row_slice_p (window_matrix->rows + i, | |
3239 | frame_matrix->rows + j)) | |
3240 | abort (); | |
3241 | ++i, ++j; | |
3242 | } | |
3243 | } | |
3244 | ||
3245 | #endif /* GLYPH_DEBUG != 0 */ | |
3246 | ||
3247 | ||
3248 | \f | |
3249 | /********************************************************************** | |
3250 | VPOS and HPOS translations | |
3251 | **********************************************************************/ | |
3252 | ||
3253 | #if GLYPH_DEBUG | |
3254 | ||
3255 | /* Translate vertical position VPOS which is relative to window W to a | |
3256 | vertical position relative to W's frame. */ | |
3257 | ||
3258 | static int | |
3259 | window_to_frame_vpos (w, vpos) | |
3260 | struct window *w; | |
3261 | int vpos; | |
3262 | { | |
3263 | struct frame *f = XFRAME (w->frame); | |
3264 | ||
3265 | xassert (!FRAME_WINDOW_P (f)); | |
3266 | xassert (vpos >= 0 && vpos <= w->desired_matrix->nrows); | |
3267 | vpos += XFASTINT (w->top); | |
3268 | xassert (vpos >= 0 && vpos <= FRAME_HEIGHT (f)); | |
3269 | return vpos; | |
3270 | } | |
3271 | ||
3272 | ||
3273 | /* Translate horizontal position HPOS which is relative to window W to | |
3274 | a vertical position relative to W's frame. */ | |
3275 | ||
3276 | static int | |
3277 | window_to_frame_hpos (w, hpos) | |
3278 | struct window *w; | |
3279 | int hpos; | |
3280 | { | |
3281 | struct frame *f = XFRAME (w->frame); | |
3282 | ||
3283 | xassert (!FRAME_WINDOW_P (f)); | |
3284 | hpos += XFASTINT (w->left); | |
3285 | return hpos; | |
3286 | } | |
3287 | ||
3288 | #endif /* GLYPH_DEBUG */ | |
3289 | ||
3290 | ||
3291 | \f | |
3292 | /********************************************************************** | |
3293 | Redrawing Frames | |
3294 | **********************************************************************/ | |
3295 | ||
3296 | DEFUN ("redraw-frame", Fredraw_frame, Sredraw_frame, 1, 1, 0, | |
7ee72033 MB |
3297 | doc: /* Clear frame FRAME and output again what is supposed to appear on it. */) |
3298 | (frame) | |
5f5c8ee5 GM |
3299 | Lisp_Object frame; |
3300 | { | |
3301 | struct frame *f; | |
3302 | ||
b7826503 | 3303 | CHECK_LIVE_FRAME (frame); |
5f5c8ee5 GM |
3304 | f = XFRAME (frame); |
3305 | ||
3306 | /* Ignore redraw requests, if frame has no glyphs yet. | |
3307 | (Implementation note: It still has to be checked why we are | |
3308 | called so early here). */ | |
3309 | if (!glyphs_initialized_initially_p) | |
3310 | return Qnil; | |
3311 | ||
3312 | update_begin (f); | |
f2adda5e | 3313 | if (FRAME_MSDOS_P (f)) |
5f5c8ee5 GM |
3314 | set_terminal_modes (); |
3315 | clear_frame (); | |
3316 | clear_current_matrices (f); | |
3317 | update_end (f); | |
3318 | fflush (stdout); | |
3319 | windows_or_buffers_changed++; | |
3320 | /* Mark all windows as inaccurate, so that every window will have | |
3321 | its redisplay done. */ | |
3322 | mark_window_display_accurate (FRAME_ROOT_WINDOW (f), 0); | |
3323 | set_window_update_flags (XWINDOW (FRAME_ROOT_WINDOW (f)), 1); | |
3324 | f->garbaged = 0; | |
3325 | return Qnil; | |
3326 | } | |
3327 | ||
3328 | ||
3329 | /* Redraw frame F. This is nothing more than a call to the Lisp | |
3330 | function redraw-frame. */ | |
3331 | ||
3332 | void | |
3333 | redraw_frame (f) | |
3334 | struct frame *f; | |
3335 | { | |
3336 | Lisp_Object frame; | |
3337 | XSETFRAME (frame, f); | |
3338 | Fredraw_frame (frame); | |
3339 | } | |
3340 | ||
3341 | ||
3342 | DEFUN ("redraw-display", Fredraw_display, Sredraw_display, 0, 0, "", | |
7ee72033 MB |
3343 | doc: /* Clear and redisplay all visible frames. */) |
3344 | () | |
5f5c8ee5 GM |
3345 | { |
3346 | Lisp_Object tail, frame; | |
3347 | ||
3348 | FOR_EACH_FRAME (tail, frame) | |
3349 | if (FRAME_VISIBLE_P (XFRAME (frame))) | |
3350 | Fredraw_frame (frame); | |
3351 | ||
3352 | return Qnil; | |
3353 | } | |
3354 | ||
3355 | ||
3356 | /* This is used when frame_garbaged is set. Call Fredraw_frame on all | |
3357 | visible frames marked as garbaged. */ | |
3358 | ||
3359 | void | |
3360 | redraw_garbaged_frames () | |
3361 | { | |
3362 | Lisp_Object tail, frame; | |
3363 | ||
3364 | FOR_EACH_FRAME (tail, frame) | |
3365 | if (FRAME_VISIBLE_P (XFRAME (frame)) | |
3366 | && FRAME_GARBAGED_P (XFRAME (frame))) | |
3367 | Fredraw_frame (frame); | |
3368 | } | |
3369 | ||
3370 | ||
3371 | \f | |
3372 | /*********************************************************************** | |
3373 | Direct Operations | |
3374 | ***********************************************************************/ | |
3375 | ||
3376 | /* Try to update display and current glyph matrix directly. | |
3377 | ||
3378 | This function is called after a character G has been inserted into | |
3379 | current_buffer. It tries to update the current glyph matrix and | |
3380 | perform appropriate screen output to reflect the insertion. If it | |
3381 | succeeds, the global flag redisplay_performed_directly_p will be | |
3382 | set to 1, and thereby prevent the more costly general redisplay | |
3383 | from running (see redisplay_internal). | |
3384 | ||
3385 | This function is not called for `hairy' character insertions. | |
3386 | In particular, it is not called when after or before change | |
3387 | functions exist, like they are used by font-lock. See keyboard.c | |
3388 | for details where this function is called. */ | |
3389 | ||
3390 | int | |
3391 | direct_output_for_insert (g) | |
3392 | int g; | |
3393 | { | |
91fb7e1b | 3394 | register struct frame *f = SELECTED_FRAME (); |
5f5c8ee5 GM |
3395 | struct window *w = XWINDOW (selected_window); |
3396 | struct it it, it2; | |
3397 | struct glyph_row *glyph_row; | |
3398 | struct glyph *glyphs, *glyph, *end; | |
3399 | int n; | |
3400 | /* Non-null means that Redisplay of W is based on window matrices. */ | |
3401 | int window_redisplay_p = FRAME_WINDOW_P (f); | |
3402 | /* Non-null means we are in overwrite mode. */ | |
3403 | int overwrite_p = !NILP (current_buffer->overwrite_mode); | |
3404 | int added_width; | |
3405 | struct text_pos pos; | |
3406 | int delta, delta_bytes; | |
3407 | ||
3408 | /* Not done directly. */ | |
3409 | redisplay_performed_directly_p = 0; | |
3410 | ||
3411 | /* Quickly give up for some common cases. */ | |
3412 | if (cursor_in_echo_area | |
3413 | /* Give up if fonts have changed. */ | |
3414 | || fonts_changed_p | |
3415 | /* Give up if face attributes have been changed. */ | |
3416 | || face_change_count | |
3417 | /* Give up if cursor position not really known. */ | |
3418 | || !display_completed | |
3419 | /* Give up if buffer appears in two places. */ | |
3420 | || buffer_shared > 1 | |
c74e645b GM |
3421 | /* Give up if currently displaying a message instead of the |
3422 | minibuffer contents. */ | |
3423 | || (EQ (selected_window, minibuf_window) | |
3424 | && EQ (minibuf_window, echo_area_window)) | |
5f5c8ee5 GM |
3425 | /* Give up for hscrolled mini-buffer because display of the prompt |
3426 | is handled specially there (see display_line). */ | |
3427 | || (MINI_WINDOW_P (w) && XFASTINT (w->hscroll)) | |
3428 | /* Give up if overwriting in the middle of a line. */ | |
3429 | || (overwrite_p | |
3430 | && PT != ZV | |
3431 | && FETCH_BYTE (PT) != '\n') | |
3432 | /* Give up for tabs and line ends. */ | |
3433 | || g == '\t' | |
3434 | || g == '\n' | |
3435 | || g == '\r' | |
3436 | /* Give up if unable to display the cursor in the window. */ | |
3437 | || w->cursor.vpos < 0 | |
c224f70b GM |
3438 | /* Give up if we are showing a message or just cleared the message |
3439 | because we might need to resize the echo area window. */ | |
3440 | || !NILP (echo_area_buffer[0]) | |
3441 | || !NILP (echo_area_buffer[1]) | |
408f5064 GM |
3442 | || (glyph_row = MATRIX_ROW (w->current_matrix, w->cursor.vpos), |
3443 | /* Can't do it in a continued line because continuation | |
3444 | lines would change. */ | |
3445 | (glyph_row->continued_p | |
3446 | /* Can't use this method if the line overlaps others or is | |
3447 | overlapped by others because these other lines would | |
3448 | have to be redisplayed. */ | |
3449 | || glyph_row->overlapping_p | |
3450 | || glyph_row->overlapped_p)) | |
5f5c8ee5 GM |
3451 | /* Can't do it for partial width windows on terminal frames |
3452 | because we can't clear to eol in such a window. */ | |
3453 | || (!window_redisplay_p && !WINDOW_FULL_WIDTH_P (w))) | |
3454 | return 0; | |
3455 | ||
f3ffc2c3 GM |
3456 | /* If we can't insert glyphs, we can use this method only |
3457 | at the end of a line. */ | |
3458 | if (!char_ins_del_ok) | |
3459 | if (PT != ZV && FETCH_BYTE (PT_BYTE) != '\n') | |
3460 | return 0; | |
3461 | ||
5f5c8ee5 GM |
3462 | /* Set up a display iterator structure for W. Glyphs will be |
3463 | produced in scratch_glyph_row. Current position is W's cursor | |
3464 | position. */ | |
3465 | clear_glyph_row (&scratch_glyph_row); | |
3466 | SET_TEXT_POS (pos, PT, PT_BYTE); | |
5f15d712 | 3467 | DEC_TEXT_POS (pos, !NILP (current_buffer->enable_multibyte_characters)); |
5f5c8ee5 GM |
3468 | init_iterator (&it, w, CHARPOS (pos), BYTEPOS (pos), &scratch_glyph_row, |
3469 | DEFAULT_FACE_ID); | |
3470 | ||
3471 | glyph_row = MATRIX_ROW (w->current_matrix, w->cursor.vpos); | |
e876ff42 GM |
3472 | if (glyph_row->mouse_face_p) |
3473 | return 0; | |
5f5c8ee5 GM |
3474 | |
3475 | /* Give up if highlighting trailing whitespace and we have trailing | |
3476 | whitespace in glyph_row. We would have to remove the trailing | |
3477 | whitespace face in that case. */ | |
f1f13490 | 3478 | if (!NILP (Vshow_trailing_whitespace) |
5f5c8ee5 GM |
3479 | && glyph_row->used[TEXT_AREA]) |
3480 | { | |
3481 | struct glyph *last; | |
3482 | ||
3483 | last = glyph_row->glyphs[TEXT_AREA] + glyph_row->used[TEXT_AREA] - 1; | |
3484 | if (last->type == STRETCH_GLYPH | |
3485 | || (last->type == CHAR_GLYPH | |
42186983 | 3486 | && last->u.ch == ' ')) |
5f5c8ee5 GM |
3487 | return 0; |
3488 | } | |
3489 | ||
3490 | /* Give up if there are overlay strings at pos. This would fail | |
3491 | if the overlay string has newlines in it. */ | |
3492 | if (STRINGP (it.string)) | |
3493 | return 0; | |
3494 | ||
3495 | it.hpos = w->cursor.hpos; | |
3496 | it.vpos = w->cursor.vpos; | |
3497 | it.current_x = w->cursor.x + it.first_visible_x; | |
3498 | it.current_y = w->cursor.y; | |
3499 | it.end_charpos = PT; | |
3500 | it.stop_charpos = min (PT, it.stop_charpos); | |
ae76d741 | 3501 | it.stop_charpos = max (IT_CHARPOS (it), it.stop_charpos); |
5f5c8ee5 GM |
3502 | |
3503 | /* More than one display element may be returned for PT - 1 if | |
3504 | (i) it's a control character which is translated into `\003' or | |
3505 | `^C', or (ii) it has a display table entry, or (iii) it's a | |
3506 | combination of both. */ | |
3507 | delta = delta_bytes = 0; | |
3508 | while (get_next_display_element (&it)) | |
3509 | { | |
3510 | PRODUCE_GLYPHS (&it); | |
3511 | ||
3512 | /* Give up if glyph doesn't fit completely on the line. */ | |
3513 | if (it.current_x >= it.last_visible_x) | |
3514 | return 0; | |
3515 | ||
3516 | /* Give up if new glyph has different ascent or descent than | |
3517 | the original row, or if it is not a character glyph. */ | |
3518 | if (glyph_row->ascent != it.ascent | |
3519 | || glyph_row->height != it.ascent + it.descent | |
408f5064 GM |
3520 | || glyph_row->phys_ascent != it.phys_ascent |
3521 | || glyph_row->phys_height != it.phys_ascent + it.phys_descent | |
5f5c8ee5 GM |
3522 | || it.what != IT_CHARACTER) |
3523 | return 0; | |
3524 | ||
3525 | delta += 1; | |
3526 | delta_bytes += it.len; | |
a2e2a7f6 | 3527 | set_iterator_to_next (&it, 1); |
5f5c8ee5 GM |
3528 | } |
3529 | ||
3530 | /* Give up if we hit the right edge of the window. We would have | |
3531 | to insert truncation or continuation glyphs. */ | |
3532 | added_width = it.current_x - (w->cursor.x + it.first_visible_x); | |
3533 | if (glyph_row->pixel_width + added_width >= it.last_visible_x) | |
3534 | return 0; | |
3535 | ||
3536 | /* Give up if there is a \t following in the line. */ | |
3537 | it2 = it; | |
3538 | it2.end_charpos = ZV; | |
3539 | it2.stop_charpos = min (it2.stop_charpos, ZV); | |
3540 | while (get_next_display_element (&it2) | |
3541 | && !ITERATOR_AT_END_OF_LINE_P (&it2)) | |
3542 | { | |
3543 | if (it2.c == '\t') | |
3544 | return 0; | |
a2e2a7f6 | 3545 | set_iterator_to_next (&it2, 1); |
5f5c8ee5 GM |
3546 | } |
3547 | ||
3548 | /* Number of new glyphs produced. */ | |
3549 | n = it.glyph_row->used[TEXT_AREA]; | |
3550 | ||
3551 | /* Start and end of glyphs in original row. */ | |
3552 | glyphs = glyph_row->glyphs[TEXT_AREA] + w->cursor.hpos; | |
3553 | end = glyph_row->glyphs[1 + TEXT_AREA]; | |
60a8948a | 3554 | |
5f5c8ee5 GM |
3555 | /* Make room for new glyphs, then insert them. */ |
3556 | xassert (end - glyphs - n >= 0); | |
700fb05a GM |
3557 | safe_bcopy ((char *) glyphs, (char *) (glyphs + n), |
3558 | (end - glyphs - n) * sizeof (*end)); | |
5f5c8ee5 GM |
3559 | bcopy (it.glyph_row->glyphs[TEXT_AREA], glyphs, n * sizeof *glyphs); |
3560 | glyph_row->used[TEXT_AREA] = min (glyph_row->used[TEXT_AREA] + n, | |
3561 | end - glyph_row->glyphs[TEXT_AREA]); | |
3562 | ||
3563 | /* Compute new line width. */ | |
3564 | glyph = glyph_row->glyphs[TEXT_AREA]; | |
3565 | end = glyph + glyph_row->used[TEXT_AREA]; | |
3566 | glyph_row->pixel_width = glyph_row->x; | |
3567 | while (glyph < end) | |
3568 | { | |
3569 | glyph_row->pixel_width += glyph->pixel_width; | |
3570 | ++glyph; | |
3571 | } | |
3572 | ||
3573 | /* Increment buffer positions for glyphs following the newly | |
3574 | inserted ones. */ | |
3575 | for (glyph = glyphs + n; glyph < end; ++glyph) | |
f2fa858f | 3576 | if (glyph->charpos > 0 && BUFFERP (glyph->object)) |
5f5c8ee5 GM |
3577 | glyph->charpos += delta; |
3578 | ||
3579 | if (MATRIX_ROW_END_CHARPOS (glyph_row) > 0) | |
3580 | { | |
3581 | MATRIX_ROW_END_CHARPOS (glyph_row) += delta; | |
3582 | MATRIX_ROW_END_BYTEPOS (glyph_row) += delta_bytes; | |
3583 | } | |
3584 | ||
3585 | /* Adjust positions in lines following the one we are in. */ | |
86c11ba1 GM |
3586 | increment_matrix_positions (w->current_matrix, |
3587 | w->cursor.vpos + 1, | |
3588 | w->current_matrix->nrows, | |
3589 | delta, delta_bytes); | |
5f5c8ee5 GM |
3590 | |
3591 | glyph_row->contains_overlapping_glyphs_p | |
3592 | |= it.glyph_row->contains_overlapping_glyphs_p; | |
3593 | ||
975c6226 GM |
3594 | glyph_row->displays_text_p = 1; |
3595 | w->window_end_vpos = make_number (max (w->cursor.vpos, | |
3596 | XFASTINT (w->window_end_vpos))); | |
3597 | ||
f1f13490 | 3598 | if (!NILP (Vshow_trailing_whitespace)) |
5f5c8ee5 GM |
3599 | highlight_trailing_whitespace (it.f, glyph_row); |
3600 | ||
3601 | /* Write glyphs. If at end of row, we can simply call write_glyphs. | |
3602 | In the middle, we have to insert glyphs. Note that this is now | |
3603 | implemented for X frames. The implementation uses updated_window | |
3604 | and updated_row. */ | |
3605 | updated_row = glyph_row; | |
9d126815 | 3606 | updated_area = TEXT_AREA; |
5f5c8ee5 GM |
3607 | update_begin (f); |
3608 | if (rif) | |
3609 | { | |
3610 | rif->update_window_begin_hook (w); | |
3611 | ||
7728f17b GM |
3612 | if (glyphs == end - n |
3613 | /* In front of a space added by append_space. */ | |
3614 | || (glyphs == end - n - 1 | |
3615 | && (end - n)->charpos <= 0)) | |
5f5c8ee5 GM |
3616 | rif->write_glyphs (glyphs, n); |
3617 | else | |
3618 | rif->insert_glyphs (glyphs, n); | |
3619 | } | |
3620 | else | |
3621 | { | |
3622 | if (glyphs == end - n) | |
3623 | write_glyphs (glyphs, n); | |
3624 | else | |
3625 | insert_glyphs (glyphs, n); | |
3626 | } | |
4588ec20 | 3627 | |
5f5c8ee5 GM |
3628 | w->cursor.hpos += n; |
3629 | w->cursor.x = it.current_x - it.first_visible_x; | |
3630 | xassert (w->cursor.hpos >= 0 | |
3631 | && w->cursor.hpos < w->desired_matrix->matrix_w); | |
3632 | ||
3633 | /* How to set the cursor differs depending on whether we are | |
3634 | using a frame matrix or a window matrix. Note that when | |
3635 | a frame matrix is used, cursor_to expects frame coordinates, | |
3636 | and the X and Y parameters are not used. */ | |
3637 | if (window_redisplay_p) | |
3638 | rif->cursor_to (w->cursor.vpos, w->cursor.hpos, | |
3639 | w->cursor.y, w->cursor.x); | |
3640 | else | |
3641 | { | |
3642 | int x, y; | |
3643 | x = (WINDOW_TO_FRAME_HPOS (w, w->cursor.hpos) | |
3644 | + (INTEGERP (w->left_margin_width) | |
3645 | ? XFASTINT (w->left_margin_width) | |
3646 | : 0)); | |
3647 | y = WINDOW_TO_FRAME_VPOS (w, w->cursor.vpos); | |
3648 | cursor_to (y, x); | |
3649 | } | |
4588ec20 | 3650 | |
5f5c8ee5 | 3651 | if (rif) |
e876ff42 | 3652 | rif->update_window_end_hook (w, 1, 0); |
5f5c8ee5 GM |
3653 | update_end (f); |
3654 | updated_row = NULL; | |
3655 | fflush (stdout); | |
4588ec20 | 3656 | |
5f5c8ee5 | 3657 | TRACE ((stderr, "direct output for insert\n")); |
4588ec20 | 3658 | |
0f8f5ffe GM |
3659 | UNCHANGED_MODIFIED = MODIFF; |
3660 | BEG_UNCHANGED = GPT - BEG; | |
5f5c8ee5 GM |
3661 | XSETFASTINT (w->last_point, PT); |
3662 | w->last_cursor = w->cursor; | |
3663 | XSETFASTINT (w->last_modified, MODIFF); | |
3664 | XSETFASTINT (w->last_overlay_modified, OVERLAY_MODIFF); | |
4588ec20 | 3665 | |
5f5c8ee5 GM |
3666 | redisplay_performed_directly_p = 1; |
3667 | return 1; | |
3668 | } | |
448fd7c0 | 3669 | |
4588ec20 | 3670 | |
5f5c8ee5 GM |
3671 | /* Perform a direct display update for moving PT by N positions |
3672 | left or right. N < 0 means a movement backwards. This function | |
3673 | is currently only called for N == 1 or N == -1. */ | |
3674 | ||
3675 | int | |
3676 | direct_output_forward_char (n) | |
3677 | int n; | |
3678 | { | |
91fb7e1b | 3679 | struct frame *f = SELECTED_FRAME (); |
5f5c8ee5 GM |
3680 | struct window *w = XWINDOW (selected_window); |
3681 | struct glyph_row *row; | |
3682 | ||
959804a0 | 3683 | /* Give up if point moved out of or into a composition. */ |
7c752c80 | 3684 | if (check_point_in_composition (current_buffer, XINT (w->last_point), |
959804a0 KH |
3685 | current_buffer, PT)) |
3686 | return 0; | |
3687 | ||
5f5c8ee5 GM |
3688 | /* Give up if face attributes have been changed. */ |
3689 | if (face_change_count) | |
3690 | return 0; | |
3691 | ||
3692 | /* Give up if current matrix is not up to date or we are | |
3693 | displaying a message. */ | |
3694 | if (!display_completed || cursor_in_echo_area) | |
3695 | return 0; | |
3696 | ||
3697 | /* Give up if the buffer's direction is reversed. */ | |
3698 | if (!NILP (XBUFFER (w->buffer)->direction_reversed)) | |
3699 | return 0; | |
3700 | ||
3701 | /* Can't use direct output if highlighting a region. */ | |
3702 | if (!NILP (Vtransient_mark_mode) && !NILP (current_buffer->mark_active)) | |
3703 | return 0; | |
3704 | ||
f1f13490 GM |
3705 | /* Can't use direct output if highlighting trailing whitespace. */ |
3706 | if (!NILP (Vshow_trailing_whitespace)) | |
3707 | return 0; | |
3708 | ||
d2d2ddaf GM |
3709 | /* Give up if we are showing a message or just cleared the message |
3710 | because we might need to resize the echo area window. */ | |
3711 | if (!NILP (echo_area_buffer[0]) || !NILP (echo_area_buffer[1])) | |
3712 | return 0; | |
3713 | ||
e4e0bee9 GM |
3714 | /* Give up if currently displaying a message instead of the |
3715 | minibuffer contents. */ | |
3716 | if (XWINDOW (minibuf_window) == w | |
3717 | && EQ (minibuf_window, echo_area_window)) | |
3718 | return 0; | |
3719 | ||
d2d2ddaf GM |
3720 | /* Give up if we don't know where the cursor is. */ |
3721 | if (w->cursor.vpos < 0) | |
3722 | return 0; | |
3723 | ||
5f5c8ee5 GM |
3724 | row = MATRIX_ROW (w->current_matrix, w->cursor.vpos); |
3725 | ||
2a8bd25f | 3726 | /* Give up if PT is outside of the last known cursor row. */ |
9b784ab8 GM |
3727 | if (PT <= MATRIX_ROW_START_CHARPOS (row) |
3728 | || PT >= MATRIX_ROW_END_CHARPOS (row)) | |
5f5c8ee5 GM |
3729 | return 0; |
3730 | ||
3731 | set_cursor_from_row (w, row, w->current_matrix, 0, 0, 0, 0); | |
2a8bd25f | 3732 | |
5f5c8ee5 GM |
3733 | w->last_cursor = w->cursor; |
3734 | XSETFASTINT (w->last_point, PT); | |
3735 | ||
3736 | xassert (w->cursor.hpos >= 0 | |
3737 | && w->cursor.hpos < w->desired_matrix->matrix_w); | |
3738 | ||
3739 | if (FRAME_WINDOW_P (f)) | |
3740 | rif->cursor_to (w->cursor.vpos, w->cursor.hpos, | |
3741 | w->cursor.y, w->cursor.x); | |
3742 | else | |
3743 | { | |
3744 | int x, y; | |
3745 | x = (WINDOW_TO_FRAME_HPOS (w, w->cursor.hpos) | |
3746 | + (INTEGERP (w->left_margin_width) | |
3747 | ? XFASTINT (w->left_margin_width) | |
3748 | : 0)); | |
3749 | y = WINDOW_TO_FRAME_VPOS (w, w->cursor.vpos); | |
3750 | cursor_to (y, x); | |
4588ec20 | 3751 | } |
5f5c8ee5 GM |
3752 | |
3753 | fflush (stdout); | |
3754 | redisplay_performed_directly_p = 1; | |
4588ec20 JB |
3755 | return 1; |
3756 | } | |
5f5c8ee5 GM |
3757 | |
3758 | ||
4588ec20 | 3759 | \f |
5f5c8ee5 GM |
3760 | /*********************************************************************** |
3761 | Frame Update | |
3762 | ***********************************************************************/ | |
4588ec20 | 3763 | |
5f5c8ee5 | 3764 | /* Update frame F based on the data in desired matrices. |
4588ec20 | 3765 | |
5f5c8ee5 GM |
3766 | If FORCE_P is non-zero, don't let redisplay be stopped by detecting |
3767 | pending input. If INHIBIT_HAIRY_ID_P is non-zero, don't try | |
3768 | scrolling. | |
3769 | ||
3770 | Value is non-zero if redisplay was stopped due to pending input. */ | |
4588ec20 | 3771 | |
5f5c8ee5 GM |
3772 | int |
3773 | update_frame (f, force_p, inhibit_hairy_id_p) | |
3774 | struct frame *f; | |
3775 | int force_p; | |
3776 | int inhibit_hairy_id_p; | |
3777 | { | |
3778 | /* 1 means display has been paused because of pending input. */ | |
3779 | int paused_p; | |
3780 | struct window *root_window = XWINDOW (f->root_window); | |
3781 | ||
3782 | if (FRAME_WINDOW_P (f)) | |
4588ec20 | 3783 | { |
5f5c8ee5 GM |
3784 | /* We are working on window matrix basis. All windows whose |
3785 | flag must_be_updated_p is set have to be updated. */ | |
3786 | ||
3787 | /* Record that we are not working on frame matrices. */ | |
3788 | set_frame_matrix_frame (NULL); | |
3789 | ||
3790 | /* Update all windows in the window tree of F, maybe stopping | |
3791 | when pending input is detected. */ | |
3792 | update_begin (f); | |
3793 | ||
3794 | /* Update the menu bar on X frames that don't have toolkit | |
3795 | support. */ | |
3796 | if (WINDOWP (f->menu_bar_window)) | |
3797 | update_window (XWINDOW (f->menu_bar_window), 1); | |
3798 | ||
3799 | /* Update the tool-bar window, if present. */ | |
9ea173e8 | 3800 | if (WINDOWP (f->tool_bar_window)) |
4588ec20 | 3801 | { |
5f5c8ee5 | 3802 | Lisp_Object tem; |
9ea173e8 | 3803 | struct window *w = XWINDOW (f->tool_bar_window); |
5f5c8ee5 GM |
3804 | |
3805 | /* Update tool-bar window. */ | |
3806 | if (w->must_be_updated_p) | |
4588ec20 | 3807 | { |
5f5c8ee5 GM |
3808 | update_window (w, 1); |
3809 | w->must_be_updated_p = 0; | |
3810 | ||
3811 | /* Swap tool-bar strings. We swap because we want to | |
3812 | reuse strings. */ | |
9ea173e8 GM |
3813 | tem = f->current_tool_bar_string; |
3814 | f->current_tool_bar_string = f->desired_tool_bar_string; | |
3815 | f->desired_tool_bar_string = tem; | |
4588ec20 JB |
3816 | } |
3817 | } | |
5f5c8ee5 GM |
3818 | |
3819 | ||
3820 | /* Update windows. */ | |
3821 | paused_p = update_window_tree (root_window, force_p); | |
3822 | update_end (f); | |
868dd24b GM |
3823 | |
3824 | #if 0 /* This flush is a performance bottleneck under X, | |
3825 | and it doesn't seem to be necessary anyway. */ | |
5f5c8ee5 GM |
3826 | rif->flush_display (f); |
3827 | #endif | |
4588ec20 | 3828 | } |
5f5c8ee5 GM |
3829 | else |
3830 | { | |
3831 | /* We are working on frame matrix basis. Set the frame on whose | |
3832 | frame matrix we operate. */ | |
3833 | set_frame_matrix_frame (f); | |
3834 | ||
868dd24b | 3835 | /* Build F's desired matrix from window matrices. */ |
5f5c8ee5 GM |
3836 | build_frame_matrix (f); |
3837 | ||
868dd24b GM |
3838 | /* Update the display */ |
3839 | update_begin (f); | |
5f5c8ee5 | 3840 | paused_p = update_frame_1 (f, force_p, inhibit_hairy_id_p); |
868dd24b GM |
3841 | update_end (f); |
3842 | ||
3843 | if (termscript) | |
3844 | fflush (termscript); | |
3845 | fflush (stdout); | |
3846 | ||
5f5c8ee5 | 3847 | /* Check window matrices for lost pointers. */ |
2d5912c1 | 3848 | #if GLYPH_DEBUG |
9b0e97aa GM |
3849 | check_window_matrix_pointers (root_window); |
3850 | add_frame_display_history (f, paused_p); | |
3851 | #endif | |
5f5c8ee5 GM |
3852 | } |
3853 | ||
3854 | /* Reset flags indicating that a window should be updated. */ | |
3855 | set_window_update_flags (root_window, 0); | |
868dd24b GM |
3856 | |
3857 | display_completed = !paused_p; | |
5f5c8ee5 | 3858 | return paused_p; |
4588ec20 | 3859 | } |
5f5c8ee5 GM |
3860 | |
3861 | ||
4588ec20 | 3862 | \f |
5f5c8ee5 GM |
3863 | /************************************************************************ |
3864 | Window-based updates | |
3865 | ************************************************************************/ | |
3866 | ||
3867 | /* Perform updates in window tree rooted at W. FORCE_P non-zero means | |
3868 | don't stop updating when input is pending. */ | |
3869 | ||
3870 | static int | |
3871 | update_window_tree (w, force_p) | |
3872 | struct window *w; | |
3873 | int force_p; | |
3874 | { | |
3875 | int paused_p = 0; | |
3876 | ||
3877 | while (w && !paused_p) | |
3878 | { | |
3879 | if (!NILP (w->hchild)) | |
3880 | paused_p |= update_window_tree (XWINDOW (w->hchild), force_p); | |
3881 | else if (!NILP (w->vchild)) | |
3882 | paused_p |= update_window_tree (XWINDOW (w->vchild), force_p); | |
3883 | else if (w->must_be_updated_p) | |
3884 | paused_p |= update_window (w, force_p); | |
3885 | ||
3886 | w = NILP (w->next) ? 0 : XWINDOW (w->next); | |
3887 | } | |
3888 | ||
3889 | return paused_p; | |
3890 | } | |
3891 | ||
3892 | ||
3893 | /* Update window W if its flag must_be_updated_p is non-zero. If | |
3894 | FORCE_P is non-zero, don't stop updating if input is pending. */ | |
3895 | ||
3896 | void | |
3897 | update_single_window (w, force_p) | |
3898 | struct window *w; | |
3899 | int force_p; | |
3900 | { | |
3901 | if (w->must_be_updated_p) | |
3902 | { | |
3903 | struct frame *f = XFRAME (WINDOW_FRAME (w)); | |
3904 | ||
3905 | /* Record that this is not a frame-based redisplay. */ | |
3906 | set_frame_matrix_frame (NULL); | |
3907 | ||
3908 | /* Update W. */ | |
3909 | update_begin (f); | |
3910 | update_window (w, force_p); | |
3911 | update_end (f); | |
4588ec20 | 3912 | |
5f5c8ee5 GM |
3913 | /* Reset flag in W. */ |
3914 | w->must_be_updated_p = 0; | |
3915 | } | |
3916 | } | |
4588ec20 | 3917 | |
4588ec20 | 3918 | |
408f5064 GM |
3919 | /* Redraw lines from the current matrix of window W that are |
3920 | overlapped by other rows. YB is bottom-most y-position in W. */ | |
3921 | ||
3922 | static void | |
3923 | redraw_overlapped_rows (w, yb) | |
3924 | struct window *w; | |
3925 | int yb; | |
3926 | { | |
d8ee7803 GM |
3927 | int i; |
3928 | ||
408f5064 GM |
3929 | /* If rows overlapping others have been changed, the rows being |
3930 | overlapped have to be redrawn. This won't draw lines that have | |
3931 | already been drawn in update_window_line because overlapped_p in | |
3932 | desired rows is 0, so after row assignment overlapped_p in | |
3933 | current rows is 0. */ | |
3934 | for (i = 0; i < w->current_matrix->nrows; ++i) | |
3935 | { | |
e876ff42 | 3936 | struct glyph_row *row = w->current_matrix->rows + i; |
408f5064 GM |
3937 | |
3938 | if (!row->enabled_p) | |
3939 | break; | |
3940 | else if (row->mode_line_p) | |
3941 | continue; | |
3942 | ||
3943 | if (row->overlapped_p) | |
3944 | { | |
3945 | enum glyph_row_area area; | |
3946 | ||
3947 | for (area = LEFT_MARGIN_AREA; area < LAST_AREA; ++area) | |
3948 | { | |
3949 | updated_row = row; | |
3950 | updated_area = area; | |
3951 | rif->cursor_to (i, 0, row->y, area == TEXT_AREA ? row->x : 0); | |
3952 | if (row->used[area]) | |
3953 | rif->write_glyphs (row->glyphs[area], row->used[area]); | |
3954 | rif->clear_end_of_line (-1); | |
3955 | } | |
3956 | ||
3957 | row->overlapped_p = 0; | |
3958 | } | |
3959 | ||
e876ff42 | 3960 | if (MATRIX_ROW_BOTTOM_Y (row) >= yb) |
408f5064 GM |
3961 | break; |
3962 | } | |
3963 | } | |
3964 | ||
3965 | ||
3966 | /* Redraw lines from the current matrix of window W that overlap | |
3967 | others. YB is bottom-most y-position in W. */ | |
3968 | ||
3969 | static void | |
3970 | redraw_overlapping_rows (w, yb) | |
3971 | struct window *w; | |
3972 | int yb; | |
3973 | { | |
3974 | int i, bottom_y; | |
3975 | struct glyph_row *row; | |
3976 | ||
3977 | for (i = 0; i < w->current_matrix->nrows; ++i) | |
3978 | { | |
3979 | row = w->current_matrix->rows + i; | |
3980 | ||
3981 | if (!row->enabled_p) | |
3982 | break; | |
3983 | else if (row->mode_line_p) | |
3984 | continue; | |
3985 | ||
3986 | bottom_y = MATRIX_ROW_BOTTOM_Y (row); | |
3987 | ||
3988 | if (row->overlapping_p && i > 0 && bottom_y < yb) | |
3989 | { | |
3990 | if (row->used[LEFT_MARGIN_AREA]) | |
3991 | rif->fix_overlapping_area (w, row, LEFT_MARGIN_AREA); | |
3992 | ||
3993 | if (row->used[TEXT_AREA]) | |
3994 | rif->fix_overlapping_area (w, row, TEXT_AREA); | |
3995 | ||
3996 | if (row->used[RIGHT_MARGIN_AREA]) | |
3997 | rif->fix_overlapping_area (w, row, RIGHT_MARGIN_AREA); | |
3998 | ||
3999 | /* Record in neighbor rows that ROW overwrites part of their | |
4000 | display. */ | |
4001 | if (row->phys_ascent > row->ascent && i > 0) | |
4002 | MATRIX_ROW (w->current_matrix, i - 1)->overlapped_p = 1; | |
4003 | if ((row->phys_height - row->phys_ascent | |
4004 | > row->height - row->ascent) | |
4005 | && bottom_y < yb) | |
4006 | MATRIX_ROW (w->current_matrix, i + 1)->overlapped_p = 1; | |
4007 | } | |
4008 | ||
4009 | if (bottom_y >= yb) | |
4010 | break; | |
4011 | } | |
4012 | } | |
4013 | ||
4014 | ||
93962bfa GM |
4015 | #ifdef GLYPH_DEBUG |
4016 | ||
4017 | /* Check that no row in the current matrix of window W is enabled | |
4018 | which is below what's displayed in the window. */ | |
4019 | ||
4020 | void | |
4021 | check_current_matrix_flags (w) | |
4022 | struct window *w; | |
4023 | { | |
4024 | int last_seen_p = 0; | |
4025 | int i, yb = window_text_bottom_y (w); | |
4026 | ||
4027 | for (i = 0; i < w->current_matrix->nrows - 1; ++i) | |
4028 | { | |
4029 | struct glyph_row *row = MATRIX_ROW (w->current_matrix, i); | |
4030 | if (!last_seen_p && MATRIX_ROW_BOTTOM_Y (row) >= yb) | |
4031 | last_seen_p = 1; | |
4032 | else if (last_seen_p && row->enabled_p) | |
4033 | abort (); | |
4034 | } | |
4035 | } | |
4036 | ||
4037 | #endif /* GLYPH_DEBUG */ | |
4038 | ||
4039 | ||
5f5c8ee5 GM |
4040 | /* Update display of window W. FORCE_P non-zero means that we should |
4041 | not stop when detecting pending input. */ | |
4042 | ||
4043 | static int | |
4044 | update_window (w, force_p) | |
4588ec20 | 4045 | struct window *w; |
5f5c8ee5 | 4046 | int force_p; |
4588ec20 | 4047 | { |
5f5c8ee5 GM |
4048 | struct glyph_matrix *desired_matrix = w->desired_matrix; |
4049 | int paused_p; | |
4050 | int preempt_count = baud_rate / 2400 + 1; | |
4051 | extern int input_pending; | |
8fd9a666 | 4052 | extern Lisp_Object do_mouse_tracking; |
b96fd3e8 GM |
4053 | #if GLYPH_DEBUG |
4054 | struct frame *f = XFRAME (WINDOW_FRAME (w)); | |
5f5c8ee5 | 4055 | extern struct frame *updating_frame; |
b96fd3e8 | 4056 | #endif |
5f5c8ee5 GM |
4057 | |
4058 | /* Check that W's frame doesn't have glyph matrices. */ | |
4059 | xassert (FRAME_WINDOW_P (f)); | |
4060 | xassert (updating_frame != NULL); | |
4061 | ||
4062 | /* Check pending input the first time so that we can quickly return. */ | |
4063 | if (redisplay_dont_pause) | |
4064 | force_p = 1; | |
4065 | else | |
4066 | detect_input_pending (); | |
4588ec20 | 4067 | |
5f5c8ee5 GM |
4068 | /* If forced to complete the update, or if no input is pending, do |
4069 | the update. */ | |
8fd9a666 | 4070 | if (force_p || !input_pending || !NILP (do_mouse_tracking)) |
4588ec20 | 4071 | { |
5f5c8ee5 GM |
4072 | struct glyph_row *row, *end; |
4073 | struct glyph_row *mode_line_row; | |
56974e03 | 4074 | struct glyph_row *header_line_row; |
e87b8809 | 4075 | int yb, changed_p = 0, mouse_face_overwritten_p = 0, n_updated; |
5f5c8ee5 GM |
4076 | |
4077 | rif->update_window_begin_hook (w); | |
4078 | yb = window_text_bottom_y (w); | |
4079 | ||
4080 | /* If window has a top line, update it before everything else. | |
4081 | Adjust y-positions of other rows by the top line height. */ | |
4082 | row = desired_matrix->rows; | |
4083 | end = row + desired_matrix->nrows - 1; | |
56974e03 | 4084 | |
5f5c8ee5 | 4085 | if (row->mode_line_p) |
56974e03 GM |
4086 | { |
4087 | header_line_row = row; | |
4088 | ++row; | |
4089 | } | |
4090 | else | |
4091 | header_line_row = NULL; | |
5f5c8ee5 GM |
4092 | |
4093 | /* Update the mode line, if necessary. */ | |
4094 | mode_line_row = MATRIX_MODE_LINE_ROW (desired_matrix); | |
4095 | if (mode_line_row->mode_line_p && mode_line_row->enabled_p) | |
4096 | { | |
4097 | mode_line_row->y = yb; | |
4098 | update_window_line (w, MATRIX_ROW_VPOS (mode_line_row, | |
e876ff42 GM |
4099 | desired_matrix), |
4100 | &mouse_face_overwritten_p); | |
408f5064 | 4101 | changed_p = 1; |
5f5c8ee5 GM |
4102 | } |
4103 | ||
4104 | /* Find first enabled row. Optimizations in redisplay_internal | |
4105 | may lead to an update with only one row enabled. There may | |
4106 | be also completely empty matrices. */ | |
4107 | while (row < end && !row->enabled_p) | |
4108 | ++row; | |
4109 | ||
bfdcafe1 | 4110 | /* Try reusing part of the display by copying. */ |
5f5c8ee5 | 4111 | if (row < end && !desired_matrix->no_scrolling_p) |
56974e03 GM |
4112 | { |
4113 | int rc = scrolling_window (w, header_line_row != NULL); | |
4114 | if (rc < 0) | |
4115 | { | |
4116 | /* All rows were found to be equal. */ | |
4117 | paused_p = 0; | |
4118 | goto set_cursor; | |
4119 | } | |
4120 | else if (rc > 0) | |
4121 | /* We've scrolled the display. */ | |
4122 | force_p = 1; | |
4123 | changed_p = 1; | |
4124 | } | |
5f5c8ee5 GM |
4125 | |
4126 | /* Update the top mode line after scrolling because a new top | |
4127 | line would otherwise overwrite lines at the top of the window | |
4128 | that can be scrolled. */ | |
045dee35 | 4129 | if (header_line_row && header_line_row->enabled_p) |
5f5c8ee5 | 4130 | { |
045dee35 | 4131 | header_line_row->y = 0; |
e876ff42 | 4132 | update_window_line (w, 0, &mouse_face_overwritten_p); |
408f5064 | 4133 | changed_p = 1; |
5f5c8ee5 GM |
4134 | } |
4135 | ||
4136 | /* Update the rest of the lines. */ | |
e87b8809 | 4137 | for (n_updated = 0; row < end && (force_p || !input_pending); ++row) |
b7412313 | 4138 | if (row->enabled_p) |
5f5c8ee5 GM |
4139 | { |
4140 | int vpos = MATRIX_ROW_VPOS (row, desired_matrix); | |
4141 | int i; | |
4142 | ||
4143 | /* We'll Have to play a little bit with when to | |
4144 | detect_input_pending. If it's done too often, | |
4145 | scrolling large windows with repeated scroll-up | |
4146 | commands will too quickly pause redisplay. */ | |
e87b8809 | 4147 | if (!force_p && ++n_updated % preempt_count == 0) |
5f5c8ee5 GM |
4148 | detect_input_pending (); |
4149 | ||
e876ff42 GM |
4150 | changed_p |= update_window_line (w, vpos, |
4151 | &mouse_face_overwritten_p); | |
5f5c8ee5 GM |
4152 | |
4153 | /* Mark all rows below the last visible one in the current | |
4154 | matrix as invalid. This is necessary because of | |
4155 | variable line heights. Consider the case of three | |
4156 | successive redisplays, where the first displays 5 | |
4157 | lines, the second 3 lines, and the third 5 lines again. | |
4158 | If the second redisplay wouldn't mark rows in the | |
4159 | current matrix invalid, the third redisplay might be | |
4160 | tempted to optimize redisplay based on lines displayed | |
4161 | in the first redisplay. */ | |
4162 | if (MATRIX_ROW_BOTTOM_Y (row) >= yb) | |
4163 | for (i = vpos + 1; i < w->current_matrix->nrows - 1; ++i) | |
4164 | MATRIX_ROW (w->current_matrix, i)->enabled_p = 0; | |
4165 | } | |
4166 | ||
4167 | /* Was display preempted? */ | |
4168 | paused_p = row < end; | |
4169 | ||
56974e03 GM |
4170 | set_cursor: |
4171 | ||
408f5064 | 4172 | /* Fix the appearance of overlapping(overlapped rows. */ |
5f5c8ee5 GM |
4173 | if (!paused_p && !w->pseudo_window_p) |
4174 | { | |
e876ff42 GM |
4175 | if (changed_p && rif->fix_overlapping_area) |
4176 | { | |
4177 | redraw_overlapped_rows (w, yb); | |
4178 | redraw_overlapping_rows (w, yb); | |
4179 | } | |
4180 | ||
5f5c8ee5 GM |
4181 | /* Make cursor visible at cursor position of W. */ |
4182 | set_window_cursor_after_update (w); | |
4183 | ||
e876ff42 GM |
4184 | #if 0 /* Check that current matrix invariants are satisfied. This is |
4185 | for debugging only. See the comment of check_matrix_invariants. */ | |
5f5c8ee5 GM |
4186 | IF_DEBUG (check_matrix_invariants (w)); |
4187 | #endif | |
4588ec20 | 4188 | } |
5f5c8ee5 GM |
4189 | |
4190 | #if GLYPH_DEBUG | |
4191 | /* Remember the redisplay method used to display the matrix. */ | |
4192 | strcpy (w->current_matrix->method, w->desired_matrix->method); | |
4193 | #endif | |
408f5064 | 4194 | |
56974e03 GM |
4195 | /* End the update of window W. Don't set the cursor if we |
4196 | paused updating the display because in this case, | |
4197 | set_window_cursor_after_update hasn't been called, and | |
4198 | output_cursor doesn't contain the cursor location. */ | |
4199 | rif->update_window_end_hook (w, !paused_p, mouse_face_overwritten_p); | |
4588ec20 | 4200 | } |
5f5c8ee5 GM |
4201 | else |
4202 | paused_p = 1; | |
4203 | ||
2d5912c1 | 4204 | #if GLYPH_DEBUG |
0cffd9d8 | 4205 | /* check_current_matrix_flags (w); */ |
9b0e97aa GM |
4206 | add_window_display_history (w, w->current_matrix->method, paused_p); |
4207 | #endif | |
4208 | ||
5f5c8ee5 | 4209 | clear_glyph_matrix (desired_matrix); |
408f5064 | 4210 | |
5f5c8ee5 | 4211 | return paused_p; |
4588ec20 JB |
4212 | } |
4213 | ||
b64b3980 | 4214 | |
5f5c8ee5 GM |
4215 | /* Update the display of area AREA in window W, row number VPOS. |
4216 | AREA can be either LEFT_MARGIN_AREA or RIGHT_MARGIN_AREA. */ | |
4217 | ||
4218 | static void | |
4219 | update_marginal_area (w, area, vpos) | |
b64b3980 | 4220 | struct window *w; |
5f5c8ee5 | 4221 | int area, vpos; |
b64b3980 | 4222 | { |
5f5c8ee5 GM |
4223 | struct glyph_row *desired_row = MATRIX_ROW (w->desired_matrix, vpos); |
4224 | ||
4225 | /* Let functions in xterm.c know what area subsequent X positions | |
4226 | will be relative to. */ | |
4227 | updated_area = area; | |
4228 | ||
4229 | /* Set cursor to start of glyphs, write them, and clear to the end | |
4230 | of the area. I don't think that something more sophisticated is | |
4231 | necessary here, since marginal areas will not be the default. */ | |
4232 | rif->cursor_to (vpos, 0, desired_row->y, 0); | |
4233 | if (desired_row->used[area]) | |
4234 | rif->write_glyphs (desired_row->glyphs[area], desired_row->used[area]); | |
4235 | rif->clear_end_of_line (-1); | |
b64b3980 | 4236 | } |
23b0200c | 4237 | |
352f1545 | 4238 | |
408f5064 GM |
4239 | /* Update the display of the text area of row VPOS in window W. |
4240 | Value is non-zero if display has changed. */ | |
5f5c8ee5 | 4241 | |
408f5064 | 4242 | static int |
5f5c8ee5 | 4243 | update_text_area (w, vpos) |
23b0200c | 4244 | struct window *w; |
5f5c8ee5 | 4245 | int vpos; |
23b0200c | 4246 | { |
5f5c8ee5 GM |
4247 | struct glyph_row *current_row = MATRIX_ROW (w->current_matrix, vpos); |
4248 | struct glyph_row *desired_row = MATRIX_ROW (w->desired_matrix, vpos); | |
408f5064 | 4249 | int changed_p = 0; |
5f5c8ee5 GM |
4250 | |
4251 | /* Let functions in xterm.c know what area subsequent X positions | |
4252 | will be relative to. */ | |
4253 | updated_area = TEXT_AREA; | |
4254 | ||
4255 | /* If rows are at different X or Y, or rows have different height, | |
4256 | or the current row is marked invalid, write the entire line. */ | |
4257 | if (!current_row->enabled_p | |
4258 | || desired_row->y != current_row->y | |
4259 | || desired_row->ascent != current_row->ascent | |
408f5064 GM |
4260 | || desired_row->phys_ascent != current_row->phys_ascent |
4261 | || desired_row->phys_height != current_row->phys_height | |
5f5c8ee5 | 4262 | || desired_row->visible_height != current_row->visible_height |
408f5064 | 4263 | || current_row->overlapped_p |
62ba722a | 4264 | || current_row->mouse_face_p |
5f5c8ee5 GM |
4265 | || current_row->x != desired_row->x) |
4266 | { | |
4267 | rif->cursor_to (vpos, 0, desired_row->y, desired_row->x); | |
4268 | ||
4269 | if (desired_row->used[TEXT_AREA]) | |
4270 | rif->write_glyphs (desired_row->glyphs[TEXT_AREA], | |
4271 | desired_row->used[TEXT_AREA]); | |
4272 | ||
4273 | /* Clear to end of window. */ | |
4274 | rif->clear_end_of_line (-1); | |
408f5064 | 4275 | changed_p = 1; |
5f5c8ee5 GM |
4276 | } |
4277 | else | |
4278 | { | |
4279 | int stop, i, x; | |
4280 | struct glyph *current_glyph = current_row->glyphs[TEXT_AREA]; | |
4281 | struct glyph *desired_glyph = desired_row->glyphs[TEXT_AREA]; | |
e47306e6 | 4282 | int overlapping_glyphs_p = current_row->contains_overlapping_glyphs_p; |
074b781a | 4283 | int desired_stop_pos = desired_row->used[TEXT_AREA]; |
5f5c8ee5 GM |
4284 | |
4285 | /* If the desired row extends its face to the text area end, | |
4286 | make sure we write at least one glyph, so that the face | |
4287 | extension actually takes place. */ | |
4554cc79 | 4288 | if (MATRIX_ROW_EXTENDS_FACE_P (desired_row)) |
074b781a | 4289 | --desired_stop_pos; |
5f5c8ee5 GM |
4290 | |
4291 | stop = min (current_row->used[TEXT_AREA], desired_stop_pos); | |
4292 | i = 0; | |
4293 | x = desired_row->x; | |
8399f8a0 GM |
4294 | |
4295 | /* Loop over glyphs that current and desired row may have | |
4296 | in common. */ | |
5f5c8ee5 | 4297 | while (i < stop) |
352f1545 | 4298 | { |
6d950f4c | 4299 | int can_skip_p = 1; |
e47306e6 | 4300 | |
5f5c8ee5 | 4301 | /* Skip over glyphs that both rows have in common. These |
e47306e6 GM |
4302 | don't have to be written. We can't skip if the last |
4303 | current glyph overlaps the glyph to its right. For | |
4304 | example, consider a current row of `if ' with the `f' in | |
4305 | Courier bold so that it overlaps the ` ' to its right. | |
4306 | If the desired row is ` ', we would skip over the space | |
4307 | after the `if' and there would remain a pixel from the | |
4308 | `f' on the screen. */ | |
4309 | if (overlapping_glyphs_p && i > 0) | |
352f1545 | 4310 | { |
e47306e6 GM |
4311 | struct glyph *glyph = ¤t_row->glyphs[TEXT_AREA][i - 1]; |
4312 | int left, right; | |
4313 | ||
4314 | rif->get_glyph_overhangs (glyph, XFRAME (w->frame), | |
4315 | &left, &right); | |
6d950f4c | 4316 | can_skip_p = right == 0; |
352f1545 | 4317 | } |
6d950f4c GM |
4318 | |
4319 | if (can_skip_p) | |
352f1545 | 4320 | { |
6d950f4c GM |
4321 | while (i < stop |
4322 | && GLYPH_EQUAL_P (desired_glyph, current_glyph)) | |
4323 | { | |
4324 | x += desired_glyph->pixel_width; | |
4325 | ++desired_glyph, ++current_glyph, ++i; | |
4326 | } | |
4327 | ||
4328 | /* Consider the case that the current row contains "xxx | |
4329 | ppp ggg" in italic Courier font, and the desired row | |
4330 | is "xxx ggg". The character `p' has lbearing, `g' | |
4331 | has not. The loop above will stop in front of the | |
4332 | first `p' in the current row. If we would start | |
4333 | writing glyphs there, we wouldn't erase the lbearing | |
4334 | of the `p'. The rest of the lbearing problem is then | |
4335 | taken care of by x_draw_glyphs. */ | |
4336 | if (overlapping_glyphs_p | |
4337 | && i > 0 | |
4338 | && i < current_row->used[TEXT_AREA] | |
4339 | && (current_row->used[TEXT_AREA] | |
4340 | != desired_row->used[TEXT_AREA])) | |
5f5c8ee5 | 4341 | { |
6d950f4c GM |
4342 | int left, right; |
4343 | ||
4344 | rif->get_glyph_overhangs (current_glyph, XFRAME (w->frame), | |
4345 | &left, &right); | |
4346 | while (left > 0 && i > 0) | |
4347 | { | |
4348 | --i, --desired_glyph, --current_glyph; | |
4349 | x -= desired_glyph->pixel_width; | |
4350 | left -= desired_glyph->pixel_width; | |
4351 | } | |
5f5c8ee5 | 4352 | } |
352f1545 | 4353 | } |
5f5c8ee5 GM |
4354 | |
4355 | /* Try to avoid writing the entire rest of the desired row | |
4356 | by looking for a resync point. This mainly prevents | |
4357 | mode line flickering in the case the mode line is in | |
4358 | fixed-pitch font, which it usually will be. */ | |
4359 | if (i < desired_row->used[TEXT_AREA]) | |
4360 | { | |
4361 | int start_x = x, start_hpos = i; | |
4362 | struct glyph *start = desired_glyph; | |
4363 | int current_x = x; | |
6d950f4c GM |
4364 | int skip_first_p = !can_skip_p; |
4365 | ||
5f5c8ee5 GM |
4366 | /* Find the next glyph that's equal again. */ |
4367 | while (i < stop | |
6d950f4c GM |
4368 | && (skip_first_p |
4369 | || !GLYPH_EQUAL_P (desired_glyph, current_glyph)) | |
5f5c8ee5 GM |
4370 | && x == current_x) |
4371 | { | |
4372 | x += desired_glyph->pixel_width; | |
4373 | current_x += current_glyph->pixel_width; | |
4374 | ++desired_glyph, ++current_glyph, ++i; | |
6d950f4c | 4375 | skip_first_p = 0; |
5f5c8ee5 | 4376 | } |
23b0200c | 4377 | |
5f5c8ee5 GM |
4378 | if (i == start_hpos || x != current_x) |
4379 | { | |
4380 | i = start_hpos; | |
4381 | x = start_x; | |
4382 | desired_glyph = start; | |
4383 | break; | |
4384 | } | |
e47306e6 | 4385 | |
5f5c8ee5 GM |
4386 | rif->cursor_to (vpos, start_hpos, desired_row->y, start_x); |
4387 | rif->write_glyphs (start, i - start_hpos); | |
408f5064 | 4388 | changed_p = 1; |
5f5c8ee5 GM |
4389 | } |
4390 | } | |
4391 | ||
4392 | /* Write the rest. */ | |
4393 | if (i < desired_row->used[TEXT_AREA]) | |
4394 | { | |
4395 | rif->cursor_to (vpos, i, desired_row->y, x); | |
4396 | rif->write_glyphs (desired_glyph, desired_row->used[TEXT_AREA] - i); | |
408f5064 | 4397 | changed_p = 1; |
5f5c8ee5 GM |
4398 | } |
4399 | ||
4400 | /* Maybe clear to end of line. */ | |
4401 | if (MATRIX_ROW_EXTENDS_FACE_P (desired_row)) | |
4402 | { | |
4403 | /* If new row extends to the end of the text area, nothing | |
4404 | has to be cleared, if and only if we did a write_glyphs | |
4405 | above. This is made sure by setting desired_stop_pos | |
4406 | appropriately above. */ | |
4407 | xassert (i < desired_row->used[TEXT_AREA]); | |
4408 | } | |
4409 | else if (MATRIX_ROW_EXTENDS_FACE_P (current_row)) | |
4410 | { | |
4411 | /* If old row extends to the end of the text area, clear. */ | |
4412 | if (i >= desired_row->used[TEXT_AREA]) | |
4413 | rif->cursor_to (vpos, i, desired_row->y, | |
4414 | desired_row->x + desired_row->pixel_width); | |
4415 | rif->clear_end_of_line (-1); | |
408f5064 | 4416 | changed_p = 1; |
5f5c8ee5 GM |
4417 | } |
4418 | else if (desired_row->pixel_width < current_row->pixel_width) | |
2e8907d3 | 4419 | { |
5f5c8ee5 GM |
4420 | /* Otherwise clear to the end of the old row. Everything |
4421 | after that position should be clear already. */ | |
4422 | int x; | |
4423 | ||
4424 | if (i >= desired_row->used[TEXT_AREA]) | |
4425 | rif->cursor_to (vpos, i, desired_row->y, | |
4426 | desired_row->x + desired_row->pixel_width); | |
4427 | ||
4428 | /* If cursor is displayed at the end of the line, make sure | |
4429 | it's cleared. Nowadays we don't have a phys_cursor_glyph | |
4430 | with which to erase the cursor (because this method | |
4431 | doesn't work with lbearing/rbearing), so we must do it | |
4432 | this way. */ | |
4433 | if (vpos == w->phys_cursor.vpos | |
4434 | && w->phys_cursor.hpos >= desired_row->used[TEXT_AREA]) | |
4435 | { | |
4436 | w->phys_cursor_on_p = 0; | |
4437 | x = -1; | |
4438 | } | |
4439 | else | |
4440 | x = current_row->x + current_row->pixel_width; | |
4441 | rif->clear_end_of_line (x); | |
408f5064 | 4442 | changed_p = 1; |
2e8907d3 | 4443 | } |
23b0200c | 4444 | } |
408f5064 GM |
4445 | |
4446 | return changed_p; | |
23b0200c | 4447 | } |
4588ec20 | 4448 | |
5f5c8ee5 | 4449 | |
408f5064 GM |
4450 | /* Update row VPOS in window W. Value is non-zero if display has been |
4451 | changed. */ | |
5f5c8ee5 | 4452 | |
408f5064 | 4453 | static int |
e876ff42 | 4454 | update_window_line (w, vpos, mouse_face_overwritten_p) |
5f5c8ee5 | 4455 | struct window *w; |
e876ff42 | 4456 | int vpos, *mouse_face_overwritten_p; |
5f5c8ee5 GM |
4457 | { |
4458 | struct glyph_row *current_row = MATRIX_ROW (w->current_matrix, vpos); | |
4459 | struct glyph_row *desired_row = MATRIX_ROW (w->desired_matrix, vpos); | |
408f5064 | 4460 | int changed_p = 0; |
5f5c8ee5 | 4461 | |
5f5c8ee5 GM |
4462 | /* Set the row being updated. This is important to let xterm.c |
4463 | know what line height values are in effect. */ | |
4464 | updated_row = desired_row; | |
4465 | ||
504805ac GM |
4466 | /* A row can be completely invisible in case a desired matrix was |
4467 | built with a vscroll and then make_cursor_line_fully_visible shifts | |
4468 | the matrix. Make sure to make such rows current anyway, since | |
4469 | we need the correct y-position, for example, in the current matrix. */ | |
001f93f3 GM |
4470 | if (desired_row->mode_line_p |
4471 | || desired_row->visible_height > 0) | |
408f5064 | 4472 | { |
504805ac GM |
4473 | xassert (desired_row->enabled_p); |
4474 | ||
4475 | /* Update display of the left margin area, if there is one. */ | |
4476 | if (!desired_row->full_width_p | |
4477 | && !NILP (w->left_margin_width)) | |
4478 | { | |
4479 | changed_p = 1; | |
4480 | update_marginal_area (w, LEFT_MARGIN_AREA, vpos); | |
4481 | } | |
4482 | ||
4483 | /* Update the display of the text area. */ | |
4484 | if (update_text_area (w, vpos)) | |
4485 | { | |
4486 | changed_p = 1; | |
4487 | if (current_row->mouse_face_p) | |
4488 | *mouse_face_overwritten_p = 1; | |
4489 | } | |
4490 | ||
4491 | /* Update display of the right margin area, if there is one. */ | |
4492 | if (!desired_row->full_width_p | |
4493 | && !NILP (w->right_margin_width)) | |
4494 | { | |
4495 | changed_p = 1; | |
4496 | update_marginal_area (w, RIGHT_MARGIN_AREA, vpos); | |
4497 | } | |
4498 | ||
4499 | /* Draw truncation marks etc. */ | |
4500 | if (!current_row->enabled_p | |
4501 | || desired_row->y != current_row->y | |
4502 | || desired_row->visible_height != current_row->visible_height | |
4503 | || desired_row->overlay_arrow_p != current_row->overlay_arrow_p | |
4504 | || desired_row->truncated_on_left_p != current_row->truncated_on_left_p | |
4505 | || desired_row->truncated_on_right_p != current_row->truncated_on_right_p | |
4506 | || desired_row->continued_p != current_row->continued_p | |
4507 | || desired_row->mode_line_p != current_row->mode_line_p | |
4508 | || (desired_row->indicate_empty_line_p | |
4509 | != current_row->indicate_empty_line_p) | |
4510 | || (MATRIX_ROW_CONTINUATION_LINE_P (desired_row) | |
4511 | != MATRIX_ROW_CONTINUATION_LINE_P (current_row))) | |
4512 | rif->after_update_window_line_hook (desired_row); | |
408f5064 | 4513 | } |
5f5c8ee5 | 4514 | |
5f5c8ee5 GM |
4515 | /* Update current_row from desired_row. */ |
4516 | make_current (w->desired_matrix, w->current_matrix, vpos); | |
4517 | updated_row = NULL; | |
408f5064 | 4518 | return changed_p; |
5f5c8ee5 GM |
4519 | } |
4520 | ||
4521 | ||
4522 | /* Set the cursor after an update of window W. This function may only | |
4523 | be called from update_window. */ | |
4524 | ||
4525 | static void | |
4526 | set_window_cursor_after_update (w) | |
4588ec20 JB |
4527 | struct window *w; |
4528 | { | |
5f5c8ee5 GM |
4529 | struct frame *f = XFRAME (w->frame); |
4530 | int cx, cy, vpos, hpos; | |
4531 | ||
4532 | /* Not intended for frame matrix updates. */ | |
4533 | xassert (FRAME_WINDOW_P (f)); | |
4534 | ||
b96fd3e8 GM |
4535 | if (cursor_in_echo_area |
4536 | && !NILP (echo_area_buffer[0]) | |
4537 | /* If we are showing a message instead of the mini-buffer, | |
4538 | show the cursor for the message instead. */ | |
4539 | && XWINDOW (minibuf_window) == w | |
4540 | && EQ (minibuf_window, echo_area_window) | |
5f5c8ee5 GM |
4541 | /* These cases apply only to the frame that contains |
4542 | the active mini-buffer window. */ | |
4543 | && FRAME_HAS_MINIBUF_P (f) | |
4544 | && EQ (FRAME_MINIBUF_WINDOW (f), echo_area_window)) | |
4545 | { | |
4546 | cx = cy = vpos = hpos = 0; | |
4547 | ||
4548 | if (cursor_in_echo_area >= 0) | |
4549 | { | |
4550 | /* If the mini-buffer is several lines high, find the last | |
4551 | line that has any text on it. Note: either all lines | |
4552 | are enabled or none. Otherwise we wouldn't be able to | |
4553 | determine Y. */ | |
862b4790 GM |
4554 | struct glyph_row *row, *last_row; |
4555 | struct glyph *glyph; | |
4556 | int yb = window_text_bottom_y (w); | |
5f5c8ee5 | 4557 | |
862b4790 | 4558 | last_row = NULL; |
6206f8ce GM |
4559 | row = w->current_matrix->rows; |
4560 | while (row->enabled_p | |
4561 | && (last_row == NULL | |
4562 | || MATRIX_ROW_BOTTOM_Y (row) <= yb)) | |
5f5c8ee5 | 4563 | { |
862b4790 GM |
4564 | if (row->used[TEXT_AREA] |
4565 | && row->glyphs[TEXT_AREA][0].charpos >= 0) | |
4566 | last_row = row; | |
6206f8ce | 4567 | ++row; |
862b4790 GM |
4568 | } |
4569 | ||
5f5c8ee5 GM |
4570 | if (last_row) |
4571 | { | |
6206f8ce GM |
4572 | struct glyph *start = last_row->glyphs[TEXT_AREA]; |
4573 | struct glyph *last = start + last_row->used[TEXT_AREA] - 1; | |
862b4790 | 4574 | |
b96fd3e8 | 4575 | while (last > start && last->charpos < 0) |
862b4790 GM |
4576 | --last; |
4577 | ||
4578 | for (glyph = start; glyph < last; ++glyph) | |
4579 | { | |
4580 | cx += glyph->pixel_width; | |
4581 | ++hpos; | |
4582 | } | |
4583 | ||
5f5c8ee5 | 4584 | cy = last_row->y; |
862b4790 | 4585 | vpos = MATRIX_ROW_VPOS (last_row, w->current_matrix); |
5f5c8ee5 GM |
4586 | } |
4587 | } | |
4588 | } | |
4589 | else | |
4590 | { | |
4591 | cx = w->cursor.x; | |
4592 | cy = w->cursor.y; | |
4593 | hpos = w->cursor.hpos; | |
4594 | vpos = w->cursor.vpos; | |
4595 | } | |
4588ec20 | 4596 | |
5f5c8ee5 GM |
4597 | /* Window cursor can be out of sync for horizontally split windows. */ |
4598 | hpos = max (0, hpos); | |
4599 | hpos = min (w->current_matrix->matrix_w - 1, hpos); | |
4600 | vpos = max (0, vpos); | |
4601 | vpos = min (w->current_matrix->nrows - 1, vpos); | |
4602 | rif->cursor_to (vpos, hpos, cy, cx); | |
4588ec20 | 4603 | } |
4588ec20 | 4604 | |
5f5c8ee5 | 4605 | |
6df5d75f GM |
4606 | /* Set WINDOW->must_be_updated_p to ON_P for all windows in the window |
4607 | tree rooted at W. */ | |
4608 | ||
4609 | void | |
4610 | set_window_update_flags (w, on_p) | |
4611 | struct window *w; | |
4612 | int on_p; | |
4613 | { | |
4614 | while (w) | |
4615 | { | |
4616 | if (!NILP (w->hchild)) | |
4617 | set_window_update_flags (XWINDOW (w->hchild), on_p); | |
4618 | else if (!NILP (w->vchild)) | |
4619 | set_window_update_flags (XWINDOW (w->vchild), on_p); | |
4620 | else | |
4621 | w->must_be_updated_p = on_p; | |
4622 | ||
4623 | w = NILP (w->next) ? 0 : XWINDOW (w->next); | |
4624 | } | |
4625 | } | |
4626 | ||
4627 | ||
4628 | \f | |
4629 | /*********************************************************************** | |
4630 | Window-Based Scrolling | |
4631 | ***********************************************************************/ | |
4632 | ||
4633 | /* Structure describing rows in scrolling_window. */ | |
4634 | ||
4635 | struct row_entry | |
4636 | { | |
4637 | /* Number of occurrences of this row in desired and current matrix. */ | |
4638 | int old_uses, new_uses; | |
4639 | ||
4640 | /* Vpos of row in new matrix. */ | |
4641 | int new_line_number; | |
4642 | ||
4643 | /* Bucket index of this row_entry in the hash table row_table. */ | |
4644 | int bucket; | |
4645 | ||
4646 | /* The row described by this entry. */ | |
4647 | struct glyph_row *row; | |
4648 | ||
4649 | /* Hash collision chain. */ | |
4650 | struct row_entry *next; | |
4651 | }; | |
4652 | ||
4653 | /* A pool to allocate row_entry structures from, and the size of the | |
4654 | pool. The pool is reallocated in scrolling_window when we find | |
4655 | that we need a larger one. */ | |
4656 | ||
4657 | static struct row_entry *row_entry_pool; | |
4658 | static int row_entry_pool_size; | |
4659 | ||
4660 | /* Index of next free entry in row_entry_pool. */ | |
4661 | ||
4662 | static int row_entry_idx; | |
4663 | ||
4664 | /* The hash table used during scrolling, and the table's size. This | |
4665 | table is used to quickly identify equal rows in the desired and | |
4666 | current matrix. */ | |
4667 | ||
4668 | static struct row_entry **row_table; | |
4669 | static int row_table_size; | |
4670 | ||
4671 | /* Vectors of pointers to row_entry structures belonging to the | |
4672 | current and desired matrix, and the size of the vectors. */ | |
4673 | ||
4674 | static struct row_entry **old_lines, **new_lines; | |
4675 | static int old_lines_size, new_lines_size; | |
4676 | ||
4677 | /* A pool to allocate run structures from, and its size. */ | |
4678 | ||
4679 | static struct run *run_pool; | |
4680 | static int runs_size; | |
4681 | ||
4682 | /* A vector of runs of lines found during scrolling. */ | |
4683 | ||
4684 | static struct run **runs; | |
4685 | ||
4686 | static struct row_entry *add_row_entry P_ ((struct window *, | |
4687 | struct glyph_row *)); | |
4688 | ||
4689 | ||
4690 | /* Add glyph row ROW to the scrolling hash table during the scrolling | |
4691 | of window W. */ | |
4692 | ||
4693 | static INLINE struct row_entry * | |
4694 | add_row_entry (w, row) | |
4695 | struct window *w; | |
4696 | struct glyph_row *row; | |
4697 | { | |
4698 | struct row_entry *entry; | |
4699 | int i = row->hash % row_table_size; | |
4700 | ||
4701 | entry = row_table[i]; | |
e4e0bee9 | 4702 | while (entry && !row_equal_p (w, entry->row, row, 1)) |
6df5d75f GM |
4703 | entry = entry->next; |
4704 | ||
4705 | if (entry == NULL) | |
4706 | { | |
4707 | entry = row_entry_pool + row_entry_idx++; | |
4708 | entry->row = row; | |
4709 | entry->old_uses = entry->new_uses = 0; | |
4710 | entry->new_line_number = 0; | |
4711 | entry->bucket = i; | |
4712 | entry->next = row_table[i]; | |
4713 | row_table[i] = entry; | |
4714 | } | |
4715 | ||
4716 | return entry; | |
4717 | } | |
4718 | ||
4719 | ||
5f5c8ee5 | 4720 | /* Try to reuse part of the current display of W by scrolling lines. |
045dee35 | 4721 | HEADER_LINE_P non-zero means W has a top mode line. |
5f5c8ee5 GM |
4722 | |
4723 | The algorithm is taken from Communications of the ACM, Apr78 "A | |
4724 | Technique for Isolating Differences Between Files." It should take | |
4725 | O(N) time. | |
4726 | ||
4727 | A short outline of the steps of the algorithm | |
4728 | ||
4729 | 1. Skip lines equal at the start and end of both matrices. | |
4730 | ||
4731 | 2. Enter rows in the current and desired matrix into a symbol | |
4732 | table, counting how often they appear in both matrices. | |
4733 | ||
4734 | 3. Rows that appear exactly once in both matrices serve as anchors, | |
4735 | i.e. we assume that such lines are likely to have been moved. | |
4736 | ||
4737 | 4. Starting from anchor lines, extend regions to be scrolled both | |
4738 | forward and backward. | |
4739 | ||
4740 | Value is | |
4741 | ||
4742 | -1 if all rows were found to be equal. | |
4743 | 0 to indicate that we did not scroll the display, or | |
4744 | 1 if we did scroll. */ | |
4745 | ||
4746 | static int | |
045dee35 | 4747 | scrolling_window (w, header_line_p) |
5f5c8ee5 | 4748 | struct window *w; |
045dee35 | 4749 | int header_line_p; |
4588ec20 | 4750 | { |
5f5c8ee5 GM |
4751 | struct glyph_matrix *desired_matrix = w->desired_matrix; |
4752 | struct glyph_matrix *current_matrix = w->current_matrix; | |
4753 | int yb = window_text_bottom_y (w); | |
6df5d75f GM |
4754 | int i, j, first_old, first_new, last_old, last_new; |
4755 | int nruns, nbytes, n, run_idx; | |
4756 | struct row_entry *entry; | |
5f5c8ee5 GM |
4757 | |
4758 | /* Skip over rows equal at the start. */ | |
bfdcafe1 | 4759 | for (i = header_line_p ? 1 : 0; i < current_matrix->nrows - 1; ++i) |
5f5c8ee5 | 4760 | { |
bfdcafe1 GM |
4761 | struct glyph_row *d = MATRIX_ROW (desired_matrix, i); |
4762 | struct glyph_row *c = MATRIX_ROW (current_matrix, i); | |
4763 | ||
4764 | if (c->enabled_p | |
4765 | && d->enabled_p | |
4766 | && c->y == d->y | |
4767 | && MATRIX_ROW_BOTTOM_Y (c) <= yb | |
4768 | && MATRIX_ROW_BOTTOM_Y (d) <= yb | |
4769 | && row_equal_p (w, c, d, 1)) | |
4770 | { | |
4771 | assign_row (c, d); | |
4772 | d->enabled_p = 0; | |
4773 | } | |
4774 | else | |
4775 | break; | |
5f5c8ee5 | 4776 | } |
4588ec20 | 4777 | |
5f5c8ee5 GM |
4778 | /* Give up if some rows in the desired matrix are not enabled. */ |
4779 | if (!MATRIX_ROW (desired_matrix, i)->enabled_p) | |
4780 | return -1; | |
4781 | ||
4782 | first_old = first_new = i; | |
4783 | ||
4784 | /* Set last_new to the index + 1 of the last enabled row in the | |
4785 | desired matrix. */ | |
4786 | i = first_new + 1; | |
4787 | while (i < desired_matrix->nrows - 1 | |
4788 | && MATRIX_ROW (desired_matrix, i)->enabled_p | |
6df5d75f | 4789 | && MATRIX_ROW_BOTTOM_Y (MATRIX_ROW (desired_matrix, i)) <= yb) |
5f5c8ee5 GM |
4790 | ++i; |
4791 | ||
4792 | if (!MATRIX_ROW (desired_matrix, i)->enabled_p) | |
4793 | return 0; | |
4794 | ||
4795 | last_new = i; | |
4796 | ||
4797 | /* Set last_old to the index + 1 of the last enabled row in the | |
4798 | current matrix. We don't look at the enabled flag here because | |
4799 | we plan to reuse part of the display even if other parts are | |
4800 | disabled. */ | |
4801 | i = first_old + 1; | |
93962bfa GM |
4802 | while (i < current_matrix->nrows - 1) |
4803 | { | |
4804 | int bottom = MATRIX_ROW_BOTTOM_Y (MATRIX_ROW (current_matrix, i)); | |
4805 | if (bottom <= yb) | |
4806 | ++i; | |
4807 | if (bottom >= yb) | |
4808 | break; | |
4809 | } | |
4810 | ||
5f5c8ee5 GM |
4811 | last_old = i; |
4812 | ||
4813 | /* Skip over rows equal at the bottom. */ | |
4814 | i = last_new; | |
4815 | j = last_old; | |
4816 | while (i - 1 > first_new | |
4817 | && j - 1 > first_old | |
4818 | && MATRIX_ROW (current_matrix, i - 1)->enabled_p | |
4819 | && (MATRIX_ROW (current_matrix, i - 1)->y | |
4820 | == MATRIX_ROW (desired_matrix, j - 1)->y) | |
4821 | && row_equal_p (w, | |
4822 | MATRIX_ROW (desired_matrix, i - 1), | |
e4e0bee9 | 4823 | MATRIX_ROW (current_matrix, j - 1), 1)) |
5f5c8ee5 GM |
4824 | --i, --j; |
4825 | last_new = i; | |
4826 | last_old = j; | |
4827 | ||
4828 | /* Nothing to do if all rows are equal. */ | |
4829 | if (last_new == first_new) | |
4830 | return 0; | |
4831 | ||
6df5d75f GM |
4832 | /* Reallocate vectors, tables etc. if necessary. */ |
4833 | ||
4834 | if (current_matrix->nrows > old_lines_size) | |
4835 | { | |
4836 | old_lines_size = current_matrix->nrows; | |
4837 | nbytes = old_lines_size * sizeof *old_lines; | |
4838 | old_lines = (struct row_entry **) xrealloc (old_lines, nbytes); | |
4839 | } | |
4840 | ||
4841 | if (desired_matrix->nrows > new_lines_size) | |
4842 | { | |
4843 | new_lines_size = desired_matrix->nrows; | |
4844 | nbytes = new_lines_size * sizeof *new_lines; | |
4845 | new_lines = (struct row_entry **) xrealloc (new_lines, nbytes); | |
4846 | } | |
4847 | ||
4848 | n = desired_matrix->nrows + current_matrix->nrows; | |
4849 | if (3 * n > row_table_size) | |
4850 | { | |
4851 | row_table_size = next_almost_prime (3 * n); | |
4852 | nbytes = row_table_size * sizeof *row_table; | |
4853 | row_table = (struct row_entry **) xrealloc (row_table, nbytes); | |
4854 | bzero (row_table, nbytes); | |
4855 | } | |
4856 | ||
4857 | if (n > row_entry_pool_size) | |
4858 | { | |
4859 | row_entry_pool_size = n; | |
4860 | nbytes = row_entry_pool_size * sizeof *row_entry_pool; | |
4861 | row_entry_pool = (struct row_entry *) xrealloc (row_entry_pool, nbytes); | |
4862 | } | |
4863 | ||
4864 | if (desired_matrix->nrows > runs_size) | |
4865 | { | |
4866 | runs_size = desired_matrix->nrows; | |
4867 | nbytes = runs_size * sizeof *runs; | |
4868 | runs = (struct run **) xrealloc (runs, nbytes); | |
4869 | nbytes = runs_size * sizeof *run_pool; | |
4870 | run_pool = (struct run *) xrealloc (run_pool, nbytes); | |
4871 | } | |
4872 | ||
4873 | nruns = run_idx = 0; | |
4874 | row_entry_idx = 0; | |
4875 | ||
4876 | /* Add rows from the current and desired matrix to the hash table | |
4877 | row_hash_table to be able to find equal ones quickly. */ | |
4878 | ||
5f5c8ee5 GM |
4879 | for (i = first_old; i < last_old; ++i) |
4880 | { | |
4881 | if (MATRIX_ROW (current_matrix, i)->enabled_p) | |
4882 | { | |
6df5d75f GM |
4883 | entry = add_row_entry (w, MATRIX_ROW (current_matrix, i)); |
4884 | old_lines[i] = entry; | |
4885 | ++entry->old_uses; | |
5f5c8ee5 GM |
4886 | } |
4887 | else | |
6df5d75f | 4888 | old_lines[i] = NULL; |
5f5c8ee5 GM |
4889 | } |
4890 | ||
5f5c8ee5 GM |
4891 | for (i = first_new; i < last_new; ++i) |
4892 | { | |
4893 | xassert (MATRIX_ROW_ENABLED_P (desired_matrix, i)); | |
6df5d75f GM |
4894 | entry = add_row_entry (w, MATRIX_ROW (desired_matrix, i)); |
4895 | ++entry->new_uses; | |
4896 | entry->new_line_number = i; | |
4897 | new_lines[i] = entry; | |
5f5c8ee5 | 4898 | } |
4588ec20 | 4899 | |
5f5c8ee5 GM |
4900 | /* Identify moves based on lines that are unique and equal |
4901 | in both matrices. */ | |
4902 | for (i = first_old; i < last_old;) | |
6df5d75f GM |
4903 | if (old_lines[i] |
4904 | && old_lines[i]->old_uses == 1 | |
4905 | && old_lines[i]->new_uses == 1) | |
5f5c8ee5 GM |
4906 | { |
4907 | int j, k; | |
6df5d75f GM |
4908 | int new_line = old_lines[i]->new_line_number; |
4909 | struct run *run = run_pool + run_idx++; | |
5f5c8ee5 GM |
4910 | |
4911 | /* Record move. */ | |
4912 | run->current_vpos = i; | |
4913 | run->current_y = MATRIX_ROW (current_matrix, i)->y; | |
4914 | run->desired_vpos = new_line; | |
4915 | run->desired_y = MATRIX_ROW (desired_matrix, new_line)->y; | |
4916 | run->nrows = 1; | |
4917 | run->height = MATRIX_ROW (current_matrix, i)->height; | |
4918 | ||
4919 | /* Extend backward. */ | |
4920 | j = i - 1; | |
4921 | k = new_line - 1; | |
4922 | while (j > first_old | |
4923 | && k > first_new | |
6df5d75f | 4924 | && old_lines[j] == new_lines[k]) |
5f5c8ee5 GM |
4925 | { |
4926 | int h = MATRIX_ROW (current_matrix, j)->height; | |
4927 | --run->current_vpos; | |
4928 | --run->desired_vpos; | |
4929 | ++run->nrows; | |
4930 | run->height += h; | |
4931 | run->desired_y -= h; | |
4932 | run->current_y -= h; | |
4933 | --j, --k; | |
4934 | } | |
4588ec20 | 4935 | |
5f5c8ee5 GM |
4936 | /* Extend forward. */ |
4937 | j = i + 1; | |
4938 | k = new_line + 1; | |
4939 | while (j < last_old | |
4940 | && k < last_new | |
6df5d75f | 4941 | && old_lines[j] == new_lines[k]) |
5f5c8ee5 GM |
4942 | { |
4943 | int h = MATRIX_ROW (current_matrix, j)->height; | |
4944 | ++run->nrows; | |
4945 | run->height += h; | |
4946 | ++j, ++k; | |
4947 | } | |
19dff8dc | 4948 | |
5f5c8ee5 GM |
4949 | /* Insert run into list of all runs. Order runs by copied |
4950 | pixel lines. Note that we record runs that don't have to | |
4951 | be copied because they are already in place. This is done | |
4952 | because we can avoid calling update_window_line in this | |
4953 | case. */ | |
4954 | for (j = 0; j < nruns && runs[j]->height > run->height; ++j) | |
4955 | ; | |
2b4ec4d7 | 4956 | for (k = nruns; k > j; --k) |
5f5c8ee5 GM |
4957 | runs[k] = runs[k - 1]; |
4958 | runs[j] = run; | |
4959 | ++nruns; | |
4960 | ||
4961 | i += run->nrows; | |
4962 | } | |
4963 | else | |
4964 | ++i; | |
4588ec20 | 4965 | |
5f5c8ee5 GM |
4966 | /* Do the moves. Do it in a way that we don't overwrite something |
4967 | we want to copy later on. This is not solvable in general | |
4968 | because there is only one display and we don't have a way to | |
4969 | exchange areas on this display. Example: | |
4588ec20 | 4970 | |
5f5c8ee5 GM |
4971 | +-----------+ +-----------+ |
4972 | | A | | B | | |
4973 | +-----------+ --> +-----------+ | |
4974 | | B | | A | | |
4975 | +-----------+ +-----------+ | |
4588ec20 | 4976 | |
5f5c8ee5 GM |
4977 | Instead, prefer bigger moves, and invalidate moves that would |
4978 | copy from where we copied to. */ | |
ea0d86af | 4979 | |
5f5c8ee5 GM |
4980 | for (i = 0; i < nruns; ++i) |
4981 | if (runs[i]->nrows > 0) | |
4982 | { | |
4983 | struct run *r = runs[i]; | |
24e86043 | 4984 | |
5f5c8ee5 GM |
4985 | /* Copy on the display. */ |
4986 | if (r->current_y != r->desired_y) | |
4987 | { | |
4988 | rif->scroll_run_hook (w, r); | |
4989 | ||
4990 | /* Invalidate runs that copy from where we copied to. */ | |
4991 | for (j = i + 1; j < nruns; ++j) | |
4992 | { | |
4993 | struct run *p = runs[j]; | |
4994 | ||
4995 | if ((p->current_y >= r->desired_y | |
4996 | && p->current_y < r->desired_y + r->height) | |
4997 | || (p->current_y + p->height >= r->desired_y | |
4998 | && (p->current_y + p->height | |
4999 | < r->desired_y + r->height))) | |
5000 | p->nrows = 0; | |
5001 | } | |
5002 | } | |
ea0d86af | 5003 | |
5f5c8ee5 GM |
5004 | /* Assign matrix rows. */ |
5005 | for (j = 0; j < r->nrows; ++j) | |
5006 | { | |
5007 | struct glyph_row *from, *to; | |
408f5064 | 5008 | int to_overlapped_p; |
e876ff42 | 5009 | |
5f5c8ee5 GM |
5010 | to = MATRIX_ROW (current_matrix, r->desired_vpos + j); |
5011 | from = MATRIX_ROW (desired_matrix, r->desired_vpos + j); | |
e876ff42 | 5012 | to_overlapped_p = to->overlapped_p; |
5f5c8ee5 GM |
5013 | assign_row (to, from); |
5014 | to->enabled_p = 1, from->enabled_p = 0; | |
408f5064 | 5015 | to->overlapped_p = to_overlapped_p; |
5f5c8ee5 GM |
5016 | } |
5017 | } | |
15874c59 | 5018 | |
6df5d75f GM |
5019 | /* Clear the hash table, for the next time. */ |
5020 | for (i = 0; i < row_entry_idx; ++i) | |
5021 | row_table[row_entry_pool[i].bucket] = NULL; | |
5022 | ||
5f5c8ee5 GM |
5023 | /* Value is non-zero to indicate that we scrolled the display. */ |
5024 | return 1; | |
5025 | } | |
de83c314 | 5026 | |
15874c59 | 5027 | |
4588ec20 | 5028 | \f |
5f5c8ee5 GM |
5029 | /************************************************************************ |
5030 | Frame-Based Updates | |
5031 | ************************************************************************/ | |
4588ec20 | 5032 | |
5f5c8ee5 | 5033 | /* Update the desired frame matrix of frame F. |
4588ec20 | 5034 | |
5f5c8ee5 GM |
5035 | FORCE_P non-zero means that the update should not be stopped by |
5036 | pending input. INHIBIT_HAIRY_ID_P non-zero means that scrolling | |
5037 | should not be tried. | |
5038 | ||
5039 | Value is non-zero if update was stopped due to pending input. */ | |
5040 | ||
5041 | static int | |
5042 | update_frame_1 (f, force_p, inhibit_id_p) | |
5043 | struct frame *f; | |
5044 | int force_p; | |
5045 | int inhibit_id_p; | |
4588ec20 | 5046 | { |
5f5c8ee5 GM |
5047 | /* Frame matrices to work on. */ |
5048 | struct glyph_matrix *current_matrix = f->current_matrix; | |
5049 | struct glyph_matrix *desired_matrix = f->desired_matrix; | |
5050 | int i; | |
4588ec20 JB |
5051 | int pause; |
5052 | int preempt_count = baud_rate / 2400 + 1; | |
dfcf069d | 5053 | extern int input_pending; |
5f5c8ee5 GM |
5054 | |
5055 | xassert (current_matrix && desired_matrix); | |
4588ec20 | 5056 | |
c37e4889 RS |
5057 | if (baud_rate != FRAME_COST_BAUD_RATE (f)) |
5058 | calculate_costs (f); | |
5059 | ||
d88c2b9e RS |
5060 | if (preempt_count <= 0) |
5061 | preempt_count = 1; | |
5062 | ||
e7067d00 GM |
5063 | if (redisplay_dont_pause) |
5064 | force_p = 1; | |
5065 | else if (!force_p && detect_input_pending ()) | |
4588ec20 JB |
5066 | { |
5067 | pause = 1; | |
5068 | goto do_pause; | |
5069 | } | |
5070 | ||
5f5c8ee5 | 5071 | /* If we cannot insert/delete lines, it's no use trying it. */ |
4588ec20 | 5072 | if (!line_ins_del_ok) |
5f5c8ee5 | 5073 | inhibit_id_p = 1; |
7098a0fa | 5074 | |
efb859b4 | 5075 | /* See if any of the desired lines are enabled; don't compute for |
5f5c8ee5 GM |
5076 | i/d line if just want cursor motion. */ |
5077 | for (i = 0; i < desired_matrix->nrows; i++) | |
5078 | if (MATRIX_ROW_ENABLED_P (desired_matrix, i)) | |
4588ec20 JB |
5079 | break; |
5080 | ||
5081 | /* Try doing i/d line, if not yet inhibited. */ | |
5f5c8ee5 GM |
5082 | if (!inhibit_id_p && i < desired_matrix->nrows) |
5083 | force_p |= scrolling (f); | |
4588ec20 JB |
5084 | |
5085 | /* Update the individual lines as needed. Do bottom line first. */ | |
5f5c8ee5 GM |
5086 | if (MATRIX_ROW_ENABLED_P (desired_matrix, desired_matrix->nrows - 1)) |
5087 | update_frame_line (f, desired_matrix->nrows - 1); | |
4588ec20 | 5088 | |
5f5c8ee5 GM |
5089 | /* Now update the rest of the lines. */ |
5090 | for (i = 0; i < desired_matrix->nrows - 1 && (force_p || !input_pending); i++) | |
4588ec20 | 5091 | { |
5f5c8ee5 | 5092 | if (MATRIX_ROW_ENABLED_P (desired_matrix, i)) |
4588ec20 | 5093 | { |
b6a65ac2 | 5094 | if (FRAME_TERMCAP_P (f)) |
4588ec20 JB |
5095 | { |
5096 | /* Flush out every so many lines. | |
5097 | Also flush out if likely to have more than 1k buffered | |
5098 | otherwise. I'm told that some telnet connections get | |
5099 | really screwed by more than 1k output at once. */ | |
5100 | int outq = PENDING_OUTPUT_COUNT (stdout); | |
5101 | if (outq > 900 | |
5102 | || (outq > 20 && ((i - 1) % preempt_count == 0))) | |
5103 | { | |
5104 | fflush (stdout); | |
5105 | if (preempt_count == 1) | |
5106 | { | |
a41f8bed JB |
5107 | #ifdef EMACS_OUTQSIZE |
5108 | if (EMACS_OUTQSIZE (0, &outq) < 0) | |
4588ec20 | 5109 | /* Probably not a tty. Ignore the error and reset |
5f5c8ee5 | 5110 | * the outq count. */ |
4588ec20 JB |
5111 | outq = PENDING_OUTPUT_COUNT (stdout); |
5112 | #endif | |
5113 | outq *= 10; | |
d520f0d2 | 5114 | if (baud_rate <= outq && baud_rate > 0) |
d88c2b9e | 5115 | sleep (outq / baud_rate); |
4588ec20 JB |
5116 | } |
5117 | } | |
4588ec20 JB |
5118 | } |
5119 | ||
a2960116 RS |
5120 | if ((i - 1) % preempt_count == 0) |
5121 | detect_input_pending (); | |
5122 | ||
5f5c8ee5 | 5123 | update_frame_line (f, i); |
4588ec20 | 5124 | } |
4588ec20 | 5125 | } |
5f5c8ee5 | 5126 | |
502b9b64 | 5127 | pause = (i < FRAME_HEIGHT (f) - 1) ? i : 0; |
4588ec20 JB |
5128 | |
5129 | /* Now just clean up termcap drivers and set cursor, etc. */ | |
5130 | if (!pause) | |
5131 | { | |
48cf7030 | 5132 | if ((cursor_in_echo_area |
5f5c8ee5 | 5133 | /* If we are showing a message instead of the mini-buffer, |
2577053b | 5134 | show the cursor for the message instead of for the |
5f5c8ee5 | 5135 | (now hidden) mini-buffer contents. */ |
2577053b RS |
5136 | || (EQ (minibuf_window, selected_window) |
5137 | && EQ (minibuf_window, echo_area_window) | |
b96fd3e8 | 5138 | && !NILP (echo_area_buffer[0]))) |
2577053b | 5139 | /* These cases apply only to the frame that contains |
5f5c8ee5 | 5140 | the active mini-buffer window. */ |
2577053b | 5141 | && FRAME_HAS_MINIBUF_P (f) |
140f8645 | 5142 | && EQ (FRAME_MINIBUF_WINDOW (f), echo_area_window)) |
1113d9db | 5143 | { |
648fa17d JB |
5144 | int top = XINT (XWINDOW (FRAME_MINIBUF_WINDOW (f))->top); |
5145 | int row, col; | |
5146 | ||
5147 | if (cursor_in_echo_area < 0) | |
5148 | { | |
5f5c8ee5 GM |
5149 | /* Negative value of cursor_in_echo_area means put |
5150 | cursor at beginning of line. */ | |
648fa17d JB |
5151 | row = top; |
5152 | col = 0; | |
5153 | } | |
1113d9db | 5154 | else |
648fa17d | 5155 | { |
5f5c8ee5 GM |
5156 | /* Positive value of cursor_in_echo_area means put |
5157 | cursor at the end of the prompt. If the mini-buffer | |
5158 | is several lines high, find the last line that has | |
5159 | any text on it. */ | |
648fa17d JB |
5160 | row = FRAME_HEIGHT (f); |
5161 | do | |
5162 | { | |
5f5c8ee5 GM |
5163 | --row; |
5164 | col = 0; | |
5165 | ||
5166 | if (MATRIX_ROW_ENABLED_P (current_matrix, row)) | |
5167 | { | |
5168 | /* Frame rows are filled up with spaces that | |
5169 | must be ignored here. */ | |
5f5c8ee5 GM |
5170 | struct glyph_row *r = MATRIX_ROW (current_matrix, |
5171 | row); | |
5172 | struct glyph *start = r->glyphs[TEXT_AREA]; | |
5173 | struct glyph *last = start + r->used[TEXT_AREA]; | |
5174 | ||
5175 | while (last > start | |
5176 | && (last - 1)->charpos < 0) | |
5177 | --last; | |
5178 | ||
5179 | col = last - start; | |
5180 | } | |
648fa17d JB |
5181 | } |
5182 | while (row > top && col == 0); | |
5183 | ||
6395da5c | 5184 | /* Make sure COL is not out of range. */ |
868e640e | 5185 | if (col >= FRAME_CURSOR_X_LIMIT (f)) |
648fa17d | 5186 | { |
6395da5c | 5187 | /* If we have another row, advance cursor into it. */ |
648fa17d | 5188 | if (row < FRAME_HEIGHT (f) - 1) |
6395da5c RS |
5189 | { |
5190 | col = FRAME_LEFT_SCROLL_BAR_WIDTH (f); | |
5191 | row++; | |
5192 | } | |
5193 | /* Otherwise move it back in range. */ | |
5194 | else | |
868e640e | 5195 | col = FRAME_CURSOR_X_LIMIT (f) - 1; |
648fa17d JB |
5196 | } |
5197 | } | |
5198 | ||
5199 | cursor_to (row, col); | |
1113d9db | 5200 | } |
4588ec20 | 5201 | else |
5f5c8ee5 GM |
5202 | { |
5203 | /* We have only one cursor on terminal frames. Use it to | |
5204 | display the cursor of the selected window. */ | |
5205 | struct window *w = XWINDOW (FRAME_SELECTED_WINDOW (f)); | |
a871441d GM |
5206 | if (w->cursor.vpos >= 0 |
5207 | /* The cursor vpos may be temporarily out of bounds | |
5208 | in the following situation: There is one window, | |
5209 | with the cursor in the lower half of it. The window | |
5210 | is split, and a message causes a redisplay before | |
5211 | a new cursor position has been computed. */ | |
5212 | && w->cursor.vpos < XFASTINT (w->height)) | |
5f5c8ee5 GM |
5213 | { |
5214 | int x = WINDOW_TO_FRAME_HPOS (w, w->cursor.hpos); | |
5215 | int y = WINDOW_TO_FRAME_VPOS (w, w->cursor.vpos); | |
5216 | ||
5217 | if (INTEGERP (w->left_margin_width)) | |
5218 | x += XFASTINT (w->left_margin_width); | |
5219 | ||
5220 | /* x = max (min (x, FRAME_WINDOW_WIDTH (f) - 1), 0); */ | |
5221 | cursor_to (y, x); | |
5222 | } | |
5223 | } | |
4588ec20 JB |
5224 | } |
5225 | ||
4588ec20 JB |
5226 | do_pause: |
5227 | ||
5f5c8ee5 | 5228 | clear_desired_matrices (f); |
4588ec20 JB |
5229 | return pause; |
5230 | } | |
5231 | ||
4588ec20 | 5232 | |
5f5c8ee5 | 5233 | /* Do line insertions/deletions on frame F for frame-based redisplay. */ |
4588ec20 | 5234 | |
dfcf069d | 5235 | int |
502b9b64 | 5236 | scrolling (frame) |
5f5c8ee5 | 5237 | struct frame *frame; |
4588ec20 JB |
5238 | { |
5239 | int unchanged_at_top, unchanged_at_bottom; | |
5240 | int window_size; | |
5241 | int changed_lines; | |
502b9b64 JB |
5242 | int *old_hash = (int *) alloca (FRAME_HEIGHT (frame) * sizeof (int)); |
5243 | int *new_hash = (int *) alloca (FRAME_HEIGHT (frame) * sizeof (int)); | |
5244 | int *draw_cost = (int *) alloca (FRAME_HEIGHT (frame) * sizeof (int)); | |
190bb91a | 5245 | int *old_draw_cost = (int *) alloca (FRAME_HEIGHT (frame) * sizeof (int)); |
4588ec20 | 5246 | register int i; |
502b9b64 | 5247 | int free_at_end_vpos = FRAME_HEIGHT (frame); |
5f5c8ee5 GM |
5248 | struct glyph_matrix *current_matrix = frame->current_matrix; |
5249 | struct glyph_matrix *desired_matrix = frame->desired_matrix; | |
4588ec20 | 5250 | |
5f5c8ee5 GM |
5251 | if (!current_matrix) |
5252 | abort (); | |
4588ec20 | 5253 | |
5f5c8ee5 GM |
5254 | /* Compute hash codes of all the lines. Also calculate number of |
5255 | changed lines, number of unchanged lines at the beginning, and | |
5256 | number of unchanged lines at the end. */ | |
4588ec20 JB |
5257 | changed_lines = 0; |
5258 | unchanged_at_top = 0; | |
502b9b64 JB |
5259 | unchanged_at_bottom = FRAME_HEIGHT (frame); |
5260 | for (i = 0; i < FRAME_HEIGHT (frame); i++) | |
4588ec20 JB |
5261 | { |
5262 | /* Give up on this scrolling if some old lines are not enabled. */ | |
5f5c8ee5 | 5263 | if (!MATRIX_ROW_ENABLED_P (current_matrix, i)) |
4588ec20 | 5264 | return 0; |
5f5c8ee5 GM |
5265 | old_hash[i] = line_hash_code (MATRIX_ROW (current_matrix, i)); |
5266 | if (! MATRIX_ROW_ENABLED_P (desired_matrix, i)) | |
f188b3c4 RS |
5267 | { |
5268 | /* This line cannot be redrawn, so don't let scrolling mess it. */ | |
5269 | new_hash[i] = old_hash[i]; | |
5270 | #define INFINITY 1000000 /* Taken from scroll.c */ | |
5271 | draw_cost[i] = INFINITY; | |
5272 | } | |
4588ec20 | 5273 | else |
f188b3c4 | 5274 | { |
5f5c8ee5 GM |
5275 | new_hash[i] = line_hash_code (MATRIX_ROW (desired_matrix, i)); |
5276 | draw_cost[i] = line_draw_cost (desired_matrix, i); | |
f188b3c4 | 5277 | } |
4588ec20 JB |
5278 | |
5279 | if (old_hash[i] != new_hash[i]) | |
5280 | { | |
5281 | changed_lines++; | |
502b9b64 | 5282 | unchanged_at_bottom = FRAME_HEIGHT (frame) - i - 1; |
4588ec20 JB |
5283 | } |
5284 | else if (i == unchanged_at_top) | |
5285 | unchanged_at_top++; | |
5f5c8ee5 | 5286 | old_draw_cost[i] = line_draw_cost (current_matrix, i); |
4588ec20 JB |
5287 | } |
5288 | ||
5289 | /* If changed lines are few, don't allow preemption, don't scroll. */ | |
5f5c8ee5 | 5290 | if ((!scroll_region_ok && changed_lines < baud_rate / 2400) |
502b9b64 | 5291 | || unchanged_at_bottom == FRAME_HEIGHT (frame)) |
4588ec20 JB |
5292 | return 1; |
5293 | ||
502b9b64 | 5294 | window_size = (FRAME_HEIGHT (frame) - unchanged_at_top |
4588ec20 JB |
5295 | - unchanged_at_bottom); |
5296 | ||
5297 | if (scroll_region_ok) | |
5298 | free_at_end_vpos -= unchanged_at_bottom; | |
502b9b64 | 5299 | else if (memory_below_frame) |
4588ec20 JB |
5300 | free_at_end_vpos = -1; |
5301 | ||
5302 | /* If large window, fast terminal and few lines in common between | |
5f5c8ee5 | 5303 | current frame and desired frame, don't bother with i/d calc. */ |
190bb91a | 5304 | if (!scroll_region_ok && window_size >= 18 && baud_rate > 2400 |
4588ec20 JB |
5305 | && (window_size >= |
5306 | 10 * scrolling_max_lines_saved (unchanged_at_top, | |
502b9b64 | 5307 | FRAME_HEIGHT (frame) - unchanged_at_bottom, |
4588ec20 JB |
5308 | old_hash, new_hash, draw_cost))) |
5309 | return 0; | |
5310 | ||
5f5c8ee5 GM |
5311 | if (window_size < 2) |
5312 | return 0; | |
5313 | ||
502b9b64 | 5314 | scrolling_1 (frame, window_size, unchanged_at_top, unchanged_at_bottom, |
4588ec20 | 5315 | draw_cost + unchanged_at_top - 1, |
190bb91a | 5316 | old_draw_cost + unchanged_at_top - 1, |
4588ec20 JB |
5317 | old_hash + unchanged_at_top - 1, |
5318 | new_hash + unchanged_at_top - 1, | |
5319 | free_at_end_vpos - unchanged_at_top); | |
5320 | ||
5321 | return 0; | |
5322 | } | |
4588ec20 | 5323 | |
4588ec20 | 5324 | |
5f5c8ee5 GM |
5325 | /* Count the number of blanks at the start of the vector of glyphs R |
5326 | which is LEN glyphs long. */ | |
4588ec20 | 5327 | |
4588ec20 | 5328 | static int |
5f5c8ee5 GM |
5329 | count_blanks (r, len) |
5330 | struct glyph *r; | |
5331 | int len; | |
4588ec20 | 5332 | { |
5f5c8ee5 | 5333 | int i; |
0a894bad | 5334 | |
5f5c8ee5 GM |
5335 | for (i = 0; i < len; ++i) |
5336 | if (!CHAR_GLYPH_SPACE_P (r[i])) | |
5337 | break; | |
5338 | ||
5339 | return i; | |
4588ec20 JB |
5340 | } |
5341 | ||
5f5c8ee5 GM |
5342 | |
5343 | /* Count the number of glyphs in common at the start of the glyph | |
5344 | vectors STR1 and STR2. END1 is the end of STR1 and END2 is the end | |
5345 | of STR2. Value is the number of equal glyphs equal at the start. */ | |
5346 | ||
4588ec20 | 5347 | static int |
5f5c8ee5 GM |
5348 | count_match (str1, end1, str2, end2) |
5349 | struct glyph *str1, *end1, *str2, *end2; | |
4588ec20 | 5350 | { |
5f5c8ee5 GM |
5351 | struct glyph *p1 = str1; |
5352 | struct glyph *p2 = str2; | |
5353 | ||
5354 | while (p1 < end1 | |
5355 | && p2 < end2 | |
42186983 | 5356 | && GLYPH_CHAR_AND_FACE_EQUAL_P (p1, p2)) |
5f5c8ee5 GM |
5357 | ++p1, ++p2; |
5358 | ||
5359 | return p1 - str1; | |
4588ec20 JB |
5360 | } |
5361 | ||
5f5c8ee5 | 5362 | |
4588ec20 | 5363 | /* Char insertion/deletion cost vector, from term.c */ |
4588ec20 | 5364 | |
5f5c8ee5 | 5365 | extern int *char_ins_del_vector; |
29ec5d84 | 5366 | #define char_ins_del_cost(f) (&char_ins_del_vector[FRAME_WINDOW_WIDTH((f))]) |
4588ec20 | 5367 | |
5f5c8ee5 GM |
5368 | |
5369 | /* Perform a frame-based update on line VPOS in frame FRAME. */ | |
5370 | ||
4588ec20 | 5371 | static void |
c363a1d6 GM |
5372 | update_frame_line (f, vpos) |
5373 | struct frame *f; | |
4588ec20 JB |
5374 | int vpos; |
5375 | { | |
5f5c8ee5 | 5376 | struct glyph *obody, *nbody, *op1, *op2, *np1, *nend; |
4588ec20 JB |
5377 | int tem; |
5378 | int osp, nsp, begmatch, endmatch, olen, nlen; | |
c363a1d6 GM |
5379 | struct glyph_matrix *current_matrix = f->current_matrix; |
5380 | struct glyph_matrix *desired_matrix = f->desired_matrix; | |
5f5c8ee5 GM |
5381 | struct glyph_row *current_row = MATRIX_ROW (current_matrix, vpos); |
5382 | struct glyph_row *desired_row = MATRIX_ROW (desired_matrix, vpos); | |
5383 | int must_write_whole_line_p; | |
0a894bad | 5384 | int write_spaces_p = must_write_spaces; |
c363a1d6 | 5385 | int colored_spaces_p = (FACE_FROM_ID (f, DEFAULT_FACE_ID)->background |
0a894bad GM |
5386 | != FACE_TTY_DEFAULT_BG_COLOR); |
5387 | ||
5388 | if (colored_spaces_p) | |
5389 | write_spaces_p = 1; | |
5f5c8ee5 | 5390 | |
26c63686 GM |
5391 | /* Current row not enabled means it has unknown contents. We must |
5392 | write the whole desired line in that case. */ | |
5f5c8ee5 GM |
5393 | must_write_whole_line_p = !current_row->enabled_p; |
5394 | if (must_write_whole_line_p) | |
4588ec20 | 5395 | { |
5f5c8ee5 | 5396 | obody = 0; |
4588ec20 JB |
5397 | olen = 0; |
5398 | } | |
5399 | else | |
5400 | { | |
5f5c8ee5 GM |
5401 | obody = MATRIX_ROW_GLYPH_START (current_matrix, vpos); |
5402 | olen = current_row->used[TEXT_AREA]; | |
5403 | ||
4cecaab8 MB |
5404 | /* Ignore trailing spaces, if we can. */ |
5405 | if (!write_spaces_p) | |
5406 | while (olen > 0 && CHAR_GLYPH_SPACE_P (obody[olen-1])) | |
5407 | olen--; | |
4588ec20 JB |
5408 | } |
5409 | ||
5f5c8ee5 GM |
5410 | current_row->enabled_p = 1; |
5411 | current_row->used[TEXT_AREA] = desired_row->used[TEXT_AREA]; | |
4588ec20 | 5412 | |
5f5c8ee5 GM |
5413 | /* If desired line is empty, just clear the line. */ |
5414 | if (!desired_row->enabled_p) | |
4588ec20 JB |
5415 | { |
5416 | nlen = 0; | |
5417 | goto just_erase; | |
5418 | } | |
5419 | ||
5f5c8ee5 GM |
5420 | nbody = desired_row->glyphs[TEXT_AREA]; |
5421 | nlen = desired_row->used[TEXT_AREA]; | |
5422 | nend = nbody + nlen; | |
5423 | ||
5424 | /* If display line has unknown contents, write the whole line. */ | |
5425 | if (must_write_whole_line_p) | |
5426 | { | |
26c63686 | 5427 | /* Ignore spaces at the end, if we can. */ |
0a894bad | 5428 | if (!write_spaces_p) |
74ca462f GM |
5429 | while (nlen > 0 && CHAR_GLYPH_SPACE_P (nbody[nlen - 1])) |
5430 | --nlen; | |
5431 | ||
26c63686 | 5432 | /* Write the contents of the desired line. */ |
74ca462f | 5433 | if (nlen) |
26c63686 GM |
5434 | { |
5435 | cursor_to (vpos, 0); | |
5436 | write_glyphs (nbody, nlen); | |
5437 | } | |
74ca462f | 5438 | |
26c63686 GM |
5439 | /* Don't call clear_end_of_line if we already wrote the whole |
5440 | line. The cursor will not be at the right margin in that | |
5441 | case but in the line below. */ | |
c363a1d6 | 5442 | if (nlen < FRAME_WINDOW_WIDTH (f)) |
26c63686 GM |
5443 | { |
5444 | cursor_to (vpos, nlen); | |
c363a1d6 | 5445 | clear_end_of_line (FRAME_WINDOW_WIDTH (f)); |
26c63686 | 5446 | } |
58827478 GM |
5447 | else |
5448 | /* Make sure we are in the right row, otherwise cursor movement | |
5449 | with cmgoto might use `ch' in the wrong row. */ | |
5450 | cursor_to (vpos, 0); | |
5451 | ||
5f5c8ee5 GM |
5452 | make_current (desired_matrix, current_matrix, vpos); |
5453 | return; | |
5454 | } | |
4588ec20 JB |
5455 | |
5456 | /* Pretend trailing spaces are not there at all, | |
5457 | unless for one reason or another we must write all spaces. */ | |
4cecaab8 MB |
5458 | if (!write_spaces_p) |
5459 | while (nlen > 0 && CHAR_GLYPH_SPACE_P (nbody[nlen - 1])) | |
5460 | nlen--; | |
4588ec20 JB |
5461 | |
5462 | /* If there's no i/d char, quickly do the best we can without it. */ | |
5463 | if (!char_ins_del_ok) | |
5464 | { | |
5f5c8ee5 | 5465 | int i, j; |
4588ec20 | 5466 | |
5f5c8ee5 GM |
5467 | /* Find the first glyph in desired row that doesn't agree with |
5468 | a glyph in the current row, and write the rest from there on. */ | |
4588ec20 JB |
5469 | for (i = 0; i < nlen; i++) |
5470 | { | |
5f5c8ee5 | 5471 | if (i >= olen || !GLYPH_EQUAL_P (nbody + i, obody + i)) |
4588ec20 | 5472 | { |
5f5c8ee5 GM |
5473 | /* Find the end of the run of different glyphs. */ |
5474 | j = i + 1; | |
5475 | while (j < nlen | |
5476 | && (j >= olen | |
5477 | || !GLYPH_EQUAL_P (nbody + j, obody + j) | |
5478 | || CHAR_GLYPH_PADDING_P (nbody[j]))) | |
5479 | ++j; | |
5480 | ||
4588ec20 | 5481 | /* Output this run of non-matching chars. */ |
5f5c8ee5 GM |
5482 | cursor_to (vpos, i); |
5483 | write_glyphs (nbody + i, j - i); | |
5484 | i = j - 1; | |
4588ec20 JB |
5485 | |
5486 | /* Now find the next non-match. */ | |
5487 | } | |
5488 | } | |
5489 | ||
5490 | /* Clear the rest of the line, or the non-clear part of it. */ | |
5491 | if (olen > nlen) | |
5492 | { | |
5493 | cursor_to (vpos, nlen); | |
5494 | clear_end_of_line (olen); | |
5495 | } | |
5496 | ||
5f5c8ee5 GM |
5497 | /* Make current row = desired row. */ |
5498 | make_current (desired_matrix, current_matrix, vpos); | |
4588ec20 JB |
5499 | return; |
5500 | } | |
5501 | ||
5f5c8ee5 GM |
5502 | /* Here when CHAR_INS_DEL_OK != 0, i.e. we can insert or delete |
5503 | characters in a row. */ | |
5504 | ||
4588ec20 JB |
5505 | if (!olen) |
5506 | { | |
5f5c8ee5 GM |
5507 | /* If current line is blank, skip over initial spaces, if |
5508 | possible, and write the rest. */ | |
4cecaab8 | 5509 | if (write_spaces_p) |
5f5c8ee5 GM |
5510 | nsp = 0; |
5511 | else | |
5512 | nsp = count_blanks (nbody, nlen); | |
5513 | ||
4588ec20 JB |
5514 | if (nlen > nsp) |
5515 | { | |
5516 | cursor_to (vpos, nsp); | |
5517 | write_glyphs (nbody + nsp, nlen - nsp); | |
5518 | } | |
5519 | ||
502b9b64 | 5520 | /* Exchange contents between current_frame and new_frame. */ |
5f5c8ee5 | 5521 | make_current (desired_matrix, current_matrix, vpos); |
4588ec20 JB |
5522 | return; |
5523 | } | |
5524 | ||
4588ec20 | 5525 | /* Compute number of leading blanks in old and new contents. */ |
5f5c8ee5 | 5526 | osp = count_blanks (obody, olen); |
4cecaab8 | 5527 | nsp = (colored_spaces_p ? 0 : count_blanks (nbody, nlen)); |
4588ec20 | 5528 | |
5f5c8ee5 GM |
5529 | /* Compute number of matching chars starting with first non-blank. */ |
5530 | begmatch = count_match (obody + osp, obody + olen, | |
5531 | nbody + nsp, nbody + nlen); | |
4588ec20 JB |
5532 | |
5533 | /* Spaces in new match implicit space past the end of old. */ | |
5534 | /* A bug causing this to be a no-op was fixed in 18.29. */ | |
0a894bad | 5535 | if (!write_spaces_p && osp + begmatch == olen) |
4588ec20 JB |
5536 | { |
5537 | np1 = nbody + nsp; | |
5f5c8ee5 GM |
5538 | while (np1 + begmatch < nend && CHAR_GLYPH_SPACE_P (np1[begmatch])) |
5539 | ++begmatch; | |
4588ec20 JB |
5540 | } |
5541 | ||
5542 | /* Avoid doing insert/delete char | |
5543 | just cause number of leading spaces differs | |
5f5c8ee5 | 5544 | when the following text does not match. */ |
4588ec20 JB |
5545 | if (begmatch == 0 && osp != nsp) |
5546 | osp = nsp = min (osp, nsp); | |
5547 | ||
5548 | /* Find matching characters at end of line */ | |
5549 | op1 = obody + olen; | |
5550 | np1 = nbody + nlen; | |
5551 | op2 = op1 + begmatch - min (olen - osp, nlen - nsp); | |
5f5c8ee5 GM |
5552 | while (op1 > op2 |
5553 | && GLYPH_EQUAL_P (op1 - 1, np1 - 1)) | |
4588ec20 JB |
5554 | { |
5555 | op1--; | |
5556 | np1--; | |
5557 | } | |
5558 | endmatch = obody + olen - op1; | |
5559 | ||
4588ec20 JB |
5560 | /* tem gets the distance to insert or delete. |
5561 | endmatch is how many characters we save by doing so. | |
5562 | Is it worth it? */ | |
5563 | ||
5564 | tem = (nlen - nsp) - (olen - osp); | |
5565 | if (endmatch && tem | |
c363a1d6 | 5566 | && (!char_ins_del_ok || endmatch <= char_ins_del_cost (f)[tem])) |
4588ec20 JB |
5567 | endmatch = 0; |
5568 | ||
5569 | /* nsp - osp is the distance to insert or delete. | |
5570 | If that is nonzero, begmatch is known to be nonzero also. | |
5571 | begmatch + endmatch is how much we save by doing the ins/del. | |
5572 | Is it worth it? */ | |
5573 | ||
5574 | if (nsp != osp | |
5575 | && (!char_ins_del_ok | |
c363a1d6 | 5576 | || begmatch + endmatch <= char_ins_del_cost (f)[nsp - osp])) |
4588ec20 JB |
5577 | { |
5578 | begmatch = 0; | |
5579 | endmatch = 0; | |
5580 | osp = nsp = min (osp, nsp); | |
5581 | } | |
5582 | ||
5583 | /* Now go through the line, inserting, writing and | |
5584 | deleting as appropriate. */ | |
5585 | ||
5586 | if (osp > nsp) | |
5587 | { | |
5588 | cursor_to (vpos, nsp); | |
5589 | delete_glyphs (osp - nsp); | |
5590 | } | |
5591 | else if (nsp > osp) | |
5592 | { | |
5593 | /* If going to delete chars later in line | |
5594 | and insert earlier in the line, | |
5595 | must delete first to avoid losing data in the insert */ | |
5596 | if (endmatch && nlen < olen + nsp - osp) | |
5597 | { | |
5598 | cursor_to (vpos, nlen - endmatch + osp - nsp); | |
5599 | delete_glyphs (olen + nsp - osp - nlen); | |
5600 | olen = nlen - (nsp - osp); | |
5601 | } | |
5602 | cursor_to (vpos, osp); | |
5f5c8ee5 | 5603 | insert_glyphs (0, nsp - osp); |
4588ec20 JB |
5604 | } |
5605 | olen += nsp - osp; | |
5606 | ||
5607 | tem = nsp + begmatch + endmatch; | |
5608 | if (nlen != tem || olen != tem) | |
5609 | { | |
4588ec20 JB |
5610 | if (!endmatch || nlen == olen) |
5611 | { | |
c363a1d6 GM |
5612 | /* If new text being written reaches right margin, there is |
5613 | no need to do clear-to-eol at the end of this function | |
5614 | (and it would not be safe, since cursor is not going to | |
5615 | be "at the margin" after the text is done). */ | |
5616 | if (nlen == FRAME_WINDOW_WIDTH (f)) | |
4588ec20 | 5617 | olen = 0; |
c363a1d6 GM |
5618 | |
5619 | /* Function write_glyphs is prepared to do nothing | |
5620 | if passed a length <= 0. Check it here to avoid | |
5621 | unnecessary cursor movement. */ | |
5622 | if (nlen - tem > 0) | |
5623 | { | |
5624 | cursor_to (vpos, nsp + begmatch); | |
5625 | write_glyphs (nbody + nsp + begmatch, nlen - tem); | |
5626 | } | |
4588ec20 JB |
5627 | } |
5628 | else if (nlen > olen) | |
5629 | { | |
24e86043 KH |
5630 | /* Here, we used to have the following simple code: |
5631 | ---------------------------------------- | |
5632 | write_glyphs (nbody + nsp + begmatch, olen - tem); | |
5633 | insert_glyphs (nbody + nsp + begmatch + olen - tem, nlen - olen); | |
5634 | ---------------------------------------- | |
5635 | but it doesn't work if nbody[nsp + begmatch + olen - tem] | |
5636 | is a padding glyph. */ | |
5637 | int out = olen - tem; /* Columns to be overwritten originally. */ | |
5638 | int del; | |
5f5c8ee5 | 5639 | |
c363a1d6 GM |
5640 | cursor_to (vpos, nsp + begmatch); |
5641 | ||
5f5c8ee5 | 5642 | /* Calculate columns we can actually overwrite. */ |
c363a1d6 GM |
5643 | while (CHAR_GLYPH_PADDING_P (nbody[nsp + begmatch + out])) |
5644 | out--; | |
5f5c8ee5 | 5645 | write_glyphs (nbody + nsp + begmatch, out); |
c363a1d6 | 5646 | |
5f5c8ee5 GM |
5647 | /* If we left columns to be overwritten, we must delete them. */ |
5648 | del = olen - tem - out; | |
c363a1d6 GM |
5649 | if (del > 0) |
5650 | delete_glyphs (del); | |
5651 | ||
5f5c8ee5 GM |
5652 | /* At last, we insert columns not yet written out. */ |
5653 | insert_glyphs (nbody + nsp + begmatch + out, nlen - olen + del); | |
5654 | olen = nlen; | |
5655 | } | |
5656 | else if (olen > nlen) | |
5657 | { | |
c363a1d6 | 5658 | cursor_to (vpos, nsp + begmatch); |
5f5c8ee5 GM |
5659 | write_glyphs (nbody + nsp + begmatch, nlen - tem); |
5660 | delete_glyphs (olen - nlen); | |
5661 | olen = nlen; | |
5662 | } | |
bd9e3e75 | 5663 | } |
5f5c8ee5 GM |
5664 | |
5665 | just_erase: | |
5666 | /* If any unerased characters remain after the new line, erase them. */ | |
5667 | if (olen > nlen) | |
078b3696 | 5668 | { |
5f5c8ee5 GM |
5669 | cursor_to (vpos, nlen); |
5670 | clear_end_of_line (olen); | |
078b3696 | 5671 | } |
5f5c8ee5 GM |
5672 | |
5673 | /* Exchange contents between current_frame and new_frame. */ | |
5674 | make_current (desired_matrix, current_matrix, vpos); | |
078b3696 | 5675 | } |
5f5c8ee5 GM |
5676 | |
5677 | ||
078b3696 | 5678 | \f |
5f5c8ee5 GM |
5679 | /*********************************************************************** |
5680 | X/Y Position -> Buffer Position | |
5681 | ***********************************************************************/ | |
5682 | ||
a1b0a6db GM |
5683 | /* Determine what's under window-relative pixel position (*X, *Y). |
5684 | Return in *OBJECT the object (string or buffer) that's there. | |
5685 | Return in *POS the position in that object. Adjust *X and *Y | |
5686 | to character boundaries. */ | |
5f5c8ee5 | 5687 | |
a1b0a6db GM |
5688 | void |
5689 | buffer_posn_from_coords (w, x, y, object, pos) | |
5f5c8ee5 GM |
5690 | struct window *w; |
5691 | int *x, *y; | |
a1b0a6db GM |
5692 | Lisp_Object *object; |
5693 | struct display_pos *pos; | |
4588ec20 | 5694 | { |
5f5c8ee5 GM |
5695 | struct it it; |
5696 | struct buffer *old_current_buffer = current_buffer; | |
5697 | struct text_pos startp; | |
5698 | int left_area_width; | |
5699 | ||
5700 | current_buffer = XBUFFER (w->buffer); | |
5701 | SET_TEXT_POS_FROM_MARKER (startp, w->start); | |
5702 | CHARPOS (startp) = min (ZV, max (BEGV, CHARPOS (startp))); | |
5703 | BYTEPOS (startp) = min (ZV_BYTE, max (BEGV_BYTE, BYTEPOS (startp))); | |
5704 | start_display (&it, w, startp); | |
5705 | ||
5706 | left_area_width = WINDOW_DISPLAY_LEFT_AREA_PIXEL_WIDTH (w); | |
5707 | move_it_to (&it, -1, *x + it.first_visible_x - left_area_width, *y, -1, | |
5708 | MOVE_TO_X | MOVE_TO_Y); | |
5709 | ||
5710 | *x = it.current_x - it.first_visible_x + left_area_width; | |
5711 | *y = it.current_y; | |
5712 | current_buffer = old_current_buffer; | |
a1b0a6db GM |
5713 | |
5714 | *object = STRINGP (it.string) ? it.string : w->buffer; | |
5715 | *pos = it.current; | |
5f5c8ee5 | 5716 | } |
4588ec20 | 5717 | |
5f5c8ee5 GM |
5718 | |
5719 | /* Value is the string under window-relative coordinates X/Y in the | |
5720 | mode or top line of window W, or nil if none. MODE_LINE_P non-zero | |
5721 | means look at the mode line. *CHARPOS is set to the position in | |
5722 | the string returned. */ | |
5723 | ||
5724 | Lisp_Object | |
5725 | mode_line_string (w, x, y, mode_line_p, charpos) | |
5726 | struct window *w; | |
43028b7e | 5727 | int x, y, mode_line_p; |
5f5c8ee5 GM |
5728 | int *charpos; |
5729 | { | |
5730 | struct glyph_row *row; | |
5731 | struct glyph *glyph, *end; | |
5732 | struct frame *f = XFRAME (w->frame); | |
5733 | int x0; | |
5734 | Lisp_Object string = Qnil; | |
5735 | ||
5f5c8ee5 GM |
5736 | if (mode_line_p) |
5737 | row = MATRIX_MODE_LINE_ROW (w->current_matrix); | |
5738 | else | |
045dee35 | 5739 | row = MATRIX_HEADER_LINE_ROW (w->current_matrix); |
5f5c8ee5 GM |
5740 | |
5741 | if (row->mode_line_p && row->enabled_p) | |
4588ec20 | 5742 | { |
228a2085 KS |
5743 | /* The mode lines are displayed over scroll bars and fringes, |
5744 | and X is window-relative. Correct X by the scroll bar | |
5745 | and fringe width. */ | |
5f5c8ee5 GM |
5746 | if (FRAME_HAS_VERTICAL_SCROLL_BARS_ON_LEFT (f)) |
5747 | x += FRAME_SCROLL_BAR_COLS (f) * CANON_X_UNIT (f); | |
228a2085 | 5748 | x += FRAME_LEFT_FRINGE_WIDTH (f); |
5f5c8ee5 GM |
5749 | |
5750 | /* Find the glyph under X. If we find one with a string object, | |
5751 | it's the one we were looking for. */ | |
5752 | glyph = row->glyphs[TEXT_AREA]; | |
5753 | end = glyph + row->used[TEXT_AREA]; | |
5754 | for (x0 = 0; glyph < end; x0 += glyph->pixel_width, ++glyph) | |
5755 | if (x >= x0 && x < x0 + glyph->pixel_width) | |
5756 | { | |
5757 | string = glyph->object; | |
5758 | *charpos = glyph->charpos; | |
5759 | break; | |
5760 | } | |
4588ec20 | 5761 | } |
5f5c8ee5 GM |
5762 | |
5763 | return string; | |
4588ec20 | 5764 | } |
5f5c8ee5 GM |
5765 | |
5766 | ||
5767 | /*********************************************************************** | |
5768 | Changing Frame Sizes | |
5769 | ***********************************************************************/ | |
4588ec20 JB |
5770 | |
5771 | #ifdef SIGWINCH | |
5f5c8ee5 | 5772 | |
efb859b4 | 5773 | SIGTYPE |
61cbef47 | 5774 | window_change_signal (signalnum) /* If we don't have an argument, */ |
5f5c8ee5 | 5775 | int signalnum; /* some compilers complain in signal calls. */ |
4588ec20 JB |
5776 | { |
5777 | int width, height; | |
d43721a2 | 5778 | #ifndef USE_CRT_DLL |
4588ec20 | 5779 | extern int errno; |
d43721a2 | 5780 | #endif |
4588ec20 JB |
5781 | int old_errno = errno; |
5782 | ||
502b9b64 | 5783 | get_frame_size (&width, &height); |
4588ec20 | 5784 | |
502b9b64 JB |
5785 | /* The frame size change obviously applies to a termcap-controlled |
5786 | frame. Find such a frame in the list, and assume it's the only | |
4588ec20 | 5787 | one (since the redisplay code always writes to stdout, not a |
502b9b64 | 5788 | FILE * specified in the frame structure). Record the new size, |
4588ec20 JB |
5789 | but don't reallocate the data structures now. Let that be done |
5790 | later outside of the signal handler. */ | |
5791 | ||
5792 | { | |
35f56f96 | 5793 | Lisp_Object tail, frame; |
4588ec20 | 5794 | |
35f56f96 | 5795 | FOR_EACH_FRAME (tail, frame) |
4588ec20 | 5796 | { |
35f56f96 | 5797 | if (FRAME_TERMCAP_P (XFRAME (frame))) |
4588ec20 | 5798 | { |
b96fd3e8 | 5799 | change_frame_size (XFRAME (frame), height, width, 0, 1, 0); |
4588ec20 JB |
5800 | break; |
5801 | } | |
5802 | } | |
5803 | } | |
5804 | ||
5805 | signal (SIGWINCH, window_change_signal); | |
5806 | errno = old_errno; | |
5807 | } | |
5808 | #endif /* SIGWINCH */ | |
5809 | ||
5810 | ||
b96fd3e8 GM |
5811 | /* Do any change in frame size that was requested by a signal. SAFE |
5812 | non-zero means this function is called from a place where it is | |
5813 | safe to change frame sizes while a redisplay is in progress. */ | |
4588ec20 | 5814 | |
dfcf069d | 5815 | void |
b96fd3e8 GM |
5816 | do_pending_window_change (safe) |
5817 | int safe; | |
4588ec20 JB |
5818 | { |
5819 | /* If window_change_signal should have run before, run it now. */ | |
b96fd3e8 GM |
5820 | if (redisplaying_p && !safe) |
5821 | return; | |
5822 | ||
4588ec20 JB |
5823 | while (delayed_size_change) |
5824 | { | |
35f56f96 | 5825 | Lisp_Object tail, frame; |
4588ec20 JB |
5826 | |
5827 | delayed_size_change = 0; | |
5828 | ||
35f56f96 | 5829 | FOR_EACH_FRAME (tail, frame) |
4588ec20 | 5830 | { |
5f5c8ee5 | 5831 | struct frame *f = XFRAME (frame); |
35f56f96 | 5832 | |
502b9b64 JB |
5833 | int height = FRAME_NEW_HEIGHT (f); |
5834 | int width = FRAME_NEW_WIDTH (f); | |
4588ec20 | 5835 | |
08f7aa3e | 5836 | if (height != 0 || width != 0) |
b96fd3e8 | 5837 | change_frame_size (f, height, width, 0, 0, safe); |
4588ec20 JB |
5838 | } |
5839 | } | |
5840 | } | |
5841 | ||
5842 | ||
502b9b64 | 5843 | /* Change the frame height and/or width. Values may be given as zero to |
b6a65ac2 | 5844 | indicate no change is to take place. |
4588ec20 | 5845 | |
b6a65ac2 JB |
5846 | If DELAY is non-zero, then assume we're being called from a signal |
5847 | handler, and queue the change for later - perhaps the next | |
5848 | redisplay. Since this tries to resize windows, we can't call it | |
b96fd3e8 GM |
5849 | from a signal handler. |
5850 | ||
5851 | SAFE non-zero means this function is called from a place where it's | |
5852 | safe to change frame sizes while a redisplay is in progress. */ | |
b6a65ac2 | 5853 | |
dfcf069d | 5854 | void |
b96fd3e8 | 5855 | change_frame_size (f, newheight, newwidth, pretend, delay, safe) |
5f5c8ee5 | 5856 | register struct frame *f; |
b96fd3e8 | 5857 | int newheight, newwidth, pretend, delay, safe; |
45140e01 RS |
5858 | { |
5859 | Lisp_Object tail, frame; | |
3826ea1a | 5860 | |
8a376b3b | 5861 | if (! FRAME_WINDOW_P (f)) |
45140e01 | 5862 | { |
93e54836 RS |
5863 | /* When using termcap, or on MS-DOS, all frames use |
5864 | the same screen, so a change in size affects all frames. */ | |
45140e01 | 5865 | FOR_EACH_FRAME (tail, frame) |
8a376b3b | 5866 | if (! FRAME_WINDOW_P (XFRAME (frame))) |
45140e01 | 5867 | change_frame_size_1 (XFRAME (frame), newheight, newwidth, |
b96fd3e8 | 5868 | pretend, delay, safe); |
45140e01 RS |
5869 | } |
5870 | else | |
b96fd3e8 | 5871 | change_frame_size_1 (f, newheight, newwidth, pretend, delay, safe); |
45140e01 RS |
5872 | } |
5873 | ||
5874 | static void | |
b96fd3e8 | 5875 | change_frame_size_1 (f, newheight, newwidth, pretend, delay, safe) |
5f5c8ee5 | 5876 | register struct frame *f; |
b96fd3e8 | 5877 | int newheight, newwidth, pretend, delay, safe; |
4588ec20 | 5878 | { |
9bfd4456 | 5879 | int new_frame_window_width; |
e523f7e5 | 5880 | int count = specpdl_ptr - specpdl; |
3826ea1a | 5881 | |
4588ec20 | 5882 | /* If we can't deal with the change now, queue it for later. */ |
b96fd3e8 | 5883 | if (delay || (redisplaying_p && !safe)) |
4588ec20 | 5884 | { |
5f5c8ee5 GM |
5885 | FRAME_NEW_HEIGHT (f) = newheight; |
5886 | FRAME_NEW_WIDTH (f) = newwidth; | |
4588ec20 JB |
5887 | delayed_size_change = 1; |
5888 | return; | |
5889 | } | |
5890 | ||
502b9b64 | 5891 | /* This size-change overrides any pending one for this frame. */ |
5f5c8ee5 GM |
5892 | FRAME_NEW_HEIGHT (f) = 0; |
5893 | FRAME_NEW_WIDTH (f) = 0; | |
b6a65ac2 | 5894 | |
08f7aa3e | 5895 | /* If an argument is zero, set it to the current value. */ |
ae19c6f2 | 5896 | if (newheight == 0) |
5f5c8ee5 | 5897 | newheight = FRAME_HEIGHT (f); |
ae19c6f2 | 5898 | if (newwidth == 0) |
5f5c8ee5 | 5899 | newwidth = FRAME_WIDTH (f); |
3826ea1a | 5900 | |
5f5c8ee5 GM |
5901 | /* Compute width of windows in F. |
5902 | This is the width of the frame without vertical scroll bars. */ | |
5903 | new_frame_window_width = FRAME_WINDOW_WIDTH_ARG (f, newwidth); | |
3826ea1a | 5904 | |
b6a65ac2 | 5905 | /* Round up to the smallest acceptable size. */ |
5f5c8ee5 | 5906 | check_frame_size (f, &newheight, &newwidth); |
b6a65ac2 JB |
5907 | |
5908 | /* If we're not changing the frame size, quit now. */ | |
5f5c8ee5 GM |
5909 | if (newheight == FRAME_HEIGHT (f) |
5910 | && new_frame_window_width == FRAME_WINDOW_WIDTH (f)) | |
4588ec20 JB |
5911 | return; |
5912 | ||
cbb95688 RS |
5913 | BLOCK_INPUT; |
5914 | ||
886a8a6c KH |
5915 | #ifdef MSDOS |
5916 | /* We only can set screen dimensions to certain values supported | |
5917 | by our video hardware. Try to find the smallest size greater | |
5918 | or equal to the requested dimensions. */ | |
5919 | dos_set_window_size (&newheight, &newwidth); | |
5920 | #endif | |
5921 | ||
5f5c8ee5 | 5922 | if (newheight != FRAME_HEIGHT (f)) |
4588ec20 | 5923 | { |
5f5c8ee5 | 5924 | if (FRAME_HAS_MINIBUF_P (f) && !FRAME_MINIBUF_ONLY_P (f)) |
4588ec20 | 5925 | { |
5f5c8ee5 GM |
5926 | /* Frame has both root and mini-buffer. */ |
5927 | XSETFASTINT (XWINDOW (FRAME_ROOT_WINDOW (f))->top, | |
5928 | FRAME_TOP_MARGIN (f)); | |
5929 | set_window_height (FRAME_ROOT_WINDOW (f), | |
5930 | (newheight | |
5931 | - 1 | |
5932 | - FRAME_TOP_MARGIN (f)), | |
5933 | 0); | |
5934 | XSETFASTINT (XWINDOW (FRAME_MINIBUF_WINDOW (f))->top, | |
a5d8b611 | 5935 | newheight - 1); |
5f5c8ee5 | 5936 | set_window_height (FRAME_MINIBUF_WINDOW (f), 1, 0); |
4588ec20 JB |
5937 | } |
5938 | else | |
502b9b64 | 5939 | /* Frame has just one top-level window. */ |
5f5c8ee5 GM |
5940 | set_window_height (FRAME_ROOT_WINDOW (f), |
5941 | newheight - FRAME_TOP_MARGIN (f), 0); | |
b6a65ac2 | 5942 | |
5f5c8ee5 | 5943 | if (FRAME_TERMCAP_P (f) && !pretend) |
b6a65ac2 | 5944 | FrameRows = newheight; |
4588ec20 JB |
5945 | } |
5946 | ||
5f5c8ee5 | 5947 | if (new_frame_window_width != FRAME_WINDOW_WIDTH (f)) |
4588ec20 | 5948 | { |
5f5c8ee5 GM |
5949 | set_window_width (FRAME_ROOT_WINDOW (f), new_frame_window_width, 0); |
5950 | if (FRAME_HAS_MINIBUF_P (f)) | |
5951 | set_window_width (FRAME_MINIBUF_WINDOW (f), new_frame_window_width, 0); | |
4588ec20 | 5952 | |
5f5c8ee5 | 5953 | if (FRAME_TERMCAP_P (f) && !pretend) |
502b9b64 | 5954 | FrameCols = newwidth; |
5f5c8ee5 | 5955 | |
9ea173e8 GM |
5956 | if (WINDOWP (f->tool_bar_window)) |
5957 | XSETFASTINT (XWINDOW (f->tool_bar_window)->width, newwidth); | |
4588ec20 JB |
5958 | } |
5959 | ||
5f5c8ee5 GM |
5960 | FRAME_HEIGHT (f) = newheight; |
5961 | SET_FRAME_WIDTH (f, newwidth); | |
986e61b8 | 5962 | |
5f5c8ee5 GM |
5963 | { |
5964 | struct window *w = XWINDOW (FRAME_SELECTED_WINDOW (f)); | |
5965 | int text_area_x, text_area_y, text_area_width, text_area_height; | |
5966 | ||
5967 | window_box (w, TEXT_AREA, &text_area_x, &text_area_y, &text_area_width, | |
5968 | &text_area_height); | |
5969 | if (w->cursor.x >= text_area_x + text_area_width) | |
5970 | w->cursor.hpos = w->cursor.x = 0; | |
5971 | if (w->cursor.y >= text_area_y + text_area_height) | |
5972 | w->cursor.vpos = w->cursor.y = 0; | |
5973 | } | |
986e61b8 | 5974 | |
5f5c8ee5 | 5975 | adjust_glyphs (f); |
5f5c8ee5 | 5976 | calculate_costs (f); |
cb02fa39 GM |
5977 | SET_FRAME_GARBAGED (f); |
5978 | f->resized_p = 1; | |
97cf50e7 RS |
5979 | |
5980 | UNBLOCK_INPUT; | |
61730a69 | 5981 | |
e523f7e5 RS |
5982 | record_unwind_protect (Fset_buffer, Fcurrent_buffer ()); |
5983 | ||
61730a69 | 5984 | /* This isn't quite a no-op: it runs window-configuration-change-hook. */ |
5f5c8ee5 GM |
5985 | Fset_window_buffer (FRAME_SELECTED_WINDOW (f), |
5986 | XWINDOW (FRAME_SELECTED_WINDOW (f))->buffer); | |
e523f7e5 RS |
5987 | |
5988 | unbind_to (count, Qnil); | |
4588ec20 | 5989 | } |
5f5c8ee5 GM |
5990 | |
5991 | ||
4588ec20 | 5992 | \f |
5f5c8ee5 GM |
5993 | /*********************************************************************** |
5994 | Terminal Related Lisp Functions | |
5995 | ***********************************************************************/ | |
5996 | ||
5997 | DEFUN ("open-termscript", Fopen_termscript, Sopen_termscript, | |
228299fa | 5998 | 1, 1, "FOpen termscript file: ", |
7ee72033 MB |
5999 | doc: /* Start writing all terminal output to FILE as well as the terminal. |
6000 | FILE = nil means just close any termscript file currently open. */) | |
6001 | (file) | |
5f5c8ee5 GM |
6002 | Lisp_Object file; |
6003 | { | |
6004 | if (termscript != 0) fclose (termscript); | |
6005 | termscript = 0; | |
6006 | ||
6007 | if (! NILP (file)) | |
6008 | { | |
6009 | file = Fexpand_file_name (file, Qnil); | |
6010 | termscript = fopen (XSTRING (file)->data, "w"); | |
6011 | if (termscript == 0) | |
6012 | report_file_error ("Opening termscript", Fcons (file, Qnil)); | |
6013 | } | |
6014 | return Qnil; | |
6015 | } | |
6016 | ||
6017 | ||
4588ec20 | 6018 | DEFUN ("send-string-to-terminal", Fsend_string_to_terminal, |
228299fa | 6019 | Ssend_string_to_terminal, 1, 1, 0, |
7ee72033 MB |
6020 | doc: /* Send STRING to the terminal without alteration. |
6021 | Control characters in STRING will have terminal-dependent effects. */) | |
6022 | (string) | |
e912ba09 | 6023 | Lisp_Object string; |
4588ec20 | 6024 | { |
94f3db62 | 6025 | /* ??? Perhaps we should do something special for multibyte strings here. */ |
b7826503 | 6026 | CHECK_STRING (string); |
fc932ac6 | 6027 | fwrite (XSTRING (string)->data, 1, STRING_BYTES (XSTRING (string)), stdout); |
4588ec20 JB |
6028 | fflush (stdout); |
6029 | if (termscript) | |
6030 | { | |
fc932ac6 RS |
6031 | fwrite (XSTRING (string)->data, 1, STRING_BYTES (XSTRING (string)), |
6032 | termscript); | |
4588ec20 JB |
6033 | fflush (termscript); |
6034 | } | |
6035 | return Qnil; | |
6036 | } | |
6037 | ||
5f5c8ee5 | 6038 | |
4588ec20 | 6039 | DEFUN ("ding", Fding, Sding, 0, 1, 0, |
7ee72033 | 6040 | doc: /* Beep, or flash the screen. |
228299fa | 6041 | Also, unless an argument is given, |
7ee72033 MB |
6042 | terminate any keyboard macro currently executing. */) |
6043 | (arg) | |
4588ec20 JB |
6044 | Lisp_Object arg; |
6045 | { | |
efb859b4 | 6046 | if (!NILP (arg)) |
4588ec20 | 6047 | { |
7fa788da RS |
6048 | if (noninteractive) |
6049 | putchar (07); | |
6050 | else | |
6051 | ring_bell (); | |
4588ec20 JB |
6052 | fflush (stdout); |
6053 | } | |
6054 | else | |
6055 | bitch_at_user (); | |
6056 | ||
6057 | return Qnil; | |
6058 | } | |
6059 | ||
dfcf069d | 6060 | void |
4588ec20 JB |
6061 | bitch_at_user () |
6062 | { | |
6063 | if (noninteractive) | |
6064 | putchar (07); | |
5f5c8ee5 | 6065 | else if (!INTERACTIVE) /* Stop executing a keyboard macro. */ |
4588ec20 JB |
6066 | error ("Keyboard macro terminated by a command ringing the bell"); |
6067 | else | |
6068 | ring_bell (); | |
6069 | fflush (stdout); | |
6070 | } | |
6071 | ||
5f5c8ee5 GM |
6072 | |
6073 | \f | |
6074 | /*********************************************************************** | |
6075 | Sleeping, Waiting | |
6076 | ***********************************************************************/ | |
6077 | ||
4588ec20 | 6078 | DEFUN ("sleep-for", Fsleep_for, Ssleep_for, 1, 2, 0, |
7ee72033 | 6079 | doc: /* Pause, without updating display, for SECONDS seconds. |
228299fa GM |
6080 | SECONDS may be a floating-point value, meaning that you can wait for a |
6081 | fraction of a second. Optional second arg MILLISECONDS specifies an | |
6082 | additional wait period, in milliseconds; this may be useful if your | |
6083 | Emacs was built without floating point support. | |
7ee72033 MB |
6084 | \(Not all operating systems support waiting for a fraction of a second.) */) |
6085 | (seconds, milliseconds) | |
767229f8 | 6086 | Lisp_Object seconds, milliseconds; |
4588ec20 | 6087 | { |
767229f8 | 6088 | int sec, usec; |
4588ec20 | 6089 | |
767229f8 | 6090 | if (NILP (milliseconds)) |
e9c9a718 | 6091 | XSETINT (milliseconds, 0); |
767229f8 | 6092 | else |
b7826503 | 6093 | CHECK_NUMBER (milliseconds); |
b07646f5 JB |
6094 | usec = XINT (milliseconds) * 1000; |
6095 | ||
b07646f5 JB |
6096 | { |
6097 | double duration = extract_float (seconds); | |
6098 | sec = (int) duration; | |
6099 | usec += (duration - sec) * 1000000; | |
6100 | } | |
4588ec20 | 6101 | |
a41f8bed | 6102 | #ifndef EMACS_HAS_USECS |
767229f8 JB |
6103 | if (sec == 0 && usec != 0) |
6104 | error ("millisecond `sleep-for' not supported on %s", SYSTEM_TYPE); | |
4588ec20 | 6105 | #endif |
767229f8 JB |
6106 | |
6107 | /* Assure that 0 <= usec < 1000000. */ | |
6108 | if (usec < 0) | |
6109 | { | |
6110 | /* We can't rely on the rounding being correct if user is negative. */ | |
6111 | if (-1000000 < usec) | |
6112 | sec--, usec += 1000000; | |
6113 | else | |
6114 | sec -= -usec / 1000000, usec = 1000000 - (-usec % 1000000); | |
4588ec20 | 6115 | } |
767229f8 JB |
6116 | else |
6117 | sec += usec / 1000000, usec %= 1000000; | |
6118 | ||
6b5153b1 | 6119 | if (sec < 0 || (sec == 0 && usec == 0)) |
767229f8 | 6120 | return Qnil; |
4588ec20 | 6121 | |
f76475ad JB |
6122 | { |
6123 | Lisp_Object zero; | |
6124 | ||
a5d8b611 | 6125 | XSETFASTINT (zero, 0); |
f76475ad JB |
6126 | wait_reading_process_input (sec, usec, zero, 0); |
6127 | } | |
d1af74e9 | 6128 | |
767229f8 JB |
6129 | /* We should always have wait_reading_process_input; we have a dummy |
6130 | implementation for systems which don't support subprocesses. */ | |
6131 | #if 0 | |
6132 | /* No wait_reading_process_input */ | |
4588ec20 JB |
6133 | immediate_quit = 1; |
6134 | QUIT; | |
6135 | ||
6136 | #ifdef VMS | |
6137 | sys_sleep (sec); | |
6138 | #else /* not VMS */ | |
6139 | /* The reason this is done this way | |
6140 | (rather than defined (H_S) && defined (H_T)) | |
6141 | is because the VMS preprocessor doesn't grok `defined' */ | |
6142 | #ifdef HAVE_SELECT | |
a41f8bed JB |
6143 | EMACS_GET_TIME (end_time); |
6144 | EMACS_SET_SECS_USECS (timeout, sec, usec); | |
d1af74e9 | 6145 | EMACS_ADD_TIME (end_time, end_time, timeout); |
a41f8bed | 6146 | |
4588ec20 JB |
6147 | while (1) |
6148 | { | |
a41f8bed JB |
6149 | EMACS_GET_TIME (timeout); |
6150 | EMACS_SUB_TIME (timeout, end_time, timeout); | |
6151 | if (EMACS_TIME_NEG_P (timeout) | |
6152 | || !select (1, 0, 0, 0, &timeout)) | |
4588ec20 JB |
6153 | break; |
6154 | } | |
4588ec20 JB |
6155 | #else /* not HAVE_SELECT */ |
6156 | sleep (sec); | |
6157 | #endif /* HAVE_SELECT */ | |
6158 | #endif /* not VMS */ | |
6159 | ||
6160 | immediate_quit = 0; | |
6161 | #endif /* no subprocesses */ | |
6162 | ||
6163 | return Qnil; | |
6164 | } | |
6165 | ||
5f5c8ee5 | 6166 | |
f76475ad JB |
6167 | /* This is just like wait_reading_process_input, except that |
6168 | it does the redisplay. | |
6169 | ||
ea0d86af | 6170 | It's also much like Fsit_for, except that it can be used for |
836d2cde | 6171 | waiting for input as well. */ |
4588ec20 | 6172 | |
f76475ad | 6173 | Lisp_Object |
ae5a0dd4 RS |
6174 | sit_for (sec, usec, reading, display, initial_display) |
6175 | int sec, usec, reading, display, initial_display; | |
f76475ad JB |
6176 | { |
6177 | Lisp_Object read_kbd; | |
4588ec20 | 6178 | |
ccddf474 RS |
6179 | swallow_events (display); |
6180 | ||
f80bd2d7 | 6181 | if (detect_input_pending_run_timers (display)) |
4588ec20 | 6182 | return Qnil; |
4588ec20 | 6183 | |
ae5a0dd4 | 6184 | if (initial_display) |
3007ebfb | 6185 | redisplay_preserve_echo_area (2); |
4588ec20 | 6186 | |
dfdb645c JB |
6187 | if (sec == 0 && usec == 0) |
6188 | return Qt; | |
6189 | ||
4588ec20 | 6190 | #ifdef SIGIO |
8fc798e9 | 6191 | gobble_input (0); |
f76475ad JB |
6192 | #endif |
6193 | ||
e9c9a718 | 6194 | XSETINT (read_kbd, reading ? -1 : 1); |
f76475ad JB |
6195 | wait_reading_process_input (sec, usec, read_kbd, display); |
6196 | ||
4588ec20 JB |
6197 | return detect_input_pending () ? Qnil : Qt; |
6198 | } | |
6199 | ||
5f5c8ee5 | 6200 | |
f76475ad | 6201 | DEFUN ("sit-for", Fsit_for, Ssit_for, 1, 3, 0, |
bacf09b4 | 6202 | doc: /* Perform redisplay, then wait for SECONDS seconds or until input is available. |
228299fa GM |
6203 | SECONDS may be a floating-point value, meaning that you can wait for a |
6204 | fraction of a second. Optional second arg MILLISECONDS specifies an | |
6205 | additional wait period, in milliseconds; this may be useful if your | |
6206 | Emacs was built without floating point support. | |
6207 | \(Not all operating systems support waiting for a fraction of a second.) | |
6208 | Optional third arg NODISP non-nil means don't redisplay, just wait for input. | |
6209 | Redisplay is preempted as always if input arrives, and does not happen | |
6210 | if input is available before it starts. | |
7ee72033 MB |
6211 | Value is t if waited the full time with no input arriving. */) |
6212 | (seconds, milliseconds, nodisp) | |
767229f8 | 6213 | Lisp_Object seconds, milliseconds, nodisp; |
f76475ad | 6214 | { |
767229f8 | 6215 | int sec, usec; |
f76475ad | 6216 | |
767229f8 | 6217 | if (NILP (milliseconds)) |
e9c9a718 | 6218 | XSETINT (milliseconds, 0); |
767229f8 | 6219 | else |
b7826503 | 6220 | CHECK_NUMBER (milliseconds); |
b07646f5 JB |
6221 | usec = XINT (milliseconds) * 1000; |
6222 | ||
b07646f5 JB |
6223 | { |
6224 | double duration = extract_float (seconds); | |
6225 | sec = (int) duration; | |
6226 | usec += (duration - sec) * 1000000; | |
6227 | } | |
f76475ad | 6228 | |
f76475ad | 6229 | #ifndef EMACS_HAS_USECS |
767229f8 JB |
6230 | if (usec != 0 && sec == 0) |
6231 | error ("millisecond `sit-for' not supported on %s", SYSTEM_TYPE); | |
f76475ad | 6232 | #endif |
f76475ad | 6233 | |
ae5a0dd4 | 6234 | return sit_for (sec, usec, 0, NILP (nodisp), NILP (nodisp)); |
f76475ad | 6235 | } |
5f5c8ee5 GM |
6236 | |
6237 | ||
6238 | \f | |
6239 | /*********************************************************************** | |
6240 | Other Lisp Functions | |
6241 | ***********************************************************************/ | |
6242 | ||
6243 | /* A vector of size >= 2 * NFRAMES + 3 * NBUFFERS + 1, containing the | |
6244 | session's frames, frame names, buffers, buffer-read-only flags, and | |
6245 | buffer-modified-flags, and a trailing sentinel (so we don't need to | |
6246 | add length checks). */ | |
6247 | ||
6248 | static Lisp_Object frame_and_buffer_state; | |
6249 | ||
6250 | ||
6251 | DEFUN ("frame-or-buffer-changed-p", Fframe_or_buffer_changed_p, | |
228299fa | 6252 | Sframe_or_buffer_changed_p, 0, 0, 0, |
bacf09b4 | 6253 | doc: /* Return non-nil if the frame and buffer state appears to have changed. |
228299fa GM |
6254 | The state variable is an internal vector containing all frames and buffers, |
6255 | aside from buffers whose names start with space, | |
6256 | along with the buffers' read-only and modified flags, which allows a fast | |
6257 | check to see whether the menu bars might need to be recomputed. | |
6258 | If this function returns non-nil, it updates the internal vector to reflect | |
7ee72033 MB |
6259 | the current state. */) |
6260 | () | |
5f5c8ee5 GM |
6261 | { |
6262 | Lisp_Object tail, frame, buf; | |
6263 | Lisp_Object *vecp; | |
6264 | int n; | |
6265 | ||
6266 | vecp = XVECTOR (frame_and_buffer_state)->contents; | |
6267 | FOR_EACH_FRAME (tail, frame) | |
6268 | { | |
6269 | if (!EQ (*vecp++, frame)) | |
6270 | goto changed; | |
6271 | if (!EQ (*vecp++, XFRAME (frame)->name)) | |
6272 | goto changed; | |
6273 | } | |
6274 | /* Check that the buffer info matches. | |
6275 | No need to test for the end of the vector | |
6276 | because the last element of the vector is lambda | |
6277 | and that will always cause a mismatch. */ | |
7539e11f | 6278 | for (tail = Vbuffer_alist; CONSP (tail); tail = XCDR (tail)) |
5f5c8ee5 | 6279 | { |
7539e11f | 6280 | buf = XCDR (XCAR (tail)); |
5f5c8ee5 GM |
6281 | /* Ignore buffers that aren't included in buffer lists. */ |
6282 | if (XSTRING (XBUFFER (buf)->name)->data[0] == ' ') | |
6283 | continue; | |
6284 | if (!EQ (*vecp++, buf)) | |
6285 | goto changed; | |
6286 | if (!EQ (*vecp++, XBUFFER (buf)->read_only)) | |
6287 | goto changed; | |
6288 | if (!EQ (*vecp++, Fbuffer_modified_p (buf))) | |
6289 | goto changed; | |
6290 | } | |
6291 | /* Detect deletion of a buffer at the end of the list. */ | |
6292 | if (EQ (*vecp, Qlambda)) | |
6293 | return Qnil; | |
6294 | changed: | |
6295 | /* Start with 1 so there is room for at least one lambda at the end. */ | |
6296 | n = 1; | |
6297 | FOR_EACH_FRAME (tail, frame) | |
6298 | n += 2; | |
7539e11f | 6299 | for (tail = Vbuffer_alist; CONSP (tail); tail = XCDR (tail)) |
5f5c8ee5 GM |
6300 | n += 3; |
6301 | /* Reallocate the vector if it's grown, or if it's shrunk a lot. */ | |
6302 | if (n > XVECTOR (frame_and_buffer_state)->size | |
6303 | || n + 20 < XVECTOR (frame_and_buffer_state)->size / 2) | |
6304 | /* Add 20 extra so we grow it less often. */ | |
6305 | frame_and_buffer_state = Fmake_vector (make_number (n + 20), Qlambda); | |
6306 | vecp = XVECTOR (frame_and_buffer_state)->contents; | |
6307 | FOR_EACH_FRAME (tail, frame) | |
6308 | { | |
6309 | *vecp++ = frame; | |
6310 | *vecp++ = XFRAME (frame)->name; | |
6311 | } | |
7539e11f | 6312 | for (tail = Vbuffer_alist; CONSP (tail); tail = XCDR (tail)) |
5f5c8ee5 | 6313 | { |
7539e11f | 6314 | buf = XCDR (XCAR (tail)); |
5f5c8ee5 GM |
6315 | /* Ignore buffers that aren't included in buffer lists. */ |
6316 | if (XSTRING (XBUFFER (buf)->name)->data[0] == ' ') | |
6317 | continue; | |
6318 | *vecp++ = buf; | |
6319 | *vecp++ = XBUFFER (buf)->read_only; | |
6320 | *vecp++ = Fbuffer_modified_p (buf); | |
6321 | } | |
6322 | /* Fill up the vector with lambdas (always at least one). */ | |
6323 | *vecp++ = Qlambda; | |
6324 | while (vecp - XVECTOR (frame_and_buffer_state)->contents | |
6325 | < XVECTOR (frame_and_buffer_state)->size) | |
6326 | *vecp++ = Qlambda; | |
6327 | /* Make sure we didn't overflow the vector. */ | |
6328 | if (vecp - XVECTOR (frame_and_buffer_state)->contents | |
6329 | > XVECTOR (frame_and_buffer_state)->size) | |
6330 | abort (); | |
6331 | return Qt; | |
6332 | } | |
6333 | ||
6334 | ||
4588ec20 | 6335 | \f |
5f5c8ee5 GM |
6336 | /*********************************************************************** |
6337 | Initialization | |
6338 | ***********************************************************************/ | |
6339 | ||
4588ec20 JB |
6340 | char *terminal_type; |
6341 | ||
5f5c8ee5 GM |
6342 | /* Initialization done when Emacs fork is started, before doing stty. |
6343 | Determine terminal type and set terminal_driver. Then invoke its | |
6344 | decoding routine to set up variables in the terminal package. */ | |
4588ec20 | 6345 | |
dfcf069d | 6346 | void |
4588ec20 JB |
6347 | init_display () |
6348 | { | |
6349 | #ifdef HAVE_X_WINDOWS | |
6350 | extern int display_arg; | |
6351 | #endif | |
6352 | ||
5f5c8ee5 GM |
6353 | /* Construct the space glyph. */ |
6354 | space_glyph.type = CHAR_GLYPH; | |
6355 | SET_CHAR_GLYPH_FROM_GLYPH (space_glyph, ' '); | |
6356 | space_glyph.charpos = -1; | |
6357 | ||
4588ec20 JB |
6358 | meta_key = 0; |
6359 | inverse_video = 0; | |
6360 | cursor_in_echo_area = 0; | |
6361 | terminal_type = (char *) 0; | |
6362 | ||
1315c181 JB |
6363 | /* Now is the time to initialize this; it's used by init_sys_modes |
6364 | during startup. */ | |
6365 | Vwindow_system = Qnil; | |
4588ec20 | 6366 | |
1315c181 JB |
6367 | /* If the user wants to use a window system, we shouldn't bother |
6368 | initializing the terminal. This is especially important when the | |
6369 | terminal is so dumb that emacs gives up before and doesn't bother | |
6370 | using the window system. | |
4588ec20 | 6371 | |
36bbad1d KH |
6372 | If the DISPLAY environment variable is set and nonempty, |
6373 | try to use X, and die with an error message if that doesn't work. */ | |
4588ec20 JB |
6374 | |
6375 | #ifdef HAVE_X_WINDOWS | |
d460af17 JB |
6376 | if (! display_arg) |
6377 | { | |
36bbad1d | 6378 | char *display; |
d460af17 | 6379 | #ifdef VMS |
36bbad1d | 6380 | display = getenv ("DECW$DISPLAY"); |
d460af17 | 6381 | #else |
36bbad1d | 6382 | display = getenv ("DISPLAY"); |
d460af17 | 6383 | #endif |
36bbad1d KH |
6384 | |
6385 | display_arg = (display != 0 && *display != 0); | |
f040093a | 6386 | } |
d460af17 | 6387 | |
9e4555e8 RS |
6388 | if (!inhibit_window_system && display_arg |
6389 | #ifndef CANNOT_DUMP | |
6390 | && initialized | |
6391 | #endif | |
6392 | ) | |
4588ec20 JB |
6393 | { |
6394 | Vwindow_system = intern ("x"); | |
6395 | #ifdef HAVE_X11 | |
6396 | Vwindow_system_version = make_number (11); | |
6397 | #else | |
6398 | Vwindow_system_version = make_number (10); | |
039e5d71 | 6399 | #endif |
8a2a6032 | 6400 | #if defined (GNU_LINUX) && defined (HAVE_LIBNCURSES) |
039e5d71 | 6401 | /* In some versions of ncurses, |
6a428f77 | 6402 | tputs crashes if we have not called tgetent. |
039e5d71 KH |
6403 | So call tgetent. */ |
6404 | { char b[2044]; tgetent (b, "xterm");} | |
4588ec20 | 6405 | #endif |
5f5c8ee5 | 6406 | adjust_frame_glyphs_initially (); |
4588ec20 JB |
6407 | return; |
6408 | } | |
6409 | #endif /* HAVE_X_WINDOWS */ | |
6410 | ||
fd2e066a GV |
6411 | #ifdef HAVE_NTGUI |
6412 | if (!inhibit_window_system) | |
6413 | { | |
60c7469c | 6414 | Vwindow_system = intern ("w32"); |
fd2e066a | 6415 | Vwindow_system_version = make_number (1); |
5f5c8ee5 | 6416 | adjust_frame_glyphs_initially (); |
fd2e066a GV |
6417 | return; |
6418 | } | |
6419 | #endif /* HAVE_NTGUI */ | |
6420 | ||
1a578e9b AC |
6421 | #ifdef macintosh |
6422 | if (!inhibit_window_system) | |
6423 | { | |
6424 | Vwindow_system = intern ("mac"); | |
6425 | Vwindow_system_version = make_number (1); | |
6426 | adjust_frame_glyphs_initially (); | |
6427 | return; | |
6428 | } | |
6429 | #endif /* macintosh */ | |
6430 | ||
4588ec20 JB |
6431 | /* If no window system has been specified, try to use the terminal. */ |
6432 | if (! isatty (0)) | |
6433 | { | |
1559a86d | 6434 | fatal ("standard input is not a tty"); |
4588ec20 JB |
6435 | exit (1); |
6436 | } | |
6437 | ||
6438 | /* Look at the TERM variable */ | |
6439 | terminal_type = (char *) getenv ("TERM"); | |
6440 | if (!terminal_type) | |
6441 | { | |
6442 | #ifdef VMS | |
6443 | fprintf (stderr, "Please specify your terminal type.\n\ | |
6444 | For types defined in VMS, use set term /device=TYPE.\n\ | |
6445 | For types not defined in VMS, use define emacs_term \"TYPE\".\n\ | |
6446 | \(The quotation marks are necessary since terminal types are lower case.)\n"); | |
6447 | #else | |
6448 | fprintf (stderr, "Please set the environment variable TERM; see tset(1).\n"); | |
6449 | #endif | |
6450 | exit (1); | |
6451 | } | |
6452 | ||
6453 | #ifdef VMS | |
5f5c8ee5 | 6454 | /* VMS DCL tends to up-case things, so down-case term type. |
4588ec20 JB |
6455 | Hardly any uppercase letters in terminal types; should be none. */ |
6456 | { | |
6457 | char *new = (char *) xmalloc (strlen (terminal_type) + 1); | |
6458 | char *p; | |
6459 | ||
6460 | strcpy (new, terminal_type); | |
6461 | ||
6462 | for (p = new; *p; p++) | |
6463 | if (isupper (*p)) | |
6464 | *p = tolower (*p); | |
6465 | ||
6466 | terminal_type = new; | |
6467 | } | |
5f5c8ee5 | 6468 | #endif /* VMS */ |
4588ec20 JB |
6469 | |
6470 | term_init (terminal_type); | |
5f5c8ee5 | 6471 | |
d86c299a | 6472 | { |
91fb7e1b GM |
6473 | struct frame *sf = SELECTED_FRAME (); |
6474 | int width = FRAME_WINDOW_WIDTH (sf); | |
6475 | int height = FRAME_HEIGHT (sf); | |
d86c299a | 6476 | |
5f5c8ee5 | 6477 | unsigned int total_glyphs = height * (width + 2) * sizeof (struct glyph); |
d86c299a | 6478 | |
5f5c8ee5 GM |
6479 | /* If these sizes are so big they cause overflow, just ignore the |
6480 | change. It's not clear what better we could do. */ | |
6481 | if (total_glyphs / sizeof (struct glyph) / height != width + 2) | |
1559a86d | 6482 | fatal ("screen size %dx%d too big", width, height); |
d86c299a RS |
6483 | } |
6484 | ||
5f5c8ee5 | 6485 | adjust_frame_glyphs_initially (); |
91fb7e1b | 6486 | calculate_costs (XFRAME (selected_frame)); |
4588ec20 | 6487 | |
4588ec20 JB |
6488 | #ifdef SIGWINCH |
6489 | #ifndef CANNOT_DUMP | |
6490 | if (initialized) | |
6491 | #endif /* CANNOT_DUMP */ | |
6492 | signal (SIGWINCH, window_change_signal); | |
6493 | #endif /* SIGWINCH */ | |
5f5c8ee5 GM |
6494 | |
6495 | /* Set up faces of the initial terminal frame of a dumped Emacs. */ | |
6496 | if (initialized | |
6497 | && !noninteractive | |
622dca89 EZ |
6498 | #ifdef MSDOS |
6499 | /* The MSDOS terminal turns on its ``window system'' relatively | |
6500 | late into the startup, so we cannot do the frame faces' | |
6501 | initialization just yet. It will be done later by pc-win.el | |
6502 | and internal_terminal_init. */ | |
6503 | && (strcmp (terminal_type, "internal") != 0 || inhibit_window_system) | |
6504 | #endif | |
5f5c8ee5 | 6505 | && NILP (Vwindow_system)) |
2d764c78 EZ |
6506 | { |
6507 | /* For the initial frame, we don't have any way of knowing what | |
6508 | are the foreground and background colors of the terminal. */ | |
6509 | struct frame *sf = SELECTED_FRAME(); | |
6510 | ||
f9d2fdc4 EZ |
6511 | FRAME_FOREGROUND_PIXEL (sf) = FACE_TTY_DEFAULT_FG_COLOR; |
6512 | FRAME_BACKGROUND_PIXEL (sf) = FACE_TTY_DEFAULT_BG_COLOR; | |
2d764c78 EZ |
6513 | call0 (intern ("tty-set-up-initial-frame-faces")); |
6514 | } | |
5f5c8ee5 GM |
6515 | } |
6516 | ||
6517 | ||
6518 | \f | |
6519 | /*********************************************************************** | |
6520 | Blinking cursor | |
6521 | ***********************************************************************/ | |
6522 | ||
c3f13540 | 6523 | DEFUN ("internal-show-cursor", Finternal_show_cursor, |
5d7791b3 | 6524 | Sinternal_show_cursor, 2, 2, 0, |
7ee72033 | 6525 | doc: /* Set the cursor-visibility flag of WINDOW to SHOW. |
228299fa GM |
6526 | WINDOW nil means use the selected window. SHOW non-nil means |
6527 | show a cursor in WINDOW in the next redisplay. SHOW nil means | |
7ee72033 MB |
6528 | don't show a cursor. */) |
6529 | (window, show) | |
5d7791b3 | 6530 | Lisp_Object window, show; |
5f5c8ee5 | 6531 | { |
5f5c8ee5 GM |
6532 | /* Don't change cursor state while redisplaying. This could confuse |
6533 | output routines. */ | |
6534 | if (!redisplaying_p) | |
6535 | { | |
6536 | if (NILP (window)) | |
6537 | window = selected_window; | |
6538 | else | |
b7826503 | 6539 | CHECK_WINDOW (window); |
5f5c8ee5 | 6540 | |
5d7791b3 | 6541 | XWINDOW (window)->cursor_off_p = NILP (show); |
5f5c8ee5 GM |
6542 | } |
6543 | ||
6544 | return Qnil; | |
4588ec20 | 6545 | } |
5f5c8ee5 GM |
6546 | |
6547 | ||
5d7791b3 GM |
6548 | DEFUN ("internal-show-cursor-p", Finternal_show_cursor_p, |
6549 | Sinternal_show_cursor_p, 0, 1, 0, | |
bacf09b4 | 6550 | doc: /* Value is non-nil if next redisplay will display a cursor in WINDOW. |
7ee72033 MB |
6551 | WINDOW nil or omitted means report on the selected window. */) |
6552 | (window) | |
5d7791b3 GM |
6553 | Lisp_Object window; |
6554 | { | |
6555 | struct window *w; | |
6556 | ||
6557 | if (NILP (window)) | |
6558 | window = selected_window; | |
6559 | else | |
b7826503 | 6560 | CHECK_WINDOW (window); |
5d7791b3 GM |
6561 | |
6562 | w = XWINDOW (window); | |
6563 | return w->cursor_off_p ? Qnil : Qt; | |
6564 | } | |
6565 | ||
4588ec20 | 6566 | \f |
5f5c8ee5 GM |
6567 | /*********************************************************************** |
6568 | Initialization | |
6569 | ***********************************************************************/ | |
6570 | ||
dfcf069d | 6571 | void |
4588ec20 JB |
6572 | syms_of_display () |
6573 | { | |
502b9b64 | 6574 | defsubr (&Sredraw_frame); |
4588ec20 | 6575 | defsubr (&Sredraw_display); |
078b3696 | 6576 | defsubr (&Sframe_or_buffer_changed_p); |
4588ec20 JB |
6577 | defsubr (&Sopen_termscript); |
6578 | defsubr (&Sding); | |
6579 | defsubr (&Ssit_for); | |
6580 | defsubr (&Ssleep_for); | |
6581 | defsubr (&Ssend_string_to_terminal); | |
c3f13540 | 6582 | defsubr (&Sinternal_show_cursor); |
5d7791b3 | 6583 | defsubr (&Sinternal_show_cursor_p); |
4588ec20 | 6584 | |
2d5912c1 | 6585 | #if GLYPH_DEBUG |
9b0e97aa GM |
6586 | defsubr (&Sdump_redisplay_history); |
6587 | #endif | |
6588 | ||
d1dad759 | 6589 | frame_and_buffer_state = Fmake_vector (make_number (20), Qlambda); |
078b3696 KH |
6590 | staticpro (&frame_and_buffer_state); |
6591 | ||
9cda4f7c RS |
6592 | Qdisplay_table = intern ("display-table"); |
6593 | staticpro (&Qdisplay_table); | |
e7067d00 GM |
6594 | Qredisplay_dont_pause = intern ("redisplay-dont-pause"); |
6595 | staticpro (&Qredisplay_dont_pause); | |
9cda4f7c | 6596 | |
7ee72033 | 6597 | DEFVAR_INT ("baud-rate", &baud_rate, |
bacf09b4 | 6598 | doc: /* *The output baud rate of the terminal. |
228299fa GM |
6599 | On most systems, changing this value will affect the amount of padding |
6600 | and the other strategic decisions made during redisplay. */); | |
5f5c8ee5 | 6601 | |
7ee72033 | 6602 | DEFVAR_BOOL ("inverse-video", &inverse_video, |
bacf09b4 | 6603 | doc: /* *Non-nil means invert the entire frame display. |
228299fa | 6604 | This means everything is in inverse video which otherwise would not be. */); |
5f5c8ee5 | 6605 | |
7ee72033 | 6606 | DEFVAR_BOOL ("visible-bell", &visible_bell, |
bacf09b4 | 6607 | doc: /* *Non-nil means try to flash the frame to represent a bell. |
552b1b01 EZ |
6608 | |
6609 | See also `ring-bell-function'. */); | |
5f5c8ee5 | 6610 | |
7ee72033 | 6611 | DEFVAR_BOOL ("no-redraw-on-reenter", &no_redraw_on_reenter, |
bacf09b4 | 6612 | doc: /* *Non-nil means no need to redraw entire frame after suspending. |
228299fa GM |
6613 | A non-nil value is useful if the terminal can automatically preserve |
6614 | Emacs's frame display when you reenter Emacs. | |
6615 | It is up to you to set this variable if your terminal can do that. */); | |
5f5c8ee5 | 6616 | |
7ee72033 | 6617 | DEFVAR_LISP ("window-system", &Vwindow_system, |
85565e9e RS |
6618 | doc: /* Name of window system that Emacs is displaying through. |
6619 | The value is a symbol--for instance, `x' for X windows. | |
6620 | The value is nil if Emacs is using a text-only terminal. */); | |
5f5c8ee5 | 6621 | |
7ee72033 | 6622 | DEFVAR_LISP ("window-system-version", &Vwindow_system_version, |
bacf09b4 | 6623 | doc: /* The version number of the window system in use. |
228299fa | 6624 | For X windows, this is 10 or 11. */); |
5f5c8ee5 | 6625 | |
7ee72033 | 6626 | DEFVAR_BOOL ("cursor-in-echo-area", &cursor_in_echo_area, |
bacf09b4 | 6627 | doc: /* Non-nil means put cursor in minibuffer, at end of any message there. */); |
5f5c8ee5 | 6628 | |
7ee72033 | 6629 | DEFVAR_LISP ("glyph-table", &Vglyph_table, |
bacf09b4 | 6630 | doc: /* Table defining how to output a glyph code to the frame. |
228299fa GM |
6631 | If not nil, this is a vector indexed by glyph code to define the glyph. |
6632 | Each element can be: | |
6633 | integer: a glyph code which this glyph is an alias for. | |
6634 | string: output this glyph using that string (not impl. in X windows). | |
6635 | nil: this glyph mod 524288 is the code of a character to output, | |
6636 | and this glyph / 524288 is the face number (see `face-id') to use | |
6637 | while outputting it. */); | |
4588ec20 JB |
6638 | Vglyph_table = Qnil; |
6639 | ||
7ee72033 | 6640 | DEFVAR_LISP ("standard-display-table", &Vstandard_display_table, |
bacf09b4 | 6641 | doc: /* Display table to use for buffers that specify none. |
228299fa | 6642 | See `buffer-display-table' for more information. */); |
4588ec20 JB |
6643 | Vstandard_display_table = Qnil; |
6644 | ||
7ee72033 | 6645 | DEFVAR_BOOL ("redisplay-dont-pause", &redisplay_dont_pause, |
bacf09b4 | 6646 | doc: /* *Non-nil means update isn't paused when input is detected. */); |
5f5c8ee5 GM |
6647 | redisplay_dont_pause = 0; |
6648 | ||
4588ec20 JB |
6649 | /* Initialize `window-system', unless init_display already decided it. */ |
6650 | #ifdef CANNOT_DUMP | |
6651 | if (noninteractive) | |
6652 | #endif | |
6653 | { | |
6654 | Vwindow_system = Qnil; | |
6655 | Vwindow_system_version = Qnil; | |
6656 | } | |
6657 | } |