]> code.delx.au - gnu-emacs/blob - src/indent.c
(Fvertical_motion): Call move_it_by_lines even if LINES = 0.
[gnu-emacs] / src / indent.c
1 /* Indentation functions.
2 Copyright (C) 1985,86,87,88,93,94,95,98,2000,01,02,03,2004
3 Free Software Foundation, Inc.
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
9 the Free Software Foundation; either version 2, or (at your option)
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
19 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
21
22 #include <config.h>
23 #include "lisp.h"
24 #include "buffer.h"
25 #include "charset.h"
26 #include "category.h"
27 #include "indent.h"
28 #include "keyboard.h"
29 #include "frame.h"
30 #include "window.h"
31 #include "termchar.h"
32 #include "termopts.h"
33 #include "disptab.h"
34 #include "intervals.h"
35 #include "region-cache.h"
36
37 /* Indentation can insert tabs if this is non-zero;
38 otherwise always uses spaces. */
39
40 int indent_tabs_mode;
41
42 #define CR 015
43
44 /* These three values memorize the current column to avoid recalculation. */
45
46 /* Last value returned by current_column.
47 Some things in set last_known_column_point to -1
48 to mark the memorized value as invalid. */
49
50 double last_known_column;
51
52 /* Value of point when current_column was called. */
53
54 int last_known_column_point;
55
56 /* Value of MODIFF when current_column was called. */
57
58 int last_known_column_modified;
59
60 static double current_column_1 P_ ((void));
61 static double position_indentation P_ ((int));
62
63 /* Cache of beginning of line found by the last call of
64 current_column. */
65
66 int current_column_bol_cache;
67
68 /* Get the display table to use for the current buffer. */
69
70 struct Lisp_Char_Table *
71 buffer_display_table ()
72 {
73 Lisp_Object thisbuf;
74
75 thisbuf = current_buffer->display_table;
76 if (DISP_TABLE_P (thisbuf))
77 return XCHAR_TABLE (thisbuf);
78 if (DISP_TABLE_P (Vstandard_display_table))
79 return XCHAR_TABLE (Vstandard_display_table);
80 return 0;
81 }
82 \f
83 /* Width run cache considerations. */
84
85 /* Return the width of character C under display table DP. */
86
87 static int
88 character_width (c, dp)
89 int c;
90 struct Lisp_Char_Table *dp;
91 {
92 Lisp_Object elt;
93
94 /* These width computations were determined by examining the cases
95 in display_text_line. */
96
97 /* Everything can be handled by the display table, if it's
98 present and the element is right. */
99 if (dp && (elt = DISP_CHAR_VECTOR (dp, c), VECTORP (elt)))
100 return XVECTOR (elt)->size;
101
102 /* Some characters are special. */
103 if (c == '\n' || c == '\t' || c == '\015')
104 return 0;
105
106 /* Printing characters have width 1. */
107 else if (c >= 040 && c < 0177)
108 return 1;
109
110 /* Everybody else (control characters, metacharacters) has other
111 widths. We could return their actual widths here, but they
112 depend on things like ctl_arrow and crud like that, and they're
113 not very common at all. So we'll just claim we don't know their
114 widths. */
115 else
116 return 0;
117 }
118
119 /* Return true iff the display table DISPTAB specifies the same widths
120 for characters as WIDTHTAB. We use this to decide when to
121 invalidate the buffer's width_run_cache. */
122
123 int
124 disptab_matches_widthtab (disptab, widthtab)
125 struct Lisp_Char_Table *disptab;
126 struct Lisp_Vector *widthtab;
127 {
128 int i;
129
130 if (widthtab->size != 256)
131 abort ();
132
133 for (i = 0; i < 256; i++)
134 if (character_width (i, disptab)
135 != XFASTINT (widthtab->contents[i]))
136 return 0;
137
138 return 1;
139 }
140
141 /* Recompute BUF's width table, using the display table DISPTAB. */
142
143 void
144 recompute_width_table (buf, disptab)
145 struct buffer *buf;
146 struct Lisp_Char_Table *disptab;
147 {
148 int i;
149 struct Lisp_Vector *widthtab;
150
151 if (!VECTORP (buf->width_table))
152 buf->width_table = Fmake_vector (make_number (256), make_number (0));
153 widthtab = XVECTOR (buf->width_table);
154 if (widthtab->size != 256)
155 abort ();
156
157 for (i = 0; i < 256; i++)
158 XSETFASTINT (widthtab->contents[i], character_width (i, disptab));
159 }
160
161 /* Allocate or free the width run cache, as requested by the current
162 state of current_buffer's cache_long_line_scans variable. */
163
164 static void
165 width_run_cache_on_off ()
166 {
167 if (NILP (current_buffer->cache_long_line_scans)
168 /* And, for the moment, this feature doesn't work on multibyte
169 characters. */
170 || !NILP (current_buffer->enable_multibyte_characters))
171 {
172 /* It should be off. */
173 if (current_buffer->width_run_cache)
174 {
175 free_region_cache (current_buffer->width_run_cache);
176 current_buffer->width_run_cache = 0;
177 current_buffer->width_table = Qnil;
178 }
179 }
180 else
181 {
182 /* It should be on. */
183 if (current_buffer->width_run_cache == 0)
184 {
185 current_buffer->width_run_cache = new_region_cache ();
186 recompute_width_table (current_buffer, buffer_display_table ());
187 }
188 }
189 }
190
191 \f
192 /* Skip some invisible characters starting from POS.
193 This includes characters invisible because of text properties
194 and characters invisible because of overlays.
195
196 If position POS is followed by invisible characters,
197 skip some of them and return the position after them.
198 Otherwise return POS itself.
199
200 Set *NEXT_BOUNDARY_P to the next position at which
201 it will be necessary to call this function again.
202
203 Don't scan past TO, and don't set *NEXT_BOUNDARY_P
204 to a value greater than TO.
205
206 If WINDOW is non-nil, and this buffer is displayed in WINDOW,
207 take account of overlays that apply only in WINDOW.
208
209 We don't necessarily skip all the invisible characters after POS
210 because that could take a long time. We skip a reasonable number
211 which can be skipped quickly. If there might be more invisible
212 characters immediately following, then *NEXT_BOUNDARY_P
213 will equal the return value. */
214
215 int
216 skip_invisible (pos, next_boundary_p, to, window)
217 int pos;
218 int *next_boundary_p;
219 int to;
220 Lisp_Object window;
221 {
222 Lisp_Object prop, position, overlay_limit, proplimit;
223 Lisp_Object buffer, tmp;
224 int end, inv_p;
225
226 XSETFASTINT (position, pos);
227 XSETBUFFER (buffer, current_buffer);
228
229 /* Give faster response for overlay lookup near POS. */
230 recenter_overlay_lists (current_buffer, pos);
231
232 /* We must not advance farther than the next overlay change.
233 The overlay change might change the invisible property;
234 or there might be overlay strings to be displayed there. */
235 overlay_limit = Fnext_overlay_change (position);
236 /* As for text properties, this gives a lower bound
237 for where the invisible text property could change. */
238 proplimit = Fnext_property_change (position, buffer, Qt);
239 if (XFASTINT (overlay_limit) < XFASTINT (proplimit))
240 proplimit = overlay_limit;
241 /* PROPLIMIT is now a lower bound for the next change
242 in invisible status. If that is plenty far away,
243 use that lower bound. */
244 if (XFASTINT (proplimit) > pos + 100 || XFASTINT (proplimit) >= to)
245 *next_boundary_p = XFASTINT (proplimit);
246 /* Otherwise, scan for the next `invisible' property change. */
247 else
248 {
249 /* Don't scan terribly far. */
250 XSETFASTINT (proplimit, min (pos + 100, to));
251 /* No matter what. don't go past next overlay change. */
252 if (XFASTINT (overlay_limit) < XFASTINT (proplimit))
253 proplimit = overlay_limit;
254 tmp = Fnext_single_property_change (position, Qinvisible,
255 buffer, proplimit);
256 end = XFASTINT (tmp);
257 #if 0
258 /* Don't put the boundary in the middle of multibyte form if
259 there is no actual property change. */
260 if (end == pos + 100
261 && !NILP (current_buffer->enable_multibyte_characters)
262 && end < ZV)
263 while (pos < end && !CHAR_HEAD_P (POS_ADDR (end)))
264 end--;
265 #endif
266 *next_boundary_p = end;
267 }
268 /* if the `invisible' property is set, we can skip to
269 the next property change */
270 prop = Fget_char_property (position, Qinvisible,
271 (!NILP (window)
272 && EQ (XWINDOW (window)->buffer, buffer))
273 ? window : buffer);
274 inv_p = TEXT_PROP_MEANS_INVISIBLE (prop);
275 /* When counting columns (window == nil), don't skip over ellipsis text. */
276 if (NILP (window) ? inv_p == 1 : inv_p)
277 return *next_boundary_p;
278 return pos;
279 }
280 \f
281 /* If a composition starts at POS/POS_BYTE and it doesn't stride over
282 POINT, set *LEN / *LEN_BYTE to the character and byte lengths, *WIDTH
283 to the width, and return 1. Otherwise, return 0. */
284
285 static int
286 check_composition (pos, pos_byte, point, len, len_byte, width)
287 int pos, pos_byte, point;
288 int *len, *len_byte, *width;
289 {
290 Lisp_Object prop;
291 int start, end;
292 int id;
293
294 if (! find_composition (pos, -1, &start, &end, &prop, Qnil)
295 || pos != start || point < end
296 || !COMPOSITION_VALID_P (start, end, prop))
297 return 0;
298 if ((id = get_composition_id (pos, pos_byte, end - pos, prop, Qnil)) < 0)
299 return 0;
300
301 *len = COMPOSITION_LENGTH (prop);
302 *len_byte = CHAR_TO_BYTE (end) - pos_byte;
303 *width = composition_table[id]->width;
304 return 1;
305 }
306 \f
307 /* Set variables WIDTH and BYTES for a multibyte sequence starting at P.
308
309 DP is a display table or NULL.
310
311 This macro is used in current_column_1, Fmove_to_column, and
312 compute_motion. */
313
314 #define MULTIBYTE_BYTES_WIDTH(p, dp) \
315 do { \
316 int c; \
317 \
318 wide_column = 0; \
319 c = STRING_CHAR_AND_LENGTH (p, MAX_MULTIBYTE_LENGTH, bytes); \
320 if (BYTES_BY_CHAR_HEAD (*p) != bytes) \
321 width = bytes * 4; \
322 else \
323 { \
324 if (dp != 0 && VECTORP (DISP_CHAR_VECTOR (dp, c))) \
325 width = XVECTOR (DISP_CHAR_VECTOR (dp, c))->size; \
326 else \
327 width = WIDTH_BY_CHAR_HEAD (*p); \
328 if (width > 1) \
329 wide_column = width; \
330 } \
331 } while (0)
332
333
334 DEFUN ("current-column", Fcurrent_column, Scurrent_column, 0, 0, 0,
335 doc: /* Return the horizontal position of point. Beginning of line is column 0.
336 This is calculated by adding together the widths of all the displayed
337 representations of the character between the start of the previous line
338 and point. (eg control characters will have a width of 2 or 4, tabs
339 will have a variable width)
340 Ignores finite width of frame, which means that this function may return
341 values greater than (frame-width).
342 Whether the line is visible (if `selective-display' is t) has no effect;
343 however, ^M is treated as end of line when `selective-display' is t. */)
344 ()
345 {
346 Lisp_Object temp;
347 XSETFASTINT (temp, (int) current_column ()); /* iftc */
348 return temp;
349 }
350
351 /* Cancel any recorded value of the horizontal position. */
352
353 void
354 invalidate_current_column ()
355 {
356 last_known_column_point = 0;
357 }
358
359 double
360 current_column ()
361 {
362 register int col;
363 register unsigned char *ptr, *stop;
364 register int tab_seen;
365 int post_tab;
366 register int c;
367 register int tab_width = XINT (current_buffer->tab_width);
368 int ctl_arrow = !NILP (current_buffer->ctl_arrow);
369 register struct Lisp_Char_Table *dp = buffer_display_table ();
370
371 if (PT == last_known_column_point
372 && MODIFF == last_known_column_modified)
373 return last_known_column;
374
375 /* If the buffer has overlays, text properties,
376 or multibyte characters, use a more general algorithm. */
377 if (BUF_INTERVALS (current_buffer)
378 || current_buffer->overlays_before
379 || current_buffer->overlays_after
380 || Z != Z_BYTE)
381 return current_column_1 ();
382
383 /* Scan backwards from point to the previous newline,
384 counting width. Tab characters are the only complicated case. */
385
386 /* Make a pointer for decrementing through the chars before point. */
387 ptr = BYTE_POS_ADDR (PT_BYTE - 1) + 1;
388 /* Make a pointer to where consecutive chars leave off,
389 going backwards from point. */
390 if (PT == BEGV)
391 stop = ptr;
392 else if (PT <= GPT || BEGV > GPT)
393 stop = BEGV_ADDR;
394 else
395 stop = GAP_END_ADDR;
396
397 if (tab_width <= 0 || tab_width > 1000)
398 tab_width = 8;
399
400 col = 0, tab_seen = 0, post_tab = 0;
401
402 while (1)
403 {
404 EMACS_INT i, n;
405 Lisp_Object charvec;
406
407 if (ptr == stop)
408 {
409 /* We stopped either for the beginning of the buffer
410 or for the gap. */
411 if (ptr == BEGV_ADDR)
412 break;
413
414 /* It was the gap. Jump back over it. */
415 stop = BEGV_ADDR;
416 ptr = GPT_ADDR;
417
418 /* Check whether that brings us to beginning of buffer. */
419 if (BEGV >= GPT)
420 break;
421 }
422
423 c = *--ptr;
424
425 if (dp && VECTORP (DISP_CHAR_VECTOR (dp, c)))
426 {
427 charvec = DISP_CHAR_VECTOR (dp, c);
428 n = ASIZE (charvec);
429 }
430 else
431 {
432 charvec = Qnil;
433 n = 1;
434 }
435
436 for (i = n - 1; i >= 0; --i)
437 {
438 if (VECTORP (charvec))
439 {
440 /* This should be handled the same as
441 next_element_from_display_vector does it. */
442 Lisp_Object entry = AREF (charvec, i);
443
444 if (INTEGERP (entry)
445 && GLYPH_CHAR_VALID_P (XFASTINT (entry)))
446 c = FAST_GLYPH_CHAR (XFASTINT (entry));
447 else
448 c = ' ';
449 }
450
451 if (c >= 040 && c < 0177)
452 col++;
453 else if (c == '\n'
454 || (c == '\r'
455 && EQ (current_buffer->selective_display, Qt)))
456 {
457 ptr++;
458 goto start_of_line_found;
459 }
460 else if (c == '\t')
461 {
462 if (tab_seen)
463 col = ((col + tab_width) / tab_width) * tab_width;
464
465 post_tab += col;
466 col = 0;
467 tab_seen = 1;
468 }
469 else if (VECTORP (charvec))
470 /* With a display table entry, C is displayed as is, and
471 not displayed as \NNN or as ^N. If C is a single-byte
472 character, it takes one column. If C is multi-byte in
473 an unibyte buffer, it's translated to unibyte, so it
474 also takes one column. */
475 ++col;
476 else
477 col += (ctl_arrow && c < 0200) ? 2 : 4;
478 }
479 }
480
481 start_of_line_found:
482
483 if (tab_seen)
484 {
485 col = ((col + tab_width) / tab_width) * tab_width;
486 col += post_tab;
487 }
488
489 if (ptr == BEGV_ADDR)
490 current_column_bol_cache = BEGV;
491 else
492 current_column_bol_cache = BYTE_TO_CHAR (PTR_BYTE_POS (ptr));
493
494 last_known_column = col;
495 last_known_column_point = PT;
496 last_known_column_modified = MODIFF;
497
498 return col;
499 }
500 \f
501 /* Return the column number of position POS
502 by scanning forward from the beginning of the line.
503 This function handles characters that are invisible
504 due to text properties or overlays. */
505
506 static double
507 current_column_1 ()
508 {
509 register int tab_width = XINT (current_buffer->tab_width);
510 register int ctl_arrow = !NILP (current_buffer->ctl_arrow);
511 register struct Lisp_Char_Table *dp = buffer_display_table ();
512 int multibyte = !NILP (current_buffer->enable_multibyte_characters);
513
514 /* Start the scan at the beginning of this line with column number 0. */
515 register int col = 0;
516 int scan, scan_byte;
517 int next_boundary;
518 int opoint = PT, opoint_byte = PT_BYTE;
519
520 scan_newline (PT, PT_BYTE, BEGV, BEGV_BYTE, -1, 1);
521 current_column_bol_cache = PT;
522 scan = PT, scan_byte = PT_BYTE;
523 SET_PT_BOTH (opoint, opoint_byte);
524 next_boundary = scan;
525
526 if (tab_width <= 0 || tab_width > 1000) tab_width = 8;
527
528 /* Scan forward to the target position. */
529 while (scan < opoint)
530 {
531 int c;
532
533 /* Occasionally we may need to skip invisible text. */
534 while (scan == next_boundary)
535 {
536 int old_scan = scan;
537 /* This updates NEXT_BOUNDARY to the next place
538 where we might need to skip more invisible text. */
539 scan = skip_invisible (scan, &next_boundary, opoint, Qnil);
540 if (scan >= opoint)
541 goto endloop;
542 if (scan != old_scan)
543 scan_byte = CHAR_TO_BYTE (scan);
544 }
545
546 /* Check composition sequence. */
547 {
548 int len, len_byte, width;
549
550 if (check_composition (scan, scan_byte, opoint,
551 &len, &len_byte, &width))
552 {
553 scan += len;
554 scan_byte += len_byte;
555 if (scan <= opoint)
556 col += width;
557 continue;
558 }
559 }
560
561 c = FETCH_BYTE (scan_byte);
562
563 if (dp != 0
564 && ! (multibyte && BASE_LEADING_CODE_P (c))
565 && VECTORP (DISP_CHAR_VECTOR (dp, c)))
566 {
567 Lisp_Object charvec;
568 EMACS_INT i, n;
569
570 /* This character is displayed using a vector of glyphs.
571 Update the column based on those glyphs. */
572
573 charvec = DISP_CHAR_VECTOR (dp, c);
574 n = ASIZE (charvec);
575
576 for (i = 0; i < n; i++)
577 {
578 /* This should be handled the same as
579 next_element_from_display_vector does it. */
580 Lisp_Object entry;
581 entry = AREF (charvec, i);
582
583 if (INTEGERP (entry)
584 && GLYPH_CHAR_VALID_P (XFASTINT (entry)))
585 c = FAST_GLYPH_CHAR (XFASTINT (entry));
586 else
587 c = ' ';
588
589 if (c == '\n')
590 goto endloop;
591 if (c == '\r' && EQ (current_buffer->selective_display, Qt))
592 goto endloop;
593 if (c == '\t')
594 {
595 col += tab_width;
596 col = col / tab_width * tab_width;
597 }
598 else
599 ++col;
600 }
601 }
602 else
603 {
604 /* The display table says nothing for this character.
605 Display it as itself. */
606
607 if (c == '\n')
608 goto endloop;
609 if (c == '\r' && EQ (current_buffer->selective_display, Qt))
610 goto endloop;
611 if (c == '\t')
612 {
613 col += tab_width;
614 col = col / tab_width * tab_width;
615 }
616 else if (multibyte && BASE_LEADING_CODE_P (c))
617 {
618 unsigned char *ptr;
619 int bytes, width, wide_column;
620
621 ptr = BYTE_POS_ADDR (scan_byte);
622 MULTIBYTE_BYTES_WIDTH (ptr, dp);
623 scan_byte += bytes;
624 /* Subtract one to compensate for the increment
625 that is going to happen below. */
626 scan_byte--;
627 col += width;
628 }
629 else if (ctl_arrow && (c < 040 || c == 0177))
630 col += 2;
631 else if (c < 040 || c >= 0177)
632 col += 4;
633 else
634 col++;
635 }
636 scan++;
637 scan_byte++;
638
639 }
640 endloop:
641
642 last_known_column = col;
643 last_known_column_point = PT;
644 last_known_column_modified = MODIFF;
645
646 return col;
647 }
648 \f
649
650 #if 0 /* Not used. */
651
652 /* Return the width in columns of the part of STRING from BEG to END.
653 If BEG is nil, that stands for the beginning of STRING.
654 If END is nil, that stands for the end of STRING. */
655
656 static double
657 string_display_width (string, beg, end)
658 Lisp_Object string, beg, end;
659 {
660 register int col;
661 register unsigned char *ptr, *stop;
662 register int tab_seen;
663 int post_tab;
664 register int c;
665 register int tab_width = XINT (current_buffer->tab_width);
666 int ctl_arrow = !NILP (current_buffer->ctl_arrow);
667 register struct Lisp_Char_Table *dp = buffer_display_table ();
668 int b, e;
669
670 if (NILP (end))
671 e = SCHARS (string);
672 else
673 {
674 CHECK_NUMBER (end);
675 e = XINT (end);
676 }
677
678 if (NILP (beg))
679 b = 0;
680 else
681 {
682 CHECK_NUMBER (beg);
683 b = XINT (beg);
684 }
685
686 /* Make a pointer for decrementing through the chars before point. */
687 ptr = SDATA (string) + e;
688 /* Make a pointer to where consecutive chars leave off,
689 going backwards from point. */
690 stop = SDATA (string) + b;
691
692 if (tab_width <= 0 || tab_width > 1000) tab_width = 8;
693
694 col = 0, tab_seen = 0, post_tab = 0;
695
696 while (1)
697 {
698 if (ptr == stop)
699 break;
700
701 c = *--ptr;
702 if (dp != 0 && VECTORP (DISP_CHAR_VECTOR (dp, c)))
703 col += XVECTOR (DISP_CHAR_VECTOR (dp, c))->size;
704 else if (c >= 040 && c < 0177)
705 col++;
706 else if (c == '\n')
707 break;
708 else if (c == '\t')
709 {
710 if (tab_seen)
711 col = ((col + tab_width) / tab_width) * tab_width;
712
713 post_tab += col;
714 col = 0;
715 tab_seen = 1;
716 }
717 else
718 col += (ctl_arrow && c < 0200) ? 2 : 4;
719 }
720
721 if (tab_seen)
722 {
723 col = ((col + tab_width) / tab_width) * tab_width;
724 col += post_tab;
725 }
726
727 return col;
728 }
729
730 #endif /* 0 */
731
732 \f
733 DEFUN ("indent-to", Findent_to, Sindent_to, 1, 2, "NIndent to column: ",
734 doc: /* Indent from point with tabs and spaces until COLUMN is reached.
735 Optional second argument MININUM says always do at least MININUM spaces
736 even if that goes past COLUMN; by default, MININUM is zero. */)
737 (column, minimum)
738 Lisp_Object column, minimum;
739 {
740 int mincol;
741 register int fromcol;
742 register int tab_width = XINT (current_buffer->tab_width);
743
744 CHECK_NUMBER (column);
745 if (NILP (minimum))
746 XSETFASTINT (minimum, 0);
747 CHECK_NUMBER (minimum);
748
749 fromcol = current_column ();
750 mincol = fromcol + XINT (minimum);
751 if (mincol < XINT (column)) mincol = XINT (column);
752
753 if (fromcol == mincol)
754 return make_number (mincol);
755
756 if (tab_width <= 0 || tab_width > 1000) tab_width = 8;
757
758 if (indent_tabs_mode)
759 {
760 Lisp_Object n;
761 XSETFASTINT (n, mincol / tab_width - fromcol / tab_width);
762 if (XFASTINT (n) != 0)
763 {
764 Finsert_char (make_number ('\t'), n, Qt);
765
766 fromcol = (mincol / tab_width) * tab_width;
767 }
768 }
769
770 XSETFASTINT (column, mincol - fromcol);
771 Finsert_char (make_number (' '), column, Qt);
772
773 last_known_column = mincol;
774 last_known_column_point = PT;
775 last_known_column_modified = MODIFF;
776
777 XSETINT (column, mincol);
778 return column;
779 }
780
781 \f
782 static double position_indentation P_ ((int));
783
784 DEFUN ("current-indentation", Fcurrent_indentation, Scurrent_indentation,
785 0, 0, 0,
786 doc: /* Return the indentation of the current line.
787 This is the horizontal position of the character
788 following any initial whitespace. */)
789 ()
790 {
791 Lisp_Object val;
792 int opoint = PT, opoint_byte = PT_BYTE;
793
794 scan_newline (PT, PT_BYTE, BEGV, BEGV_BYTE, -1, 1);
795
796 XSETFASTINT (val, (int) position_indentation (PT_BYTE)); /* iftc */
797 SET_PT_BOTH (opoint, opoint_byte);
798 return val;
799 }
800
801 static double
802 position_indentation (pos_byte)
803 register int pos_byte;
804 {
805 register int column = 0;
806 register int tab_width = XINT (current_buffer->tab_width);
807 register unsigned char *p;
808 register unsigned char *stop;
809 unsigned char *start;
810 int next_boundary_byte = pos_byte;
811 int ceiling = next_boundary_byte;
812
813 if (tab_width <= 0 || tab_width > 1000) tab_width = 8;
814
815 p = BYTE_POS_ADDR (pos_byte);
816 /* STOP records the value of P at which we will need
817 to think about the gap, or about invisible text,
818 or about the end of the buffer. */
819 stop = p;
820 /* START records the starting value of P. */
821 start = p;
822 while (1)
823 {
824 while (p == stop)
825 {
826 int stop_pos_byte;
827
828 /* If we have updated P, set POS_BYTE to match.
829 The first time we enter the loop, POS_BYTE is already right. */
830 if (p != start)
831 pos_byte = PTR_BYTE_POS (p);
832 /* Consider the various reasons STOP might have been set here. */
833 if (pos_byte == ZV_BYTE)
834 return column;
835 if (pos_byte == next_boundary_byte)
836 {
837 int next_boundary;
838 int pos = BYTE_TO_CHAR (pos_byte);
839 pos = skip_invisible (pos, &next_boundary, ZV, Qnil);
840 pos_byte = CHAR_TO_BYTE (pos);
841 next_boundary_byte = CHAR_TO_BYTE (next_boundary);
842 }
843 if (pos_byte >= ceiling)
844 ceiling = BUFFER_CEILING_OF (pos_byte) + 1;
845 /* Compute the next place we need to stop and think,
846 and set STOP accordingly. */
847 stop_pos_byte = min (ceiling, next_boundary_byte);
848 /* The -1 and +1 arrange to point at the first byte of gap
849 (if STOP_POS_BYTE is the position of the gap)
850 rather than at the data after the gap. */
851
852 stop = BYTE_POS_ADDR (stop_pos_byte - 1) + 1;
853 p = BYTE_POS_ADDR (pos_byte);
854 }
855 switch (*p++)
856 {
857 case 0240:
858 if (! NILP (current_buffer->enable_multibyte_characters))
859 return column;
860 case ' ':
861 column++;
862 break;
863 case '\t':
864 column += tab_width - column % tab_width;
865 break;
866 default:
867 if (ASCII_BYTE_P (p[-1])
868 || NILP (current_buffer->enable_multibyte_characters))
869 return column;
870 {
871 int c;
872 pos_byte = PTR_BYTE_POS (p - 1);
873 c = FETCH_MULTIBYTE_CHAR (pos_byte);
874 if (CHAR_HAS_CATEGORY (c, ' '))
875 {
876 column++;
877 INC_POS (pos_byte);
878 p = BYTE_POS_ADDR (pos_byte);
879 }
880 else
881 return column;
882 }
883 }
884 }
885 }
886
887 /* Test whether the line beginning at POS is indented beyond COLUMN.
888 Blank lines are treated as if they had the same indentation as the
889 preceding line. */
890
891 int
892 indented_beyond_p (pos, pos_byte, column)
893 int pos, pos_byte;
894 double column;
895 {
896 double val;
897 int opoint = PT, opoint_byte = PT_BYTE;
898
899 SET_PT_BOTH (pos, pos_byte);
900 while (PT > BEGV && FETCH_BYTE (PT_BYTE) == '\n')
901 scan_newline (PT - 1, PT_BYTE - 1, BEGV, BEGV_BYTE, -1, 0);
902
903 val = position_indentation (PT_BYTE);
904 SET_PT_BOTH (opoint, opoint_byte);
905 return val >= column; /* hmm, float comparison */
906 }
907 \f
908 DEFUN ("move-to-column", Fmove_to_column, Smove_to_column, 1, 2, "p",
909 doc: /* Move point to column COLUMN in the current line.
910 The column of a character is calculated by adding together the widths
911 as displayed of the previous characters in the line.
912 This function ignores line-continuation;
913 there is no upper limit on the column number a character can have
914 and horizontal scrolling has no effect.
915
916 If specified column is within a character, point goes after that character.
917 If it's past end of line, point goes to end of line.
918
919 A non-nil second (optional) argument FORCE means,
920 if COLUMN is in the middle of a tab character, change it to spaces.
921 In addition, if FORCE is t, and the line is too short
922 to reach column COLUMN, add spaces/tabs to get there.
923
924 The return value is the current column. */)
925 (column, force)
926 Lisp_Object column, force;
927 {
928 register int pos;
929 register int col = current_column ();
930 register int goal;
931 register int end;
932 register int tab_width = XINT (current_buffer->tab_width);
933 register int ctl_arrow = !NILP (current_buffer->ctl_arrow);
934 register struct Lisp_Char_Table *dp = buffer_display_table ();
935 register int multibyte = !NILP (current_buffer->enable_multibyte_characters);
936
937 Lisp_Object val;
938 int prev_col = 0;
939 int c = 0;
940 int next_boundary, pos_byte;
941
942 if (tab_width <= 0 || tab_width > 1000) tab_width = 8;
943 CHECK_NATNUM (column);
944 goal = XINT (column);
945
946 pos = PT;
947 pos_byte = PT_BYTE;
948 end = ZV;
949 next_boundary = pos;
950
951 /* If we're starting past the desired column,
952 back up to beginning of line and scan from there. */
953 if (col > goal)
954 {
955 end = pos;
956 pos = current_column_bol_cache;
957 pos_byte = CHAR_TO_BYTE (pos);
958 col = 0;
959 }
960
961 while (pos < end)
962 {
963 while (pos == next_boundary)
964 {
965 int prev = pos;
966 pos = skip_invisible (pos, &next_boundary, end, Qnil);
967 if (pos != prev)
968 pos_byte = CHAR_TO_BYTE (pos);
969 if (pos >= end)
970 goto endloop;
971 }
972
973 /* Test reaching the goal column. We do this after skipping
974 invisible characters, so that we put point before the
975 character on which the cursor will appear. */
976 if (col >= goal)
977 break;
978
979 /* Check composition sequence. */
980 {
981 int len, len_byte, width;
982
983 if (check_composition (pos, pos_byte, Z, &len, &len_byte, &width))
984 {
985 pos += len;
986 pos_byte += len_byte;
987 col += width;
988 continue;
989 }
990 }
991
992 c = FETCH_BYTE (pos_byte);
993
994 /* See if there is a display table and it relates
995 to this character. */
996
997 if (dp != 0
998 && ! (multibyte && BASE_LEADING_CODE_P (c))
999 && VECTORP (DISP_CHAR_VECTOR (dp, c)))
1000 {
1001 Lisp_Object charvec;
1002 EMACS_INT i, n;
1003
1004 /* This character is displayed using a vector of glyphs.
1005 Update the position based on those glyphs. */
1006
1007 charvec = DISP_CHAR_VECTOR (dp, c);
1008 n = ASIZE (charvec);
1009
1010 for (i = 0; i < n; i++)
1011 {
1012 /* This should be handled the same as
1013 next_element_from_display_vector does it. */
1014
1015 Lisp_Object entry;
1016 entry = AREF (charvec, i);
1017
1018 if (INTEGERP (entry)
1019 && GLYPH_CHAR_VALID_P (XFASTINT (entry)))
1020 c = FAST_GLYPH_CHAR (XFASTINT (entry));
1021 else
1022 c = ' ';
1023
1024 if (c == '\n')
1025 goto endloop;
1026 if (c == '\r' && EQ (current_buffer->selective_display, Qt))
1027 goto endloop;
1028 if (c == '\t')
1029 {
1030 prev_col = col;
1031 col += tab_width;
1032 col = col / tab_width * tab_width;
1033 }
1034 else
1035 ++col;
1036 }
1037 }
1038 else
1039 {
1040 /* The display table doesn't affect this character;
1041 it displays as itself. */
1042
1043 if (c == '\n')
1044 goto endloop;
1045 if (c == '\r' && EQ (current_buffer->selective_display, Qt))
1046 goto endloop;
1047 if (c == '\t')
1048 {
1049 prev_col = col;
1050 col += tab_width;
1051 col = col / tab_width * tab_width;
1052 }
1053 else if (ctl_arrow && (c < 040 || c == 0177))
1054 col += 2;
1055 else if (c < 040 || c == 0177)
1056 col += 4;
1057 else if (c < 0177)
1058 col++;
1059 else if (multibyte && BASE_LEADING_CODE_P (c))
1060 {
1061 /* Start of multi-byte form. */
1062 unsigned char *ptr;
1063 int bytes, width, wide_column;
1064
1065 ptr = BYTE_POS_ADDR (pos_byte);
1066 MULTIBYTE_BYTES_WIDTH (ptr, dp);
1067 pos_byte += bytes - 1;
1068 col += width;
1069 }
1070 else
1071 col += 4;
1072 }
1073
1074 pos++;
1075 pos_byte++;
1076 }
1077 endloop:
1078
1079 SET_PT_BOTH (pos, pos_byte);
1080
1081 /* If a tab char made us overshoot, change it to spaces
1082 and scan through it again. */
1083 if (!NILP (force) && col > goal && c == '\t' && prev_col < goal)
1084 {
1085 int goal_pt, goal_pt_byte;
1086
1087 /* Insert spaces in front of the tab to reach GOAL. Do this
1088 first so that a marker at the end of the tab gets
1089 adjusted. */
1090 SET_PT_BOTH (PT - 1, PT_BYTE - 1);
1091 Finsert_char (make_number (' '), make_number (goal - prev_col), Qt);
1092
1093 /* Now delete the tab, and indent to COL. */
1094 del_range (PT, PT + 1);
1095 goal_pt = PT;
1096 goal_pt_byte = PT_BYTE;
1097 Findent_to (make_number (col), Qnil);
1098 SET_PT_BOTH (goal_pt, goal_pt_byte);
1099
1100 /* Set the last_known... vars consistently. */
1101 col = goal;
1102 }
1103
1104 /* If line ends prematurely, add space to the end. */
1105 if (col < goal && EQ (force, Qt))
1106 Findent_to (make_number (col = goal), Qnil);
1107
1108 last_known_column = col;
1109 last_known_column_point = PT;
1110 last_known_column_modified = MODIFF;
1111
1112 XSETFASTINT (val, col);
1113 return val;
1114 }
1115 \f
1116 /* compute_motion: compute buffer posn given screen posn and vice versa */
1117
1118 struct position val_compute_motion;
1119
1120 /* Scan the current buffer forward from offset FROM, pretending that
1121 this is at line FROMVPOS, column FROMHPOS, until reaching buffer
1122 offset TO or line TOVPOS, column TOHPOS (whichever comes first),
1123 and return the ending buffer position and screen location. If we
1124 can't hit the requested column exactly (because of a tab or other
1125 multi-column character), overshoot.
1126
1127 DID_MOTION is 1 if FROMHPOS has already accounted for overlay strings
1128 at FROM. This is the case if FROMVPOS and FROMVPOS came from an
1129 earlier call to compute_motion. The other common case is that FROMHPOS
1130 is zero and FROM is a position that "belongs" at column zero, but might
1131 be shifted by overlay strings; in this case DID_MOTION should be 0.
1132
1133 WIDTH is the number of columns available to display text;
1134 compute_motion uses this to handle continuation lines and such.
1135 If WIDTH is -1, use width of window's text area adjusted for
1136 continuation glyph when needed.
1137
1138 HSCROLL is the number of columns not being displayed at the left
1139 margin; this is usually taken from a window's hscroll member.
1140 TAB_OFFSET is the number of columns of the first tab that aren't
1141 being displayed, perhaps because of a continuation line or
1142 something.
1143
1144 compute_motion returns a pointer to a struct position. The bufpos
1145 member gives the buffer position at the end of the scan, and hpos
1146 and vpos give its cartesian location. prevhpos is the column at
1147 which the character before bufpos started, and contin is non-zero
1148 if we reached the current line by continuing the previous.
1149
1150 Note that FROMHPOS and TOHPOS should be expressed in real screen
1151 columns, taking HSCROLL and the truncation glyph at the left margin
1152 into account. That is, beginning-of-line moves you to the hpos
1153 -HSCROLL + (HSCROLL > 0).
1154
1155 For example, to find the buffer position of column COL of line LINE
1156 of a certain window, pass the window's starting location as FROM
1157 and the window's upper-left coordinates as FROMVPOS and FROMHPOS.
1158 Pass the buffer's ZV as TO, to limit the scan to the end of the
1159 visible section of the buffer, and pass LINE and COL as TOVPOS and
1160 TOHPOS.
1161
1162 When displaying in window w, a typical formula for WIDTH is:
1163
1164 window_width - 1
1165 - (has_vertical_scroll_bars
1166 ? WINDOW_CONFIG_SCROLL_BAR_COLS (window)
1167 : (window_width + window_left != frame_cols))
1168
1169 where
1170 window_width is XFASTINT (w->total_cols),
1171 window_left is XFASTINT (w->left_col),
1172 has_vertical_scroll_bars is
1173 WINDOW_HAS_VERTICAL_SCROLL_BAR (window)
1174 and frame_cols = FRAME_COLS (XFRAME (window->frame))
1175
1176 Or you can let window_box_text_cols do this all for you, and write:
1177 window_box_text_cols (w) - 1
1178
1179 The `-1' accounts for the continuation-line backslashes; the rest
1180 accounts for window borders if the window is split horizontally, and
1181 the scroll bars if they are turned on. */
1182
1183 struct position *
1184 compute_motion (from, fromvpos, fromhpos, did_motion, to, tovpos, tohpos, width, hscroll, tab_offset, win)
1185 int from, fromvpos, fromhpos, to, tovpos, tohpos;
1186 int did_motion;
1187 register int width;
1188 int hscroll, tab_offset;
1189 struct window *win;
1190 {
1191 register int hpos = fromhpos;
1192 register int vpos = fromvpos;
1193
1194 register int pos;
1195 int pos_byte;
1196 register int c = 0;
1197 register int tab_width = XFASTINT (current_buffer->tab_width);
1198 register int ctl_arrow = !NILP (current_buffer->ctl_arrow);
1199 register struct Lisp_Char_Table *dp = window_display_table (win);
1200 int selective
1201 = (INTEGERP (current_buffer->selective_display)
1202 ? XINT (current_buffer->selective_display)
1203 : !NILP (current_buffer->selective_display) ? -1 : 0);
1204 int selective_rlen
1205 = (selective && dp && VECTORP (DISP_INVIS_VECTOR (dp))
1206 ? XVECTOR (DISP_INVIS_VECTOR (dp))->size : 0);
1207 /* The next location where the `invisible' property changes, or an
1208 overlay starts or ends. */
1209 int next_boundary = from;
1210
1211 /* For computing runs of characters with similar widths.
1212 Invariant: width_run_width is zero, or all the characters
1213 from width_run_start to width_run_end have a fixed width of
1214 width_run_width. */
1215 int width_run_start = from;
1216 int width_run_end = from;
1217 int width_run_width = 0;
1218 Lisp_Object *width_table;
1219 Lisp_Object buffer;
1220
1221 /* The next buffer pos where we should consult the width run cache. */
1222 int next_width_run = from;
1223 Lisp_Object window;
1224
1225 int multibyte = !NILP (current_buffer->enable_multibyte_characters);
1226 /* If previous char scanned was a wide character,
1227 this is the column where it ended. Otherwise, this is 0. */
1228 int wide_column_end_hpos = 0;
1229 int prev_pos; /* Previous buffer position. */
1230 int prev_pos_byte; /* Previous buffer position. */
1231 int prev_hpos = 0;
1232 int prev_vpos = 0;
1233 int contin_hpos; /* HPOS of last column of continued line. */
1234 int prev_tab_offset; /* Previous tab offset. */
1235 int continuation_glyph_width;
1236
1237 XSETBUFFER (buffer, current_buffer);
1238 XSETWINDOW (window, win);
1239
1240 width_run_cache_on_off ();
1241 if (dp == buffer_display_table ())
1242 width_table = (VECTORP (current_buffer->width_table)
1243 ? XVECTOR (current_buffer->width_table)->contents
1244 : 0);
1245 else
1246 /* If the window has its own display table, we can't use the width
1247 run cache, because that's based on the buffer's display table. */
1248 width_table = 0;
1249
1250 if (tab_width <= 0 || tab_width > 1000)
1251 tab_width = 8;
1252
1253 /* Negative width means use all available text columns. */
1254 if (width < 0)
1255 {
1256 width = window_box_text_cols (win);
1257 /* We must make room for continuation marks if we don't have fringes. */
1258 #ifdef HAVE_WINDOW_SYSTEM
1259 if (!FRAME_WINDOW_P (XFRAME (win->frame)))
1260 #endif
1261 width -= 1;
1262 }
1263
1264 continuation_glyph_width = 1;
1265 #ifdef HAVE_WINDOW_SYSTEM
1266 if (FRAME_WINDOW_P (XFRAME (win->frame)))
1267 continuation_glyph_width = 0; /* In the fringe. */
1268 #endif
1269
1270 immediate_quit = 1;
1271 QUIT;
1272
1273 pos = prev_pos = from;
1274 pos_byte = prev_pos_byte = CHAR_TO_BYTE (from);
1275 contin_hpos = 0;
1276 prev_tab_offset = tab_offset;
1277 while (1)
1278 {
1279 while (pos == next_boundary)
1280 {
1281 int pos_here = pos;
1282 int newpos;
1283
1284 /* Don't skip invisible if we are already at the margin. */
1285 if (vpos > tovpos || (vpos == tovpos && hpos >= tohpos))
1286 {
1287 if (contin_hpos && prev_hpos == 0
1288 && hpos > tohpos
1289 && (contin_hpos == width || wide_column_end_hpos > width))
1290 { /* Line breaks because we can't put the character at the
1291 previous line any more. It is not the multi-column
1292 character continued in middle. Go back to previous
1293 buffer position, screen position, and set tab offset
1294 to previous value. It's the beginning of the
1295 line. */
1296 pos = prev_pos;
1297 pos_byte = prev_pos_byte;
1298 hpos = prev_hpos;
1299 vpos = prev_vpos;
1300 tab_offset = prev_tab_offset;
1301 }
1302 break;
1303 }
1304
1305 /* If the caller says that the screen position came from an earlier
1306 call to compute_motion, then we've already accounted for the
1307 overlay strings at point. This is only true the first time
1308 through, so clear the flag after testing it. */
1309 if (!did_motion)
1310 /* We need to skip past the overlay strings. Currently those
1311 strings must not contain TAB;
1312 if we want to relax that restriction, something will have
1313 to be changed here. */
1314 {
1315 unsigned char *ovstr;
1316 int ovlen = overlay_strings (pos, win, &ovstr);
1317 hpos += ((multibyte && ovlen > 0)
1318 ? strwidth (ovstr, ovlen) : ovlen);
1319 }
1320 did_motion = 0;
1321
1322 if (pos >= to)
1323 break;
1324
1325 /* Advance POS past invisible characters
1326 (but not necessarily all that there are here),
1327 and store in next_boundary the next position where
1328 we need to call skip_invisible. */
1329 newpos = skip_invisible (pos, &next_boundary, to, window);
1330
1331 if (newpos >= to)
1332 {
1333 pos = min (to, newpos);
1334 pos_byte = CHAR_TO_BYTE (pos);
1335 goto after_loop;
1336 }
1337
1338 if (newpos != pos_here)
1339 {
1340 pos = newpos;
1341 pos_byte = CHAR_TO_BYTE (pos);
1342 }
1343 }
1344
1345 /* Handle right margin. */
1346 /* Note on a wide-column character.
1347
1348 Characters are classified into the following three categories
1349 according to the width (columns occupied on screen).
1350
1351 (1) single-column character: ex. `a'
1352 (2) multi-column character: ex. `^A', TAB, `\033'
1353 (3) wide-column character: ex. Japanese character, Chinese character
1354 (In the following example, `W_' stands for them.)
1355
1356 Multi-column characters can be divided around the right margin,
1357 but wide-column characters cannot.
1358
1359 NOTE:
1360
1361 (*) The cursor is placed on the next character after the point.
1362
1363 ----------
1364 abcdefghi\
1365 j ^---- next after the point
1366 ^--- next char. after the point.
1367 ----------
1368 In case of sigle-column character
1369
1370 ----------
1371 abcdefgh\\
1372 033 ^---- next after the point, next char. after the point.
1373 ----------
1374 In case of multi-column character
1375
1376 ----------
1377 abcdefgh\\
1378 W_ ^---- next after the point
1379 ^---- next char. after the point.
1380 ----------
1381 In case of wide-column character
1382
1383 The problem here is continuation at a wide-column character.
1384 In this case, the line may shorter less than WIDTH.
1385 And we find the continuation AFTER it occurs.
1386
1387 */
1388
1389 if (hpos > width)
1390 {
1391 if (hscroll
1392 || (truncate_partial_width_windows
1393 && ((width + continuation_glyph_width)
1394 < FRAME_COLS (XFRAME (WINDOW_FRAME (win)))))
1395 || !NILP (current_buffer->truncate_lines))
1396 {
1397 /* Truncating: skip to newline, unless we are already past
1398 TO (we need to go back below). */
1399 if (pos <= to)
1400 {
1401 pos = find_before_next_newline (pos, to, 1);
1402 pos_byte = CHAR_TO_BYTE (pos);
1403 hpos = width;
1404 /* If we just skipped next_boundary,
1405 loop around in the main while
1406 and handle it. */
1407 if (pos >= next_boundary)
1408 next_boundary = pos + 1;
1409 prev_hpos = width;
1410 prev_vpos = vpos;
1411 prev_tab_offset = tab_offset;
1412 }
1413 }
1414 else
1415 {
1416 /* Continuing. */
1417 /* Remember the previous value. */
1418 prev_tab_offset = tab_offset;
1419
1420 if (wide_column_end_hpos > width)
1421 {
1422 hpos -= prev_hpos;
1423 tab_offset += prev_hpos;
1424 }
1425 else
1426 {
1427 tab_offset += width;
1428 hpos -= width;
1429 }
1430 vpos++;
1431 contin_hpos = prev_hpos;
1432 prev_hpos = 0;
1433 prev_vpos = vpos;
1434 }
1435 }
1436
1437 /* Stop if past the target buffer position or screen position. */
1438 if (pos > to)
1439 {
1440 /* Go back to the previous position. */
1441 pos = prev_pos;
1442 pos_byte = prev_pos_byte;
1443 hpos = prev_hpos;
1444 vpos = prev_vpos;
1445 tab_offset = prev_tab_offset;
1446
1447 /* NOTE on contin_hpos, hpos, and prev_hpos.
1448
1449 ----------
1450 abcdefgh\\
1451 W_ ^---- contin_hpos
1452 | ^----- hpos
1453 \---- prev_hpos
1454 ----------
1455 */
1456
1457 if (contin_hpos && prev_hpos == 0
1458 && contin_hpos < width && !wide_column_end_hpos)
1459 {
1460 /* Line breaking occurs in the middle of multi-column
1461 character. Go back to previous line. */
1462 hpos = contin_hpos;
1463 vpos = vpos - 1;
1464 }
1465 break;
1466 }
1467
1468 if (vpos > tovpos || (vpos == tovpos && hpos >= tohpos))
1469 {
1470 if (contin_hpos && prev_hpos == 0
1471 && hpos > tohpos
1472 && (contin_hpos == width || wide_column_end_hpos > width))
1473 { /* Line breaks because we can't put the character at the
1474 previous line any more. It is not the multi-column
1475 character continued in middle. Go back to previous
1476 buffer position, screen position, and set tab offset
1477 to previous value. It's the beginning of the
1478 line. */
1479 pos = prev_pos;
1480 pos_byte = prev_pos_byte;
1481 hpos = prev_hpos;
1482 vpos = prev_vpos;
1483 tab_offset = prev_tab_offset;
1484 }
1485 break;
1486 }
1487 if (pos == ZV) /* We cannot go beyond ZV. Stop here. */
1488 break;
1489
1490 prev_hpos = hpos;
1491 prev_vpos = vpos;
1492 prev_pos = pos;
1493 prev_pos_byte = pos_byte;
1494 wide_column_end_hpos = 0;
1495
1496 /* Consult the width run cache to see if we can avoid inspecting
1497 the text character-by-character. */
1498 if (current_buffer->width_run_cache && pos >= next_width_run)
1499 {
1500 int run_end;
1501 int common_width
1502 = region_cache_forward (current_buffer,
1503 current_buffer->width_run_cache,
1504 pos, &run_end);
1505
1506 /* A width of zero means the character's width varies (like
1507 a tab), is meaningless (like a newline), or we just don't
1508 want to skip over it for some other reason. */
1509 if (common_width != 0)
1510 {
1511 int run_end_hpos;
1512
1513 /* Don't go past the final buffer posn the user
1514 requested. */
1515 if (run_end > to)
1516 run_end = to;
1517
1518 run_end_hpos = hpos + (run_end - pos) * common_width;
1519
1520 /* Don't go past the final horizontal position the user
1521 requested. */
1522 if (vpos == tovpos && run_end_hpos > tohpos)
1523 {
1524 run_end = pos + (tohpos - hpos) / common_width;
1525 run_end_hpos = hpos + (run_end - pos) * common_width;
1526 }
1527
1528 /* Don't go past the margin. */
1529 if (run_end_hpos >= width)
1530 {
1531 run_end = pos + (width - hpos) / common_width;
1532 run_end_hpos = hpos + (run_end - pos) * common_width;
1533 }
1534
1535 hpos = run_end_hpos;
1536 if (run_end > pos)
1537 prev_hpos = hpos - common_width;
1538 if (pos != run_end)
1539 {
1540 pos = run_end;
1541 pos_byte = CHAR_TO_BYTE (pos);
1542 }
1543 }
1544
1545 next_width_run = run_end + 1;
1546 }
1547
1548 /* We have to scan the text character-by-character. */
1549 else
1550 {
1551 EMACS_INT i, n;
1552 Lisp_Object charvec;
1553
1554 c = FETCH_BYTE (pos_byte);
1555
1556 /* Check composition sequence. */
1557 {
1558 int len, len_byte, width;
1559
1560 if (check_composition (pos, pos_byte, to, &len, &len_byte, &width))
1561 {
1562 pos += len;
1563 pos_byte += len_byte;
1564 hpos += width;
1565 continue;
1566 }
1567 }
1568
1569 pos++, pos_byte++;
1570
1571 /* Perhaps add some info to the width_run_cache. */
1572 if (current_buffer->width_run_cache)
1573 {
1574 /* Is this character part of the current run? If so, extend
1575 the run. */
1576 if (pos - 1 == width_run_end
1577 && XFASTINT (width_table[c]) == width_run_width)
1578 width_run_end = pos;
1579
1580 /* The previous run is over, since this is a character at a
1581 different position, or a different width. */
1582 else
1583 {
1584 /* Have we accumulated a run to put in the cache?
1585 (Currently, we only cache runs of width == 1). */
1586 if (width_run_start < width_run_end
1587 && width_run_width == 1)
1588 know_region_cache (current_buffer,
1589 current_buffer->width_run_cache,
1590 width_run_start, width_run_end);
1591
1592 /* Start recording a new width run. */
1593 width_run_width = XFASTINT (width_table[c]);
1594 width_run_start = pos - 1;
1595 width_run_end = pos;
1596 }
1597 }
1598
1599 if (dp != 0
1600 && ! (multibyte && BASE_LEADING_CODE_P (c))
1601 && VECTORP (DISP_CHAR_VECTOR (dp, c)))
1602 {
1603 charvec = DISP_CHAR_VECTOR (dp, c);
1604 n = ASIZE (charvec);
1605 }
1606 else
1607 {
1608 charvec = Qnil;
1609 n = 1;
1610 }
1611
1612 for (i = n - 1; i >= 0; --i)
1613 {
1614 if (VECTORP (charvec))
1615 {
1616 /* This should be handled the same as
1617 next_element_from_display_vector does it. */
1618 Lisp_Object entry = AREF (charvec, i);
1619
1620 if (INTEGERP (entry)
1621 && GLYPH_CHAR_VALID_P (XFASTINT (entry)))
1622 c = FAST_GLYPH_CHAR (XFASTINT (entry));
1623 else
1624 c = ' ';
1625 }
1626
1627 if (c >= 040 && c < 0177)
1628 hpos++;
1629 else if (c == '\t')
1630 {
1631 int tem = ((hpos + tab_offset + hscroll - (hscroll > 0))
1632 % tab_width);
1633 if (tem < 0)
1634 tem += tab_width;
1635 hpos += tab_width - tem;
1636 }
1637 else if (c == '\n')
1638 {
1639 if (selective > 0
1640 && indented_beyond_p (pos, pos_byte,
1641 (double) selective)) /* iftc */
1642 {
1643 /* If (pos == to), we don't have to take care of
1644 selective display. */
1645 if (pos < to)
1646 {
1647 /* Skip any number of invisible lines all at once */
1648 do
1649 {
1650 pos = find_before_next_newline (pos, to, 1);
1651 if (pos < to)
1652 pos++;
1653 pos_byte = CHAR_TO_BYTE (pos);
1654 }
1655 while (pos < to
1656 && indented_beyond_p (pos, pos_byte,
1657 (double) selective)); /* iftc */
1658 /* Allow for the " ..." that is displayed for them. */
1659 if (selective_rlen)
1660 {
1661 hpos += selective_rlen;
1662 if (hpos >= width)
1663 hpos = width;
1664 }
1665 DEC_BOTH (pos, pos_byte);
1666 /* We have skipped the invis text, but not the
1667 newline after. */
1668 }
1669 }
1670 else
1671 {
1672 /* A visible line. */
1673 vpos++;
1674 hpos = 0;
1675 hpos -= hscroll;
1676 /* Count the truncation glyph on column 0 */
1677 if (hscroll > 0)
1678 hpos += continuation_glyph_width;
1679 tab_offset = 0;
1680 }
1681 contin_hpos = 0;
1682 }
1683 else if (c == CR && selective < 0)
1684 {
1685 /* In selective display mode,
1686 everything from a ^M to the end of the line is invisible.
1687 Stop *before* the real newline. */
1688 if (pos < to)
1689 {
1690 pos = find_before_next_newline (pos, to, 1);
1691 pos_byte = CHAR_TO_BYTE (pos);
1692 }
1693 /* If we just skipped next_boundary,
1694 loop around in the main while
1695 and handle it. */
1696 if (pos > next_boundary)
1697 next_boundary = pos;
1698 /* Allow for the " ..." that is displayed for them. */
1699 if (selective_rlen)
1700 {
1701 hpos += selective_rlen;
1702 if (hpos >= width)
1703 hpos = width;
1704 }
1705 }
1706 else if (multibyte && BASE_LEADING_CODE_P (c))
1707 {
1708 /* Start of multi-byte form. */
1709 unsigned char *ptr;
1710 int bytes, width, wide_column;
1711
1712 pos_byte--; /* rewind POS_BYTE */
1713 ptr = BYTE_POS_ADDR (pos_byte);
1714 MULTIBYTE_BYTES_WIDTH (ptr, dp);
1715 pos_byte += bytes;
1716 if (wide_column)
1717 wide_column_end_hpos = hpos + wide_column;
1718 hpos += width;
1719 }
1720 else if (VECTORP (charvec))
1721 ++hpos;
1722 else
1723 hpos += (ctl_arrow && c < 0200) ? 2 : 4;
1724 }
1725 }
1726 }
1727
1728 after_loop:
1729
1730 /* Remember any final width run in the cache. */
1731 if (current_buffer->width_run_cache
1732 && width_run_width == 1
1733 && width_run_start < width_run_end)
1734 know_region_cache (current_buffer, current_buffer->width_run_cache,
1735 width_run_start, width_run_end);
1736
1737 val_compute_motion.bufpos = pos;
1738 val_compute_motion.bytepos = pos_byte;
1739 val_compute_motion.hpos = hpos;
1740 val_compute_motion.vpos = vpos;
1741 if (contin_hpos && prev_hpos == 0)
1742 val_compute_motion.prevhpos = contin_hpos;
1743 else
1744 val_compute_motion.prevhpos = prev_hpos;
1745 /* We alalways handle all of them here; none of them remain to do. */
1746 val_compute_motion.ovstring_chars_done = 0;
1747
1748 /* Nonzero if have just continued a line */
1749 val_compute_motion.contin = (contin_hpos && prev_hpos == 0);
1750
1751 immediate_quit = 0;
1752 return &val_compute_motion;
1753 }
1754
1755
1756 DEFUN ("compute-motion", Fcompute_motion, Scompute_motion, 7, 7, 0,
1757 doc: /* Scan through the current buffer, calculating screen position.
1758 Scan the current buffer forward from offset FROM,
1759 assuming it is at position FROMPOS--a cons of the form (HPOS . VPOS)--
1760 to position TO or position TOPOS--another cons of the form (HPOS . VPOS)--
1761 and return the ending buffer position and screen location.
1762
1763 If TOPOS is nil, the actual width and height of the window's
1764 text area are used.
1765
1766 There are three additional arguments:
1767
1768 WIDTH is the number of columns available to display text;
1769 this affects handling of continuation lines. A value of nil
1770 corresponds to the actual number of available text columns.
1771
1772 OFFSETS is either nil or a cons cell (HSCROLL . TAB-OFFSET).
1773 HSCROLL is the number of columns not being displayed at the left
1774 margin; this is usually taken from a window's hscroll member.
1775 TAB-OFFSET is the number of columns of the first tab that aren't
1776 being displayed, perhaps because the line was continued within it.
1777 If OFFSETS is nil, HSCROLL and TAB-OFFSET are assumed to be zero.
1778
1779 WINDOW is the window to operate on. It is used to choose the display table;
1780 if it is showing the current buffer, it is used also for
1781 deciding which overlay properties apply.
1782 Note that `compute-motion' always operates on the current buffer.
1783
1784 The value is a list of five elements:
1785 (POS HPOS VPOS PREVHPOS CONTIN)
1786 POS is the buffer position where the scan stopped.
1787 VPOS is the vertical position where the scan stopped.
1788 HPOS is the horizontal position where the scan stopped.
1789
1790 PREVHPOS is the horizontal position one character back from POS.
1791 CONTIN is t if a line was continued after (or within) the previous character.
1792
1793 For example, to find the buffer position of column COL of line LINE
1794 of a certain window, pass the window's starting location as FROM
1795 and the window's upper-left coordinates as FROMPOS.
1796 Pass the buffer's (point-max) as TO, to limit the scan to the end of the
1797 visible section of the buffer, and pass LINE and COL as TOPOS. */)
1798 (from, frompos, to, topos, width, offsets, window)
1799 Lisp_Object from, frompos, to, topos;
1800 Lisp_Object width, offsets, window;
1801 {
1802 struct window *w;
1803 Lisp_Object bufpos, hpos, vpos, prevhpos;
1804 struct position *pos;
1805 int hscroll, tab_offset;
1806
1807 CHECK_NUMBER_COERCE_MARKER (from);
1808 CHECK_CONS (frompos);
1809 CHECK_NUMBER_CAR (frompos);
1810 CHECK_NUMBER_CDR (frompos);
1811 CHECK_NUMBER_COERCE_MARKER (to);
1812 if (!NILP (topos))
1813 {
1814 CHECK_CONS (topos);
1815 CHECK_NUMBER_CAR (topos);
1816 CHECK_NUMBER_CDR (topos);
1817 }
1818 if (!NILP (width))
1819 CHECK_NUMBER (width);
1820
1821 if (!NILP (offsets))
1822 {
1823 CHECK_CONS (offsets);
1824 CHECK_NUMBER_CAR (offsets);
1825 CHECK_NUMBER_CDR (offsets);
1826 hscroll = XINT (XCAR (offsets));
1827 tab_offset = XINT (XCDR (offsets));
1828 }
1829 else
1830 hscroll = tab_offset = 0;
1831
1832 if (NILP (window))
1833 window = Fselected_window ();
1834 else
1835 CHECK_LIVE_WINDOW (window);
1836 w = XWINDOW (window);
1837
1838 if (XINT (from) < BEGV || XINT (from) > ZV)
1839 args_out_of_range_3 (from, make_number (BEGV), make_number (ZV));
1840 if (XINT (to) < BEGV || XINT (to) > ZV)
1841 args_out_of_range_3 (to, make_number (BEGV), make_number (ZV));
1842
1843 pos = compute_motion (XINT (from), XINT (XCDR (frompos)),
1844 XINT (XCAR (frompos)), 0,
1845 XINT (to),
1846 (NILP (topos)
1847 ? window_internal_height (w)
1848 : XINT (XCDR (topos))),
1849 (NILP (topos)
1850 ? (window_box_text_cols (w)
1851 - (
1852 #ifdef HAVE_WINDOW_SYSTEM
1853 FRAME_WINDOW_P (XFRAME (w->frame)) ? 0 :
1854 #endif
1855 1))
1856 : XINT (XCAR (topos))),
1857 (NILP (width) ? -1 : XINT (width)),
1858 hscroll, tab_offset,
1859 XWINDOW (window));
1860
1861 XSETFASTINT (bufpos, pos->bufpos);
1862 XSETINT (hpos, pos->hpos);
1863 XSETINT (vpos, pos->vpos);
1864 XSETINT (prevhpos, pos->prevhpos);
1865
1866 return Fcons (bufpos,
1867 Fcons (hpos,
1868 Fcons (vpos,
1869 Fcons (prevhpos,
1870 Fcons (pos->contin ? Qt : Qnil, Qnil)))));
1871
1872 }
1873 \f
1874 /* Fvertical_motion and vmotion */
1875
1876 struct position val_vmotion;
1877
1878 struct position *
1879 vmotion (from, vtarget, w)
1880 register int from, vtarget;
1881 struct window *w;
1882 {
1883 int hscroll = XINT (w->hscroll);
1884 struct position pos;
1885 /* vpos is cumulative vertical position, changed as from is changed */
1886 register int vpos = 0;
1887 int prevline;
1888 register int first;
1889 int from_byte;
1890 int lmargin = hscroll > 0 ? 1 - hscroll : 0;
1891 int selective
1892 = (INTEGERP (current_buffer->selective_display)
1893 ? XINT (current_buffer->selective_display)
1894 : !NILP (current_buffer->selective_display) ? -1 : 0);
1895 Lisp_Object window;
1896 int start_hpos = 0;
1897 int did_motion;
1898 /* This is the object we use for fetching character properties. */
1899 Lisp_Object text_prop_object;
1900
1901 XSETWINDOW (window, w);
1902
1903 /* If the window contains this buffer, use it for getting text properties.
1904 Otherwise use the current buffer as arg for doing that. */
1905 if (EQ (w->buffer, Fcurrent_buffer ()))
1906 text_prop_object = window;
1907 else
1908 text_prop_object = Fcurrent_buffer ();
1909
1910 if (vpos >= vtarget)
1911 {
1912 /* To move upward, go a line at a time until
1913 we have gone at least far enough. */
1914
1915 first = 1;
1916
1917 while ((vpos > vtarget || first) && from > BEGV)
1918 {
1919 Lisp_Object propval;
1920
1921 prevline = find_next_newline_no_quit (from - 1, -1);
1922 while (prevline > BEGV
1923 && ((selective > 0
1924 && indented_beyond_p (prevline,
1925 CHAR_TO_BYTE (prevline),
1926 (double) selective)) /* iftc */
1927 /* Watch out for newlines with `invisible' property.
1928 When moving upward, check the newline before. */
1929 || (propval = Fget_char_property (make_number (prevline - 1),
1930 Qinvisible,
1931 text_prop_object),
1932 TEXT_PROP_MEANS_INVISIBLE (propval))))
1933 prevline = find_next_newline_no_quit (prevline - 1, -1);
1934 pos = *compute_motion (prevline, 0,
1935 lmargin + (prevline == BEG ? start_hpos : 0),
1936 0,
1937 from,
1938 /* Don't care for VPOS... */
1939 1 << (BITS_PER_SHORT - 1),
1940 /* ... nor HPOS. */
1941 1 << (BITS_PER_SHORT - 1),
1942 -1, hscroll,
1943 /* This compensates for start_hpos
1944 so that a tab as first character
1945 still occupies 8 columns. */
1946 (prevline == BEG ? -start_hpos : 0),
1947 w);
1948 vpos -= pos.vpos;
1949 first = 0;
1950 from = prevline;
1951 }
1952
1953 /* If we made exactly the desired vertical distance,
1954 or if we hit beginning of buffer,
1955 return point found */
1956 if (vpos >= vtarget)
1957 {
1958 val_vmotion.bufpos = from;
1959 val_vmotion.bytepos = CHAR_TO_BYTE (from);
1960 val_vmotion.vpos = vpos;
1961 val_vmotion.hpos = lmargin;
1962 val_vmotion.contin = 0;
1963 val_vmotion.prevhpos = 0;
1964 val_vmotion.ovstring_chars_done = 0;
1965 val_vmotion.tab_offset = 0; /* For accumulating tab offset. */
1966 return &val_vmotion;
1967 }
1968
1969 /* Otherwise find the correct spot by moving down */
1970 }
1971 /* Moving downward is simple, but must calculate from beg of line
1972 to determine hpos of starting point */
1973 from_byte = CHAR_TO_BYTE (from);
1974 if (from > BEGV && FETCH_BYTE (from_byte - 1) != '\n')
1975 {
1976 Lisp_Object propval;
1977
1978 prevline = find_next_newline_no_quit (from, -1);
1979 while (prevline > BEGV
1980 && ((selective > 0
1981 && indented_beyond_p (prevline,
1982 CHAR_TO_BYTE (prevline),
1983 (double) selective)) /* iftc */
1984 /* Watch out for newlines with `invisible' property.
1985 When moving downward, check the newline after. */
1986 || (propval = Fget_char_property (make_number (prevline),
1987 Qinvisible,
1988 text_prop_object),
1989 TEXT_PROP_MEANS_INVISIBLE (propval))))
1990 prevline = find_next_newline_no_quit (prevline - 1, -1);
1991 pos = *compute_motion (prevline, 0,
1992 lmargin + (prevline == BEG
1993 ? start_hpos : 0),
1994 0,
1995 from,
1996 /* Don't care for VPOS... */
1997 1 << (BITS_PER_SHORT - 1),
1998 /* ... nor HPOS. */
1999 1 << (BITS_PER_SHORT - 1),
2000 -1, hscroll,
2001 (prevline == BEG ? -start_hpos : 0),
2002 w);
2003 did_motion = 1;
2004 }
2005 else
2006 {
2007 pos.hpos = lmargin + (from == BEG ? start_hpos : 0);
2008 pos.vpos = 0;
2009 pos.tab_offset = 0;
2010 did_motion = 0;
2011 }
2012 return compute_motion (from, vpos, pos.hpos, did_motion,
2013 ZV, vtarget, - (1 << (BITS_PER_SHORT - 1)),
2014 -1, hscroll,
2015 pos.tab_offset - (from == BEG ? start_hpos : 0),
2016 w);
2017 }
2018
2019 DEFUN ("vertical-motion", Fvertical_motion, Svertical_motion, 1, 2, 0,
2020 doc: /* Move point to start of the screen line LINES lines down.
2021 If LINES is negative, this means moving up.
2022
2023 This function is an ordinary cursor motion function
2024 which calculates the new position based on how text would be displayed.
2025 The new position may be the start of a line,
2026 or just the start of a continuation line.
2027 The function returns number of screen lines moved over;
2028 that usually equals LINES, but may be closer to zero
2029 if beginning or end of buffer was reached.
2030
2031 The optional second argument WINDOW specifies the window to use for
2032 parameters such as width, horizontal scrolling, and so on.
2033 The default is to use the selected window's parameters.
2034
2035 `vertical-motion' always uses the current buffer,
2036 regardless of which buffer is displayed in WINDOW.
2037 This is consistent with other cursor motion functions
2038 and makes it possible to use `vertical-motion' in any buffer,
2039 whether or not it is currently displayed in some window. */)
2040 (lines, window)
2041 Lisp_Object lines, window;
2042 {
2043 struct it it;
2044 struct text_pos pt;
2045 struct window *w;
2046 Lisp_Object old_buffer;
2047 struct gcpro gcpro1;
2048
2049 CHECK_NUMBER (lines);
2050 if (! NILP (window))
2051 CHECK_WINDOW (window);
2052 else
2053 window = selected_window;
2054 w = XWINDOW (window);
2055
2056 old_buffer = Qnil;
2057 GCPRO1 (old_buffer);
2058 if (XBUFFER (w->buffer) != current_buffer)
2059 {
2060 /* Set the window's buffer temporarily to the current buffer. */
2061 old_buffer = w->buffer;
2062 XSETBUFFER (w->buffer, current_buffer);
2063 }
2064
2065 if (noninteractive)
2066 {
2067 struct position pos;
2068 pos = *vmotion (PT, XINT (lines), w);
2069 SET_PT_BOTH (pos.bufpos, pos.bytepos);
2070 }
2071 else
2072 {
2073 int it_start;
2074
2075 SET_TEXT_POS (pt, PT, PT_BYTE);
2076 start_display (&it, w, pt);
2077
2078 /* Scan from the start of the line containing PT. If we don't
2079 do this, we start moving with IT->current_x == 0, while PT is
2080 really at some x > 0. The effect is, in continuation lines, that
2081 we end up with the iterator placed at where it thinks X is 0,
2082 while the end position is really at some X > 0, the same X that
2083 PT had. */
2084 it_start = IT_CHARPOS (it);
2085 reseat_at_previous_visible_line_start (&it);
2086 it.current_x = it.hpos = 0;
2087 move_it_to (&it, PT, -1, -1, -1, MOVE_TO_POS);
2088
2089 /* Move back if we got too far. This may happen if
2090 truncate-lines is on and PT is beyond right margin. */
2091 if (IT_CHARPOS (it) > it_start && XINT (lines) > 0)
2092 move_it_by_lines (&it, -1, 0);
2093
2094 it.vpos = 0;
2095 /* Do this even if LINES is 0, so that we move back
2096 to the beginning of the current line as we ought. */
2097 move_it_by_lines (&it, XINT (lines), 0);
2098
2099 SET_PT_BOTH (IT_CHARPOS (it), IT_BYTEPOS (it));
2100 }
2101
2102 if (BUFFERP (old_buffer))
2103 w->buffer = old_buffer;
2104
2105 RETURN_UNGCPRO (make_number (it.vpos));
2106 }
2107
2108
2109 \f
2110 /* File's initialization. */
2111
2112 void
2113 syms_of_indent ()
2114 {
2115 DEFVAR_BOOL ("indent-tabs-mode", &indent_tabs_mode,
2116 doc: /* *Indentation can insert tabs if this is non-nil.
2117 Setting this variable automatically makes it local to the current buffer. */);
2118 indent_tabs_mode = 1;
2119
2120 defsubr (&Scurrent_indentation);
2121 defsubr (&Sindent_to);
2122 defsubr (&Scurrent_column);
2123 defsubr (&Smove_to_column);
2124 defsubr (&Svertical_motion);
2125 defsubr (&Scompute_motion);
2126 }
2127
2128 /* arch-tag: 9adfea44-71f7-4988-8ee3-96da15c502cc
2129 (do not change this comment) */