Mercurial > emacs
annotate src/scroll.c @ 38488:2a70c922f6ad
Fix last change.
author | Eli Zaretskii <eliz@gnu.org> |
---|---|
date | Thu, 19 Jul 2001 13:10:50 +0000 |
parents | 6a0caa788013 |
children | 5f60884970a8 |
rev | line source |
---|---|
154 | 1 /* Calculate what line insertion or deletion to do, and do it, |
7307 | 2 Copyright (C) 1985, 1986, 1990, 1993, 1994 Free Software Foundation, Inc. |
154 | 3 |
4 This file is part of GNU Emacs. | |
5 | |
6 GNU Emacs is free software; you can redistribute it and/or modify | |
7 it under the terms of the GNU General Public License as published by | |
732 | 8 the Free Software Foundation; either version 2, or (at your option) |
154 | 9 any later version. |
10 | |
11 GNU Emacs is distributed in the hope that it will be useful, | |
12 but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 GNU General Public License for more details. | |
15 | |
16 You should have received a copy of the GNU General Public License | |
17 along with GNU Emacs; see the file COPYING. If not, write to | |
14186
ee40177f6c68
Update FSF's address in the preamble.
Erik Naggum <erik@naggum.no>
parents:
13415
diff
changeset
|
18 the Free Software Foundation, Inc., 59 Temple Place - Suite 330, |
ee40177f6c68
Update FSF's address in the preamble.
Erik Naggum <erik@naggum.no>
parents:
13415
diff
changeset
|
19 Boston, MA 02111-1307, USA. */ |
154 | 20 |
21 | |
4696
1fc792473491
Include <config.h> instead of "config.h".
Roland McGrath <roland@gnu.org>
parents:
3356
diff
changeset
|
22 #include <config.h> |
25004 | 23 #include <stdio.h> |
24 #include <string.h> | |
154 | 25 #include "termchar.h" |
26 #include "lisp.h" | |
27 #include "dispextern.h" | |
31102
6a0caa788013
Include keyboard.h before frame.h.
Andrew Innes <andrewi@gnu.org>
parents:
28407
diff
changeset
|
28 #include "keyboard.h" |
766 | 29 #include "frame.h" |
25004 | 30 #include "window.h" |
154 | 31 |
32 #define max(a, b) ((a) > (b) ? (a) : (b)) | |
33 #define min(a, b) ((a) < (b) ? (a) : (b)) | |
34 | |
35 /* All costs measured in characters. | |
766 | 36 So no cost can exceed the area of a frame, measured in characters. |
6773
ed16e189b9a5
(struct matrix_elt): Use int, not short.
Richard M. Stallman <rms@gnu.org>
parents:
6647
diff
changeset
|
37 Let's hope this is never more than 1000000 characters. */ |
154 | 38 |
6773
ed16e189b9a5
(struct matrix_elt): Use int, not short.
Richard M. Stallman <rms@gnu.org>
parents:
6647
diff
changeset
|
39 #define INFINITY 1000000 |
154 | 40 |
41 struct matrix_elt | |
42 { | |
43 /* Cost of outputting through this line | |
44 if no insert/delete is done just above it. */ | |
6773
ed16e189b9a5
(struct matrix_elt): Use int, not short.
Richard M. Stallman <rms@gnu.org>
parents:
6647
diff
changeset
|
45 int writecost; |
154 | 46 /* Cost of outputting through this line |
47 if an insert is done just above it. */ | |
6773
ed16e189b9a5
(struct matrix_elt): Use int, not short.
Richard M. Stallman <rms@gnu.org>
parents:
6647
diff
changeset
|
48 int insertcost; |
154 | 49 /* Cost of outputting through this line |
50 if a delete is done just above it. */ | |
6773
ed16e189b9a5
(struct matrix_elt): Use int, not short.
Richard M. Stallman <rms@gnu.org>
parents:
6647
diff
changeset
|
51 int deletecost; |
154 | 52 /* Number of inserts so far in this run of inserts, |
53 for the cost in insertcost. */ | |
6773
ed16e189b9a5
(struct matrix_elt): Use int, not short.
Richard M. Stallman <rms@gnu.org>
parents:
6647
diff
changeset
|
54 unsigned char insertcount; |
154 | 55 /* Number of deletes so far in this run of deletes, |
56 for the cost in deletecost. */ | |
6773
ed16e189b9a5
(struct matrix_elt): Use int, not short.
Richard M. Stallman <rms@gnu.org>
parents:
6647
diff
changeset
|
57 unsigned char deletecount; |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
58 /* Number of writes so far since the last insert |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
59 or delete for the cost in writecost. */ |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
60 unsigned char writecount; |
154 | 61 }; |
62 | |
25004 | 63 static void do_direct_scrolling P_ ((struct glyph_matrix *, |
64 struct matrix_elt *, | |
65 int, int)); | |
66 static void do_scrolling P_ ((struct glyph_matrix *, | |
67 struct matrix_elt *, | |
68 int, int)); | |
69 | |
154 | 70 |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
71 /* Determine, in matrix[i,j], the cost of updating the first j old |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
72 lines into the first i new lines using the general scrolling method. |
154 | 73 This involves using insert or delete somewhere if i != j. |
74 For each matrix elements, three kinds of costs are recorded: | |
75 the smallest cost that ends with an insert, the smallest | |
76 cost that ends with a delete, and the smallest cost that | |
77 ends with neither one. These are kept separate because | |
78 on some terminals the cost of doing an insert varies | |
79 depending on whether one was just done, etc. */ | |
80 | |
81 /* draw_cost[VPOS] is the cost of outputting new line at VPOS. | |
82 old_hash[VPOS] is the hash code of the old line at VPOS. | |
83 new_hash[VPOS] is the hash code of the new line at VPOS. | |
766 | 84 Note that these are not true frame vpos's, but relative |
154 | 85 to the place at which the first mismatch between old and |
86 new contents appears. */ | |
87 | |
88 static void | |
766 | 89 calculate_scrolling (frame, matrix, window_size, lines_below, |
154 | 90 draw_cost, old_hash, new_hash, |
91 free_at_end) | |
766 | 92 FRAME_PTR frame; |
154 | 93 /* matrix is of size window_size + 1 on each side. */ |
94 struct matrix_elt *matrix; | |
95 int window_size; | |
96 int *draw_cost; | |
97 int *old_hash; | |
98 int *new_hash; | |
99 int free_at_end; | |
100 { | |
101 register int i, j; | |
766 | 102 int frame_height = FRAME_HEIGHT (frame); |
154 | 103 register struct matrix_elt *p, *p1; |
104 register int cost, cost1; | |
105 | |
106 int lines_moved = window_size + (scroll_region_ok ? 0 : lines_below); | |
107 /* first_insert_cost[I] is the cost of doing the first insert-line | |
25004 | 108 at the i'th line of the lines we are considering, |
154 | 109 where I is origin 1 (as it is below). */ |
110 int *first_insert_cost | |
766 | 111 = &FRAME_INSERT_COST (frame)[frame_height - 1 - lines_moved]; |
154 | 112 int *first_delete_cost |
766 | 113 = &FRAME_DELETE_COST (frame)[frame_height - 1 - lines_moved]; |
154 | 114 int *next_insert_cost |
766 | 115 = &FRAME_INSERTN_COST (frame)[frame_height - 1 - lines_moved]; |
154 | 116 int *next_delete_cost |
766 | 117 = &FRAME_DELETEN_COST (frame)[frame_height - 1 - lines_moved]; |
154 | 118 |
119 /* Discourage long scrolls on fast lines. | |
766 | 120 Don't scroll nearly a full frame height unless it saves |
154 | 121 at least 1/4 second. */ |
766 | 122 int extra_cost = baud_rate / (10 * 4 * FRAME_HEIGHT (frame)); |
154 | 123 |
3356
09759a9653c5
(calculate_scrolling): Defend against negative baud_rate.
Richard M. Stallman <rms@gnu.org>
parents:
2961
diff
changeset
|
124 if (baud_rate <= 0) |
09759a9653c5
(calculate_scrolling): Defend against negative baud_rate.
Richard M. Stallman <rms@gnu.org>
parents:
2961
diff
changeset
|
125 extra_cost = 1; |
09759a9653c5
(calculate_scrolling): Defend against negative baud_rate.
Richard M. Stallman <rms@gnu.org>
parents:
2961
diff
changeset
|
126 |
154 | 127 /* initialize the top left corner of the matrix */ |
128 matrix->writecost = 0; | |
129 matrix->insertcost = INFINITY; | |
130 matrix->deletecost = INFINITY; | |
131 matrix->insertcount = 0; | |
132 matrix->deletecount = 0; | |
133 | |
134 /* initialize the left edge of the matrix */ | |
135 cost = first_insert_cost[1] - next_insert_cost[1]; | |
136 for (i = 1; i <= window_size; i++) | |
137 { | |
138 p = matrix + i * (window_size + 1); | |
139 cost += draw_cost[i] + next_insert_cost[i] + extra_cost; | |
140 p->insertcost = cost; | |
141 p->writecost = INFINITY; | |
142 p->deletecost = INFINITY; | |
143 p->insertcount = i; | |
144 p->deletecount = 0; | |
145 } | |
146 | |
147 /* initialize the top edge of the matrix */ | |
148 cost = first_delete_cost[1] - next_delete_cost[1]; | |
149 for (j = 1; j <= window_size; j++) | |
150 { | |
151 cost += next_delete_cost[j]; | |
152 matrix[j].deletecost = cost; | |
153 matrix[j].writecost = INFINITY; | |
154 matrix[j].insertcost = INFINITY; | |
155 matrix[j].deletecount = j; | |
156 matrix[j].insertcount = 0; | |
157 } | |
158 | |
766 | 159 /* `i' represents the vpos among new frame contents. |
160 `j' represents the vpos among the old frame contents. */ | |
154 | 161 p = matrix + window_size + 2; /* matrix [1, 1] */ |
162 for (i = 1; i <= window_size; i++, p++) | |
163 for (j = 1; j <= window_size; j++, p++) | |
164 { | |
165 /* p contains the address of matrix [i, j] */ | |
166 | |
167 /* First calculate the cost assuming we do | |
168 not insert or delete above this line. | |
169 That is, if we update through line i-1 | |
170 based on old lines through j-1, | |
171 and then just change old line j to new line i. */ | |
172 p1 = p - window_size - 2; /* matrix [i-1, j-1] */ | |
173 cost = p1->writecost; | |
174 if (cost > p1->insertcost) | |
175 cost = p1->insertcost; | |
176 if (cost > p1->deletecost) | |
177 cost = p1->deletecost; | |
178 if (old_hash[j] != new_hash[i]) | |
179 cost += draw_cost[i]; | |
180 p->writecost = cost; | |
181 | |
182 /* Calculate the cost if we do an insert-line | |
183 before outputting this line. | |
184 That is, we update through line i-1 | |
185 based on old lines through j, | |
186 do an insert-line on line i, | |
187 and then output line i from scratch, | |
188 leaving old lines starting from j for reuse below. */ | |
189 p1 = p - window_size - 1; /* matrix [i-1, j] */ | |
190 /* No need to think about doing a delete followed | |
191 immediately by an insert. It cannot be as good | |
192 as not doing either of them. */ | |
193 if (free_at_end == i) | |
194 { | |
195 cost = p1->writecost; | |
196 cost1 = p1->insertcost; | |
197 } | |
198 else | |
199 { | |
200 cost = p1->writecost + first_insert_cost[i]; | |
6888
a39caeb88721
(calculate_scrolling): Add explicit casts, to avoid compiler warnings.
Karl Heuer <kwzh@gnu.org>
parents:
6773
diff
changeset
|
201 if ((int) p1->insertcount > i) |
154 | 202 abort (); |
203 cost1 = p1->insertcost + next_insert_cost[i - p1->insertcount]; | |
204 } | |
205 p->insertcost = min (cost, cost1) + draw_cost[i] + extra_cost; | |
206 p->insertcount = (cost < cost1) ? 1 : p1->insertcount + 1; | |
6888
a39caeb88721
(calculate_scrolling): Add explicit casts, to avoid compiler warnings.
Karl Heuer <kwzh@gnu.org>
parents:
6773
diff
changeset
|
207 if ((int) p->insertcount > i) |
154 | 208 abort (); |
209 | |
210 /* Calculate the cost if we do a delete line after | |
211 outputting this line. | |
212 That is, we update through line i | |
213 based on old lines through j-1, | |
214 and throw away old line j. */ | |
215 p1 = p - 1; /* matrix [i, j-1] */ | |
216 /* No need to think about doing an insert followed | |
217 immediately by a delete. */ | |
218 if (free_at_end == i) | |
219 { | |
220 cost = p1->writecost; | |
221 cost1 = p1->deletecost; | |
222 } | |
223 else | |
224 { | |
225 cost = p1->writecost + first_delete_cost[i]; | |
226 cost1 = p1->deletecost + next_delete_cost[i]; | |
227 } | |
228 p->deletecost = min (cost, cost1); | |
229 p->deletecount = (cost < cost1) ? 1 : p1->deletecount + 1; | |
230 } | |
231 } | |
25004 | 232 |
233 | |
154 | 234 |
25004 | 235 /* Perform insert-lines and delete-lines operations on CURRENT_MATRIX |
236 according to the costs in MATRIX, using the general scrolling | |
237 method that is used if the terminal does not support the setting of | |
238 scroll windows (scroll_region_ok == 0). | |
6647
e6611521fb67
(do_scrolling): Handle charstarts like glyphs.
Richard M. Stallman <rms@gnu.org>
parents:
4696
diff
changeset
|
239 |
e6611521fb67
(do_scrolling): Handle charstarts like glyphs.
Richard M. Stallman <rms@gnu.org>
parents:
4696
diff
changeset
|
240 WINDOW_SIZE is the number of lines being considered for scrolling |
25004 | 241 and UNCHANGED_AT_TOP is the vpos of the first line being |
242 considered. These two arguments can specify any contiguous range | |
243 of lines. */ | |
6647
e6611521fb67
(do_scrolling): Handle charstarts like glyphs.
Richard M. Stallman <rms@gnu.org>
parents:
4696
diff
changeset
|
244 |
154 | 245 static void |
25004 | 246 do_scrolling (current_matrix, matrix, window_size, unchanged_at_top) |
247 struct glyph_matrix *current_matrix; | |
154 | 248 struct matrix_elt *matrix; |
249 int window_size; | |
250 int unchanged_at_top; | |
251 { | |
25004 | 252 struct matrix_elt *p; |
253 int i, j, k; | |
254 | |
255 /* Set to 1 if we have set a terminal window with | |
256 set_terminal_window. */ | |
257 int terminal_window_p = 0; | |
154 | 258 |
25004 | 259 /* A queue for line insertions to be done. */ |
260 struct queue { int count, pos; }; | |
261 struct queue *queue_start | |
262 = (struct queue *) alloca (current_matrix->nrows * sizeof (struct queue)); | |
263 struct queue *queue = queue_start; | |
264 | |
265 char *retained_p = (char *) alloca (window_size * sizeof (char)); | |
266 int *copy_from = (int *) alloca (window_size * sizeof (int)); | |
154 | 267 |
25004 | 268 /* Zero means line is empty. */ |
269 bzero (retained_p, window_size * sizeof (char)); | |
270 for (k = 0; k < window_size; ++k) | |
271 copy_from[k] = -1; | |
154 | 272 |
28407
f15029804aba
* scroll.c (CHECK_BOUNDS): Renamed from CHECK.
Ken Raeburn <raeburn@raeburn.org>
parents:
25004
diff
changeset
|
273 #define CHECK_BOUNDS \ |
25004 | 274 do \ |
275 { \ | |
276 int k; \ | |
277 for (k = 0; k < window_size; ++k) \ | |
278 xassert (copy_from[k] == -1 \ | |
279 || (copy_from[k] >= 0 && copy_from[k] < window_size)); \ | |
280 } \ | |
281 while (0); | |
154 | 282 |
25004 | 283 /* When j is advanced, this corresponds to deleted lines. |
284 When i is advanced, this corresponds to inserted lines. */ | |
154 | 285 i = j = window_size; |
286 while (i > 0 || j > 0) | |
287 { | |
288 p = matrix + i * (window_size + 1) + j; | |
25004 | 289 |
290 if (p->insertcost < p->writecost && p->insertcost < p->deletecost) | |
154 | 291 { |
25004 | 292 /* Insert should be done at vpos i-1, plus maybe some before. |
293 Queue the screen operation to be performed. */ | |
294 queue->count = p->insertcount; | |
295 queue->pos = i + unchanged_at_top - p->insertcount; | |
296 ++queue; | |
297 | |
298 /* By incrementing I, we leave room in the result rows | |
299 for the empty rows opened up. */ | |
154 | 300 i -= p->insertcount; |
301 } | |
302 else if (p->deletecost < p->writecost) | |
303 { | |
25004 | 304 /* Old line at vpos j-1, and maybe some before it, should be |
305 deleted. By decrementing J, we skip some lines in the | |
306 temp_rows which is equivalent to omitting these lines in | |
307 the result rows, thus deleting them. */ | |
154 | 308 j -= p->deletecount; |
25004 | 309 |
310 /* Set the terminal window, if not done already. */ | |
311 if (! terminal_window_p) | |
154 | 312 { |
313 set_terminal_window (window_size + unchanged_at_top); | |
25004 | 314 terminal_window_p = 1; |
154 | 315 } |
25004 | 316 |
317 /* Delete lines on the terminal. */ | |
154 | 318 ins_del_lines (j + unchanged_at_top, - p->deletecount); |
319 } | |
320 else | |
321 { | |
25004 | 322 /* Best thing done here is no insert or delete, i.e. a write. */ |
323 --i, --j; | |
324 xassert (i >= 0 && i < window_size); | |
325 xassert (j >= 0 && j < window_size); | |
326 copy_from[i] = j; | |
327 retained_p[j] = 1; | |
154 | 328 |
25004 | 329 #if GLYPH_DEBUG |
28407
f15029804aba
* scroll.c (CHECK_BOUNDS): Renamed from CHECK.
Ken Raeburn <raeburn@raeburn.org>
parents:
25004
diff
changeset
|
330 CHECK_BOUNDS; |
25004 | 331 #endif |
154 | 332 } |
333 } | |
334 | |
25004 | 335 /* Now do all insertions queued above. */ |
336 if (queue > queue_start) | |
154 | 337 { |
25004 | 338 int next = -1; |
339 | |
340 /* Set the terminal window if not yet done. */ | |
341 if (!terminal_window_p) | |
342 { | |
343 set_terminal_window (window_size + unchanged_at_top); | |
344 terminal_window_p = 1; | |
345 } | |
346 | |
347 do | |
348 { | |
349 --queue; | |
350 | |
351 /* Do the deletion on the terminal. */ | |
352 ins_del_lines (queue->pos, queue->count); | |
353 | |
354 /* All lines in the range deleted become empty in the glyph | |
355 matrix. Assign to them glyph rows that are not retained. | |
356 K is the starting position of the deleted range relative | |
357 to the window we are working in. */ | |
358 k = queue->pos - unchanged_at_top; | |
359 for (j = 0; j < queue->count; ++j) | |
360 { | |
361 /* Find the next row not retained. */ | |
362 while (retained_p[++next]) | |
363 ; | |
364 | |
365 /* Record that this row is to be used for the empty | |
366 glyph row j. */ | |
367 copy_from[k + j] = next; | |
368 } | |
369 } | |
370 while (queue > queue_start); | |
371 | |
154 | 372 } |
373 | |
25004 | 374 for (k = 0; k < window_size; ++k) |
375 xassert (copy_from[k] >= 0 && copy_from[k] < window_size); | |
154 | 376 |
25004 | 377 /* Perform the row swizzling. */ |
378 mirrored_line_dance (current_matrix, unchanged_at_top, window_size, | |
379 copy_from, retained_p); | |
154 | 380 |
25004 | 381 /* Some sanity checks if GLYPH_DEBUG != 0. */ |
382 CHECK_MATRIX (current_matrix); | |
383 | |
384 if (terminal_window_p) | |
154 | 385 set_terminal_window (0); |
386 } | |
25004 | 387 |
154 | 388 |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
389 /* Determine, in matrix[i,j], the cost of updating the first j |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
390 old lines into the first i new lines using the direct |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
391 scrolling method. When the old line and the new line have |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
392 different hash codes, the calculated cost of updating old |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
393 line j into new line i includes the cost of outputting new |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
394 line i, and if i != j, the cost of outputting the old line j |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
395 is also included, as a penalty for moving the line and then |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
396 erasing it. In addition, the cost of updating a sequence of |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
397 lines with constant i - j includes the cost of scrolling the |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
398 old lines into their new positions, unless i == j. Scrolling |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
399 is achieved by setting the screen window to avoid affecting |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
400 other lines below, and inserting or deleting lines at the top |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
401 of the scrolled region. The cost of scrolling a sequence of |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
402 lines includes the fixed cost of specifying a scroll region, |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
403 plus a variable cost which can depend upon the number of lines |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
404 involved and the distance by which they are scrolled, and an |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
405 extra cost to discourage long scrolls. |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
406 |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
407 As reflected in the matrix, an insert or delete does not |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
408 correspond directly to the insertion or deletion which is |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
409 used in scrolling lines. An insert means that the value of i |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
410 has increased without a corresponding increase in the value |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
411 of j. A delete means that the value of j has increased |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
412 without a corresponding increase in the value of i. A write |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
413 means that i and j are both increased by the same amount, and |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
414 that the old lines will be moved to their new positions. |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
415 |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
416 An insert following a delete is allowed only if i > j. |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
417 A delete following an insert is allowed only if i < j. |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
418 These restrictions ensure that the new lines in an insert |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
419 will always be blank as an effect of the neighboring writes. |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
420 Thus the calculated cost of an insert is simply the cost of |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
421 outputting the new line contents. The direct cost of a |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
422 delete is zero. Inserts and deletes indirectly affect the |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
423 total cost through their influence on subsequent writes. */ |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
424 |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
425 /* The vectors draw_cost, old_hash, and new_hash have the same |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
426 meanings here as in calculate_scrolling, and old_draw_cost |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
427 is the equivalent of draw_cost for the old line contents */ |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
428 |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
429 static void |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
430 calculate_direct_scrolling (frame, matrix, window_size, lines_below, |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
431 draw_cost, old_draw_cost, old_hash, new_hash, |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
432 free_at_end) |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
433 FRAME_PTR frame; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
434 /* matrix is of size window_size + 1 on each side. */ |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
435 struct matrix_elt *matrix; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
436 int window_size; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
437 int *draw_cost; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
438 int *old_draw_cost; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
439 int *old_hash; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
440 int *new_hash; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
441 int free_at_end; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
442 { |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
443 register int i, j; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
444 int frame_height = FRAME_HEIGHT (frame); |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
445 register struct matrix_elt *p, *p1; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
446 register int cost, cost1, delta; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
447 |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
448 /* first_insert_cost[-I] is the cost of doing the first insert-line |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
449 at a position I lines above the bottom line in the scroll window. */ |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
450 int *first_insert_cost |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
451 = &FRAME_INSERT_COST (frame)[frame_height - 1]; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
452 int *first_delete_cost |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
453 = &FRAME_DELETE_COST (frame)[frame_height - 1]; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
454 int *next_insert_cost |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
455 = &FRAME_INSERTN_COST (frame)[frame_height - 1]; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
456 int *next_delete_cost |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
457 = &FRAME_DELETEN_COST (frame)[frame_height - 1]; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
458 |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
459 int scroll_overhead; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
460 |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
461 /* Discourage long scrolls on fast lines. |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
462 Don't scroll nearly a full frame height unless it saves |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
463 at least 1/4 second. */ |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
464 int extra_cost = baud_rate / (10 * 4 * FRAME_HEIGHT (frame)); |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
465 |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
466 if (baud_rate <= 0) |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
467 extra_cost = 1; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
468 |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
469 /* Overhead of setting the scroll window, plus the extra cost |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
470 cost of scrolling by a distance of one. The extra cost is |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
471 added once for consistency with the cost vectors */ |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
472 scroll_overhead = scroll_region_cost + extra_cost; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
473 |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
474 /* initialize the top left corner of the matrix */ |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
475 matrix->writecost = 0; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
476 matrix->insertcost = INFINITY; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
477 matrix->deletecost = INFINITY; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
478 matrix->writecount = 0; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
479 matrix->insertcount = 0; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
480 matrix->deletecount = 0; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
481 |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
482 /* initialize the left edge of the matrix */ |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
483 cost = 0; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
484 for (i = 1; i <= window_size; i++) |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
485 { |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
486 p = matrix + i * (window_size + 1); |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
487 cost += draw_cost[i]; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
488 p->insertcost = cost; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
489 p->writecost = INFINITY; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
490 p->deletecost = INFINITY; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
491 p->insertcount = i; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
492 p->writecount = 0; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
493 p->deletecount = 0; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
494 } |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
495 |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
496 /* initialize the top edge of the matrix */ |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
497 for (j = 1; j <= window_size; j++) |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
498 { |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
499 matrix[j].deletecost = 0; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
500 matrix[j].writecost = INFINITY; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
501 matrix[j].insertcost = INFINITY; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
502 matrix[j].deletecount = j; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
503 matrix[j].writecount = 0; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
504 matrix[j].insertcount = 0; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
505 } |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
506 |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
507 /* `i' represents the vpos among new frame contents. |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
508 `j' represents the vpos among the old frame contents. */ |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
509 p = matrix + window_size + 2; /* matrix [1, 1] */ |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
510 |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
511 for (i = 1; i <= window_size; i++, p++) |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
512 for (j = 1; j <= window_size; j++, p++) |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
513 { |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
514 /* p contains the address of matrix [i, j] */ |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
515 |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
516 /* First calculate the cost assuming we do |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
517 not insert or delete above this line. |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
518 That is, if we update through line i-1 |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
519 based on old lines through j-1, |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
520 and then just change old line j to new line i. |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
521 |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
522 Depending on which choice gives the lower cost, |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
523 this usually involves either scrolling a single line |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
524 or extending a sequence of scrolled lines, but |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
525 when i == j, no scrolling is required. */ |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
526 p1 = p - window_size - 2; /* matrix [i-1, j-1] */ |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
527 cost = p1->insertcost; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
528 if (cost > p1->deletecost) |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
529 cost = p1->deletecost; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
530 cost1 = p1->writecost; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
531 if (i == j) |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
532 { |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
533 if (cost > cost1) |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
534 { |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
535 cost = cost1; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
536 p->writecount = p1->writecount + 1; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
537 } |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
538 else |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
539 p->writecount = 1; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
540 if (old_hash[j] != new_hash[i]) |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
541 { |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
542 cost += draw_cost[i]; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
543 } |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
544 } |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
545 else |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
546 { |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
547 if (i > j) |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
548 { |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
549 delta = i - j; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
550 |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
551 /* The cost added here for scrolling the first line by |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
552 a distance N includes the overhead of setting the |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
553 scroll window, the cost of inserting N lines at a |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
554 position N lines above the bottom line of the window, |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
555 and an extra cost which is proportional to N. */ |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
556 cost += scroll_overhead + first_insert_cost[-delta] + |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
557 (delta-1) * (next_insert_cost[-delta] + extra_cost); |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
558 |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
559 /* In the most general case, the insertion overhead and |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
560 the multiply factor can grow linearly as the distance |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
561 from the bottom of the window increases. The incremental |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
562 cost of scrolling an additional line depends upon the |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
563 rate of change of these two parameters. Each of these |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
564 growth rates can be determined by a simple difference. |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
565 To reduce the cumulative effects of rounding error, we |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
566 vary the position at which the difference is computed. */ |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
567 cost1 += first_insert_cost[-j] - first_insert_cost[1-j] + |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
568 (delta-1) * (next_insert_cost[-j] - next_insert_cost[1-j]); |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
569 } |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
570 else |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
571 { |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
572 delta = j - i; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
573 cost += scroll_overhead + first_delete_cost[-delta] + |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
574 (delta-1) * (next_delete_cost[-delta] + extra_cost); |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
575 cost1 += first_delete_cost[-i] - first_delete_cost[1-i] + |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
576 (delta-1) * ( next_delete_cost[-i] - next_delete_cost[1-i]); |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
577 } |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
578 if (cost1 < cost) |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
579 { |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
580 cost = cost1; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
581 p->writecount = p1->writecount + 1; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
582 } |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
583 else |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
584 p->writecount = 1; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
585 if (old_hash[j] != new_hash[i]) |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
586 { |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
587 cost += draw_cost[i] + old_draw_cost[j]; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
588 } |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
589 } |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
590 p->writecost = cost; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
591 |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
592 /* Calculate the cost if we do an insert-line |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
593 before outputting this line. |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
594 That is, we update through line i-1 |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
595 based on old lines through j, |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
596 do an insert-line on line i, |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
597 and then output line i from scratch, |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
598 leaving old lines starting from j for reuse below. */ |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
599 p1 = p - window_size - 1; /* matrix [i-1, j] */ |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
600 cost = p1->writecost; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
601 /* If i > j, an insert is allowed after a delete. */ |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
602 if (i > j && p1->deletecost < cost) |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
603 cost = p1->deletecost; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
604 if (p1->insertcost <= cost) |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
605 { |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
606 cost = p1->insertcost; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
607 p->insertcount = p1->insertcount + 1; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
608 } |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
609 else |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
610 p->insertcount = 1; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
611 cost += draw_cost[i]; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
612 p->insertcost = cost; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
613 |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
614 /* Calculate the cost if we do a delete line after |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
615 outputting this line. |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
616 That is, we update through line i |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
617 based on old lines through j-1, |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
618 and throw away old line j. */ |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
619 p1 = p - 1; /* matrix [i, j-1] */ |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
620 cost = p1->writecost; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
621 /* If i < j, a delete is allowed after an insert. */ |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
622 if (i < j && p1->insertcost < cost) |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
623 cost = p1->insertcost; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
624 cost1 = p1->deletecost; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
625 if (p1->deletecost <= cost) |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
626 { |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
627 cost = p1->deletecost; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
628 p->deletecount = p1->deletecount + 1; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
629 } |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
630 else |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
631 p->deletecount = 1; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
632 p->deletecost = cost; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
633 } |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
634 } |
25004 | 635 |
636 | |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
637 |
25004 | 638 /* Perform insert-lines and delete-lines operations on CURRENT_MATRIX |
639 according to the costs in MATRIX, using the direct scrolling method | |
640 which is used when the terminal supports setting a scroll window | |
641 (scroll_region_ok). | |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
642 |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
643 WINDOW_SIZE is the number of lines being considered for scrolling |
25004 | 644 and UNCHANGED_AT_TOP is the vpos of the first line being |
645 considered. These two arguments can specify any contiguous range | |
646 of lines. | |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
647 |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
648 In the direct scrolling method, a new scroll window is selected |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
649 before each insertion or deletion, so that groups of lines can be |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
650 scrolled directly to their final vertical positions. This method |
25004 | 651 is described in more detail in calculate_direct_scrolling, where |
652 the cost matrix for this approach is constructed. */ | |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
653 |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
654 static void |
25004 | 655 do_direct_scrolling (current_matrix, cost_matrix, window_size, |
656 unchanged_at_top) | |
657 struct glyph_matrix *current_matrix; | |
658 struct matrix_elt *cost_matrix; | |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
659 int window_size; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
660 int unchanged_at_top; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
661 { |
25004 | 662 struct matrix_elt *p; |
663 int i, j; | |
664 | |
665 /* A queue of deletions and insertions to be performed. */ | |
666 struct alt_queue { int count, pos, window; }; | |
667 struct alt_queue *queue_start = (struct alt_queue *) | |
668 alloca (window_size * sizeof *queue_start); | |
669 struct alt_queue *queue = queue_start; | |
670 | |
671 /* Set to 1 if a terminal window has been set with | |
672 set_terminal_window: */ | |
673 int terminal_window_p = 0; | |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
674 |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
675 /* A nonzero value of write_follows indicates that a write has been |
25004 | 676 selected, allowing either an insert or a delete to be selected |
677 next. When write_follows is zero, a delete cannot be selected | |
678 unless j < i, and an insert cannot be selected unless i < j. | |
679 This corresponds to a similar restriction (with the ordering | |
680 reversed) in calculate_direct_scrolling, which is intended to | |
681 ensure that lines marked as inserted will be blank. */ | |
682 int write_follows_p = 1; | |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
683 |
25004 | 684 /* For each row in the new matrix what row of the old matrix it is. */ |
685 int *copy_from = (int *) alloca (window_size * sizeof (int)); | |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
686 |
25004 | 687 /* Non-zero for each row in the new matrix that is retained from the |
688 old matrix. Lines not retained are empty. */ | |
689 char *retained_p = (char *) alloca (window_size * sizeof (char)); | |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
690 |
25004 | 691 bzero (retained_p, window_size * sizeof (char)); |
692 | |
693 /* Perform some sanity checks when GLYPH_DEBUG is on. */ | |
694 CHECK_MATRIX (current_matrix); | |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
695 |
25004 | 696 /* We are working on the line range UNCHANGED_AT_TOP ... |
697 UNCHANGED_AT_TOP + WINDOW_SIZE (not including) in CURRENT_MATRIX. | |
698 We step through lines in this range from the end to the start. I | |
699 is an index into new lines, j an index into old lines. The cost | |
700 matrix determines what to do for ranges of indices. | |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
701 |
25004 | 702 If i is decremented without also decrementing j, this corresponds |
703 to inserting empty lines in the result. If j is decremented | |
704 without also decrementing i, this corresponds to omitting these | |
705 lines in the new rows, i.e. rows are deleted. */ | |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
706 i = j = window_size; |
25004 | 707 |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
708 while (i > 0 || j > 0) |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
709 { |
25004 | 710 p = cost_matrix + i * (window_size + 1) + j; |
711 | |
712 if (p->insertcost < p->writecost | |
713 && p->insertcost < p->deletecost | |
714 && (write_follows_p || i < j)) | |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
715 { |
25004 | 716 /* Insert is cheaper than deleting or writing lines. Leave |
717 a hole in the result display that will be filled with | |
718 empty lines when the queue is emptied. */ | |
719 queue->count = 0; | |
720 queue->window = i; | |
721 queue->pos = i - p->insertcount; | |
722 ++queue; | |
723 | |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
724 i -= p->insertcount; |
25004 | 725 write_follows_p = 0; |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
726 } |
25004 | 727 else if (p->deletecost < p->writecost |
728 && (write_follows_p || i > j)) | |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
729 { |
25004 | 730 /* Deleting lines is cheaper. By decrementing J, omit |
731 deletecount lines from the original. */ | |
732 write_follows_p = 0; | |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
733 j -= p->deletecount; |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
734 } |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
735 else |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
736 { |
25004 | 737 /* One or more lines should be written. In the direct |
738 scrolling method we do this by scrolling the lines to the | |
739 place they belong. */ | |
740 int n_to_write = p->writecount; | |
741 write_follows_p = 1; | |
742 xassert (n_to_write > 0); | |
743 | |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
744 if (i > j) |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
745 { |
25004 | 746 /* Immediately insert lines */ |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
747 set_terminal_window (i + unchanged_at_top); |
25004 | 748 terminal_window_p = 1; |
749 ins_del_lines (j - n_to_write + unchanged_at_top, i - j); | |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
750 } |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
751 else if (i < j) |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
752 { |
25004 | 753 /* Queue the deletion of a group of lines */ |
754 queue->pos = i - n_to_write + unchanged_at_top; | |
755 queue->window = j + unchanged_at_top; | |
756 queue->count = i - j; | |
757 ++queue; | |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
758 } |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
759 |
25004 | 760 while (n_to_write > 0) |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
761 { |
25004 | 762 --i, --j, --n_to_write; |
763 copy_from[i] = j; | |
764 retained_p[j] = 1; | |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
765 } |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
766 } |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
767 } |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
768 |
25004 | 769 /* Do queued operations. */ |
770 if (queue > queue_start) | |
771 { | |
772 int next = -1; | |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
773 |
25004 | 774 do |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
775 { |
25004 | 776 --queue; |
777 if (queue->count) | |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
778 { |
25004 | 779 set_terminal_window (queue->window); |
780 terminal_window_p = 1; | |
781 ins_del_lines (queue->pos, queue->count); | |
782 } | |
783 else | |
784 { | |
785 for (j = queue->window - 1; j >= queue->pos; --j) | |
786 { | |
787 while (retained_p[++next]) | |
788 ; | |
789 copy_from[j] = next; | |
790 } | |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
791 } |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
792 } |
25004 | 793 while (queue > queue_start); |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
794 } |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
795 |
25004 | 796 /* Now, for each row I in the range of rows we are working on, |
797 copy_from[i] gives the original line to copy to I, and | |
798 retained_p[copy_from[i]] is zero if line I in the new display is | |
799 empty. */ | |
800 mirrored_line_dance (current_matrix, unchanged_at_top, window_size, | |
801 copy_from, retained_p); | |
802 | |
803 if (terminal_window_p) | |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
804 set_terminal_window (0); |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
805 } |
25004 | 806 |
807 | |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
808 |
154 | 809 void |
766 | 810 scrolling_1 (frame, window_size, unchanged_at_top, unchanged_at_bottom, |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
811 draw_cost, old_draw_cost, old_hash, new_hash, free_at_end) |
766 | 812 FRAME_PTR frame; |
154 | 813 int window_size, unchanged_at_top, unchanged_at_bottom; |
814 int *draw_cost; | |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
815 int *old_draw_cost; |
154 | 816 int *old_hash; |
817 int *new_hash; | |
818 int free_at_end; | |
819 { | |
820 struct matrix_elt *matrix; | |
821 matrix = ((struct matrix_elt *) | |
822 alloca ((window_size + 1) * (window_size + 1) * sizeof *matrix)); | |
823 | |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
824 if (scroll_region_ok) |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
825 { |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
826 calculate_direct_scrolling (frame, matrix, window_size, |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
827 unchanged_at_bottom, |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
828 draw_cost, old_draw_cost, |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
829 old_hash, new_hash, free_at_end); |
25004 | 830 do_direct_scrolling (frame->current_matrix, |
831 matrix, window_size, unchanged_at_top); | |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
832 } |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
833 else |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
834 { |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
835 calculate_scrolling (frame, matrix, window_size, unchanged_at_bottom, |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
836 draw_cost, old_hash, new_hash, |
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
837 free_at_end); |
25004 | 838 do_scrolling (frame->current_matrix, matrix, window_size, |
839 unchanged_at_top); | |
10262
4face60ac721
(scrolling_1): When scroll_region_ok is set, use a
Richard M. Stallman <rms@gnu.org>
parents:
10109
diff
changeset
|
840 } |
154 | 841 } |
25004 | 842 |
843 | |
154 | 844 |
25004 | 845 /* Return number of lines in common between current and desired frame |
846 contents described to us only as vectors of hash codes OLDHASH and | |
847 NEWHASH. Consider only vpos range START to END (not including | |
848 END). Ignore short lines on the assumption that avoiding redrawing | |
849 such a line will have little weight. */ | |
154 | 850 |
851 int | |
852 scrolling_max_lines_saved (start, end, oldhash, newhash, cost) | |
853 int start, end; | |
854 int *oldhash, *newhash, *cost; | |
855 { | |
856 struct { int hash; int count; } lines[01000]; | |
857 register int i, h; | |
858 register int matchcount = 0; | |
859 int avg_length = 0; | |
860 int threshold; | |
861 | |
862 /* Compute a threshold which is 1/4 of average length of these lines. */ | |
863 | |
864 for (i = start; i < end; i++) | |
865 avg_length += cost[i]; | |
866 | |
867 avg_length /= end - start; | |
868 threshold = avg_length / 4; | |
869 | |
870 bzero (lines, sizeof lines); | |
871 | |
25004 | 872 /* Put new lines' hash codes in hash table. Ignore lines shorter |
873 than the threshold. Thus, if the lines that are in common are | |
874 mainly the ones that are short, they won't count. */ | |
154 | 875 for (i = start; i < end; i++) |
876 { | |
877 if (cost[i] > threshold) | |
878 { | |
879 h = newhash[i] & 0777; | |
880 lines[h].hash = newhash[i]; | |
881 lines[h].count++; | |
882 } | |
883 } | |
884 | |
25004 | 885 /* Look up old line hash codes in the hash table. Count number of |
886 matches between old lines and new. */ | |
154 | 887 for (i = start; i < end; i++) |
888 { | |
889 h = oldhash[i] & 0777; | |
890 if (oldhash[i] == lines[h].hash) | |
891 { | |
892 matchcount++; | |
893 if (--lines[h].count == 0) | |
894 lines[h].hash = 0; | |
895 } | |
896 } | |
897 | |
898 return matchcount; | |
899 } | |
900 | |
25004 | 901 /* Return a measure of the cost of moving the lines starting with vpos |
902 FROM, up to but not including vpos TO, down by AMOUNT lines (AMOUNT | |
903 may be negative). These are the same arguments that might be given | |
904 to scroll_frame_lines to perform this scrolling. */ | |
154 | 905 |
21514 | 906 int |
766 | 907 scroll_cost (frame, from, to, amount) |
908 FRAME_PTR frame; | |
154 | 909 int from, to, amount; |
910 { | |
766 | 911 /* Compute how many lines, at bottom of frame, |
154 | 912 will not be involved in actual motion. */ |
913 int limit = to; | |
914 int offset; | |
766 | 915 int height = FRAME_HEIGHT (frame); |
154 | 916 |
421 | 917 if (amount == 0) |
918 return 0; | |
919 | |
154 | 920 if (! scroll_region_ok) |
921 limit = height; | |
421 | 922 else if (amount > 0) |
923 limit += amount; | |
154 | 924 |
925 if (amount < 0) | |
926 { | |
927 int temp = to; | |
928 to = from + amount; | |
929 from = temp + amount; | |
930 amount = - amount; | |
931 } | |
932 | |
933 offset = height - limit; | |
934 | |
935 return | |
766 | 936 (FRAME_INSERT_COST (frame)[offset + from] |
937 + (amount - 1) * FRAME_INSERTN_COST (frame)[offset + from] | |
10109
869e177ca872
(scroll_cost): FRAME_DELETE_COST and FRAME_DELETEN_COSTS were confused. Fixed.
Richard M. Stallman <rms@gnu.org>
parents:
9576
diff
changeset
|
938 + FRAME_DELETE_COST (frame)[offset + to] |
869e177ca872
(scroll_cost): FRAME_DELETE_COST and FRAME_DELETEN_COSTS were confused. Fixed.
Richard M. Stallman <rms@gnu.org>
parents:
9576
diff
changeset
|
939 + (amount - 1) * FRAME_DELETEN_COST (frame)[offset + to]); |
154 | 940 } |
941 | |
942 /* Calculate the line insertion/deletion | |
943 overhead and multiply factor values */ | |
944 | |
945 static void | |
766 | 946 line_ins_del (frame, ov1, pf1, ovn, pfn, ov, mf) |
947 FRAME_PTR frame; | |
154 | 948 int ov1, ovn; |
949 int pf1, pfn; | |
950 register int *ov, *mf; | |
951 { | |
952 register int i; | |
766 | 953 register int frame_height = FRAME_HEIGHT (frame); |
154 | 954 register int insert_overhead = ov1 * 10; |
955 register int next_insert_cost = ovn * 10; | |
956 | |
766 | 957 for (i = frame_height-1; i >= 0; i--) |
154 | 958 { |
529 | 959 mf[i] = next_insert_cost / 10; |
154 | 960 next_insert_cost += pfn; |
529 | 961 ov[i] = (insert_overhead + next_insert_cost) / 10; |
154 | 962 insert_overhead += pf1; |
963 } | |
964 } | |
965 | |
966 static void | |
766 | 967 ins_del_costs (frame, |
154 | 968 one_line_string, multi_string, |
969 setup_string, cleanup_string, | |
970 costvec, ncostvec, coefficient) | |
766 | 971 FRAME_PTR frame; |
154 | 972 char *one_line_string, *multi_string; |
973 char *setup_string, *cleanup_string; | |
974 int *costvec, *ncostvec; | |
975 int coefficient; | |
976 { | |
977 if (multi_string) | |
766 | 978 line_ins_del (frame, |
154 | 979 string_cost (multi_string) * coefficient, |
980 per_line_cost (multi_string) * coefficient, | |
981 0, 0, costvec, ncostvec); | |
982 else if (one_line_string) | |
766 | 983 line_ins_del (frame, |
154 | 984 string_cost (setup_string) + string_cost (cleanup_string), 0, |
985 string_cost (one_line_string), | |
986 per_line_cost (one_line_string), | |
987 costvec, ncostvec); | |
988 else | |
766 | 989 line_ins_del (frame, |
154 | 990 9999, 0, 9999, 0, |
991 costvec, ncostvec); | |
992 } | |
993 | |
994 /* Calculate the insert and delete line costs. | |
995 Note that this is done even when running with a window system | |
996 because we want to know how long scrolling takes (and avoid it). | |
766 | 997 This must be redone whenever the frame height changes. |
154 | 998 |
999 We keep the ID costs in a precomputed array based on the position | |
1000 at which the I or D is performed. Also, there are two kinds of ID | |
1001 costs: the "once-only" and the "repeated". This is to handle both | |
1002 those terminals that are able to insert N lines at a time (once- | |
1003 only) and those that must repeatedly insert one line. | |
1004 | |
1005 The cost to insert N lines at line L is | |
766 | 1006 [tt.t_ILov + (frame_height + 1 - L) * tt.t_ILpf] + |
1007 N * [tt.t_ILnov + (frame_height + 1 - L) * tt.t_ILnpf] | |
154 | 1008 |
1009 ILov represents the basic insert line overhead. ILpf is the padding | |
1010 required to allow the terminal time to move a line: insertion at line | |
766 | 1011 L changes (frame_height + 1 - L) lines. |
154 | 1012 |
1013 The first bracketed expression above is the overhead; the second is | |
1014 the multiply factor. Both are dependent only on the position at | |
1015 which the insert is performed. We store the overhead in | |
766 | 1016 FRAME_INSERT_COST (frame) and the multiply factor in |
1017 FRAME_INSERTN_COST (frame). Note however that any insertion | |
154 | 1018 must include at least one multiply factor. Rather than compute this |
766 | 1019 as FRAME_INSERT_COST (frame)[line]+FRAME_INSERTN_COST (frame)[line], |
1020 we add FRAME_INSERTN_COST (frame) into FRAME_INSERT_COST (frame). | |
154 | 1021 This is reasonable because of the particular algorithm used in calcM. |
1022 | |
1023 Deletion is essentially the same as insertion. | |
1024 */ | |
1025 | |
21514 | 1026 void |
766 | 1027 do_line_insertion_deletion_costs (frame, |
154 | 1028 ins_line_string, multi_ins_string, |
1029 del_line_string, multi_del_string, | |
1030 setup_string, cleanup_string, coefficient) | |
766 | 1031 FRAME_PTR frame; |
154 | 1032 char *ins_line_string, *multi_ins_string; |
1033 char *del_line_string, *multi_del_string; | |
1034 char *setup_string, *cleanup_string; | |
1035 int coefficient; | |
1036 { | |
766 | 1037 if (FRAME_INSERT_COST (frame) != 0) |
154 | 1038 { |
766 | 1039 FRAME_INSERT_COST (frame) = |
1040 (int *) xrealloc (FRAME_INSERT_COST (frame), | |
1041 FRAME_HEIGHT (frame) * sizeof (int)); | |
1042 FRAME_DELETEN_COST (frame) = | |
1043 (int *) xrealloc (FRAME_DELETEN_COST (frame), | |
1044 FRAME_HEIGHT (frame) * sizeof (int)); | |
1045 FRAME_INSERTN_COST (frame) = | |
1046 (int *) xrealloc (FRAME_INSERTN_COST (frame), | |
1047 FRAME_HEIGHT (frame) * sizeof (int)); | |
1048 FRAME_DELETE_COST (frame) = | |
1049 (int *) xrealloc (FRAME_DELETE_COST (frame), | |
1050 FRAME_HEIGHT (frame) * sizeof (int)); | |
154 | 1051 } |
1052 else | |
1053 { | |
766 | 1054 FRAME_INSERT_COST (frame) = |
1055 (int *) xmalloc (FRAME_HEIGHT (frame) * sizeof (int)); | |
1056 FRAME_DELETEN_COST (frame) = | |
1057 (int *) xmalloc (FRAME_HEIGHT (frame) * sizeof (int)); | |
1058 FRAME_INSERTN_COST (frame) = | |
1059 (int *) xmalloc (FRAME_HEIGHT (frame) * sizeof (int)); | |
1060 FRAME_DELETE_COST (frame) = | |
1061 (int *) xmalloc (FRAME_HEIGHT (frame) * sizeof (int)); | |
154 | 1062 } |
1063 | |
766 | 1064 ins_del_costs (frame, |
154 | 1065 ins_line_string, multi_ins_string, |
1066 setup_string, cleanup_string, | |
766 | 1067 FRAME_INSERT_COST (frame), FRAME_INSERTN_COST (frame), |
154 | 1068 coefficient); |
766 | 1069 ins_del_costs (frame, |
154 | 1070 del_line_string, multi_del_string, |
1071 setup_string, cleanup_string, | |
9576
14cd96eda0e3
(do_line_insertion_deletion_costs): Fix argument order.
Karl Heuer <kwzh@gnu.org>
parents:
7307
diff
changeset
|
1072 FRAME_DELETE_COST (frame), FRAME_DELETEN_COST (frame), |
154 | 1073 coefficient); |
1074 } |