/* Indentation functions. Copyright (C) 1985,86,87,88,93,94,95 Free Software Foundation, Inc. This file is part of GNU Emacs. GNU Emacs is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. GNU Emacs is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with GNU Emacs; see the file COPYING. If not, write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ /* 87.4.16 modified by K.Handa */ /* 87.7.12 modified by K.Handa */ /* 87.12.10 modified for Nemacs Ver.2.0 by K.Handa */ /* 88.5.30 modified for Nemacs Ver.2.1 by K.Handa */ /* 89.3.10 modified for Nemacs Ver.3.0 by K.Handa */ /* 89.9.7 modified for Nemacs Ver.3.2 by K.Handa */ /* 89.12.23 modified for Nemacs Ver.3.2.3 by K.Handa In compute_motion, fixed a bug of handling truncated lines. */ /* 90.4.10 modified for Nemacs Ver.3.3.2 by K.Handa Make compatible with original when kanji-flag is off. */ /* 91.10.27 modified for Nemacs Ver.4.0.0 by K.Handa */ /* 92.3.6 modified for Mule Ver.0.9.0 by K.Handa */ /* 92.3.21 modified for Mule Ver.0.9.1 by K.Handa and Y.Niibe current_column() and compute_motion() is changed for handling multi-column character. */ /* 92.3.27 modified for Mule Ver.0.9.2 by Y.Niibe In compute_motion, 'continue' is inserted to skip unnecessary code. */ /* 92.4.1 modified for Mule Ver.0.9.2 by Y.Niibe Calculation of tab_offset is fixed. */ /* 92.4.30 modified for Mule Ver.0.9.4 by Y.Niibe Fmove_to_column() handles invalid multi-byte chars correctly. */ /* 92.9.9 modified for Mule Ver.0.9.6 by K.Handa current_column(), Fmove_to_column(), and compute_motion() are modified for private char-sets. */ /* 92.11.11 modified for Mule Ver.0.9.6 by K.Handa Composite character is supported. */ /* 92.12.17 modified for Mule Ver.0.9.7 by Y.Niibe Preliminary support (92.8.2) for right-to-left languages. */ /* 93.2.28 modified for Mule Ver.0.9.7.1 by K.Handa In compute_motion(), line continuation in minibuffer is handled correctly. */ /* 93.4.8 modified for Mule Ver.0.9.7.1 by Y.Niibe Buf fixed in compute_motion(). */ /* 93.5.22 modified for Mule Ver.0.9.7.1 by Y.Niibe compute_motion(): full support for composite character and private char-sets, and right-to-left char-sets. */ #include #include "lisp.h" #include "buffer.h" #include "indent.h" #include "frame.h" #include "window.h" #include "termchar.h" #include "termopts.h" #include "disptab.h" #include "intervals.h" #include "region-cache.h" #include "charset.h" /* 91.10.27 by K.Handa */ /* Indentation can insert tabs if this is non-zero; otherwise always uses spaces */ int indent_tabs_mode; #define min(a, b) ((a) < (b) ? (a) : (b)) #define max(a, b) ((a) > (b) ? (a) : (b)) #define CR 015 /* These three values memoize the current column to avoid recalculation */ /* Some things in set last_known_column_point to -1 to mark the memoized value as invalid */ /* Last value returned by current_column */ int last_known_column; /* Value of point when current_column was called */ int last_known_column_point; /* Value of MODIFF when current_column was called */ int last_known_column_modified; static int current_column_1 (); /* Get the display table to use for the current buffer. */ struct Lisp_Char_Table * buffer_display_table () { Lisp_Object thisbuf; thisbuf = current_buffer->display_table; if (DISP_TABLE_P (thisbuf)) return XCHAR_TABLE (thisbuf); if (DISP_TABLE_P (Vstandard_display_table)) return XCHAR_TABLE (Vstandard_display_table); return 0; } /* Width run cache considerations. */ /* Return the width of character C under display table DP. */ static int character_width (c, dp) int c; struct Lisp_Char_Table *dp; { Lisp_Object elt; /* These width computations were determined by examining the cases in display_text_line. */ /* Everything can be handled by the display table, if it's present and the element is right. */ if (dp && (elt = DISP_CHAR_VECTOR (dp, c), VECTORP (elt))) return XVECTOR (elt)->size; /* Some characters are special. */ if (c == '\n' || c == '\t' || c == '\015') return 0; /* Printing characters have width 1. */ else if (c >= 040 && c < 0177) return 1; /* Everybody else (control characters, metacharacters) has other widths. We could return their actual widths here, but they depend on things like ctl_arrow and crud like that, and they're not very common at all. So we'll just claim we don't know their widths. */ else return 0; } /* Return true iff the display table DISPTAB specifies the same widths for characters as WIDTHTAB. We use this to decide when to invalidate the buffer's width_run_cache. */ int disptab_matches_widthtab (disptab, widthtab) struct Lisp_Char_Table *disptab; struct Lisp_Vector *widthtab; { int i; if (widthtab->size != 256) abort (); for (i = 0; i < 256; i++) if (character_width (i, disptab) != XFASTINT (widthtab->contents[i])) return 0; return 1; } /* Recompute BUF's width table, using the display table DISPTAB. */ void recompute_width_table (buf, disptab) struct buffer *buf; struct Lisp_Char_Table *disptab; { int i; struct Lisp_Vector *widthtab; if (!VECTORP (buf->width_table)) buf->width_table = Fmake_vector (make_number (256), make_number (0)); widthtab = XVECTOR (buf->width_table); if (widthtab->size != 256) abort (); for (i = 0; i < 256; i++) XSETFASTINT (widthtab->contents[i], character_width (i, disptab)); } /* Allocate or free the width run cache, as requested by the current state of current_buffer's cache_long_line_scans variable. */ static void width_run_cache_on_off () { if (NILP (current_buffer->cache_long_line_scans)) { /* It should be off. */ if (current_buffer->width_run_cache) { free_region_cache (current_buffer->width_run_cache); current_buffer->width_run_cache = 0; current_buffer->width_table = Qnil; } } else { /* It should be on. */ if (current_buffer->width_run_cache == 0) { current_buffer->width_run_cache = new_region_cache (); recompute_width_table (current_buffer, buffer_display_table ()); } } } /* Skip some invisible characters starting from POS. This includes characters invisible because of text properties and characters invisible because of overlays. If position POS is followed by invisible characters, skip some of them and return the position after them. Otherwise return POS itself. Set *NEXT_BOUNDARY_P to the next position at which it will be necessary to call this function again. Don't scan past TO, and don't set *NEXT_BOUNDARY_P to a value greater than TO. If WINDOW is non-nil, and this buffer is displayed in WINDOW, take account of overlays that apply only in WINDOW. We don't necessarily skip all the invisible characters after POS because that could take a long time. We skip a reasonable number which can be skipped quickly. If there might be more invisible characters immediately following, then *NEXT_BOUNDARY_P will equal the return value. */ static int skip_invisible (pos, next_boundary_p, to, window) int pos; int *next_boundary_p; int to; Lisp_Object window; { Lisp_Object prop, position, end, overlay_limit, proplimit; Lisp_Object buffer; XSETFASTINT (position, pos); XSETBUFFER (buffer, current_buffer); /* Give faster response for overlay lookup near POS. */ recenter_overlay_lists (current_buffer, pos); /* We must not advance farther than the next overlay change. The overlay change might change the invisible property; or there might be overlay strings to be displayed there. */ overlay_limit = Fnext_overlay_change (position); /* As for text properties, this gives a lower bound for where the invisible text property could change. */ proplimit = Fnext_property_change (position, buffer, Qt); if (XFASTINT (overlay_limit) < XFASTINT (proplimit)) proplimit = overlay_limit; /* PROPLIMIT is now a lower bound for the next change in invisible status. If that is plenty far away, use that lower bound. */ if (XFASTINT (proplimit) > pos + 100 || XFASTINT (proplimit) >= to) *next_boundary_p = XFASTINT (proplimit); /* Otherwise, scan for the next `invisible' property change. */ else { /* Don't scan terribly far. */ XSETFASTINT (proplimit, min (pos + 100, to)); /* No matter what. don't go past next overlay change. */ if (XFASTINT (overlay_limit) < XFASTINT (proplimit)) proplimit = overlay_limit; end = Fnext_single_property_change (position, Qinvisible, buffer, proplimit); *next_boundary_p = XFASTINT (end); } /* if the `invisible' property is set, we can skip to the next property change */ if (!NILP (window) && EQ (XWINDOW (window)->buffer, buffer)) prop = Fget_char_property (position, Qinvisible, window); else prop = Fget_char_property (position, Qinvisible, buffer); if (TEXT_PROP_MEANS_INVISIBLE (prop)) return *next_boundary_p; return pos; } DEFUN ("current-column", Fcurrent_column, Scurrent_column, 0, 0, 0, "Return the horizontal position of point. Beginning of line is column 0.\n\ This is calculated by adding together the widths of all the displayed\n\ representations of the character between the start of the previous line\n\ and point. (eg control characters will have a width of 2 or 4, tabs\n\ will have a variable width)\n\ Ignores finite width of frame, which means that this function may return\n\ values greater than (frame-width).\n\ Whether the line is visible (if `selective-display' is t) has no effect;\n\ however, ^M is treated as end of line when `selective-display' is t.") () { Lisp_Object temp; XSETFASTINT (temp, current_column ()); return temp; } /* Cancel any recorded value of the horizontal position. */ invalidate_current_column () { last_known_column_point = 0; } int current_column () { register int col; register unsigned char *ptr, *stop; register int tab_seen; int post_tab; register int c; register int tab_width = XINT (current_buffer->tab_width); int ctl_arrow = !NILP (current_buffer->ctl_arrow); register struct Lisp_Char_Table *dp = buffer_display_table (); int stopchar; int mc_flag = !NILP (current_buffer->mc_flag); /* 91.10.27 by K.Handa */ int non_ascii = 0; /* 92.3.21 by K.Handa */ int last_non_ascii; /* 92.11.11 by K.Handa */ if (point == last_known_column_point && MODIFF == last_known_column_modified) return last_known_column; /* If the buffer has overlays or text properties, use a more general algorithm. */ if (BUF_INTERVALS (current_buffer) || !NILP (current_buffer->overlays_before) || !NILP (current_buffer->overlays_after)) return current_column_1 (point); /* Scan backwards from point to the previous newline, counting width. Tab characters are the only complicated case. */ /* Make a pointer for decrementing through the chars before point. */ ptr = &FETCH_CHAR (point - 1) + 1; /* Make a pointer to where consecutive chars leave off, going backwards from point. */ if (point == BEGV) stop = ptr; else if (point <= GPT || BEGV > GPT) stop = BEGV_ADDR; else stop = GAP_END_ADDR; if (tab_width <= 0 || tab_width > 1000) tab_width = 8; col = 0, tab_seen = 0, post_tab = 0; while (1) { /* 92.9.9 by K.Handa */ if (ptr == stop) { /* We stopped either for the beginning of the buffer or for the gap. */ if (ptr == BEGV_ADDR) break; /* It was the gap. Jump back over it. */ stop = BEGV_ADDR; ptr = GPT_ADDR; /* Check whether that brings us to beginning of buffer. */ if (BEGV >= GPT) break; } c = *--ptr; if (dp != 0 && VECTORP (DISP_CHAR_VECTOR (dp, c))) col += XVECTOR (DISP_CHAR_VECTOR (dp, c))->size; else if (c >= 040 && c < 0177) { col += 1 + non_ascii * 4; non_ascii = 0; } else if (c == '\n') break; else if (c == '\r' && EQ (current_buffer->selective_display, Qt)) break; else if (c == '\t') { col += non_ascii * 4, non_ascii = 0; if (tab_seen) col = ((col + tab_width) / tab_width) * tab_width; post_tab += col; col = 0; tab_seen = 1; } else if (mc_flag && NONASCII_P(c)) /* 92.3.21 by K.Handa */ non_ascii++, last_non_ascii = c; else if (mc_flag && LC_P(c)) { non_ascii++; if (c == LCCMP) { /* 92.11.15 by K.Handa */ unsigned char *p; int bytes, width; if (non_ascii > 1 && non_ascii > (bytes = char_bytes[last_non_ascii - 0x20])) { width = char_width[last_non_ascii - 0x20]; p = ptr + bytes + 1; non_ascii -= bytes + 1; while (non_ascii) { if (p >= GPT_ADDR && p < GAP_END_ADDR) p += GAP_SIZE; if ((bytes = char_bytes[*p - 0x20]) <= non_ascii) { if (width < char_width[*p - 0x20]) width = char_width[*p - 0x20]; p += bytes, non_ascii -= bytes; } else break; } col += width + non_ascii * 4; } else col += non_ascii * 4; } else { if (char_bytes[c] <= non_ascii) col += char_width[c] + (non_ascii - char_bytes[c]) * 4; else col += non_ascii * 4; } non_ascii = 0; } else col += (ctl_arrow && c < 0200) ? 2 : 4; } col += non_ascii * 4; /* 92.9.9 by K.Handa */ if (tab_seen) { col = ((col + tab_width) / tab_width) * tab_width; col += post_tab; } last_known_column = col; last_known_column_point = point; last_known_column_modified = MODIFF; return col; } /* Return the column number of position POS by scanning forward from the beginning of the line. This function handles characters that are invisible due to text properties or overlays. */ static int current_column_1 (pos) int pos; { register int tab_width = XINT (current_buffer->tab_width); register int ctl_arrow = !NILP (current_buffer->ctl_arrow); register struct Lisp_Char_Table *dp = buffer_display_table (); /* Start the scan at the beginning of this line with column number 0. */ register int col = 0; int scan = find_next_newline (pos, -1); int next_boundary = scan; int multibyte = !NILP (current_buffer->mc_flag); if (tab_width <= 0 || tab_width > 1000) tab_width = 8; /* Scan forward to the target position. */ while (scan < pos) { int c; /* Occasionally we may need to skip invisible text. */ while (scan == next_boundary) { /* This updates NEXT_BOUNDARY to the next place where we might need to skip more invisible text. */ scan = skip_invisible (scan, &next_boundary, pos, Qnil); if (scan >= pos) goto endloop; } c = FETCH_CHAR (scan); if (dp != 0 && VECTORP (DISP_CHAR_VECTOR (dp, c))) { col += XVECTOR (DISP_CHAR_VECTOR (dp, c))->size; scan++; continue; } if (c == '\n') break; if (c == '\r' && EQ (current_buffer->selective_display, Qt)) break; scan++; if (c == '\t') { int prev_col = col; col += tab_width; col = col / tab_width * tab_width; } else if (multibyte && LC_P (c)) { int oldscan = scan; if (c == LCCMP) { int width = 1; /* Examine each component of composite character. */ while (scan < pos && NONASCII_P (FETCH_CHAR (scan))) { int bytes = char_bytes[(c = FETCH_CHAR (scan) - 0x20)]; scan++; /* Check existence of trailing non ascii character. */ while (--bytes && scan < pos && NONASCII_P (FETCH_CHAR (scan))) scan++; if (bytes) /* Incomplete multibyte form. */ { scan = oldscan, width = 4; break; } else if (width < char_width [c]) width = char_width [c]; } col += width; } else { int bytes = char_bytes[c]; /* Check existence of trailing non ascii character. */ while (--bytes && scan < pos && NONASCII_P (FETCH_CHAR (scan))) scan++; if (bytes) /* incomplete multibyte form. */ scan = oldscan, col += 4; else col += char_width[c]; } /* We assume that there is no invisible part in the middle of multibyte form, but may skip over the `next_boundary'. */ if (next_boundary < scan) next_boundary = scan; } else if (ctl_arrow && (c < 040 || c == 0177)) col += 2; else if (c < 040 || c >= 0177) col += 4; else col++; } endloop: last_known_column = col; last_known_column_point = point; last_known_column_modified = MODIFF; return col; } /* Return the width in columns of the part of STRING from BEG to END. If BEG is nil, that stands for the beginning of STRING. If END is nil, that stands for the end of STRING. */ static int string_display_width (string, beg, end) Lisp_Object string, beg, end; { register int col; register unsigned char *ptr, *stop; register int tab_seen; int post_tab; register int c; register int tab_width = XINT (current_buffer->tab_width); int ctl_arrow = !NILP (current_buffer->ctl_arrow); register struct Lisp_Char_Table *dp = buffer_display_table (); int b, e; /* Nonzero if we must consider multibyte form. */ int multibyte = !NILP (current_buffer->mc_flag); /* Number of non ascii character we past. */ int non_ascii; /* The last non ascii character we past. */ int last_non_ascii; if (NILP (end)) e = XSTRING (string)->size; else { CHECK_NUMBER (end, 0); e = XINT (end); } if (NILP (beg)) b = 0; else { CHECK_NUMBER (beg, 0); b = XINT (beg); } /* Make a pointer for decrementing through the chars before point. */ ptr = XSTRING (string)->data + e; /* Make a pointer to where consecutive chars leave off, going backwards from point. */ stop = XSTRING (string)->data + b; if (tab_width <= 0 || tab_width > 1000) tab_width = 8; col = 0, tab_seen = 0, post_tab = 0; while (1) { if (ptr == stop) break; c = *--ptr; if (dp != 0 && VECTORP (DISP_CHAR_VECTOR (dp, c))) col += XVECTOR (DISP_CHAR_VECTOR (dp, c))->size; else if (c >= 040 && c < 0177) col++; else if (c == '\n') break; else if (c == '\t') { col += non_ascii * 4, non_ascii = 0; if (tab_seen) col = ((col + tab_width) / tab_width) * tab_width; post_tab += col; col = 0; tab_seen = 1; continue; } else if (multibyte && NONASCII_P (c)) { non_ascii++, last_non_ascii = c; continue; } else if (multibyte && LC_P (c)) { if (c == LCCMP) { int bytes; int width = 0; int total_non_ascii = non_ascii; unsigned char *p = ptr + 1; /* points non ascii character */ while (non_ascii) { if (p <= GPT_ADDR && p < GAP_END_ADDR) p += GAP_SIZE; bytes = char_bytes[(c = *p - 0x20)]; if (non_ascii < bytes) /* Incomplete composite character. We can't recognize composite character with trailing non ascii binary characters. */ { width = total_non_ascii * 4; break; } non_ascii -= bytes, p += bytes; if (width < char_width[c]) width = char_width[c]; } col += width; } else { non_ascii++; /* includes leading character. */ if (char_bytes[c] <= non_ascii) col += char_width[c], non_ascii -= char_bytes[c]; /* There may be incomplete multibyte form. */ col += non_ascii * 4; } non_ascii = 0; continue; } else col += (ctl_arrow && c < 0200) ? 2 : 4; col += non_ascii * 4; non_ascii = 0; } if (tab_seen) { col = ((col + tab_width) / tab_width) * tab_width; col += post_tab; } return col; } DEFUN ("indent-to", Findent_to, Sindent_to, 1, 2, "NIndent to column: ", "Indent from point with tabs and spaces until COLUMN is reached.\n\ Optional second argument MININUM says always do at least MININUM spaces\n\ even if that goes past COLUMN; by default, MININUM is zero.") (column, minimum) Lisp_Object column, minimum; { int mincol; register int fromcol; register int tab_width = XINT (current_buffer->tab_width); CHECK_NUMBER (column, 0); if (NILP (minimum)) XSETFASTINT (minimum, 0); CHECK_NUMBER (minimum, 1); fromcol = current_column (); mincol = fromcol + XINT (minimum); if (mincol < XINT (column)) mincol = XINT (column); if (fromcol == mincol) return make_number (mincol); if (tab_width <= 0 || tab_width > 1000) tab_width = 8; if (indent_tabs_mode) { Lisp_Object n; XSETFASTINT (n, mincol / tab_width - fromcol / tab_width); if (XFASTINT (n) != 0) { Finsert_char (make_number ('\t'), n, Qt); fromcol = (mincol / tab_width) * tab_width; } } XSETFASTINT (column, mincol - fromcol); Finsert_char (make_number (' '), column, Qt); last_known_column = mincol; last_known_column_point = point; last_known_column_modified = MODIFF; XSETINT (column, mincol); return column; } DEFUN ("current-indentation", Fcurrent_indentation, Scurrent_indentation, 0, 0, 0, "Return the indentation of the current line.\n\ This is the horizontal position of the character\n\ following any initial whitespace.") () { Lisp_Object val; XSETFASTINT (val, position_indentation (find_next_newline (point, -1))); return val; } position_indentation (pos) register int pos; { register int column = 0; register int tab_width = XINT (current_buffer->tab_width); register unsigned char *p; register unsigned char *stop; unsigned char *start; int next_boundary = pos; int ceiling = pos; if (tab_width <= 0 || tab_width > 1000) tab_width = 8; p = &FETCH_CHAR (pos); /* STOP records the value of P at which we will need to think about the gap, or about invisible text, or about the end of the buffer. */ stop = p; /* START records the starting value of P. */ start = p; while (1) { while (p == stop) { int stop_pos; /* If we have updated P, set POS to match. The first time we enter the loop, POS is already right. */ if (p != start) pos = PTR_CHAR_POS (p); /* Consider the various reasons STOP might have been set here. */ if (pos == ZV) return column; if (pos == next_boundary) pos = skip_invisible (pos, &next_boundary, ZV, Qnil); if (pos >= ceiling) ceiling = BUFFER_CEILING_OF (pos) + 1; /* Compute the next place we need to stop and think, and set STOP accordingly. */ stop_pos = min (ceiling, next_boundary); /* The -1 and +1 arrange to point at the first byte of gap (if STOP_POS is the position of the gap) rather than at the data after the gap. */ stop = &FETCH_CHAR (stop_pos - 1) + 1; p = &FETCH_CHAR (pos); } switch (*p++) { case ' ': column++; break; case '\t': column += tab_width - column % tab_width; break; default: return column; } } } /* Test whether the line beginning at POS is indented beyond COLUMN. Blank lines are treated as if they had the same indentation as the preceding line. */ int indented_beyond_p (pos, column) int pos, column; { while (pos > BEGV && FETCH_CHAR (pos) == '\n') pos = find_next_newline_no_quit (pos - 1, -1); return (position_indentation (pos) >= column); } DEFUN ("move-to-column", Fmove_to_column, Smove_to_column, 1, 2, "p", "Move point to column COLUMN in the current line.\n\ The column of a character is calculated by adding together the widths\n\ as displayed of the previous characters in the line.\n\ This function ignores line-continuation;\n\ there is no upper limit on the column number a character can have\n\ and horizontal scrolling has no effect.\n\ \n\ If specified column is within a character, point goes after that character.\n\ If it's past end of line, point goes to end of line.\n\n\ A non-nil second (optional) argument FORCE means, if the line\n\ is too short to reach column COLUMN then add spaces/tabs to get there,\n\ and if COLUMN is in the middle of a tab character, change it to spaces.\n\ \n\ The return value is the current column.") (column, force) Lisp_Object column, force; { register int pos; register int col = current_column (); /* 92.9.9, 92.11.11 by K.Handa */ register int mc_bytes; /* end of patch */ register int goal; register int end; register int tab_width = XINT (current_buffer->tab_width); register int ctl_arrow = !NILP (current_buffer->ctl_arrow); register struct Lisp_Char_Table *dp = buffer_display_table (); int mc_flag = !NILP (current_buffer->mc_flag); /* 91.10.27 by K.Handa */ Lisp_Object val; int prev_col; int c; int next_boundary; if (tab_width <= 0 || tab_width > 1000) tab_width = 8; CHECK_NATNUM (column, 0); goal = XINT (column); pos = point; end = ZV; next_boundary = pos; /* If we're starting past the desired column, back up to beginning of line and scan from there. */ if (col > goal) { end = pos; pos = find_next_newline (pos, -1); col = 0; } while (pos < end) { while (pos == next_boundary) { pos = skip_invisible (pos, &next_boundary, end, Qnil); if (pos >= end) goto endloop; } /* Test reaching the goal column. We do this after skipping invisible characters, so that we put point before the character on which the cursor will appear. */ if (col >= goal) break; c = FETCH_CHAR (pos); if (dp != 0 && VECTORP (DISP_CHAR_VECTOR (dp, c))) { col += XVECTOR (DISP_CHAR_VECTOR (dp, c))->size; pos++; continue; } if (c == '\n') break; if (c == '\r' && EQ (current_buffer->selective_display, Qt)) break; /* 92.4.30, 93.5.22 by Y.Niibe */ #if 0 pos++; #endif if (c == '\t') { prev_col = col; col += tab_width; col = col / tab_width * tab_width; pos++; } else if (ctl_arrow && (c < 040 || c == 0177)) { col += 2; pos++; } else if (mc_flag && c > 0177) /* 91.10.27,92.9.9,92.11.11 by K.Handa */ { int next_pos_if_invalid = ++pos; if (c == LCCMP) /* 94.8.2 by K.Handa */ { int width = 0; while (NONASCII_P (c = FETCH_CHAR (pos))) { c -= 0x20; /* For ASCII, c == 0x80 and char_bytes[0x80] == 2 */ mc_bytes = char_bytes[c]; pos++; while (--mc_bytes && NONASCII_P (FETCH_CHAR (pos))) pos++; if (mc_bytes) { /* incomplete char */ pos = next_pos_if_invalid; break; } if (char_width[c] > width) width = char_width[c]; next_pos_if_invalid = pos; } col += width ? width : 4; } else if (LC_P(c)) { mc_bytes = char_bytes[c]; if (pos + mc_bytes -1 <= end) while (--mc_bytes && NONASCII_P (FETCH_CHAR (pos))) pos++; if (mc_bytes) col += 4, pos = next_pos_if_invalid; else col += char_width[c]; } else col += (ctl_arrow && c < 0200) ? 2 : 4; } else if (c < 040 || c >= 0177) { col += 4; pos++; } else col++, pos++; } endloop: SET_PT (pos); /* If a tab char made us overshoot, change it to spaces and scan through it again. */ if (!NILP (force) && col > goal && c == '\t' && prev_col < goal) { int old_point; del_range (point - 1, point); Findent_to (make_number (goal), Qnil); old_point = point; Findent_to (make_number (col), Qnil); SET_PT (old_point); /* Set the last_known... vars consistently. */ col = goal; } /* If line ends prematurely, add space to the end. */ if (col < goal && !NILP (force)) Findent_to (make_number (col = goal), Qnil); last_known_column = col; last_known_column_point = point; last_known_column_modified = MODIFF; XSETFASTINT (val, col); return val; } /* 93.5.22 Y.Niibe */ static int c_w_d[2]; /* c_width_on_point and int dir_on_point */ #define set_c_w_d(c_width,dir) c_w_d[0] = c_width, c_w_d[1] = dir int * char_width_dir_on (pt,buffer_dir) int pt, buffer_dir; { register int mc_bytes; register unsigned int c; int c_width, dir, p; if (pt >= ZV) { set_c_w_d (1, buffer_dir); return c_w_d; } c = FETCH_CHAR (pt); p = pt; if (c == '\n' || c == '\t') set_c_w_d (1, buffer_dir); else if (c >= 000 && c < 0200) set_c_w_d (1, LEFT_TO_RIGHT); else if (c == LCCMP) { p++; if (p >= ZV || !NONASCII_P (c = FETCH_CHAR (p))) set_c_w_d (1, LEFT_TO_RIGHT); else { p++; mc_bytes = char_bytes[c - 0x20]; if (pt + mc_bytes -1 <= ZV) while (--mc_bytes && NONASCII_P (FETCH_CHAR (p))) p++; if (mc_bytes) set_c_w_d (1, LEFT_TO_RIGHT); else { c_width = char_width[c - 0x20]; dir = char_direction[c - 0x20]; if (dir == DIRECTION_UNDEFINED) /* fetch extended leading char */ dir = char_direction[FETCH_CHAR (pt+2)]; set_c_w_d (c_width, dir); } } } else if (LC_P (c)) { p++; mc_bytes = char_bytes[c]; if (pt + mc_bytes -1 <= ZV) while (--mc_bytes && NONASCII_P (FETCH_CHAR (p))) p++; if (mc_bytes) set_c_w_d (1, LEFT_TO_RIGHT); c_width = char_width[c]; dir = char_direction[c]; if (dir == DIRECTION_UNDEFINED) /* fetch extended leading char */ dir = char_direction[FETCH_CHAR (pt+1)]; set_c_w_d (c_width, dir); } else set_c_w_d (1, LEFT_TO_RIGHT); return c_w_d; } /* end of patch */ /* compute_motion: compute buffer posn given screen posn and vice versa */ struct position val_compute_motion; /* Scan the current buffer forward from offset FROM, pretending that this is at line FROMVPOS, column FROMHPOS, until reaching buffer offset TO or line TOVPOS, column TOHPOS (whichever comes first), and return the ending buffer position and screen location. If we can't hit the requested column exactly (because of a tab or other multi-column character), overshoot. DID_MOTION is 1 if FROMHPOS has already accounted for overlay strings at FROM. This is the case if FROMVPOS and FROMVPOS came from an earlier call to compute_motion. The other common case is that FROMHPOS is zero and FROM is a position that "belongs" at column zero, but might be shifted by overlay strings; in this case DID_MOTION should be 0. WIDTH is the number of columns available to display text; compute_motion uses this to handle continuation lines and such. HSCROLL is the number of columns not being displayed at the left margin; this is usually taken from a window's hscroll member. TAB_OFFSET is the number of columns of the first tab that aren't being displayed, perhaps because of a continuation line or something. compute_motion returns a pointer to a struct position. The bufpos member gives the buffer position at the end of the scan, and hpos and vpos give its cartesian location. prevhpos is the column at which the character before bufpos started, and contin is non-zero if we reached the current line by continuing the previous. Note that FROMHPOS and TOHPOS should be expressed in real screen columns, taking HSCROLL and the truncation glyph at the left margin into account. That is, beginning-of-line moves you to the hpos -HSCROLL + (HSCROLL > 0). Note that FROMHPOS and TOHPOS should be expressed in real screen columns, taking HSCROLL and the truncation glyph at the left margin into account. That is, beginning-of-line moves you to the hpos -HSCROLL + (HSCROLL > 0). For example, to find the buffer position of column COL of line LINE of a certain window, pass the window's starting location as FROM and the window's upper-left coordinates as FROMVPOS and FROMHPOS. Pass the buffer's ZV as TO, to limit the scan to the end of the visible section of the buffer, and pass LINE and COL as TOVPOS and TOHPOS. When displaying in window w, a typical formula for WIDTH is: window_width - 1 - (has_vertical_scroll_bars ? FRAME_SCROLL_BAR_COLS (XFRAME (window->frame)) : (window_width + window_left != frame_width)) where window_width is XFASTINT (w->width), window_left is XFASTINT (w->left), has_vertical_scroll_bars is FRAME_HAS_VERTICAL_SCROLL_BARS (XFRAME (WINDOW_FRAME (window))) and frame_width = FRAME_WIDTH (XFRAME (window->frame)) Or you can let window_internal_width do this all for you, and write: window_internal_width (w) - 1 The `-1' accounts for the continuation-line backslashes; the rest accounts for window borders if the window is split horizontally, and the scroll bars if they are turned on. */ struct position * compute_motion (from, fromvpos, fromhpos, did_motion, to, tovpos, tohpos, width, hscroll, tab_offset, win, rev_hpos) int from, fromvpos, fromhpos, to, tovpos, tohpos; int did_motion; register int width; int hscroll, tab_offset; struct window *win; int rev_hpos; /* hpos in reverse text */ /* 92.8.2 Y.Niibe */ { register int hpos = fromhpos; register int vpos = fromvpos; register int pos; register unsigned int c; register int tab_width = XFASTINT (current_buffer->tab_width); register int ctl_arrow = !NILP (current_buffer->ctl_arrow); register struct Lisp_Char_Table *dp = window_display_table (win); int selective = (INTEGERP (current_buffer->selective_display) ? XINT (current_buffer->selective_display) : !NILP (current_buffer->selective_display) ? -1 : 0); int prev_vpos = vpos, prev_hpos = 0; int selective_rlen = (selective && dp && VECTORP (DISP_INVIS_VECTOR (dp)) ? XVECTOR (DISP_INVIS_VECTOR (dp))->size : selective && !NILP (current_buffer->selective_display_ellipses) ? 3: 0); /* The next location where the `invisible' property changes, or an overlay starts or ends. */ int next_boundary = from; /* For computing runs of characters with similar widths. Invariant: width_run_width is zero, or all the characters from width_run_start to width_run_end have a fixed width of width_run_width. */ int width_run_start = from; int width_run_end = from; int width_run_width = 0; Lisp_Object *width_table; Lisp_Object buffer; /* The next buffer pos where we should consult the width run cache. */ int next_width_run = from; Lisp_Object window; /* 92.9.9, 92.11.12 by K.Handa, 93.5.22 by Y.Niibe*/ register int mc_bytes; int last_mc = 0; /* 92.3.21 by K.Handa */ int last_char_width = 0; /* 94.8.2 by K.Handa */ int mc_flag = !NILP(current_buffer->mc_flag); /* 91.10.27 by K.Handa */ /* 92.4.1 by Y.Niibe */ int truncate = hscroll || (truncate_partial_width_windows && width + 1 < FRAME_WIDTH (XFRAME (WINDOW_FRAME (win)))) || !NILP (current_buffer->truncate_lines); /* 92.4.1 by Y.Niibe */ int lastpos; /* end of patch */ /* 92.8.2, 93.5.22 by Y.Niibe */ int display_direction = NILP (current_buffer->display_direction)? LEFT_TO_RIGHT: RIGHT_TO_LEFT; int vir_hpos; /* virtual hpos */ /* end of patch */ XSETBUFFER (buffer, current_buffer); XSETWINDOW (window, win); width_run_cache_on_off (); if (dp == buffer_display_table ()) width_table = (VECTORP (current_buffer->width_table) ? XVECTOR (current_buffer->width_table)->contents : 0); else /* If the window has its own display table, we can't use the width run cache, because that's based on the buffer's display table. */ width_table = 0; if (tab_width <= 0 || tab_width > 1000) tab_width = 8; pos = from; while (1) { while (pos == next_boundary) { /* If the caller says that the screen position came from an earlier call to compute_motion, then we've already accounted for the overlay strings at point. This is only true the first time through, so clear the flag after testing it. */ if (!did_motion) /* We need to skip past the overlay strings. Currently those strings must contain single-column printing characters; if we want to relax that restriction, something will have to be changed here. */ hpos += overlay_strings (pos, win, (char **)0); did_motion = 0; if (pos >= to) break; /* Advance POS past invisible characters (but not necessarily all that there are here), and store in next_boundary the next position where we need to call skip_invisible. */ pos = skip_invisible (pos, &next_boundary, to, window); } /* Handle right margin. */ if (hpos > width) /* 92.4.1, 93.4.8 by Y.Niibe */ { if (truncate) /* 92.4.1 by Y.Niibe */ { /* Truncating: skip to newline. */ pos = find_before_next_newline (pos, to, 1); hpos = width; /* If we just skipped next_boundary, loop around in the main while and handle it. */ if (pos >= next_boundary) next_boundary = pos + 1; rev_hpos = 0; /* 92.8.2 by Y.Niibe */ } else { /* Continuing. */ vpos += hpos / width; if (last_mc) { /* 91.10.27, 93.3.27 by K.Handa, 92.4.1 by Y.Niibe */ /* We have gone beyond right margin because of a char of multi column width. We display the whole char in the next line, which means that we should increase hpos for the char. */ hpos -= prev_hpos; tab_offset += prev_hpos; if (rev_hpos) rev_hpos = hpos; /* 92.8.2 by Y.Niibe */ } else { tab_offset += hpos - hpos % width; hpos %= width; rev_hpos = 0; /* 92.8.2 by Y.Niibe */ } } } /* Stop if past the target buffer position or screen position. */ if (pos >= to) break; if (vpos > tovpos || (vpos == tovpos && hpos >= tohpos)) break; prev_vpos = vpos; prev_hpos = hpos; /* Consult the width run cache to see if we can avoid inspecting the text character-by-character. */ if (current_buffer->width_run_cache && pos >= next_width_run) { int run_end; int common_width = region_cache_forward (current_buffer, current_buffer->width_run_cache, pos, &run_end); /* A width of zero means the character's width varies (like a tab), is meaningless (like a newline), or we just don't want to skip over it for some other reason. */ if (common_width != 0) { int run_end_hpos; /* Don't go past the final buffer posn the user requested. */ if (run_end > to) run_end = to; run_end_hpos = hpos + (run_end - pos) * common_width; /* Don't go past the final horizontal position the user requested. */ if (vpos == tovpos && run_end_hpos > tohpos) { run_end = pos + (tohpos - hpos) / common_width; run_end_hpos = hpos + (run_end - pos) * common_width; } /* Don't go past the margin. */ if (run_end_hpos >= width) { run_end = pos + (width - hpos) / common_width; run_end_hpos = hpos + (run_end - pos) * common_width; } hpos = run_end_hpos; if (run_end > pos) prev_hpos = hpos - common_width; pos = run_end; } next_width_run = run_end + 1; } /* We have to scan the text character-by-character. */ else { last_mc = 0; lastpos = pos; /* 92.4.1 by Y.Niibe */ last_char_width = 0; /* 94.8.2 by K.Handa */ c = FETCH_CHAR (pos); pos++; /* Perhaps add some info to the width_run_cache. */ if (current_buffer->width_run_cache) { /* Is this character part of the current run? If so, extend the run. */ if (pos - 1 == width_run_end && width_table[c] == width_run_width) width_run_end = pos; /* The previous run is over, since this is a character at a different position, or a different width. */ else { /* Have we accumulated a run to put in the cache? (Currently, we only cache runs of width == 1). */ if (width_run_start < width_run_end && width_run_width == 1) know_region_cache (current_buffer, current_buffer->width_run_cache, width_run_start, width_run_end); /* Start recording a new width run. */ width_run_width = width_table[c]; width_run_start = pos - 1; width_run_end = pos; } } if (dp != 0 && VECTORP (DISP_CHAR_VECTOR (dp, c))) hpos += XVECTOR (DISP_CHAR_VECTOR (dp, c))->size; else if (c >= 040 && c < 0177) /* 92.8.2, 93.5.22 by Y.Niibe */ { hpos++; if (display_direction == RIGHT_TO_LEFT) rev_hpos++; else rev_hpos = 0; } /* end of patch */ else if (c == '\t') { int tem = (hpos + tab_offset + hscroll - (hscroll > 0)) % tab_width; if (tem < 0) tem += tab_width; hpos += tab_width - tem; rev_hpos = 0; /* 93.5.22 by Y.Niibe */ } else if (c == '\n') { rev_hpos = 0; /* 92.8.2 by Y.Niibe */ if (selective > 0 && indented_beyond_p (pos, selective)) { /* Skip any number of invisible lines all at once */ do pos = find_before_next_newline (pos, to, 1) + 1; while (pos < to && indented_beyond_p (pos, selective)); /* Allow for the " ..." that is displayed for them. */ if (selective_rlen) { hpos += selective_rlen; if (hpos >= width) hpos = width; } --pos; /* We have skipped the invis text, but not the newline after. */ } else { /* A visible line. */ vpos++; hpos = 0; hpos -= hscroll; /* Count the truncation glyph on column 0 */ if (hscroll > 0) hpos++; tab_offset = 0; } } else if (c == CR && selective < 0) { rev_hpos = 0; /* 92.8.2 by Y.Niibe */ /* In selective display mode, everything from a ^M to the end of the line is invisible. Stop *before* the real newline. */ pos = find_before_next_newline (pos, to, 1); /* If we just skipped next_boundary, loop around in the main while and handle it. */ if (pos > next_boundary) next_boundary = pos; /* Allow for the " ..." that is displayed for them. */ if (selective_rlen) { hpos += selective_rlen; if (hpos >= width) hpos = width; } } /* 93.5.22 by Y.Niibe */ else if (mc_flag) /* 91.10.27, 92.3.21 by K.Handa */ { int next_pos_if_invalid = pos; int dir = display_direction; if (c == LCCMP) { /* We found start of comosite char. The next char should be LC embeded in the composite char. */ int c_width = 0; while (pos < to && NONASCII_P (c = FETCH_CHAR (pos))) { c -= 0x20; mc_bytes = char_bytes[c]; pos++; if (pos + mc_bytes -1 <= to) while (--mc_bytes && NONASCII_P (FETCH_CHAR (pos))) pos++; if (mc_bytes) { /* incomplete char */ pos = next_pos_if_invalid; break; } if ((dir = char_direction[c]) == DIRECTION_UNDEFINED) dir = char_direction[FETCH_CHAR (next_pos_if_invalid + 1)]; if (char_width[c] > c_width) c_width = char_width[c]; next_pos_if_invalid = pos; } if (c_width) last_mc = 1, last_char_width = c_width; else c_width = 4; hpos += c_width; if (dir != display_direction) rev_hpos += c_width; else rev_hpos = 0; } else if (LC_P(c)) /* 92.9.9 by K.Handa */ { /* We found start of multi-byte char. */ mc_bytes = char_bytes[c]; if (pos + mc_bytes -1 <= to) while (--mc_bytes && NONASCII_P (FETCH_CHAR (pos))) pos++; if (mc_bytes) { hpos += 4; pos = next_pos_if_invalid; if (display_direction == RIGHT_TO_LEFT) rev_hpos += 4; else rev_hpos = 0; } else { last_mc = 1; last_char_width = char_width[c]; hpos += char_width[c]; dir = char_direction[c]; if (dir == DIRECTION_UNDEFINED) /* fetch extended leading char */ dir = char_direction[FETCH_CHAR (next_pos_if_invalid)]; if (dir != display_direction) rev_hpos += char_width[c]; else rev_hpos = 0; } } else { hpos += (ctl_arrow && c < 0200) ? 2 : 4; if (display_direction == RIGHT_TO_LEFT) rev_hpos += (ctl_arrow && c < 0200) ? 2 : 4; else rev_hpos = 0; } /* pos--; /* since for-loop has pos++ */ } /* end of patch */ else /* 92.8.2 by Y.Niibe */ { hpos += (ctl_arrow && c < 0200) ? 2 : 4; if (display_direction == RIGHT_TO_LEFT) rev_hpos += (ctl_arrow && c < 0200) ? 2 : 4; else rev_hpos = 0; } /* end of patch */ } } /* 92.4.8 by Y.Niibe */ if (!truncate) { if (vpos > tovpos || (vpos == tovpos && hpos >= tohpos)) /* 93.4.8 by Y.Niibe */ { if (pos > from && prev_vpos != vpos && !(vpos == tovpos && 0 < tohpos)) { int len, c_prev; c_prev = FETCH_CHAR (lastpos); if (c_prev == '\n') len = 0; else if (mc_flag) { if (c_prev == LCCMP) { /* 92.11.12 by K.Handa, 93.5.22 by Y.Niibe */ if (pos > lastpos + 1) /* this check is enough */ len = last_char_width; else len = 1; } else if (LC_P (c_prev) && lastpos == pos - char_bytes[c_prev]) len = last_char_width; else len = 1; } else len = 1; if (prev_hpos + len > width) { hpos = 0; pos = lastpos; /* the value of prev_hpos is different from one which original method caluculate, but harmless */ rev_hpos =0; /* 92.8.2 by Y.Niibe */ } } } else if (hpos <= width && pos < ZV) { /* Here we check if the following char can be on the same line. */ int len, c_next; int pos_old = pos; c_next = FETCH_CHAR (pos); if (c_next == '\n' || (c_next == CR && selective < 0)) /* No visible char following. */ len = 0; else if (mc_flag) { if (c_next == LCCMP) { /* 92.11.15 by K.Handa, 93.5.22 by Y.Niibe */ /* Composite char is following. */ /* it is enough to validate the first character in composite LCN1 C11 ... C1n */ pos++; if (pos < ZV && NONASCII_P (c_next = FETCH_CHAR (pos))) { pos++; mc_bytes = char_bytes[c_next - 0x20]; if (pos + mc_bytes -1 <= ZV) while (--mc_bytes && NONASCII_P (FETCH_CHAR (pos))) pos++; if (mc_bytes) len = 1; else len = char_width[c_next - 0x20]; } else len = 1; pos = pos_old; } else if (LC_P (c_next)) { /* Multi-byte (not composite) char is following. */ pos++; mc_bytes = char_bytes[c_next]; if (pos + mc_bytes -1 <= ZV) while (--mc_bytes && NONASCII_P (FETCH_CHAR (pos))) pos++; if (mc_bytes) len = 1; else len = char_width[c_next]; pos = pos_old; } else len = 1; } else len = 1; if (hpos + len > width) { /* The following char can't be on the same line. */ tab_offset += hpos; vpos++; hpos = 0; rev_hpos =0; /* 92.8.2 by Y.Niibe */ } } } /* end of patch */ /* 92.8.2, 93.5.22 by Y.Niibe */ vir_hpos = hpos; if (mc_flag && pos < ZV) { int dir, c_width; int p, *ip; unsigned int old_c = c; c = FETCH_CHAR (pos); ip = char_width_dir_on (pos,display_direction); c_width = ip[0]; dir = ip[1]; if ((c != '\n') && (c != '\t') && dir != display_direction) { /* point is in reverse text */ int rest_rev_hpos_prev; int rest_rev_hpos; int pp; /* find end of reverse string */ for (p = pos, rest_rev_hpos = rest_rev_hpos_prev = 0; p < ZV;) { rest_rev_hpos_prev = rest_rev_hpos; c = FETCH_CHAR (p); if (c == '\t') break; if (c == '\n') break; if (c >= 040 && c < 0177) /* ASCII printable characters. */ if (display_direction == LEFT_TO_RIGHT) break; else { p++; rest_rev_hpos++; } else if (c == CR && selective < 0) break; else if (c == LCCMP) { p++; if (p >= ZV || !NONASCII_P (c = FETCH_CHAR (p))) if (display_direction == LEFT_TO_RIGHT) break; else rest_rev_hpos += 4; else { pp = p; p++; mc_bytes = char_bytes[c - 0x20]; if (p + mc_bytes -1 <= ZV) while (--mc_bytes && NONASCII_P (FETCH_CHAR (p))) p++; if (mc_bytes) if (display_direction == LEFT_TO_RIGHT) break; else { rest_rev_hpos += 4; p = pp; } else { dir = char_direction[c - 0x20]; if (dir == DIRECTION_UNDEFINED) /* fetch extended leading char */ dir = char_direction[FETCH_CHAR (pp+1)]; if (dir != display_direction) { rest_rev_hpos += char_width[c - 0x20]; while (p < ZV && NONASCII_P (c = FETCH_CHAR (p))) { pp = p; p++; mc_bytes = char_bytes[c-0x20]; if (p + mc_bytes -1 <= ZV) while (--mc_bytes && NONASCII_P (FETCH_CHAR (p))) p++; if (mc_bytes) { p = pp; break; } } } else break; } } } else if (LC_P(c)) { pp = ++p; mc_bytes = char_bytes[c]; if (p + mc_bytes -1 <= ZV) while (--mc_bytes && NONASCII_P (FETCH_CHAR (p))) p++; if (mc_bytes) /* invalid sequence --> left to right */ if (display_direction == LEFT_TO_RIGHT) break; else { rest_rev_hpos += 4; p = pp; } else { dir = char_direction[c]; if (dir == DIRECTION_UNDEFINED) /* fetch extended leading char */ dir = char_direction[FETCH_CHAR (pp)]; if (dir != display_direction) rest_rev_hpos += char_width[c]; else break; } } else if (display_direction == LEFT_TO_RIGHT) break; else { p++; rest_rev_hpos += (ctl_arrow && c < 0200) ? 2 : 4; } if (hpos + rest_rev_hpos > width) break; } if (rest_rev_hpos) { if (hpos + rest_rev_hpos <= width) hpos = hpos + rest_rev_hpos - rev_hpos - c_width; else hpos = hpos + rest_rev_hpos_prev - rev_hpos - c_width; } } c = old_c; } /* end of patch */ /* Remember any final width run in the cache. */ if (current_buffer->width_run_cache && width_run_width == 1 && width_run_start < width_run_end) know_region_cache (current_buffer, current_buffer->width_run_cache, width_run_start, width_run_end); val_compute_motion.bufpos = pos; val_compute_motion.hpos = hpos; val_compute_motion.vpos = vpos; val_compute_motion.prevhpos = prev_hpos; val_compute_motion.tab_offset = tab_offset; /* 92.4.1 Y.Niibe */ /* 92.8.2 by Y.Niibe */ val_compute_motion.rev_hpos = rev_hpos; val_compute_motion.vir_hpos = vir_hpos; /* end of patch */ /* Nonzero if have just continued a line */ val_compute_motion.contin = (pos != from && (val_compute_motion.vpos != prev_vpos) && c != '\n'); return &val_compute_motion; } #if 0 /* The doc string is too long for some compilers, but make-docfile can find it in this comment. */ DEFUN ("compute-motion", Ffoo, Sfoo, 7, 7, 0, "Scan through the current buffer, calculating screen position.\n\ Scan the current buffer forward from offset FROM,\n\ assuming it is at position FROMPOS--a cons of the form (HPOS . VPOS)--\n\ to position TO or position TOPOS--another cons of the form (HPOS . VPOS)--\n\ and return the ending buffer position and screen location.\n\ \n\ There are three additional arguments:\n\ \n\ WIDTH is the number of columns available to display text;\n\ this affects handling of continuation lines.\n\ This is usually the value returned by `window-width', less one (to allow\n\ for the continuation glyph).\n\ \n\ OFFSETS is either nil or a cons cell (HSCROLL . TAB-OFFSET).\n\ HSCROLL is the number of columns not being displayed at the left\n\ margin; this is usually taken from a window's hscroll member.\n\ TAB-OFFSET is the number of columns of the first tab that aren't\n\ being displayed, perhaps because the line was continued within it.\n\ If OFFSETS is nil, HSCROLL and TAB-OFFSET are assumed to be zero.\n\ \n\ WINDOW is the window to operate on. It is used to choose the display table;\n\ if it is showing the current buffer, it is used also for\n\ deciding which overlay properties apply.\n\ Note that `compute-motion' always operates on the current buffer.\n\ \n\ The value is a list of five elements:\n\ (POS HPOS VPOS PREVHPOS CONTIN)\n\ POS is the buffer position where the scan stopped.\n\ VPOS is the vertical position where the scan stopped.\n\ HPOS is the horizontal position where the scan stopped.\n\ \n\ PREVHPOS is the horizontal position one character back from POS.\n\ CONTIN is t if a line was continued after (or within) the previous character.\n\ \n\ For example, to find the buffer position of column COL of line LINE\n\ of a certain window, pass the window's starting location as FROM\n\ and the window's upper-left coordinates as FROMPOS.\n\ Pass the buffer's (point-max) as TO, to limit the scan to the end of the\n\ visible section of the buffer, and pass LINE and COL as TOPOS.") (from, frompos, to, topos, width, offsets, window) #endif DEFUN ("compute-motion", Fcompute_motion, Scompute_motion, 7, 7, 0, 0) (from, frompos, to, topos, width, offsets, window) Lisp_Object from, frompos, to, topos; Lisp_Object width, offsets, window; { Lisp_Object bufpos, hpos, vpos, prevhpos, contin; struct position *pos; int hscroll, tab_offset; CHECK_NUMBER_COERCE_MARKER (from, 0); CHECK_CONS (frompos, 0); CHECK_NUMBER (XCONS (frompos)->car, 0); CHECK_NUMBER (XCONS (frompos)->cdr, 0); CHECK_NUMBER_COERCE_MARKER (to, 0); CHECK_CONS (topos, 0); CHECK_NUMBER (XCONS (topos)->car, 0); CHECK_NUMBER (XCONS (topos)->cdr, 0); CHECK_NUMBER (width, 0); if (!NILP (offsets)) { CHECK_CONS (offsets, 0); CHECK_NUMBER (XCONS (offsets)->car, 0); CHECK_NUMBER (XCONS (offsets)->cdr, 0); hscroll = XINT (XCONS (offsets)->car); tab_offset = XINT (XCONS (offsets)->cdr); } else hscroll = tab_offset = 0; if (NILP (window)) window = Fselected_window (); else CHECK_LIVE_WINDOW (window, 0); pos = compute_motion (XINT (from), XINT (XCONS (frompos)->cdr), XINT (XCONS (frompos)->car), 0, XINT (to), XINT (XCONS (topos)->cdr), XINT (XCONS (topos)->car), XINT (width), hscroll, tab_offset, XWINDOW (window), 0); XSETFASTINT (bufpos, pos->bufpos); XSETINT (hpos, pos->hpos); XSETINT (vpos, pos->vpos); XSETINT (prevhpos, pos->prevhpos); return Fcons (bufpos, Fcons (hpos, Fcons (vpos, Fcons (prevhpos, Fcons (pos->contin ? Qt : Qnil, Qnil))))); } /* Return the column of position POS in window W's buffer. The result is rounded down to a multiple of the internal width of W. This is the amount of indentation of position POS that is not visible in its horizontal position in the window. */ int pos_tab_offset (w, pos) struct window *w; register int pos; { /* 92.4.1 by Y.Niibe - completely rewritten */ #ifndef MULE int opoint = PT; int col; #else struct position val; int prevline; #endif int width = window_internal_width (w) - 1; if (pos == BEGV || FETCH_CHAR (pos - 1) == '\n') return 0; #ifndef MULE TEMP_SET_PT (pos); col = current_column (); TEMP_SET_PT (opoint); return col - (col % width); #else prevline = find_next_newline (pos, -1); val = *compute_motion (prevline, 0, XINT (w->hscroll) ? 1 - XINT (w->hscroll) : 0, 0, pos, 1 << (BITS_PER_INT - 2), 0, width, XINT (w->hscroll), 0, w, 0); /* 92.8.2 Y.Niibe */ return val.tab_offset; #endif } /* Fvertical_motion and vmotion */ struct position val_vmotion; struct position * vmotion (from, vtarget, w) register int from, vtarget; struct window *w; { int width = window_internal_width (w) - 1; int hscroll = XINT (w->hscroll); struct position pos; /* vpos is cumulative vertical position, changed as from is changed */ register int vpos = 0; Lisp_Object prevline; register int first; int lmargin = hscroll > 0 ? 1 - hscroll : 0; int selective = (INTEGERP (current_buffer->selective_display) ? XINT (current_buffer->selective_display) : !NILP (current_buffer->selective_display) ? -1 : 0); Lisp_Object window; int start_hpos = 0; int did_motion; XSETWINDOW (window, w); /* The omission of the clause && marker_position (w->start) == BEG here is deliberate; I think we want to measure from the prompt position even if the minibuffer window has scrolled. */ if (EQ (window, minibuf_window)) { if (minibuf_prompt_width == 0 && STRINGP (minibuf_prompt)) minibuf_prompt_width = string_display_width (minibuf_prompt, Qnil, Qnil); start_hpos = minibuf_prompt_width; } if (vpos >= vtarget) { /* To move upward, go a line at a time until we have gone at least far enough */ first = 1; while ((vpos > vtarget || first) && from > BEGV) { Lisp_Object propval; XSETFASTINT (prevline, find_next_newline_no_quit (from - 1, -1)); while (XFASTINT (prevline) > BEGV && ((selective > 0 && indented_beyond_p (XFASTINT (prevline), selective)) #ifdef USE_TEXT_PROPERTIES /* watch out for newlines with `invisible' property */ || (propval = Fget_char_property (prevline, Qinvisible, window), TEXT_PROP_MEANS_INVISIBLE (propval)) #endif )) XSETFASTINT (prevline, find_next_newline_no_quit (XFASTINT (prevline) - 1, -1)); pos = *compute_motion (XFASTINT (prevline), 0, lmargin + (XFASTINT (prevline) == BEG ? start_hpos : 0), 0, from, 1 << (BITS_PER_INT - 2), 0, width, hscroll, 0, w, 0); /* 92.8.2 Y.Niibe */ vpos -= pos.vpos; first = 0; from = XFASTINT (prevline); } /* If we made exactly the desired vertical distance, or if we hit beginning of buffer, return point found */ if (vpos >= vtarget) { val_vmotion.bufpos = from; val_vmotion.vpos = vpos; val_vmotion.hpos = lmargin; val_vmotion.contin = 0; val_vmotion.prevhpos = 0; val_vmotion.tab_offset = 0; val_vmotion.vir_hpos = lmargin; val_vmotion.rev_hpos = 0; return &val_vmotion; } /* Otherwise find the correct spot by moving down */ } /* Moving downward is simple, but must calculate from beg of line to determine hpos of starting point */ if (from > BEGV && FETCH_CHAR (from - 1) != '\n') { Lisp_Object propval; XSETFASTINT (prevline, find_next_newline_no_quit (from, -1)); while (XFASTINT (prevline) > BEGV && ((selective > 0 && indented_beyond_p (XFASTINT (prevline), selective)) #ifdef USE_TEXT_PROPERTIES /* watch out for newlines with `invisible' property */ || (propval = Fget_char_property (prevline, Qinvisible, window), TEXT_PROP_MEANS_INVISIBLE (propval)) #endif )) XSETFASTINT (prevline, find_next_newline_no_quit (XFASTINT (prevline) - 1, -1)); pos = *compute_motion (XFASTINT (prevline), 0, lmargin + (XFASTINT (prevline) == BEG ? start_hpos : 0), 0, from, 1 << (BITS_PER_INT - 2), 0, width, hscroll, 0, w, 0); did_motion = 1; } else { pos.vir_hpos = lmargin + (from == BEG ? start_hpos : 0); /* 92.8.2 by Y.Niibe */ pos.vpos = 0; pos.tab_offset = 0; /* 92.4.1 by Y.Niibe */ pos.rev_hpos = 0; /* 92.8.2 by Y.Niibe */ did_motion = 0; } /* 92.4.1, 92.8.2 by Y.Niibe */ return compute_motion (from, vpos, pos.vir_hpos, did_motion, ZV, vtarget, - (1 << (BITS_PER_INT - 2)), width, hscroll, pos.tab_offset, w, pos.rev_hpos); } DEFUN ("vertical-motion", Fvertical_motion, Svertical_motion, 1, 2, 0, "Move point to start of the screen line LINES lines down.\n\ If LINES is negative, this means moving up.\n\ \n\ This function is an ordinary cursor motion function\n\ which calculates the new position based on how text would be displayed.\n\ The new position may be the start of a line,\n\ or just the start of a continuation line.\n\ The function returns number of screen lines moved over;\n\ that usually equals LINES, but may be closer to zero\n\ if beginning or end of buffer was reached.\n\ \n\ The optional second argument WINDOW specifies the window to use for\n\ parameters such as width, horizontal scrolling, and so on.\n\ The default is to use the selected window's parameters.\n\ \n\ `vertical-motion' always uses the current buffer,\n\ regardless of which buffer is displayed in WINDOW.\n\ This is consistent with other cursor motion functions\n\ and makes it possible to use `vertical-motion' in any buffer,\n\ whether or not it is currently displayed in some window.") (lines, window) Lisp_Object lines, window; { struct position pos; CHECK_NUMBER (lines, 0); if (! NILP (window)) CHECK_WINDOW (window, 0); else window = selected_window; pos = *vmotion (point, (int) XINT (lines), XWINDOW (window)); SET_PT (pos.bufpos); return make_number (pos.vpos); } /* file's initialization. */ syms_of_indent () { DEFVAR_BOOL ("indent-tabs-mode", &indent_tabs_mode, "*Indentation can insert tabs if this is non-nil.\n\ Setting this variable automatically makes it local to the current buffer."); indent_tabs_mode = 1; defsubr (&Scurrent_indentation); defsubr (&Sindent_to); defsubr (&Scurrent_column); defsubr (&Smove_to_column); defsubr (&Svertical_motion); defsubr (&Scompute_motion); }