2012-12-30 19:20:10 +00:00
|
|
|
/* $Id$ */
|
2005-07-24 19:57:51 +00:00
|
|
|
/**************************************************************************
|
2005-10-08 06:12:41 +00:00
|
|
|
* text.c *
|
2005-07-24 19:57:51 +00:00
|
|
|
* *
|
2009-12-02 03:36:22 +00:00
|
|
|
* Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, *
|
|
|
|
* 2008, 2009 Free Software Foundation, Inc. *
|
2005-07-24 19:57:51 +00:00
|
|
|
* This program is free software; you can redistribute it and/or modify *
|
|
|
|
* it under the terms of the GNU General Public License as published by *
|
2007-08-11 05:17:36 +00:00
|
|
|
* the Free Software Foundation; either version 3, or (at your option) *
|
2005-07-24 19:57:51 +00:00
|
|
|
* any later version. *
|
|
|
|
* *
|
|
|
|
* This program 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 this program; if not, write to the Free Software *
|
|
|
|
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA *
|
|
|
|
* 02110-1301, USA. *
|
|
|
|
* *
|
|
|
|
**************************************************************************/
|
|
|
|
|
2005-12-08 02:47:10 +00:00
|
|
|
#include "proto.h"
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-11-02 19:42:02 +00:00
|
|
|
#include <stdio.h>
|
2005-07-24 19:57:51 +00:00
|
|
|
#include <signal.h>
|
|
|
|
#include <unistd.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <fcntl.h>
|
|
|
|
#include <sys/wait.h>
|
|
|
|
#include <errno.h>
|
|
|
|
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-11-08 16:45:22 +00:00
|
|
|
static pid_t pid = -1;
|
2005-12-08 07:09:08 +00:00
|
|
|
/* The PID of the forked process in execute_command(), for use
|
|
|
|
* with the cancel_command() signal handler. */
|
2005-07-24 19:57:51 +00:00
|
|
|
#endif
|
|
|
|
#ifndef DISABLE_WRAPPING
|
2005-11-25 13:48:09 +00:00
|
|
|
static bool prepend_wrap = FALSE;
|
2005-07-24 19:57:51 +00:00
|
|
|
/* Should we prepend wrapped text to the next line? */
|
|
|
|
#endif
|
|
|
|
#ifndef DISABLE_JUSTIFY
|
|
|
|
static filestruct *jusbottom = NULL;
|
2005-09-20 19:46:39 +00:00
|
|
|
/* Pointer to the end of the justify buffer. */
|
2005-07-24 19:57:51 +00:00
|
|
|
#endif
|
|
|
|
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-12-08 07:09:08 +00:00
|
|
|
/* Toggle the mark. */
|
2005-07-25 02:41:59 +00:00
|
|
|
void do_mark(void)
|
|
|
|
{
|
|
|
|
openfile->mark_set = !openfile->mark_set;
|
|
|
|
if (openfile->mark_set) {
|
|
|
|
statusbar(_("Mark Set"));
|
|
|
|
openfile->mark_begin = openfile->current;
|
|
|
|
openfile->mark_begin_x = openfile->current_x;
|
|
|
|
} else {
|
2006-07-31 01:30:31 +00:00
|
|
|
statusbar(_("Mark Unset"));
|
2005-07-25 02:41:59 +00:00
|
|
|
openfile->mark_begin = NULL;
|
|
|
|
openfile->mark_begin_x = 0;
|
|
|
|
edit_refresh();
|
|
|
|
}
|
|
|
|
}
|
2005-11-15 03:17:35 +00:00
|
|
|
#endif /* !NANO_TINY */
|
2005-07-25 02:41:59 +00:00
|
|
|
|
2006-12-10 17:57:09 +00:00
|
|
|
/* Delete the character under the cursor. */
|
2005-07-25 02:41:59 +00:00
|
|
|
void do_delete(void)
|
|
|
|
{
|
2009-12-12 22:21:20 +00:00
|
|
|
size_t orig_lenpt = 0;
|
2005-07-25 02:41:59 +00:00
|
|
|
|
2008-07-10 20:13:04 +00:00
|
|
|
#ifndef NANO_TINY
|
2008-08-03 04:48:05 +00:00
|
|
|
update_undo(DEL);
|
2008-07-10 20:13:04 +00:00
|
|
|
#endif
|
|
|
|
|
2005-07-25 02:41:59 +00:00
|
|
|
assert(openfile->current != NULL && openfile->current->data != NULL && openfile->current_x <= strlen(openfile->current->data));
|
|
|
|
|
|
|
|
openfile->placewewant = xplustabs();
|
|
|
|
|
|
|
|
if (openfile->current->data[openfile->current_x] != '\0') {
|
|
|
|
int char_buf_len = parse_mbchar(openfile->current->data +
|
2005-07-26 06:13:45 +00:00
|
|
|
openfile->current_x, NULL, NULL);
|
2005-07-25 02:41:59 +00:00
|
|
|
size_t line_len = strlen(openfile->current->data +
|
|
|
|
openfile->current_x);
|
|
|
|
|
|
|
|
assert(openfile->current_x < strlen(openfile->current->data));
|
|
|
|
|
2009-12-12 22:21:20 +00:00
|
|
|
if (ISSET(SOFTWRAP))
|
|
|
|
orig_lenpt = strlenpt(openfile->current->data);
|
|
|
|
|
2005-07-25 02:41:59 +00:00
|
|
|
/* Let's get dangerous. */
|
|
|
|
charmove(&openfile->current->data[openfile->current_x],
|
|
|
|
&openfile->current->data[openfile->current_x +
|
|
|
|
char_buf_len], line_len - char_buf_len + 1);
|
|
|
|
|
|
|
|
null_at(&openfile->current->data, openfile->current_x +
|
|
|
|
line_len - char_buf_len);
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-25 02:41:59 +00:00
|
|
|
if (openfile->mark_set && openfile->mark_begin ==
|
|
|
|
openfile->current && openfile->current_x <
|
|
|
|
openfile->mark_begin_x)
|
|
|
|
openfile->mark_begin_x -= char_buf_len;
|
|
|
|
#endif
|
|
|
|
openfile->totsize--;
|
2005-11-03 21:08:39 +00:00
|
|
|
} else if (openfile->current != openfile->filebot) {
|
2005-07-25 02:41:59 +00:00
|
|
|
filestruct *foo = openfile->current->next;
|
|
|
|
|
|
|
|
assert(openfile->current_x == strlen(openfile->current->data));
|
|
|
|
|
|
|
|
/* If we're deleting at the end of a line, we need to call
|
|
|
|
* edit_refresh(). */
|
|
|
|
if (openfile->current->data[openfile->current_x] == '\0')
|
2009-12-12 22:21:20 +00:00
|
|
|
edit_refresh_needed = TRUE;
|
2005-07-25 02:41:59 +00:00
|
|
|
|
|
|
|
openfile->current->data = charealloc(openfile->current->data,
|
|
|
|
openfile->current_x + strlen(foo->data) + 1);
|
|
|
|
strcpy(openfile->current->data + openfile->current_x,
|
|
|
|
foo->data);
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-25 02:41:59 +00:00
|
|
|
if (openfile->mark_set && openfile->mark_begin ==
|
|
|
|
openfile->current->next) {
|
|
|
|
openfile->mark_begin = openfile->current;
|
|
|
|
openfile->mark_begin_x += openfile->current_x;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
if (openfile->filebot == foo)
|
|
|
|
openfile->filebot = openfile->current;
|
|
|
|
|
|
|
|
unlink_node(foo);
|
|
|
|
delete_node(foo);
|
|
|
|
renumber(openfile->current);
|
|
|
|
openfile->totsize--;
|
2005-11-03 21:08:39 +00:00
|
|
|
|
2005-11-05 17:35:44 +00:00
|
|
|
/* If the NO_NEWLINES flag isn't set, and text has been added to
|
|
|
|
* the magicline as a result of deleting at the end of the line
|
2005-11-09 00:08:29 +00:00
|
|
|
* before filebot, add a new magicline. */
|
2005-11-05 17:35:44 +00:00
|
|
|
if (!ISSET(NO_NEWLINES) && openfile->current ==
|
|
|
|
openfile->filebot && openfile->current->data[0] != '\0')
|
2005-11-03 21:08:39 +00:00
|
|
|
new_magicline();
|
2005-07-25 02:41:59 +00:00
|
|
|
} else
|
|
|
|
return;
|
|
|
|
|
2009-12-12 22:21:20 +00:00
|
|
|
if (ISSET(SOFTWRAP) && edit_refresh_needed == FALSE)
|
|
|
|
if (strlenpt(openfile->current->data) / COLS != orig_lenpt / COLS)
|
|
|
|
edit_refresh_needed = TRUE;
|
|
|
|
|
2005-11-09 00:08:29 +00:00
|
|
|
set_modified();
|
2005-07-25 02:41:59 +00:00
|
|
|
|
2009-12-12 22:21:20 +00:00
|
|
|
if (edit_refresh_needed == FALSE)
|
2005-07-25 02:41:59 +00:00
|
|
|
update_line(openfile->current, openfile->current_x);
|
|
|
|
}
|
|
|
|
|
2005-12-31 21:22:54 +00:00
|
|
|
/* Backspace over one character. That is, move the cursor left one
|
2006-11-08 13:05:50 +00:00
|
|
|
* character, and then delete the character under the cursor. */
|
2005-07-25 02:41:59 +00:00
|
|
|
void do_backspace(void)
|
|
|
|
{
|
|
|
|
if (openfile->current != openfile->fileage ||
|
|
|
|
openfile->current_x > 0) {
|
2005-09-13 04:53:44 +00:00
|
|
|
do_left();
|
2005-07-25 02:41:59 +00:00
|
|
|
do_delete();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-12-08 07:09:08 +00:00
|
|
|
/* Insert a tab. If the TABS_TO_SPACES flag is set, insert the number
|
|
|
|
* of spaces that a tab would normally take up. */
|
2005-07-25 02:41:59 +00:00
|
|
|
void do_tab(void)
|
|
|
|
{
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-25 02:41:59 +00:00
|
|
|
if (ISSET(TABS_TO_SPACES)) {
|
|
|
|
char *output;
|
2005-10-07 15:57:48 +00:00
|
|
|
size_t output_len = 0, new_pww = xplustabs();
|
2005-07-25 02:41:59 +00:00
|
|
|
|
|
|
|
do {
|
|
|
|
new_pww++;
|
|
|
|
output_len++;
|
|
|
|
} while (new_pww % tabsize != 0);
|
|
|
|
|
|
|
|
output = charalloc(output_len + 1);
|
|
|
|
|
|
|
|
charset(output, ' ', output_len);
|
|
|
|
output[output_len] = '\0';
|
|
|
|
|
|
|
|
do_output(output, output_len, TRUE);
|
|
|
|
|
|
|
|
free(output);
|
|
|
|
} else {
|
|
|
|
#endif
|
2009-11-29 06:13:22 +00:00
|
|
|
do_output((char *) "\t", 1, TRUE);
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-25 02:41:59 +00:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2006-04-28 13:19:56 +00:00
|
|
|
#ifndef NANO_TINY
|
2007-01-11 22:54:55 +00:00
|
|
|
/* Indent or unindent the current line (or, if the mark is on, all lines
|
|
|
|
* covered by the mark) len columns, depending on whether len is
|
|
|
|
* positive or negative. If the TABS_TO_SPACES flag is set, indent or
|
|
|
|
* unindent by len spaces. Otherwise, indent or unindent by (len /
|
|
|
|
* tabsize) tabs and (len % tabsize) spaces. */
|
2006-07-05 18:42:22 +00:00
|
|
|
void do_indent(ssize_t cols)
|
2006-04-28 13:19:56 +00:00
|
|
|
{
|
|
|
|
bool indent_changed = FALSE;
|
|
|
|
/* Whether any indenting or unindenting was done. */
|
|
|
|
bool unindent = FALSE;
|
|
|
|
/* Whether we're unindenting text. */
|
2006-05-05 15:41:43 +00:00
|
|
|
char *line_indent = NULL;
|
2006-04-28 13:19:56 +00:00
|
|
|
/* The text added to each line in order to indent it. */
|
2006-05-05 15:41:43 +00:00
|
|
|
size_t line_indent_len = 0;
|
2006-04-28 13:19:56 +00:00
|
|
|
/* The length of the text added to each line in order to indent
|
|
|
|
* it. */
|
|
|
|
filestruct *top, *bot, *f;
|
|
|
|
size_t top_x, bot_x;
|
|
|
|
|
|
|
|
assert(openfile->current != NULL && openfile->current->data != NULL);
|
|
|
|
|
2006-05-01 17:14:25 +00:00
|
|
|
/* If cols is zero, get out. */
|
|
|
|
if (cols == 0)
|
2006-04-28 13:19:56 +00:00
|
|
|
return;
|
|
|
|
|
2014-04-04 20:45:28 +00:00
|
|
|
/* If cols is negative, make it positive and set unindent to TRUE. */
|
2006-05-01 17:14:25 +00:00
|
|
|
if (cols < 0) {
|
|
|
|
cols = -cols;
|
2006-04-28 13:19:56 +00:00
|
|
|
unindent = TRUE;
|
|
|
|
/* Otherwise, we're indenting, in which case the file will always be
|
|
|
|
* modified, so set indent_changed to TRUE. */
|
|
|
|
} else
|
|
|
|
indent_changed = TRUE;
|
|
|
|
|
2006-07-05 18:42:22 +00:00
|
|
|
/* If the mark is on, use all lines covered by the mark. */
|
|
|
|
if (openfile->mark_set)
|
|
|
|
mark_order((const filestruct **)&top, &top_x,
|
|
|
|
(const filestruct **)&bot, &bot_x, NULL);
|
|
|
|
/* Otherwise, use the current line. */
|
|
|
|
else {
|
|
|
|
top = openfile->current;
|
|
|
|
bot = top;
|
|
|
|
}
|
2006-04-28 13:19:56 +00:00
|
|
|
|
2006-05-05 15:41:43 +00:00
|
|
|
if (!unindent) {
|
|
|
|
/* Set up the text we'll be using as indentation. */
|
|
|
|
line_indent = charalloc(cols + 1);
|
2006-04-28 13:19:56 +00:00
|
|
|
|
2006-05-05 15:41:43 +00:00
|
|
|
if (ISSET(TABS_TO_SPACES)) {
|
|
|
|
/* Set the indentation to cols spaces. */
|
|
|
|
charset(line_indent, ' ', cols);
|
|
|
|
line_indent_len = cols;
|
|
|
|
} else {
|
|
|
|
/* Set the indentation to (cols / tabsize) tabs and (cols %
|
|
|
|
* tabsize) spaces. */
|
|
|
|
size_t num_tabs = cols / tabsize;
|
|
|
|
size_t num_spaces = cols % tabsize;
|
2006-04-28 13:19:56 +00:00
|
|
|
|
2006-05-05 15:41:43 +00:00
|
|
|
charset(line_indent, '\t', num_tabs);
|
|
|
|
charset(line_indent + num_tabs, ' ', num_spaces);
|
2006-04-28 13:19:56 +00:00
|
|
|
|
2006-05-05 15:41:43 +00:00
|
|
|
line_indent_len = num_tabs + num_spaces;
|
|
|
|
}
|
2006-04-28 13:19:56 +00:00
|
|
|
|
2006-05-05 15:41:43 +00:00
|
|
|
line_indent[line_indent_len] = '\0';
|
|
|
|
}
|
2006-04-28 13:19:56 +00:00
|
|
|
|
2006-07-05 18:42:22 +00:00
|
|
|
/* Go through each line of the text. */
|
2006-04-28 13:19:56 +00:00
|
|
|
for (f = top; f != bot->next; f = f->next) {
|
|
|
|
size_t line_len = strlen(f->data);
|
2006-05-01 16:48:12 +00:00
|
|
|
size_t indent_len = indent_length(f->data);
|
2006-04-28 13:19:56 +00:00
|
|
|
|
2006-05-05 15:41:43 +00:00
|
|
|
if (!unindent) {
|
|
|
|
/* If we're indenting, add the characters in line_indent to
|
|
|
|
* the beginning of the non-whitespace text of this line. */
|
|
|
|
f->data = charealloc(f->data, line_len +
|
|
|
|
line_indent_len + 1);
|
|
|
|
charmove(&f->data[indent_len + line_indent_len],
|
|
|
|
&f->data[indent_len], line_len - indent_len + 1);
|
|
|
|
strncpy(f->data + indent_len, line_indent, line_indent_len);
|
|
|
|
openfile->totsize += line_indent_len;
|
|
|
|
|
|
|
|
/* Keep track of the change in the current line. */
|
2006-07-05 18:42:22 +00:00
|
|
|
if (openfile->mark_set && f == openfile->mark_begin &&
|
|
|
|
openfile->mark_begin_x >= indent_len)
|
2006-05-05 15:41:43 +00:00
|
|
|
openfile->mark_begin_x += line_indent_len;
|
|
|
|
|
|
|
|
if (f == openfile->current && openfile->current_x >=
|
|
|
|
indent_len)
|
|
|
|
openfile->current_x += line_indent_len;
|
|
|
|
|
|
|
|
/* If the NO_NEWLINES flag isn't set, and this is the
|
|
|
|
* magicline, add a new magicline. */
|
|
|
|
if (!ISSET(NO_NEWLINES) && f == openfile->filebot)
|
|
|
|
new_magicline();
|
|
|
|
} else {
|
2006-05-01 16:48:12 +00:00
|
|
|
size_t indent_col = strnlenpt(f->data, indent_len);
|
2006-05-05 15:41:43 +00:00
|
|
|
/* The length in columns of the indentation on this
|
|
|
|
* line. */
|
2006-05-01 16:48:12 +00:00
|
|
|
|
2006-05-01 17:14:25 +00:00
|
|
|
if (cols <= indent_col) {
|
|
|
|
size_t indent_new = actual_x(f->data, indent_col -
|
|
|
|
cols);
|
2006-05-06 14:37:33 +00:00
|
|
|
/* The length of the indentation remaining on
|
|
|
|
* this line after we unindent. */
|
2006-05-01 16:48:12 +00:00
|
|
|
size_t indent_shift = indent_len - indent_new;
|
2006-05-06 14:37:33 +00:00
|
|
|
/* The change in the indentation on this line
|
|
|
|
* after we unindent. */
|
2006-04-28 13:19:56 +00:00
|
|
|
|
2006-05-01 17:14:25 +00:00
|
|
|
/* If we're unindenting, and there's at least cols
|
2006-05-01 16:48:12 +00:00
|
|
|
* columns' worth of indentation at the beginning of the
|
|
|
|
* non-whitespace text of this line, remove it. */
|
|
|
|
charmove(&f->data[indent_new], &f->data[indent_len],
|
|
|
|
line_len - indent_shift - indent_new + 1);
|
|
|
|
null_at(&f->data, line_len - indent_shift + 1);
|
|
|
|
openfile->totsize -= indent_shift;
|
2006-04-28 13:19:56 +00:00
|
|
|
|
2006-04-29 15:44:58 +00:00
|
|
|
/* Keep track of the change in the current line. */
|
2006-07-05 18:42:22 +00:00
|
|
|
if (openfile->mark_set && f == openfile->mark_begin &&
|
2006-05-05 14:22:42 +00:00
|
|
|
openfile->mark_begin_x > indent_new) {
|
|
|
|
if (openfile->mark_begin_x <= indent_len)
|
|
|
|
openfile->mark_begin_x = indent_new;
|
|
|
|
else
|
|
|
|
openfile->mark_begin_x -= indent_shift;
|
|
|
|
}
|
2006-04-28 13:19:56 +00:00
|
|
|
|
2006-05-03 12:59:05 +00:00
|
|
|
if (f == openfile->current && openfile->current_x >
|
2006-05-05 14:22:42 +00:00
|
|
|
indent_new) {
|
|
|
|
if (openfile->current_x <= indent_len)
|
|
|
|
openfile->current_x = indent_new;
|
|
|
|
else
|
|
|
|
openfile->current_x -= indent_shift;
|
|
|
|
}
|
2006-04-29 16:11:21 +00:00
|
|
|
|
2006-04-28 13:19:56 +00:00
|
|
|
/* We've unindented, so set indent_changed to TRUE. */
|
|
|
|
if (!indent_changed)
|
|
|
|
indent_changed = TRUE;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-05-05 15:41:43 +00:00
|
|
|
if (!unindent)
|
2006-05-05 15:43:52 +00:00
|
|
|
/* Clean up. */
|
2006-05-05 15:41:43 +00:00
|
|
|
free(line_indent);
|
2006-04-28 13:19:56 +00:00
|
|
|
|
|
|
|
if (indent_changed) {
|
|
|
|
/* Mark the file as modified. */
|
|
|
|
set_modified();
|
|
|
|
|
|
|
|
/* Update the screen. */
|
2009-02-06 03:41:02 +00:00
|
|
|
edit_refresh_needed = TRUE;
|
2006-04-28 13:19:56 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-07-05 18:42:22 +00:00
|
|
|
/* Indent the current line, or all lines covered by the mark if the mark
|
|
|
|
* is on, tabsize columns. */
|
|
|
|
void do_indent_void(void)
|
2006-04-28 13:19:56 +00:00
|
|
|
{
|
2006-07-05 18:42:22 +00:00
|
|
|
do_indent(tabsize);
|
2006-04-28 13:19:56 +00:00
|
|
|
}
|
|
|
|
|
2006-07-05 18:42:22 +00:00
|
|
|
/* Unindent the current line, or all lines covered by the mark if the
|
|
|
|
* mark is on, tabsize columns. */
|
|
|
|
void do_unindent(void)
|
2006-04-28 13:19:56 +00:00
|
|
|
{
|
2006-07-05 18:42:22 +00:00
|
|
|
do_indent(-tabsize);
|
2006-04-28 13:19:56 +00:00
|
|
|
}
|
2008-07-10 20:13:04 +00:00
|
|
|
|
2014-04-04 20:45:28 +00:00
|
|
|
|
|
|
|
/* Undo a cut, or redo an uncut. */
|
2008-09-16 21:35:19 +00:00
|
|
|
void undo_cut(undo *u)
|
|
|
|
{
|
2014-04-04 20:45:28 +00:00
|
|
|
/* If we cut the magicline, we may as well not crash. :/ */
|
2009-07-27 04:16:44 +00:00
|
|
|
if (!u->cutbuffer)
|
|
|
|
return;
|
2008-09-16 21:35:19 +00:00
|
|
|
|
2009-07-27 04:16:44 +00:00
|
|
|
cutbuffer = copy_filestruct(u->cutbuffer);
|
|
|
|
|
2014-04-04 20:45:28 +00:00
|
|
|
/* Compute cutbottom for the uncut using our copy. */
|
2009-07-27 04:16:44 +00:00
|
|
|
for (cutbottom = cutbuffer; cutbottom->next != NULL; cutbottom = cutbottom->next)
|
|
|
|
;
|
2008-09-16 21:35:19 +00:00
|
|
|
|
2014-04-04 20:45:28 +00:00
|
|
|
/* Get to where we need to uncut from. */
|
2009-07-27 04:16:44 +00:00
|
|
|
if (u->mark_set && u->mark_begin_lineno < u->lineno)
|
|
|
|
do_gotolinecolumn(u->mark_begin_lineno, u->mark_begin_x+1, FALSE, FALSE, FALSE, FALSE);
|
|
|
|
else
|
|
|
|
do_gotolinecolumn(u->lineno, u->begin+1, FALSE, FALSE, FALSE, FALSE);
|
2008-09-16 21:35:19 +00:00
|
|
|
|
2009-07-27 04:16:44 +00:00
|
|
|
copy_from_filestruct(cutbuffer, cutbottom);
|
|
|
|
free_filestruct(cutbuffer);
|
|
|
|
cutbuffer = NULL;
|
2008-09-16 21:35:19 +00:00
|
|
|
|
|
|
|
}
|
|
|
|
|
2014-04-04 20:45:28 +00:00
|
|
|
/* Redo a cut, or undo an uncut. */
|
2008-09-16 21:35:19 +00:00
|
|
|
void redo_cut(undo *u) {
|
|
|
|
int i;
|
2008-10-14 04:34:56 +00:00
|
|
|
filestruct *t, *c;
|
2008-09-16 21:35:19 +00:00
|
|
|
|
2014-04-04 20:45:28 +00:00
|
|
|
/* If we cut the magicline, we may as well not crash. :/ */
|
2009-07-27 04:16:44 +00:00
|
|
|
if (!u->cutbuffer)
|
|
|
|
return;
|
|
|
|
|
|
|
|
do_gotolinecolumn(u->lineno, u->begin+1, FALSE, FALSE, FALSE, FALSE);
|
|
|
|
openfile->mark_set = u->mark_set;
|
|
|
|
if (cutbuffer)
|
|
|
|
free(cutbuffer);
|
|
|
|
cutbuffer = NULL;
|
|
|
|
|
2014-04-04 20:45:28 +00:00
|
|
|
/* Move ahead the same # lines we had if a marked cut. */
|
2009-07-27 04:16:44 +00:00
|
|
|
if (u->mark_set) {
|
|
|
|
for (i = 1, t = openfile->fileage; i != u->mark_begin_lineno; i++)
|
|
|
|
t = t->next;
|
|
|
|
openfile->mark_begin = t;
|
|
|
|
} else if (!u->to_end) {
|
2014-04-04 20:45:28 +00:00
|
|
|
/* Here we have a regular old potentially multi-line ^K cut.
|
|
|
|
* We'll need to trick nano into thinking it's a marked cut,
|
|
|
|
* to cut more than one line again. */
|
2009-07-27 04:16:44 +00:00
|
|
|
for (c = u->cutbuffer, t = openfile->current; c->next != NULL && t->next != NULL; ) {
|
2008-09-16 21:35:19 +00:00
|
|
|
|
|
|
|
#ifdef DEBUG
|
2009-11-11 06:00:33 +00:00
|
|
|
fprintf(stderr, "Advancing, lineno = %lu, data = \"%s\"\n", (unsigned long) t->lineno, t->data);
|
2008-09-16 21:35:19 +00:00
|
|
|
#endif
|
2009-07-27 04:16:44 +00:00
|
|
|
c = c->next;
|
|
|
|
t = t->next;
|
|
|
|
}
|
|
|
|
openfile->mark_begin = t;
|
2014-03-17 21:36:37 +00:00
|
|
|
openfile->mark_begin_x = 0;
|
2009-07-27 04:16:44 +00:00
|
|
|
openfile->mark_set = TRUE;
|
|
|
|
}
|
2008-09-16 21:35:19 +00:00
|
|
|
|
2009-07-27 04:16:44 +00:00
|
|
|
openfile->mark_begin_x = u->mark_begin_x;
|
|
|
|
do_cut_text(FALSE, u->to_end, TRUE);
|
|
|
|
openfile->mark_set = FALSE;
|
|
|
|
openfile->mark_begin = NULL;
|
|
|
|
openfile->mark_begin_x = 0;
|
|
|
|
edit_refresh_needed = TRUE;
|
2008-09-16 21:35:19 +00:00
|
|
|
}
|
|
|
|
|
2014-04-04 20:45:28 +00:00
|
|
|
/* Undo the last thing(s) we did. */
|
2008-07-10 20:13:04 +00:00
|
|
|
void do_undo(void)
|
|
|
|
{
|
|
|
|
undo *u = openfile->current_undo;
|
2008-08-02 22:31:01 +00:00
|
|
|
filestruct *f = openfile->current, *t;
|
2008-07-10 20:13:04 +00:00
|
|
|
int len = 0;
|
2008-07-31 04:24:04 +00:00
|
|
|
char *undidmsg, *data;
|
2008-08-03 04:48:05 +00:00
|
|
|
filestruct *oldcutbuffer = cutbuffer, *oldcutbottom = cutbottom;
|
2008-07-10 20:13:04 +00:00
|
|
|
|
|
|
|
if (!u) {
|
|
|
|
statusbar(_("Nothing in undo buffer!"));
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (u->lineno <= f->lineno)
|
|
|
|
for (; f->prev != NULL && f->lineno != u->lineno; f = f->prev)
|
|
|
|
;
|
|
|
|
else
|
|
|
|
for (; f->next != NULL && f->lineno != u->lineno; f = f->next)
|
|
|
|
;
|
|
|
|
if (f->lineno != u->lineno) {
|
2014-02-23 10:12:50 +00:00
|
|
|
statusbar(_("Internal error: can't match line %d. Please save your work."), u->lineno);
|
2008-07-10 20:13:04 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
#ifdef DEBUG
|
|
|
|
fprintf(stderr, "data we're about to undo = \"%s\"\n", f->data);
|
|
|
|
fprintf(stderr, "Undo running for type %d\n", u->type);
|
|
|
|
#endif
|
|
|
|
|
2008-07-13 16:44:19 +00:00
|
|
|
openfile->current_x = u->begin;
|
2008-07-10 20:13:04 +00:00
|
|
|
switch(u->type) {
|
|
|
|
case ADD:
|
2008-07-31 04:24:04 +00:00
|
|
|
undidmsg = _("text add");
|
2008-07-10 20:13:04 +00:00
|
|
|
len = strlen(f->data) - strlen(u->strdata) + 1;
|
|
|
|
data = charalloc(len);
|
|
|
|
strncpy(data, f->data, u->begin);
|
|
|
|
strcpy(&data[u->begin], &f->data[u->begin + strlen(u->strdata)]);
|
|
|
|
free(f->data);
|
|
|
|
f->data = data;
|
|
|
|
break;
|
|
|
|
case DEL:
|
2008-07-31 04:24:04 +00:00
|
|
|
undidmsg = _("text delete");
|
2008-07-10 20:13:04 +00:00
|
|
|
len = strlen(f->data) + strlen(u->strdata) + 1;
|
|
|
|
data = charalloc(len);
|
|
|
|
|
|
|
|
strncpy(data, f->data, u->begin);
|
|
|
|
strcpy(&data[u->begin], u->strdata);
|
|
|
|
strcpy(&data[u->begin + strlen(u->strdata)], &f->data[u->begin]);
|
|
|
|
free(f->data);
|
|
|
|
f->data = data;
|
2011-02-07 14:45:56 +00:00
|
|
|
if (u->xflags == UNdel_backspace)
|
2008-07-14 07:18:22 +00:00
|
|
|
openfile->current_x += strlen(u->strdata);
|
2008-07-10 20:13:04 +00:00
|
|
|
break;
|
2009-12-03 03:12:00 +00:00
|
|
|
#ifndef DISABLE_WRAPPING
|
2008-07-10 20:13:04 +00:00
|
|
|
case SPLIT:
|
2009-04-21 05:34:08 +00:00
|
|
|
undidmsg = _("line wrap");
|
2009-11-29 06:13:22 +00:00
|
|
|
f->data = (char *) nrealloc(f->data, strlen(f->data) + strlen(u->strdata) + 1);
|
2009-04-12 06:13:16 +00:00
|
|
|
strcpy(&f->data[strlen(f->data) - 1], u->strdata);
|
2009-04-29 04:43:58 +00:00
|
|
|
if (u->strdata2 != NULL)
|
|
|
|
f->next->data = mallocstrcpy(f->next->data, u->strdata2);
|
|
|
|
else {
|
2009-03-26 01:01:48 +00:00
|
|
|
filestruct *foo = openfile->current->next;
|
|
|
|
unlink_node(foo);
|
|
|
|
delete_node(foo);
|
2008-07-10 20:13:04 +00:00
|
|
|
}
|
2008-07-14 07:18:22 +00:00
|
|
|
renumber(f);
|
2008-07-10 20:13:04 +00:00
|
|
|
break;
|
2014-04-04 20:45:28 +00:00
|
|
|
#endif /* !DISABLE_WRAPPING */
|
2008-07-10 20:13:04 +00:00
|
|
|
case UNSPLIT:
|
2008-07-31 04:24:04 +00:00
|
|
|
undidmsg = _("line join");
|
2008-07-10 20:13:04 +00:00
|
|
|
t = make_new_node(f);
|
|
|
|
t->data = mallocstrcpy(NULL, u->strdata);
|
|
|
|
data = mallocstrncpy(NULL, f->data, u->begin);
|
|
|
|
data[u->begin] = '\0';
|
|
|
|
free(f->data);
|
|
|
|
f->data = data;
|
|
|
|
splice_node(f, t, f->next);
|
2008-07-14 07:18:22 +00:00
|
|
|
renumber(f);
|
2008-07-10 20:13:04 +00:00
|
|
|
break;
|
2008-07-31 04:24:04 +00:00
|
|
|
case CUT:
|
|
|
|
undidmsg = _("text cut");
|
2008-09-16 21:35:19 +00:00
|
|
|
undo_cut(u);
|
|
|
|
break;
|
|
|
|
case UNCUT:
|
|
|
|
undidmsg = _("text uncut");
|
|
|
|
redo_cut(u);
|
2008-07-31 04:24:04 +00:00
|
|
|
break;
|
2009-04-21 05:34:08 +00:00
|
|
|
case ENTER:
|
|
|
|
undidmsg = _("line break");
|
|
|
|
if (f->next) {
|
2009-07-12 03:36:58 +00:00
|
|
|
filestruct *foo = f->next;
|
2009-11-29 06:13:22 +00:00
|
|
|
f->data = (char *) nrealloc(f->data, strlen(f->data) + strlen(f->next->data) + 1);
|
2009-04-21 05:34:08 +00:00
|
|
|
strcat(f->data, f->next->data);
|
|
|
|
unlink_node(foo);
|
|
|
|
delete_node(foo);
|
|
|
|
}
|
|
|
|
break;
|
2008-08-03 04:48:05 +00:00
|
|
|
case INSERT:
|
|
|
|
undidmsg = _("text insert");
|
|
|
|
cutbuffer = NULL;
|
|
|
|
cutbottom = NULL;
|
2014-04-04 20:45:28 +00:00
|
|
|
/* When we updated mark_begin_lineno in update_undo, it was effectively
|
|
|
|
* how many lines were inserted due to being partitioned before read_file
|
|
|
|
* was called. So we add its value here. */
|
2008-08-03 04:48:05 +00:00
|
|
|
openfile->mark_begin = fsfromline(u->lineno + u->mark_begin_lineno - 1);
|
|
|
|
openfile->mark_begin_x = 0;
|
|
|
|
openfile->mark_set = TRUE;
|
|
|
|
do_gotolinecolumn(u->lineno, u->begin+1, FALSE, FALSE, FALSE, FALSE);
|
|
|
|
cut_marked();
|
|
|
|
u->cutbuffer = cutbuffer;
|
|
|
|
u->cutbottom = cutbottom;
|
|
|
|
cutbuffer = oldcutbuffer;
|
|
|
|
cutbottom = oldcutbottom;
|
|
|
|
openfile->mark_set = FALSE;
|
|
|
|
break;
|
2008-08-02 22:31:01 +00:00
|
|
|
case REPLACE:
|
|
|
|
undidmsg = _("text replace");
|
|
|
|
data = u->strdata;
|
|
|
|
u->strdata = f->data;
|
|
|
|
f->data = data;
|
|
|
|
break;
|
2009-04-21 05:34:08 +00:00
|
|
|
|
2008-07-10 20:13:04 +00:00
|
|
|
default:
|
2014-02-23 10:12:50 +00:00
|
|
|
undidmsg = _("Internal error: unknown type. Please save your work.");
|
2008-07-10 20:13:04 +00:00
|
|
|
break;
|
|
|
|
|
|
|
|
}
|
2009-04-21 05:34:08 +00:00
|
|
|
renumber(f);
|
2008-07-31 04:24:04 +00:00
|
|
|
do_gotolinecolumn(u->lineno, u->begin, FALSE, FALSE, FALSE, TRUE);
|
|
|
|
statusbar(_("Undid action (%s)"), undidmsg);
|
2008-07-10 20:13:04 +00:00
|
|
|
openfile->current_undo = openfile->current_undo->next;
|
2008-08-08 03:02:03 +00:00
|
|
|
openfile->last_action = OTHER;
|
2008-07-10 20:13:04 +00:00
|
|
|
}
|
|
|
|
|
2014-04-04 20:45:28 +00:00
|
|
|
/* Redo the last thing(s) we undid. */
|
2008-07-10 20:13:04 +00:00
|
|
|
void do_redo(void)
|
|
|
|
{
|
|
|
|
undo *u = openfile->undotop;
|
2009-07-12 03:36:58 +00:00
|
|
|
filestruct *f = openfile->current;
|
2008-10-14 19:55:34 +00:00
|
|
|
int len = 0;
|
2008-07-31 04:24:04 +00:00
|
|
|
char *undidmsg, *data;
|
2008-07-10 20:13:04 +00:00
|
|
|
|
|
|
|
for (; u != NULL && u->next != openfile->current_undo; u = u->next)
|
|
|
|
;
|
|
|
|
if (!u) {
|
|
|
|
statusbar(_("Nothing to re-do!"));
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if (u->next != openfile->current_undo) {
|
2014-02-23 10:12:50 +00:00
|
|
|
statusbar(_("Internal error: cannot set up redo. Please save your work."));
|
2008-07-10 20:13:04 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (u->lineno <= f->lineno)
|
|
|
|
for (; f->prev != NULL && f->lineno != u->lineno; f = f->prev)
|
|
|
|
;
|
|
|
|
else
|
|
|
|
for (; f->next != NULL && f->lineno != u->lineno; f = f->next)
|
|
|
|
;
|
|
|
|
if (f->lineno != u->lineno) {
|
2014-02-23 10:12:50 +00:00
|
|
|
statusbar(_("Internal error: can't match line %d. Please save your work."), u->lineno);
|
2008-07-10 20:13:04 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
#ifdef DEBUG
|
|
|
|
fprintf(stderr, "data we're about to redo = \"%s\"\n", f->data);
|
|
|
|
fprintf(stderr, "Redo running for type %d\n", u->type);
|
|
|
|
#endif
|
|
|
|
|
|
|
|
switch(u->type) {
|
|
|
|
case ADD:
|
2008-07-31 04:24:04 +00:00
|
|
|
undidmsg = _("text add");
|
2008-07-10 20:13:04 +00:00
|
|
|
len = strlen(f->data) + strlen(u->strdata) + 1;
|
|
|
|
data = charalloc(len);
|
2008-08-01 04:11:57 +00:00
|
|
|
strncpy(data, f->data, u->begin);
|
2008-07-10 20:13:04 +00:00
|
|
|
strcpy(&data[u->begin], u->strdata);
|
|
|
|
strcpy(&data[u->begin + strlen(u->strdata)], &f->data[u->begin]);
|
|
|
|
free(f->data);
|
|
|
|
f->data = data;
|
|
|
|
break;
|
|
|
|
case DEL:
|
2008-07-31 04:24:04 +00:00
|
|
|
undidmsg = _("text delete");
|
2008-07-10 20:13:04 +00:00
|
|
|
len = strlen(f->data) + strlen(u->strdata) + 1;
|
|
|
|
data = charalloc(len);
|
|
|
|
strncpy(data, f->data, u->begin);
|
|
|
|
strcpy(&data[u->begin], &f->data[u->begin + strlen(u->strdata)]);
|
|
|
|
free(f->data);
|
|
|
|
f->data = data;
|
|
|
|
break;
|
2009-04-21 05:34:08 +00:00
|
|
|
case ENTER:
|
|
|
|
undidmsg = _("line break");
|
|
|
|
do_gotolinecolumn(u->lineno, u->begin+1, FALSE, FALSE, FALSE, FALSE);
|
2009-04-25 03:31:30 +00:00
|
|
|
do_enter(TRUE);
|
2009-04-21 05:34:08 +00:00
|
|
|
break;
|
2009-12-03 03:12:00 +00:00
|
|
|
#ifndef DISABLE_WRAPPING
|
2008-07-10 20:13:04 +00:00
|
|
|
case SPLIT:
|
2009-04-21 05:34:08 +00:00
|
|
|
undidmsg = _("line wrap");
|
2011-02-07 14:45:56 +00:00
|
|
|
if (u->xflags & UNsplit_madenew)
|
2009-04-29 22:34:27 +00:00
|
|
|
prepend_wrap = TRUE;
|
|
|
|
do_wrap(f, TRUE);
|
2008-07-14 07:18:22 +00:00
|
|
|
renumber(f);
|
2008-07-10 20:13:04 +00:00
|
|
|
break;
|
2014-04-04 20:45:28 +00:00
|
|
|
#endif /* !DISABLE_WRAPPING */
|
2008-07-10 20:13:04 +00:00
|
|
|
case UNSPLIT:
|
2008-07-31 04:24:04 +00:00
|
|
|
undidmsg = _("line join");
|
2008-07-14 07:18:22 +00:00
|
|
|
len = strlen(f->data) + strlen(u->strdata + 1);
|
|
|
|
data = charalloc(len);
|
|
|
|
strcpy(data, f->data);
|
|
|
|
strcat(data, u->strdata);
|
2008-07-10 20:13:04 +00:00
|
|
|
free(f->data);
|
2008-07-14 07:18:22 +00:00
|
|
|
f->data = data;
|
2008-07-10 20:13:04 +00:00
|
|
|
if (f->next != NULL) {
|
|
|
|
filestruct *tmp = f->next;
|
|
|
|
unlink_node(tmp);
|
|
|
|
delete_node(tmp);
|
|
|
|
}
|
2008-07-14 07:18:22 +00:00
|
|
|
renumber(f);
|
2008-07-10 20:13:04 +00:00
|
|
|
break;
|
2008-07-31 04:24:04 +00:00
|
|
|
case CUT:
|
2008-09-16 21:35:19 +00:00
|
|
|
undidmsg = _("text cut");
|
|
|
|
redo_cut(u);
|
|
|
|
break;
|
|
|
|
case UNCUT:
|
|
|
|
undidmsg = _("text uncut");
|
|
|
|
undo_cut(u);
|
2008-07-31 04:24:04 +00:00
|
|
|
break;
|
2008-08-02 22:31:01 +00:00
|
|
|
case REPLACE:
|
|
|
|
undidmsg = _("text replace");
|
|
|
|
data = u->strdata;
|
|
|
|
u->strdata = f->data;
|
|
|
|
f->data = data;
|
|
|
|
break;
|
2008-09-16 21:35:19 +00:00
|
|
|
case INSERT:
|
2008-08-03 20:19:42 +00:00
|
|
|
undidmsg = _("text insert");
|
|
|
|
do_gotolinecolumn(u->lineno, u->begin+1, FALSE, FALSE, FALSE, FALSE);
|
2008-09-16 21:35:19 +00:00
|
|
|
copy_from_filestruct(u->cutbuffer, u->cutbottom);
|
|
|
|
openfile->placewewant = xplustabs();
|
2008-08-03 20:19:42 +00:00
|
|
|
break;
|
2008-07-10 20:13:04 +00:00
|
|
|
default:
|
2014-02-23 10:12:50 +00:00
|
|
|
undidmsg = _("Internal error: unknown type. Please save your work.");
|
2008-07-10 20:13:04 +00:00
|
|
|
break;
|
|
|
|
|
|
|
|
}
|
2008-07-31 04:24:04 +00:00
|
|
|
do_gotolinecolumn(u->lineno, u->begin, FALSE, FALSE, FALSE, TRUE);
|
|
|
|
statusbar(_("Redid action (%s)"), undidmsg);
|
2008-07-10 20:13:04 +00:00
|
|
|
|
|
|
|
openfile->current_undo = u;
|
2008-08-08 03:02:03 +00:00
|
|
|
openfile->last_action = OTHER;
|
2008-07-10 20:13:04 +00:00
|
|
|
|
|
|
|
}
|
2006-04-28 13:19:56 +00:00
|
|
|
#endif /* !NANO_TINY */
|
|
|
|
|
2005-12-08 07:24:54 +00:00
|
|
|
/* Someone hits Enter *gasp!* */
|
2009-04-25 03:31:30 +00:00
|
|
|
void do_enter(bool undoing)
|
2005-07-25 02:41:59 +00:00
|
|
|
{
|
|
|
|
filestruct *newnode = make_new_node(openfile->current);
|
|
|
|
size_t extra = 0;
|
|
|
|
|
2008-08-21 04:24:25 +00:00
|
|
|
assert(openfile->current != NULL && openfile->current->data != NULL);
|
2005-07-25 02:41:59 +00:00
|
|
|
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2009-04-25 03:31:30 +00:00
|
|
|
if (!undoing)
|
|
|
|
add_undo(ENTER);
|
2008-07-10 20:13:04 +00:00
|
|
|
|
|
|
|
|
2005-07-25 02:41:59 +00:00
|
|
|
/* Do auto-indenting, like the neolithic Turbo Pascal editor. */
|
|
|
|
if (ISSET(AUTOINDENT)) {
|
|
|
|
/* If we are breaking the line in the indentation, the new
|
|
|
|
* indentation should have only current_x characters, and
|
|
|
|
* current_x should not change. */
|
|
|
|
extra = indent_length(openfile->current->data);
|
|
|
|
if (extra > openfile->current_x)
|
|
|
|
extra = openfile->current_x;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
newnode->data = charalloc(strlen(openfile->current->data +
|
|
|
|
openfile->current_x) + extra + 1);
|
|
|
|
strcpy(&newnode->data[extra], openfile->current->data +
|
|
|
|
openfile->current_x);
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-25 02:41:59 +00:00
|
|
|
if (ISSET(AUTOINDENT)) {
|
|
|
|
strncpy(newnode->data, openfile->current->data, extra);
|
2011-05-10 05:43:08 +00:00
|
|
|
openfile->totsize += extra;
|
2005-07-25 02:41:59 +00:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
null_at(&openfile->current->data, openfile->current_x);
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-25 02:41:59 +00:00
|
|
|
if (openfile->mark_set && openfile->current ==
|
|
|
|
openfile->mark_begin && openfile->current_x <
|
|
|
|
openfile->mark_begin_x) {
|
|
|
|
openfile->mark_begin = newnode;
|
|
|
|
openfile->mark_begin_x += extra - openfile->current_x;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
openfile->current_x = extra;
|
|
|
|
|
|
|
|
if (openfile->current == openfile->filebot)
|
|
|
|
openfile->filebot = newnode;
|
|
|
|
splice_node(openfile->current, newnode,
|
|
|
|
openfile->current->next);
|
|
|
|
|
|
|
|
renumber(openfile->current);
|
|
|
|
openfile->current = newnode;
|
|
|
|
|
|
|
|
openfile->totsize++;
|
|
|
|
set_modified();
|
2005-09-13 04:45:46 +00:00
|
|
|
|
2005-07-25 02:41:59 +00:00
|
|
|
openfile->placewewant = xplustabs();
|
2005-09-13 04:45:46 +00:00
|
|
|
|
2009-02-06 03:41:02 +00:00
|
|
|
edit_refresh_needed = TRUE;
|
2005-07-25 02:41:59 +00:00
|
|
|
}
|
|
|
|
|
2011-02-07 14:45:56 +00:00
|
|
|
/* Need this again... */
|
|
|
|
void do_enter_void(void) {
|
|
|
|
do_enter(FALSE);
|
|
|
|
}
|
|
|
|
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-12-08 07:09:08 +00:00
|
|
|
/* Send a SIGKILL (unconditional kill) to the forked process in
|
|
|
|
* execute_command(). */
|
2005-12-06 19:39:56 +00:00
|
|
|
RETSIGTYPE cancel_command(int signal)
|
2005-07-24 19:57:51 +00:00
|
|
|
{
|
|
|
|
if (kill(pid, SIGKILL) == -1)
|
|
|
|
nperror("kill");
|
|
|
|
}
|
|
|
|
|
2005-11-08 23:09:47 +00:00
|
|
|
/* Execute command in a shell. Return TRUE on success. */
|
2005-07-24 19:57:51 +00:00
|
|
|
bool execute_command(const char *command)
|
|
|
|
{
|
|
|
|
int fd[2];
|
|
|
|
FILE *f;
|
2005-11-29 05:48:06 +00:00
|
|
|
char *shellenv;
|
2005-07-24 19:57:51 +00:00
|
|
|
struct sigaction oldaction, newaction;
|
|
|
|
/* Original and temporary handlers for SIGINT. */
|
|
|
|
bool sig_failed = FALSE;
|
|
|
|
/* Did sigaction() fail without changing the signal handlers? */
|
|
|
|
|
|
|
|
/* Make our pipes. */
|
|
|
|
if (pipe(fd) == -1) {
|
2014-02-28 11:49:12 +00:00
|
|
|
statusbar(_("Could not create pipe"));
|
2005-07-24 19:57:51 +00:00
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
|
2014-04-04 20:45:28 +00:00
|
|
|
/* Check $SHELL for the shell to use. If it isn't set, use /bin/sh.
|
|
|
|
* Note that $SHELL should contain only a path, with no arguments. */
|
2005-11-29 05:48:06 +00:00
|
|
|
shellenv = getenv("SHELL");
|
|
|
|
if (shellenv == NULL)
|
2009-11-29 06:13:22 +00:00
|
|
|
shellenv = (char *) "/bin/sh";
|
2005-11-29 05:48:06 +00:00
|
|
|
|
2005-07-24 19:57:51 +00:00
|
|
|
/* Fork a child. */
|
|
|
|
if ((pid = fork()) == 0) {
|
|
|
|
close(fd[0]);
|
|
|
|
dup2(fd[1], fileno(stdout));
|
|
|
|
dup2(fd[1], fileno(stderr));
|
|
|
|
|
|
|
|
/* If execl() returns at all, there was an error. */
|
2005-11-29 05:21:06 +00:00
|
|
|
execl(shellenv, tail(shellenv), "-c", command, NULL);
|
2005-07-24 19:57:51 +00:00
|
|
|
exit(0);
|
|
|
|
}
|
|
|
|
|
2006-04-26 18:33:50 +00:00
|
|
|
/* Continue as parent. */
|
2005-07-24 19:57:51 +00:00
|
|
|
close(fd[1]);
|
|
|
|
|
|
|
|
if (pid == -1) {
|
|
|
|
close(fd[0]);
|
|
|
|
statusbar(_("Could not fork"));
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Before we start reading the forked command's output, we set
|
|
|
|
* things up so that Ctrl-C will cancel the new process. */
|
|
|
|
|
|
|
|
/* Enable interpretation of the special control keys so that we get
|
|
|
|
* SIGINT when Ctrl-C is pressed. */
|
|
|
|
enable_signals();
|
|
|
|
|
|
|
|
if (sigaction(SIGINT, NULL, &newaction) == -1) {
|
|
|
|
sig_failed = TRUE;
|
|
|
|
nperror("sigaction");
|
|
|
|
} else {
|
|
|
|
newaction.sa_handler = cancel_command;
|
|
|
|
if (sigaction(SIGINT, &newaction, &oldaction) == -1) {
|
|
|
|
sig_failed = TRUE;
|
|
|
|
nperror("sigaction");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Note that now oldaction is the previous SIGINT signal handler,
|
|
|
|
* to be restored later. */
|
|
|
|
|
|
|
|
f = fdopen(fd[0], "rb");
|
|
|
|
if (f == NULL)
|
|
|
|
nperror("fdopen");
|
|
|
|
|
2009-12-09 16:51:43 +00:00
|
|
|
read_file(f, 0, "stdin", TRUE, FALSE);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
|
|
|
if (wait(NULL) == -1)
|
|
|
|
nperror("wait");
|
|
|
|
|
|
|
|
if (!sig_failed && sigaction(SIGINT, &oldaction, NULL) == -1)
|
|
|
|
nperror("sigaction");
|
|
|
|
|
2007-12-18 01:28:53 +00:00
|
|
|
/* Restore the terminal to its previous state. In the process,
|
|
|
|
* disable interpretation of the special control keys so that we can
|
2005-07-24 19:57:51 +00:00
|
|
|
* use Ctrl-C for other things. */
|
2007-12-18 01:28:53 +00:00
|
|
|
terminal_init();
|
2005-07-24 19:57:51 +00:00
|
|
|
|
|
|
|
return TRUE;
|
|
|
|
}
|
2008-07-10 20:13:04 +00:00
|
|
|
|
2014-04-04 20:45:28 +00:00
|
|
|
/* Add a new undo struct to the top of the current pile. */
|
2008-08-03 04:48:05 +00:00
|
|
|
void add_undo(undo_type current_action)
|
2008-07-10 20:13:04 +00:00
|
|
|
{
|
2008-10-14 19:55:34 +00:00
|
|
|
undo *u;
|
2008-07-10 20:13:04 +00:00
|
|
|
char *data;
|
2008-08-03 04:48:05 +00:00
|
|
|
openfilestruct *fs = openfile;
|
2014-04-04 20:45:28 +00:00
|
|
|
static undo *last_cutu = NULL; /* Last thing we cut to set up the undo for uncut. */
|
|
|
|
ssize_t wrap_loc; /* For calculating split beginning. */
|
2008-07-10 20:13:04 +00:00
|
|
|
|
2009-08-14 03:18:29 +00:00
|
|
|
if (!ISSET(UNDOABLE))
|
2009-07-12 03:36:58 +00:00
|
|
|
return;
|
|
|
|
|
2014-04-04 20:45:28 +00:00
|
|
|
/* Ugh, if we were called while cutting not-to-end, non-marked, and
|
|
|
|
* on the same lineno, we need to abort here. */
|
2008-08-01 06:52:15 +00:00
|
|
|
u = fs->current_undo;
|
2012-12-30 19:20:10 +00:00
|
|
|
if (current_action == CUT && u && u->type == CUT
|
2008-08-09 10:08:33 +00:00
|
|
|
&& !u->mark_set && u->lineno == fs->current->lineno)
|
2008-08-01 06:52:15 +00:00
|
|
|
return;
|
|
|
|
|
2014-04-04 20:45:28 +00:00
|
|
|
/* Blow away the old undo stack if we are starting from the middle. */
|
2008-08-01 03:50:20 +00:00
|
|
|
while (fs->undotop != NULL && fs->undotop != fs->current_undo) {
|
|
|
|
undo *u2 = fs->undotop;
|
2008-07-10 20:13:04 +00:00
|
|
|
fs->undotop = fs->undotop->next;
|
2008-08-01 03:50:20 +00:00
|
|
|
if (u2->strdata != NULL)
|
|
|
|
free(u2->strdata);
|
2008-08-08 03:02:03 +00:00
|
|
|
if (u2->cutbuffer)
|
2008-08-03 20:19:42 +00:00
|
|
|
free_filestruct(u2->cutbuffer);
|
2008-08-01 03:50:20 +00:00
|
|
|
free(u2);
|
2008-07-10 20:13:04 +00:00
|
|
|
}
|
|
|
|
|
2014-04-04 20:45:28 +00:00
|
|
|
/* Allocate and initialize a new undo type. */
|
2009-11-29 06:13:22 +00:00
|
|
|
u = (undo *) nmalloc(sizeof(undo));
|
2008-07-10 20:13:04 +00:00
|
|
|
u->type = current_action;
|
|
|
|
u->lineno = fs->current->lineno;
|
|
|
|
u->begin = fs->current_x;
|
|
|
|
u->next = fs->undotop;
|
|
|
|
fs->undotop = u;
|
|
|
|
fs->current_undo = u;
|
2008-08-01 03:50:20 +00:00
|
|
|
u->strdata = NULL;
|
2009-04-12 06:13:16 +00:00
|
|
|
u->strdata2 = NULL;
|
2008-08-01 03:50:20 +00:00
|
|
|
u->cutbuffer = NULL;
|
|
|
|
u->cutbottom = NULL;
|
2008-09-16 21:35:19 +00:00
|
|
|
u->mark_set = 0;
|
2008-08-01 07:29:06 +00:00
|
|
|
u->mark_begin_lineno = 0;
|
|
|
|
u->mark_begin_x = 0;
|
2008-08-01 03:50:20 +00:00
|
|
|
u->xflags = 0;
|
2008-10-14 04:34:56 +00:00
|
|
|
u->to_end = FALSE;
|
2008-07-10 20:13:04 +00:00
|
|
|
|
|
|
|
switch (u->type) {
|
2014-04-04 20:45:28 +00:00
|
|
|
/* We need to start copying data into the undo buffer
|
|
|
|
* or we won't be able to restore it later. */
|
2008-07-10 20:13:04 +00:00
|
|
|
case ADD:
|
|
|
|
data = charalloc(2);
|
|
|
|
data[0] = fs->current->data[fs->current_x];
|
|
|
|
data[1] = '\0';
|
|
|
|
u->strdata = data;
|
|
|
|
break;
|
|
|
|
case DEL:
|
|
|
|
if (u->begin != strlen(fs->current->data)) {
|
|
|
|
data = mallocstrncpy(NULL, &fs->current->data[u->begin], 2);
|
|
|
|
data[1] = '\0';
|
|
|
|
u->strdata = data;
|
|
|
|
break;
|
|
|
|
}
|
2014-04-04 20:45:28 +00:00
|
|
|
/* Else purposely fall into unsplit code. */
|
2008-07-10 20:13:04 +00:00
|
|
|
current_action = u->type = UNSPLIT;
|
|
|
|
case UNSPLIT:
|
|
|
|
if (fs->current->next) {
|
|
|
|
data = mallocstrcpy(NULL, fs->current->next->data);
|
|
|
|
u->strdata = data;
|
|
|
|
}
|
|
|
|
break;
|
2009-12-03 03:12:00 +00:00
|
|
|
#ifndef DISABLE_WRAPPING
|
2008-07-10 20:13:04 +00:00
|
|
|
case SPLIT:
|
2009-03-26 01:01:48 +00:00
|
|
|
wrap_loc = break_line(openfile->current->data, fill
|
|
|
|
#ifndef DISABLE_HELP
|
|
|
|
, FALSE
|
|
|
|
#endif
|
|
|
|
);
|
|
|
|
u->strdata = mallocstrcpy(NULL, &openfile->current->data[wrap_loc]);
|
2014-04-04 20:45:28 +00:00
|
|
|
/* Don't bother saving the next line if we're not prepending,
|
|
|
|
* as a new line will be created. */
|
2009-04-12 06:13:16 +00:00
|
|
|
if (prepend_wrap)
|
|
|
|
u->strdata2 = mallocstrcpy(NULL, fs->current->next->data);
|
2009-04-29 04:43:58 +00:00
|
|
|
u->begin = wrap_loc;
|
2009-03-26 01:01:48 +00:00
|
|
|
break;
|
2014-04-04 20:45:28 +00:00
|
|
|
#endif /* !DISABLE_WRAPPING */
|
2009-03-26 01:01:48 +00:00
|
|
|
case INSERT:
|
2008-08-02 22:31:01 +00:00
|
|
|
case REPLACE:
|
2008-07-10 20:13:04 +00:00
|
|
|
data = mallocstrcpy(NULL, fs->current->data);
|
2008-07-31 04:24:04 +00:00
|
|
|
u->strdata = data;
|
|
|
|
break;
|
|
|
|
case CUT:
|
|
|
|
u->mark_set = openfile->mark_set;
|
|
|
|
if (u->mark_set) {
|
|
|
|
u->mark_begin_lineno = openfile->mark_begin->lineno;
|
|
|
|
u->mark_begin_x = openfile->mark_begin_x;
|
|
|
|
}
|
2008-10-14 01:14:12 +00:00
|
|
|
u->to_end = (ISSET(CUT_TO_END)) ? TRUE : FALSE;
|
2008-10-04 11:10:11 +00:00
|
|
|
last_cutu = u;
|
2008-07-10 20:13:04 +00:00
|
|
|
break;
|
2008-08-02 22:31:01 +00:00
|
|
|
case UNCUT:
|
2008-10-04 11:10:11 +00:00
|
|
|
if (!last_cutu)
|
2014-02-23 10:12:50 +00:00
|
|
|
statusbar(_("Internal error: cannot set up uncut. Please save your work."));
|
2008-10-04 11:10:11 +00:00
|
|
|
else if (last_cutu->type == CUT) {
|
|
|
|
u->cutbuffer = last_cutu->cutbuffer;
|
|
|
|
u->cutbottom = last_cutu->cutbottom;
|
|
|
|
}
|
2008-08-02 22:31:01 +00:00
|
|
|
break;
|
2009-04-21 05:34:08 +00:00
|
|
|
case ENTER:
|
|
|
|
break;
|
2008-08-02 22:31:01 +00:00
|
|
|
case OTHER:
|
2008-08-21 04:21:06 +00:00
|
|
|
statusbar(_("Internal error: unknown type. Please save your work."));
|
2008-08-02 22:31:01 +00:00
|
|
|
break;
|
2008-07-10 20:13:04 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef DEBUG
|
2009-11-11 06:00:33 +00:00
|
|
|
fprintf(stderr, "fs->current->data = \"%s\", current_x = %lu, u->begin = %d, type = %d\n",
|
|
|
|
fs->current->data, (unsigned long) fs->current_x, u->begin, current_action);
|
2009-03-26 01:01:48 +00:00
|
|
|
fprintf(stderr, "left add_undo...\n");
|
2008-07-10 20:13:04 +00:00
|
|
|
#endif
|
|
|
|
fs->last_action = current_action;
|
|
|
|
}
|
|
|
|
|
2014-04-04 20:45:28 +00:00
|
|
|
/* Update an undo item, or determine whether a new one is really needed
|
|
|
|
* and bounce the data to add_undo instead. The latter functionality
|
|
|
|
* just feels gimmicky and may just be more hassle than it's worth,
|
|
|
|
* so it should be axed if needed. */
|
2008-08-03 04:48:05 +00:00
|
|
|
void update_undo(undo_type action)
|
2008-07-10 20:13:04 +00:00
|
|
|
{
|
|
|
|
undo *u;
|
|
|
|
char *data;
|
|
|
|
int len = 0;
|
2008-08-03 04:48:05 +00:00
|
|
|
openfilestruct *fs = openfile;
|
2008-08-01 03:50:20 +00:00
|
|
|
|
2009-08-14 03:18:29 +00:00
|
|
|
if (!ISSET(UNDOABLE))
|
2009-07-12 03:36:58 +00:00
|
|
|
return;
|
|
|
|
|
2008-08-01 03:50:20 +00:00
|
|
|
#ifdef DEBUG
|
2009-11-11 06:00:33 +00:00
|
|
|
fprintf(stderr, "action = %d, fs->last_action = %d, openfile->current->lineno = %lu",
|
|
|
|
action, fs->last_action, (unsigned long) openfile->current->lineno);
|
2008-08-02 22:31:01 +00:00
|
|
|
if (fs->current_undo)
|
2009-11-11 06:00:33 +00:00
|
|
|
fprintf(stderr, "fs->current_undo->lineno = %lu\n", (unsigned long) fs->current_undo->lineno);
|
2008-08-02 22:31:01 +00:00
|
|
|
else
|
|
|
|
fprintf(stderr, "\n");
|
2008-08-01 03:50:20 +00:00
|
|
|
#endif
|
|
|
|
|
2008-07-31 04:24:04 +00:00
|
|
|
/* Change to an add if we're not using the same undo struct
|
2014-04-04 20:45:28 +00:00
|
|
|
* that we should be using. */
|
2008-07-31 04:24:04 +00:00
|
|
|
if (action != fs->last_action
|
2009-04-29 22:34:27 +00:00
|
|
|
|| (action != CUT && action != INSERT && action != SPLIT
|
2008-08-01 03:50:20 +00:00
|
|
|
&& openfile->current->lineno != fs->current_undo->lineno)) {
|
2008-08-03 04:48:05 +00:00
|
|
|
add_undo(action);
|
2008-07-10 20:13:04 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
assert(fs->undotop != NULL);
|
|
|
|
u = fs->undotop;
|
|
|
|
|
|
|
|
switch (u->type) {
|
|
|
|
case ADD:
|
|
|
|
#ifdef DEBUG
|
2009-11-11 06:00:33 +00:00
|
|
|
fprintf(stderr, "fs->current->data = \"%s\", current_x = %lu, u->begin = %d\n",
|
|
|
|
fs->current->data, (unsigned long) fs->current_x, u->begin);
|
2008-07-10 20:13:04 +00:00
|
|
|
#endif
|
|
|
|
len = strlen(u->strdata) + 2;
|
2009-11-29 06:13:22 +00:00
|
|
|
data = (char *) nrealloc((void *) u->strdata, len * sizeof(char *));
|
2008-07-10 20:13:04 +00:00
|
|
|
data[len-2] = fs->current->data[fs->current_x];
|
|
|
|
data[len-1] = '\0';
|
|
|
|
u->strdata = (char *) data;
|
|
|
|
#ifdef DEBUG
|
|
|
|
fprintf(stderr, "current undo data now \"%s\"\n", u->strdata);
|
|
|
|
#endif
|
|
|
|
break;
|
|
|
|
case DEL:
|
|
|
|
len = strlen(u->strdata) + 2;
|
|
|
|
assert(len > 2);
|
|
|
|
if (fs->current_x == u->begin) {
|
2014-04-04 20:45:28 +00:00
|
|
|
/* They're deleting. */
|
2008-07-14 07:18:22 +00:00
|
|
|
if (!u->xflags)
|
2011-02-07 14:45:56 +00:00
|
|
|
u->xflags = UNdel_del;
|
|
|
|
else if (u->xflags != UNdel_del) {
|
2008-08-03 04:48:05 +00:00
|
|
|
add_undo(action);
|
2008-07-14 07:18:22 +00:00
|
|
|
return;
|
|
|
|
}
|
2008-07-10 20:13:04 +00:00
|
|
|
data = charalloc(len);
|
|
|
|
strcpy(data, u->strdata);
|
|
|
|
data[len-2] = fs->current->data[fs->current_x];;
|
|
|
|
data[len-1] = '\0';
|
|
|
|
free(u->strdata);
|
|
|
|
u->strdata = data;
|
|
|
|
} else if (fs->current_x == u->begin - 1) {
|
2014-04-04 20:45:28 +00:00
|
|
|
/* They're backspacing. */
|
2008-07-14 07:18:22 +00:00
|
|
|
if (!u->xflags)
|
2011-02-07 14:45:56 +00:00
|
|
|
u->xflags = UNdel_backspace;
|
|
|
|
else if (u->xflags != UNdel_backspace) {
|
2008-08-03 04:48:05 +00:00
|
|
|
add_undo(action);
|
2008-07-14 07:18:22 +00:00
|
|
|
return;
|
|
|
|
}
|
2008-07-10 20:13:04 +00:00
|
|
|
data = charalloc(len);
|
|
|
|
data[0] = fs->current->data[fs->current_x];
|
|
|
|
strcpy(&data[1], u->strdata);
|
|
|
|
free(u->strdata);
|
|
|
|
u->strdata = data;
|
|
|
|
u->begin--;
|
|
|
|
} else {
|
2014-04-04 20:45:28 +00:00
|
|
|
/* They deleted something else on the line. */
|
2008-08-03 04:48:05 +00:00
|
|
|
add_undo(DEL);
|
2008-07-10 20:13:04 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
#ifdef DEBUG
|
2008-07-14 07:18:22 +00:00
|
|
|
fprintf(stderr, "current undo data now \"%s\"\nu->begin = %d\n", u->strdata, u->begin);
|
2008-07-10 20:13:04 +00:00
|
|
|
#endif
|
|
|
|
break;
|
2008-07-31 04:24:04 +00:00
|
|
|
case CUT:
|
2008-10-14 01:14:12 +00:00
|
|
|
if (!cutbuffer)
|
|
|
|
break;
|
2008-08-01 06:52:15 +00:00
|
|
|
if (u->cutbuffer)
|
|
|
|
free(u->cutbuffer);
|
2008-07-31 04:24:04 +00:00
|
|
|
u->cutbuffer = copy_filestruct(cutbuffer);
|
2014-04-04 20:45:28 +00:00
|
|
|
/* Compute cutbottom for the uncut using our copy. */
|
2008-10-14 04:34:56 +00:00
|
|
|
for (u->cutbottom = u->cutbuffer; u->cutbottom->next != NULL; u->cutbottom = u->cutbottom->next)
|
|
|
|
;
|
2008-07-31 04:24:04 +00:00
|
|
|
break;
|
2008-08-02 22:31:01 +00:00
|
|
|
case REPLACE:
|
2008-09-16 21:35:19 +00:00
|
|
|
case UNCUT:
|
2008-08-03 04:48:05 +00:00
|
|
|
add_undo(action);
|
2008-08-02 22:31:01 +00:00
|
|
|
break;
|
2008-08-03 04:48:05 +00:00
|
|
|
case INSERT:
|
|
|
|
u->mark_begin_lineno = openfile->current->lineno;
|
2009-03-26 01:01:48 +00:00
|
|
|
break;
|
2009-12-03 03:12:00 +00:00
|
|
|
#ifndef DISABLE_WRAPPING
|
2008-07-10 20:13:04 +00:00
|
|
|
case SPLIT:
|
2009-03-26 01:01:48 +00:00
|
|
|
/* This will only be called if we made a completely new line,
|
2014-04-04 20:45:28 +00:00
|
|
|
* and as such we should note that so we can destroy it later. */
|
2011-02-07 14:45:56 +00:00
|
|
|
u->xflags = UNsplit_madenew;
|
2009-03-26 01:01:48 +00:00
|
|
|
break;
|
2009-12-03 03:12:00 +00:00
|
|
|
#endif /* DISABLE_WRAPPING */
|
2008-07-10 20:13:04 +00:00
|
|
|
case UNSPLIT:
|
2014-04-04 20:45:28 +00:00
|
|
|
/* These cases are handled by the earlier check for a new line and action. */
|
2009-07-12 03:36:58 +00:00
|
|
|
case ENTER:
|
2008-08-02 22:31:01 +00:00
|
|
|
case OTHER:
|
2008-07-10 20:13:04 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef DEBUG
|
|
|
|
fprintf(stderr, "Done in udpate_undo (type was %d)\n", action);
|
|
|
|
#endif
|
|
|
|
if (fs->last_action != action) {
|
|
|
|
#ifdef DEBUG
|
|
|
|
fprintf(stderr, "Starting add_undo for new action as it does not match last_action\n");
|
|
|
|
#endif
|
2008-08-03 04:48:05 +00:00
|
|
|
add_undo(action);
|
2008-07-10 20:13:04 +00:00
|
|
|
}
|
|
|
|
fs->last_action = action;
|
|
|
|
}
|
|
|
|
|
2005-11-15 03:17:35 +00:00
|
|
|
#endif /* !NANO_TINY */
|
2005-07-24 19:57:51 +00:00
|
|
|
|
|
|
|
#ifndef DISABLE_WRAPPING
|
2006-05-22 02:08:49 +00:00
|
|
|
/* Unset the prepend_wrap flag. We need to do this as soon as we do
|
2005-12-08 07:09:08 +00:00
|
|
|
* something other than type text. */
|
2005-07-24 19:57:51 +00:00
|
|
|
void wrap_reset(void)
|
|
|
|
{
|
2005-11-25 13:48:09 +00:00
|
|
|
prepend_wrap = FALSE;
|
2005-07-24 19:57:51 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* We wrap the given line. Precondition: we assume the cursor has been
|
2006-05-22 01:26:24 +00:00
|
|
|
* moved forward since the last typed character. Return TRUE if we
|
|
|
|
* wrapped, and FALSE otherwise. */
|
2009-04-29 22:34:27 +00:00
|
|
|
bool do_wrap(filestruct *line, bool undoing)
|
2005-07-24 19:57:51 +00:00
|
|
|
{
|
|
|
|
size_t line_len;
|
2005-07-25 22:54:16 +00:00
|
|
|
/* The length of the line we wrap. */
|
2005-07-24 19:57:51 +00:00
|
|
|
ssize_t wrap_loc;
|
2005-07-25 22:54:16 +00:00
|
|
|
/* The index of line->data where we wrap. */
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-24 19:57:51 +00:00
|
|
|
const char *indent_string = NULL;
|
|
|
|
/* Indentation to prepend to the new line. */
|
2005-07-25 22:54:16 +00:00
|
|
|
size_t indent_len = 0;
|
|
|
|
/* The length of indent_string. */
|
2005-07-24 19:57:51 +00:00
|
|
|
#endif
|
2005-07-25 22:54:16 +00:00
|
|
|
const char *after_break;
|
|
|
|
/* The text after the wrap point. */
|
|
|
|
size_t after_break_len;
|
|
|
|
/* The length of after_break. */
|
2005-11-22 21:48:24 +00:00
|
|
|
bool prepending = FALSE;
|
2005-07-25 22:54:16 +00:00
|
|
|
/* Do we prepend to the next line? */
|
2005-07-24 19:57:51 +00:00
|
|
|
const char *next_line = NULL;
|
|
|
|
/* The next line, minus indentation. */
|
2005-07-25 22:54:16 +00:00
|
|
|
size_t next_line_len = 0;
|
|
|
|
/* The length of next_line. */
|
|
|
|
char *new_line = NULL;
|
|
|
|
/* The line we create. */
|
|
|
|
size_t new_line_len = 0;
|
|
|
|
/* The eventual length of new_line. */
|
2005-07-24 19:57:51 +00:00
|
|
|
|
|
|
|
/* There are three steps. First, we decide where to wrap. Then, we
|
|
|
|
* create the new wrap line. Finally, we clean up. */
|
|
|
|
|
|
|
|
/* Step 1, finding where to wrap. We are going to add a new line
|
|
|
|
* after a blank character. In this step, we call break_line() to
|
|
|
|
* get the location of the last blank we can break the line at, and
|
2006-06-11 19:14:14 +00:00
|
|
|
* set wrap_loc to the location of the character after it, so that
|
|
|
|
* the blank is preserved at the end of the line.
|
2005-07-24 19:57:51 +00:00
|
|
|
*
|
|
|
|
* If there is no legal wrap point, or we reach the last character
|
|
|
|
* of the line while trying to find one, we should return without
|
|
|
|
* wrapping. Note that if autoindent is turned on, we don't break
|
|
|
|
* at the end of it! */
|
|
|
|
assert(line != NULL && line->data != NULL);
|
|
|
|
|
|
|
|
/* Save the length of the line. */
|
|
|
|
line_len = strlen(line->data);
|
|
|
|
|
|
|
|
/* Find the last blank where we can break the line. */
|
2005-11-22 21:13:36 +00:00
|
|
|
wrap_loc = break_line(line->data, fill
|
|
|
|
#ifndef DISABLE_HELP
|
|
|
|
, FALSE
|
|
|
|
#endif
|
|
|
|
);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
|
|
|
/* If we couldn't break the line, or we've reached the end of it, we
|
|
|
|
* don't wrap. */
|
|
|
|
if (wrap_loc == -1 || line->data[wrap_loc] == '\0')
|
|
|
|
return FALSE;
|
|
|
|
|
|
|
|
/* Otherwise, move forward to the character just after the blank. */
|
|
|
|
wrap_loc += move_mbright(line->data + wrap_loc, 0);
|
|
|
|
|
|
|
|
/* If we've reached the end of the line, we don't wrap. */
|
|
|
|
if (line->data[wrap_loc] == '\0')
|
|
|
|
return FALSE;
|
|
|
|
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2009-04-29 22:34:27 +00:00
|
|
|
if (!undoing)
|
|
|
|
add_undo(SPLIT);
|
2009-03-26 01:01:48 +00:00
|
|
|
|
2005-07-24 19:57:51 +00:00
|
|
|
/* If autoindent is turned on, and we're on the character just after
|
|
|
|
* the indentation, we don't wrap. */
|
|
|
|
if (ISSET(AUTOINDENT)) {
|
|
|
|
/* Get the indentation of this line. */
|
|
|
|
indent_string = line->data;
|
|
|
|
indent_len = indent_length(indent_string);
|
|
|
|
|
|
|
|
if (wrap_loc == indent_len)
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* Step 2, making the new wrap line. It will consist of indentation
|
|
|
|
* followed by the text after the wrap point, optionally followed by
|
|
|
|
* a space (if the text after the wrap point doesn't end in a blank)
|
2006-06-11 19:15:59 +00:00
|
|
|
* and the text of the next line, if they can fit without wrapping,
|
|
|
|
* the next line exists, and the prepend_wrap flag is set. */
|
2005-07-24 19:57:51 +00:00
|
|
|
|
|
|
|
/* after_break is the text that will be wrapped to the next line. */
|
|
|
|
after_break = line->data + wrap_loc;
|
|
|
|
after_break_len = line_len - wrap_loc;
|
|
|
|
|
|
|
|
assert(strlen(after_break) == after_break_len);
|
|
|
|
|
2005-11-25 13:48:09 +00:00
|
|
|
/* We prepend the wrapped text to the next line, if the prepend_wrap
|
|
|
|
* flag is set, there is a next line, and prepending would not make
|
|
|
|
* the line too long. */
|
|
|
|
if (prepend_wrap && line != openfile->filebot) {
|
2005-07-24 19:57:51 +00:00
|
|
|
const char *end = after_break + move_mbleft(after_break,
|
|
|
|
after_break_len);
|
|
|
|
|
|
|
|
/* If after_break doesn't end in a blank, make sure it ends in a
|
|
|
|
* space. */
|
|
|
|
if (!is_blank_mbchar(end)) {
|
|
|
|
line_len++;
|
|
|
|
line->data = charealloc(line->data, line_len + 1);
|
|
|
|
line->data[line_len - 1] = ' ';
|
|
|
|
line->data[line_len] = '\0';
|
|
|
|
after_break = line->data + wrap_loc;
|
|
|
|
after_break_len++;
|
|
|
|
openfile->totsize++;
|
|
|
|
}
|
|
|
|
|
|
|
|
next_line = line->next->data;
|
|
|
|
next_line_len = strlen(next_line);
|
|
|
|
|
|
|
|
if (after_break_len + next_line_len <= fill) {
|
2005-11-22 21:48:24 +00:00
|
|
|
prepending = TRUE;
|
2005-07-24 19:57:51 +00:00
|
|
|
new_line_len += next_line_len;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* new_line_len is now the length of the text that will be wrapped
|
|
|
|
* to the next line, plus (if we're prepending to it) the length of
|
|
|
|
* the text of the next line. */
|
|
|
|
new_line_len += after_break_len;
|
|
|
|
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-24 19:57:51 +00:00
|
|
|
if (ISSET(AUTOINDENT)) {
|
2005-11-22 21:48:24 +00:00
|
|
|
if (prepending) {
|
|
|
|
/* If we're prepending, the indentation will come from the
|
2005-07-24 19:57:51 +00:00
|
|
|
* next line. */
|
|
|
|
indent_string = next_line;
|
|
|
|
indent_len = indent_length(indent_string);
|
|
|
|
next_line += indent_len;
|
|
|
|
} else {
|
|
|
|
/* Otherwise, it will come from this line, in which case
|
|
|
|
* we should increase new_line_len to make room for it. */
|
|
|
|
new_line_len += indent_len;
|
|
|
|
openfile->totsize += mbstrnlen(indent_string, indent_len);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* Now we allocate the new line and copy the text into it. */
|
|
|
|
new_line = charalloc(new_line_len + 1);
|
|
|
|
new_line[0] = '\0';
|
|
|
|
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-24 19:57:51 +00:00
|
|
|
if (ISSET(AUTOINDENT)) {
|
|
|
|
/* Copy the indentation. */
|
|
|
|
strncpy(new_line, indent_string, indent_len);
|
|
|
|
new_line[indent_len] = '\0';
|
|
|
|
new_line_len += indent_len;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* Copy all the text after the wrap point of the current line. */
|
|
|
|
strcat(new_line, after_break);
|
|
|
|
|
|
|
|
/* Break the current line at the wrap point. */
|
|
|
|
null_at(&line->data, wrap_loc);
|
|
|
|
|
2005-11-22 21:48:24 +00:00
|
|
|
if (prepending) {
|
2014-04-04 20:16:59 +00:00
|
|
|
#ifndef NANO_TINY
|
2009-04-29 22:34:27 +00:00
|
|
|
if (!undoing)
|
|
|
|
update_undo(SPLIT);
|
2014-04-04 20:16:59 +00:00
|
|
|
#endif
|
2005-11-22 21:48:24 +00:00
|
|
|
/* If we're prepending, copy the text from the next line, minus
|
2005-07-24 19:57:51 +00:00
|
|
|
* the indentation that we already copied above. */
|
|
|
|
strcat(new_line, next_line);
|
|
|
|
|
|
|
|
free(line->next->data);
|
|
|
|
line->next->data = new_line;
|
2005-11-25 13:48:09 +00:00
|
|
|
|
|
|
|
/* If the NO_NEWLINES flag isn't set, and text has been added to
|
|
|
|
* the magicline, make a new magicline. */
|
|
|
|
if (!ISSET(NO_NEWLINES) && openfile->filebot->data[0] != '\0')
|
|
|
|
new_magicline();
|
2005-07-24 19:57:51 +00:00
|
|
|
} else {
|
|
|
|
/* Otherwise, make a new line and copy the text after where we
|
|
|
|
* broke this line to the beginning of the new line. */
|
|
|
|
splice_node(openfile->current, make_new_node(openfile->current),
|
|
|
|
openfile->current->next);
|
|
|
|
|
2005-11-22 22:08:01 +00:00
|
|
|
/* If the current line is the last line of the file, move the
|
|
|
|
* last line of the file down to the next line. */
|
2005-11-22 21:48:24 +00:00
|
|
|
if (openfile->filebot == openfile->current)
|
|
|
|
openfile->filebot = openfile->current->next;
|
|
|
|
|
2005-07-24 19:57:51 +00:00
|
|
|
openfile->current->next->data = new_line;
|
|
|
|
|
|
|
|
openfile->totsize++;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Step 3, clean up. Reposition the cursor and mark, and do some
|
|
|
|
* other sundry things. */
|
|
|
|
|
2005-11-25 13:48:09 +00:00
|
|
|
/* Set the prepend_wrap flag, so that later wraps of this line will
|
|
|
|
* be prepended to the next line. */
|
|
|
|
prepend_wrap = TRUE;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2006-05-22 01:24:09 +00:00
|
|
|
/* Each line knows its number. We recalculate these if we inserted
|
|
|
|
* a new line. */
|
2005-11-22 21:48:24 +00:00
|
|
|
if (!prepending)
|
2005-07-24 19:57:51 +00:00
|
|
|
renumber(line);
|
|
|
|
|
|
|
|
/* If the cursor was after the break point, we must move it. We
|
2005-11-25 13:48:09 +00:00
|
|
|
* also clear the prepend_wrap flag in this case. */
|
2005-07-24 19:57:51 +00:00
|
|
|
if (openfile->current_x > wrap_loc) {
|
2005-11-25 13:48:09 +00:00
|
|
|
prepend_wrap = FALSE;
|
2005-11-22 21:48:24 +00:00
|
|
|
|
2005-07-24 19:57:51 +00:00
|
|
|
openfile->current = openfile->current->next;
|
|
|
|
openfile->current_x -= wrap_loc
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-24 19:57:51 +00:00
|
|
|
- indent_len
|
|
|
|
#endif
|
|
|
|
;
|
|
|
|
openfile->placewewant = xplustabs();
|
|
|
|
}
|
|
|
|
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-24 19:57:51 +00:00
|
|
|
/* If the mark was on this line after the wrap point, we move it
|
2005-11-22 21:48:24 +00:00
|
|
|
* down. If it was on the next line and we prepended to that line,
|
2005-07-24 19:57:51 +00:00
|
|
|
* we move it right. */
|
|
|
|
if (openfile->mark_set) {
|
|
|
|
if (openfile->mark_begin == line && openfile->mark_begin_x >
|
|
|
|
wrap_loc) {
|
|
|
|
openfile->mark_begin = line->next;
|
|
|
|
openfile->mark_begin_x -= wrap_loc - indent_len + 1;
|
2005-11-22 21:48:24 +00:00
|
|
|
} else if (prepending && openfile->mark_begin == line->next)
|
2005-07-24 19:57:51 +00:00
|
|
|
openfile->mark_begin_x += after_break_len;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
return TRUE;
|
|
|
|
}
|
|
|
|
#endif /* !DISABLE_WRAPPING */
|
|
|
|
|
2005-11-29 21:30:00 +00:00
|
|
|
#if !defined(DISABLE_HELP) || !defined(DISABLE_WRAPJUSTIFY)
|
2005-07-25 02:33:45 +00:00
|
|
|
/* We are trying to break a chunk off line. We find the last blank such
|
2005-09-20 06:12:54 +00:00
|
|
|
* that the display length to there is at most (goal + 1). If there is
|
|
|
|
* no such blank, then we find the first blank. We then take the last
|
2005-07-25 02:33:45 +00:00
|
|
|
* blank in that group of blanks. The terminating '\0' counts as a
|
|
|
|
* blank, as does a '\n' if newline is TRUE. */
|
2005-11-22 21:13:36 +00:00
|
|
|
ssize_t break_line(const char *line, ssize_t goal
|
|
|
|
#ifndef DISABLE_HELP
|
2008-05-31 23:09:40 +00:00
|
|
|
, bool newln
|
2005-11-22 21:13:36 +00:00
|
|
|
#endif
|
|
|
|
)
|
2005-07-24 19:57:51 +00:00
|
|
|
{
|
2005-07-25 02:33:45 +00:00
|
|
|
ssize_t blank_loc = -1;
|
|
|
|
/* Current tentative return value. Index of the last blank we
|
|
|
|
* found with short enough display width. */
|
|
|
|
ssize_t cur_loc = 0;
|
|
|
|
/* Current index in line. */
|
2006-05-18 17:28:16 +00:00
|
|
|
size_t cur_pos = 0;
|
|
|
|
/* Current column position in line. */
|
2005-07-25 02:33:45 +00:00
|
|
|
int line_len;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
assert(line != NULL);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2006-05-18 17:28:16 +00:00
|
|
|
while (*line != '\0' && goal >= cur_pos) {
|
|
|
|
line_len = parse_mbchar(line, NULL, &cur_pos);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-11-22 21:13:36 +00:00
|
|
|
if (is_blank_mbchar(line)
|
|
|
|
#ifndef DISABLE_HELP
|
2008-05-31 23:09:40 +00:00
|
|
|
|| (newln && *line == '\n')
|
2005-11-22 21:13:36 +00:00
|
|
|
#endif
|
|
|
|
) {
|
2005-07-25 02:33:45 +00:00
|
|
|
blank_loc = cur_loc;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-11-22 21:13:36 +00:00
|
|
|
#ifndef DISABLE_HELP
|
2008-05-31 23:09:40 +00:00
|
|
|
if (newln && *line == '\n')
|
2005-07-25 02:33:45 +00:00
|
|
|
break;
|
2005-11-22 21:13:36 +00:00
|
|
|
#endif
|
2005-07-25 02:33:45 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
line += line_len;
|
|
|
|
cur_loc += line_len;
|
2005-07-24 19:57:51 +00:00
|
|
|
}
|
|
|
|
|
2006-05-18 17:28:16 +00:00
|
|
|
if (goal >= cur_pos)
|
2005-07-25 02:33:45 +00:00
|
|
|
/* In fact, the whole line displays shorter than goal. */
|
|
|
|
return cur_loc;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2008-07-12 01:54:49 +00:00
|
|
|
#ifndef DISABLE_HELP
|
|
|
|
if (newln && blank_loc <= 0) {
|
|
|
|
/* If blank was not found or was found only first character,
|
|
|
|
* force line break. */
|
|
|
|
cur_loc -= line_len;
|
|
|
|
return cur_loc;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
if (blank_loc == -1) {
|
|
|
|
/* No blank was found that was short enough. */
|
|
|
|
bool found_blank = FALSE;
|
2005-09-20 17:52:52 +00:00
|
|
|
ssize_t found_blank_loc = 0;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
while (*line != '\0') {
|
2005-07-26 06:13:45 +00:00
|
|
|
line_len = parse_mbchar(line, NULL, NULL);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-11-22 21:13:36 +00:00
|
|
|
if (is_blank_mbchar(line)
|
|
|
|
#ifndef DISABLE_HELP
|
2008-05-31 23:09:40 +00:00
|
|
|
|| (newln && *line == '\n')
|
2005-11-22 21:13:36 +00:00
|
|
|
#endif
|
|
|
|
) {
|
2005-07-25 02:33:45 +00:00
|
|
|
if (!found_blank)
|
|
|
|
found_blank = TRUE;
|
2005-09-20 16:36:08 +00:00
|
|
|
found_blank_loc = cur_loc;
|
2005-07-25 02:33:45 +00:00
|
|
|
} else if (found_blank)
|
2005-09-20 16:36:08 +00:00
|
|
|
return found_blank_loc;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
line += line_len;
|
|
|
|
cur_loc += line_len;
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
return -1;
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Move to the last blank after blank_loc, if there is one. */
|
|
|
|
line -= cur_loc;
|
|
|
|
line += blank_loc;
|
2005-07-26 06:13:45 +00:00
|
|
|
line_len = parse_mbchar(line, NULL, NULL);
|
2005-07-25 02:33:45 +00:00
|
|
|
line += line_len;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-11-22 21:13:36 +00:00
|
|
|
while (*line != '\0' && (is_blank_mbchar(line)
|
|
|
|
#ifndef DISABLE_HELP
|
2008-05-31 23:09:40 +00:00
|
|
|
|| (newln && *line == '\n')
|
2005-11-22 21:13:36 +00:00
|
|
|
#endif
|
|
|
|
)) {
|
2006-05-19 23:27:16 +00:00
|
|
|
#ifndef DISABLE_HELP
|
2008-05-31 23:09:40 +00:00
|
|
|
if (newln && *line == '\n')
|
2006-05-19 23:27:16 +00:00
|
|
|
break;
|
|
|
|
#endif
|
|
|
|
|
2006-05-20 13:11:56 +00:00
|
|
|
line_len = parse_mbchar(line, NULL, NULL);
|
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
line += line_len;
|
|
|
|
blank_loc += line_len;
|
2005-07-24 19:57:51 +00:00
|
|
|
}
|
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
return blank_loc;
|
|
|
|
}
|
2005-11-29 21:30:00 +00:00
|
|
|
#endif /* !DISABLE_HELP || !DISABLE_WRAPJUSTIFY */
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-11-15 03:17:35 +00:00
|
|
|
#if !defined(NANO_TINY) || !defined(DISABLE_JUSTIFY)
|
2005-07-25 02:33:45 +00:00
|
|
|
/* The "indentation" of a line is the whitespace between the quote part
|
|
|
|
* and the non-whitespace of the line. */
|
|
|
|
size_t indent_length(const char *line)
|
|
|
|
{
|
|
|
|
size_t len = 0;
|
|
|
|
char *blank_mb;
|
|
|
|
int blank_mb_len;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
assert(line != NULL);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
blank_mb = charalloc(mb_cur_max());
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
while (*line != '\0') {
|
2005-07-26 06:13:45 +00:00
|
|
|
blank_mb_len = parse_mbchar(line, blank_mb, NULL);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
if (!is_blank_mbchar(blank_mb))
|
|
|
|
break;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
line += blank_mb_len;
|
|
|
|
len += blank_mb_len;
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
free(blank_mb);
|
|
|
|
|
|
|
|
return len;
|
2005-07-24 19:57:51 +00:00
|
|
|
}
|
2005-11-15 03:17:35 +00:00
|
|
|
#endif /* !NANO_TINY || !DISABLE_JUSTIFY */
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
#ifndef DISABLE_JUSTIFY
|
|
|
|
/* justify_format() replaces blanks with spaces and multiple spaces by 1
|
|
|
|
* (except it maintains up to 2 after a character in punct optionally
|
|
|
|
* followed by a character in brackets, and removes all from the end).
|
|
|
|
*
|
|
|
|
* justify_format() might make paragraph->data shorter, and change the
|
|
|
|
* actual pointer with null_at().
|
|
|
|
*
|
|
|
|
* justify_format() will not look at the first skip characters of
|
|
|
|
* paragraph. skip should be at most strlen(paragraph->data). The
|
|
|
|
* character at paragraph[skip + 1] must not be blank. */
|
|
|
|
void justify_format(filestruct *paragraph, size_t skip)
|
2005-07-24 19:57:51 +00:00
|
|
|
{
|
2005-07-25 02:33:45 +00:00
|
|
|
char *end, *new_end, *new_paragraph_data;
|
|
|
|
size_t shift = 0;
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-25 02:33:45 +00:00
|
|
|
size_t mark_shift = 0;
|
|
|
|
#endif
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* These four asserts are assumptions about the input data. */
|
|
|
|
assert(paragraph != NULL);
|
|
|
|
assert(paragraph->data != NULL);
|
|
|
|
assert(skip < strlen(paragraph->data));
|
|
|
|
assert(!is_blank_mbchar(paragraph->data + skip));
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
end = paragraph->data + skip;
|
|
|
|
new_paragraph_data = charalloc(strlen(paragraph->data) + 1);
|
|
|
|
strncpy(new_paragraph_data, paragraph->data, skip);
|
|
|
|
new_end = new_paragraph_data + skip;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
while (*end != '\0') {
|
2005-12-31 21:08:10 +00:00
|
|
|
int end_len;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-12-31 21:08:10 +00:00
|
|
|
/* If this character is blank, change it to a space if
|
|
|
|
* necessary, and skip over all blanks after it. */
|
2005-07-25 02:33:45 +00:00
|
|
|
if (is_blank_mbchar(end)) {
|
2005-12-31 21:08:10 +00:00
|
|
|
end_len = parse_mbchar(end, NULL, NULL);
|
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
*new_end = ' ';
|
|
|
|
new_end++;
|
|
|
|
end += end_len;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
while (*end != '\0' && is_blank_mbchar(end)) {
|
2005-07-26 06:13:45 +00:00
|
|
|
end_len = parse_mbchar(end, NULL, NULL);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
end += end_len;
|
|
|
|
shift += end_len;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Keep track of the change in the current line. */
|
|
|
|
if (openfile->mark_set && openfile->mark_begin ==
|
|
|
|
paragraph && openfile->mark_begin_x >= end -
|
|
|
|
paragraph->data)
|
|
|
|
mark_shift += end_len;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
/* If this character is punctuation optionally followed by a
|
2005-12-31 21:08:10 +00:00
|
|
|
* bracket and then followed by blanks, change no more than two
|
|
|
|
* of the blanks to spaces if necessary, and skip over all
|
|
|
|
* blanks after them. */
|
2005-07-25 02:33:45 +00:00
|
|
|
} else if (mbstrchr(punct, end) != NULL) {
|
2005-12-31 21:08:10 +00:00
|
|
|
end_len = parse_mbchar(end, NULL, NULL);
|
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
while (end_len > 0) {
|
|
|
|
*new_end = *end;
|
|
|
|
new_end++;
|
|
|
|
end++;
|
|
|
|
end_len--;
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
if (*end != '\0' && mbstrchr(brackets, end) != NULL) {
|
2005-07-26 06:13:45 +00:00
|
|
|
end_len = parse_mbchar(end, NULL, NULL);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
while (end_len > 0) {
|
|
|
|
*new_end = *end;
|
|
|
|
new_end++;
|
|
|
|
end++;
|
|
|
|
end_len--;
|
|
|
|
}
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
if (*end != '\0' && is_blank_mbchar(end)) {
|
2005-07-26 06:13:45 +00:00
|
|
|
end_len = parse_mbchar(end, NULL, NULL);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
*new_end = ' ';
|
|
|
|
new_end++;
|
|
|
|
end += end_len;
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
if (*end != '\0' && is_blank_mbchar(end)) {
|
2005-07-26 06:13:45 +00:00
|
|
|
end_len = parse_mbchar(end, NULL, NULL);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
*new_end = ' ';
|
|
|
|
new_end++;
|
|
|
|
end += end_len;
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
while (*end != '\0' && is_blank_mbchar(end)) {
|
2005-07-26 06:13:45 +00:00
|
|
|
end_len = parse_mbchar(end, NULL, NULL);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
end += end_len;
|
|
|
|
shift += end_len;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Keep track of the change in the current line. */
|
|
|
|
if (openfile->mark_set && openfile->mark_begin ==
|
|
|
|
paragraph && openfile->mark_begin_x >= end -
|
|
|
|
paragraph->data)
|
|
|
|
mark_shift += end_len;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
/* If this character is neither blank nor punctuation, leave it
|
2005-12-31 21:08:10 +00:00
|
|
|
* unchanged. */
|
2005-07-25 02:33:45 +00:00
|
|
|
} else {
|
2005-12-31 21:08:10 +00:00
|
|
|
end_len = parse_mbchar(end, NULL, NULL);
|
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
while (end_len > 0) {
|
|
|
|
*new_end = *end;
|
|
|
|
new_end++;
|
|
|
|
end++;
|
|
|
|
end_len--;
|
|
|
|
}
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
}
|
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
assert(*end == '\0');
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
*new_end = *end;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-12-31 21:08:10 +00:00
|
|
|
/* If there are spaces at the end of the line, remove them. */
|
2005-07-25 02:33:45 +00:00
|
|
|
while (new_end > new_paragraph_data + skip &&
|
|
|
|
*(new_end - 1) == ' ') {
|
|
|
|
new_end--;
|
|
|
|
shift++;
|
2005-07-24 19:57:51 +00:00
|
|
|
}
|
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
if (shift > 0) {
|
|
|
|
openfile->totsize -= shift;
|
|
|
|
null_at(&new_paragraph_data, new_end - new_paragraph_data);
|
|
|
|
free(paragraph->data);
|
|
|
|
paragraph->data = new_paragraph_data;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Adjust the mark coordinates to compensate for the change in
|
|
|
|
* the current line. */
|
|
|
|
if (openfile->mark_set && openfile->mark_begin == paragraph) {
|
|
|
|
openfile->mark_begin_x -= mark_shift;
|
|
|
|
if (openfile->mark_begin_x > new_end - new_paragraph_data)
|
|
|
|
openfile->mark_begin_x = new_end - new_paragraph_data;
|
2005-07-24 19:57:51 +00:00
|
|
|
}
|
2005-07-25 02:33:45 +00:00
|
|
|
#endif
|
|
|
|
} else
|
|
|
|
free(new_paragraph_data);
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* The "quote part" of a line is the largest initial substring matching
|
|
|
|
* the quote string. This function returns the length of the quote part
|
|
|
|
* of the given line.
|
|
|
|
*
|
|
|
|
* Note that if !HAVE_REGEX_H then we match concatenated copies of
|
|
|
|
* quotestr. */
|
|
|
|
size_t quote_length(const char *line)
|
|
|
|
{
|
|
|
|
#ifdef HAVE_REGEX_H
|
|
|
|
regmatch_t matches;
|
|
|
|
int rc = regexec("ereg, line, 1, &matches, 0);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
if (rc == REG_NOMATCH || matches.rm_so == (regoff_t)-1)
|
|
|
|
return 0;
|
|
|
|
/* matches.rm_so should be 0, since the quote string should start
|
|
|
|
* with the caret ^. */
|
|
|
|
return matches.rm_eo;
|
|
|
|
#else /* !HAVE_REGEX_H */
|
|
|
|
size_t qdepth = 0;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Compute quote depth level. */
|
|
|
|
while (strncmp(line + qdepth, quotestr, quotelen) == 0)
|
|
|
|
qdepth += quotelen;
|
|
|
|
return qdepth;
|
|
|
|
#endif /* !HAVE_REGEX_H */
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* a_line and b_line are lines of text. The quotation part of a_line is
|
|
|
|
* the first a_quote characters. Check that the quotation part of
|
|
|
|
* b_line is the same. */
|
|
|
|
bool quotes_match(const char *a_line, size_t a_quote, const char
|
|
|
|
*b_line)
|
|
|
|
{
|
|
|
|
/* Here is the assumption about a_quote. */
|
|
|
|
assert(a_quote == quote_length(a_line));
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
return (a_quote == quote_length(b_line) &&
|
|
|
|
strncmp(a_line, b_line, a_quote) == 0);
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* We assume a_line and b_line have no quote part. Then, we return
|
|
|
|
* whether b_line could follow a_line in a paragraph. */
|
|
|
|
bool indents_match(const char *a_line, size_t a_indent, const char
|
|
|
|
*b_line, size_t b_indent)
|
|
|
|
{
|
|
|
|
assert(a_indent == indent_length(a_line));
|
|
|
|
assert(b_indent == indent_length(b_line));
|
|
|
|
|
|
|
|
return (b_indent <= a_indent &&
|
|
|
|
strncmp(a_line, b_line, b_indent) == 0);
|
2005-07-24 19:57:51 +00:00
|
|
|
}
|
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Is foo the beginning of a paragraph?
|
|
|
|
*
|
|
|
|
* A line of text consists of a "quote part", followed by an
|
|
|
|
* "indentation part", followed by text. The functions quote_length()
|
|
|
|
* and indent_length() calculate these parts.
|
|
|
|
*
|
|
|
|
* A line is "part of a paragraph" if it has a part not in the quote
|
|
|
|
* part or the indentation.
|
|
|
|
*
|
|
|
|
* A line is "the beginning of a paragraph" if it is part of a
|
|
|
|
* paragraph and
|
|
|
|
* 1) it is the top line of the file, or
|
|
|
|
* 2) the line above it is not part of a paragraph, or
|
|
|
|
* 3) the line above it does not have precisely the same quote
|
|
|
|
* part, or
|
|
|
|
* 4) the indentation of this line is not an initial substring of
|
|
|
|
* the indentation of the previous line, or
|
|
|
|
* 5) this line has no quote part and some indentation, and
|
|
|
|
* autoindent isn't turned on.
|
|
|
|
* The reason for number 5) is that if autoindent isn't turned on,
|
|
|
|
* then an indented line is expected to start a paragraph, as in
|
|
|
|
* books. Thus, nano can justify an indented paragraph only if
|
|
|
|
* autoindent is turned on. */
|
|
|
|
bool begpar(const filestruct *const foo)
|
2005-07-24 19:57:51 +00:00
|
|
|
{
|
2005-11-09 18:26:44 +00:00
|
|
|
size_t quote_len, indent_len, temp_id_len;
|
|
|
|
|
|
|
|
if (foo == NULL)
|
|
|
|
return FALSE;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Case 1). */
|
2005-11-09 18:26:44 +00:00
|
|
|
if (foo == openfile->fileage)
|
2005-07-25 02:33:45 +00:00
|
|
|
return TRUE;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
quote_len = quote_length(foo->data);
|
|
|
|
indent_len = indent_length(foo->data + quote_len);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Not part of a paragraph. */
|
|
|
|
if (foo->data[quote_len + indent_len] == '\0')
|
|
|
|
return FALSE;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Case 3). */
|
|
|
|
if (!quotes_match(foo->data, quote_len, foo->prev->data))
|
|
|
|
return TRUE;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
temp_id_len = indent_length(foo->prev->data + quote_len);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Case 2) or 5) or 4). */
|
|
|
|
if (foo->prev->data[quote_len + temp_id_len] == '\0' ||
|
|
|
|
(quote_len == 0 && indent_len > 0
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-25 02:33:45 +00:00
|
|
|
&& !ISSET(AUTOINDENT)
|
|
|
|
#endif
|
|
|
|
) || !indents_match(foo->prev->data + quote_len, temp_id_len,
|
|
|
|
foo->data + quote_len, indent_len))
|
|
|
|
return TRUE;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
return FALSE;
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Is foo inside a paragraph? */
|
|
|
|
bool inpar(const filestruct *const foo)
|
|
|
|
{
|
|
|
|
size_t quote_len;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
if (foo == NULL)
|
|
|
|
return FALSE;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
quote_len = quote_length(foo->data);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-11-09 20:33:42 +00:00
|
|
|
return (foo->data[quote_len + indent_length(foo->data +
|
|
|
|
quote_len)] != '\0');
|
2005-07-25 02:33:45 +00:00
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-11-09 23:06:44 +00:00
|
|
|
/* Move the next par_len lines, starting with first_line, into the
|
2005-11-09 18:49:16 +00:00
|
|
|
* justify buffer, leaving copies of those lines in place. Assume that
|
|
|
|
* par_len is greater than zero, and that there are enough lines after
|
2005-11-10 21:20:32 +00:00
|
|
|
* first_line. */
|
|
|
|
void backup_lines(filestruct *first_line, size_t par_len)
|
2005-07-25 02:33:45 +00:00
|
|
|
{
|
|
|
|
filestruct *top = first_line;
|
|
|
|
/* The top of the paragraph we're backing up. */
|
|
|
|
filestruct *bot = first_line;
|
|
|
|
/* The bottom of the paragraph we're backing up. */
|
|
|
|
size_t i;
|
|
|
|
/* Generic loop variable. */
|
|
|
|
size_t current_x_save = openfile->current_x;
|
|
|
|
ssize_t fl_lineno_save = first_line->lineno;
|
|
|
|
ssize_t edittop_lineno_save = openfile->edittop->lineno;
|
|
|
|
ssize_t current_lineno_save = openfile->current->lineno;
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-25 02:33:45 +00:00
|
|
|
bool old_mark_set = openfile->mark_set;
|
|
|
|
ssize_t mb_lineno_save = 0;
|
|
|
|
size_t mark_begin_x_save = 0;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
|
|
|
if (old_mark_set) {
|
2005-07-25 02:33:45 +00:00
|
|
|
mb_lineno_save = openfile->mark_begin->lineno;
|
|
|
|
mark_begin_x_save = openfile->mark_begin_x;
|
2005-07-24 19:57:51 +00:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2005-11-10 06:01:41 +00:00
|
|
|
/* par_len will be one greater than the number of lines between
|
|
|
|
* current and filebot if filebot is the last line in the
|
|
|
|
* paragraph. */
|
2005-11-09 18:49:16 +00:00
|
|
|
assert(par_len > 0 && openfile->current->lineno + par_len <=
|
2005-12-01 05:49:08 +00:00
|
|
|
openfile->filebot->lineno + 1);
|
2005-11-09 18:49:16 +00:00
|
|
|
|
2005-11-09 18:58:04 +00:00
|
|
|
/* Move bot down par_len lines to the line after the last line of
|
|
|
|
* the paragraph, if there is one. */
|
|
|
|
for (i = par_len; i > 0 && bot != openfile->filebot; i--)
|
2005-07-25 02:33:45 +00:00
|
|
|
bot = bot->next;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Move the paragraph from the current buffer's filestruct to the
|
|
|
|
* justify buffer. */
|
2005-11-09 18:58:04 +00:00
|
|
|
move_to_filestruct(&jusbuffer, &jusbottom, top, 0, bot,
|
2005-11-09 23:27:51 +00:00
|
|
|
(i == 1 && bot == openfile->filebot) ? strlen(bot->data) : 0);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Copy the paragraph back to the current buffer's filestruct from
|
|
|
|
* the justify buffer. */
|
|
|
|
copy_from_filestruct(jusbuffer, jusbottom);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Move upward from the last line of the paragraph to the first
|
|
|
|
* line, putting first_line, edittop, current, and mark_begin at the
|
|
|
|
* same lines in the copied paragraph that they had in the original
|
|
|
|
* paragraph. */
|
2007-04-22 15:04:05 +00:00
|
|
|
if (openfile->current != openfile->fileage) {
|
2005-11-09 18:58:04 +00:00
|
|
|
top = openfile->current->prev;
|
2007-04-22 15:04:05 +00:00
|
|
|
#ifndef NANO_TINY
|
|
|
|
if (old_mark_set &&
|
|
|
|
openfile->current->lineno == mb_lineno_save) {
|
|
|
|
openfile->mark_begin = openfile->current;
|
|
|
|
openfile->mark_begin_x = mark_begin_x_save;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
} else
|
2005-11-09 18:58:04 +00:00
|
|
|
top = openfile->current;
|
2005-11-10 03:40:45 +00:00
|
|
|
for (i = par_len; i > 0 && top != NULL; i--) {
|
2005-07-25 02:33:45 +00:00
|
|
|
if (top->lineno == fl_lineno_save)
|
|
|
|
first_line = top;
|
|
|
|
if (top->lineno == edittop_lineno_save)
|
|
|
|
openfile->edittop = top;
|
|
|
|
if (top->lineno == current_lineno_save)
|
|
|
|
openfile->current = top;
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-25 02:33:45 +00:00
|
|
|
if (old_mark_set && top->lineno == mb_lineno_save) {
|
|
|
|
openfile->mark_begin = top;
|
|
|
|
openfile->mark_begin_x = mark_begin_x_save;
|
2005-07-24 19:57:51 +00:00
|
|
|
}
|
2005-07-25 02:33:45 +00:00
|
|
|
#endif
|
|
|
|
top = top->prev;
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Put current_x at the same place in the copied paragraph that it
|
|
|
|
* had in the original paragraph. */
|
|
|
|
openfile->current_x = current_x_save;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
set_modified();
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-11-29 18:34:45 +00:00
|
|
|
/* Find the beginning of the current paragraph if we're in one, or the
|
|
|
|
* beginning of the next paragraph if we're not. Afterwards, save the
|
|
|
|
* quote length and paragraph length in *quote and *par. Return TRUE if
|
2006-05-22 01:26:24 +00:00
|
|
|
* we found a paragraph, and FALSE if there was an error or we didn't
|
2005-11-29 18:34:45 +00:00
|
|
|
* find a paragraph.
|
2005-07-25 02:33:45 +00:00
|
|
|
*
|
|
|
|
* See the comment at begpar() for more about when a line is the
|
|
|
|
* beginning of a paragraph. */
|
2005-11-29 18:34:45 +00:00
|
|
|
bool find_paragraph(size_t *const quote, size_t *const par)
|
2005-07-25 02:33:45 +00:00
|
|
|
{
|
|
|
|
size_t quote_len;
|
|
|
|
/* Length of the initial quotation of the paragraph we search
|
|
|
|
* for. */
|
|
|
|
size_t par_len;
|
|
|
|
/* Number of lines in the paragraph we search for. */
|
|
|
|
filestruct *current_save;
|
|
|
|
/* The line at the beginning of the paragraph we search for. */
|
|
|
|
ssize_t current_y_save;
|
|
|
|
/* The y-coordinate at the beginning of the paragraph we search
|
|
|
|
* for. */
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
#ifdef HAVE_REGEX_H
|
|
|
|
if (quoterc != 0) {
|
|
|
|
statusbar(_("Bad quote string %s: %s"), quotestr, quoteerr);
|
|
|
|
return FALSE;
|
2005-07-24 19:57:51 +00:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
assert(openfile->current != NULL);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-11-11 03:55:52 +00:00
|
|
|
/* If we're at the end of the last line of the file, it means that
|
|
|
|
* there aren't any paragraphs left, so get out. */
|
|
|
|
if (openfile->current == openfile->filebot && openfile->current_x ==
|
|
|
|
strlen(openfile->filebot->data))
|
|
|
|
return FALSE;
|
|
|
|
|
|
|
|
/* If the current line isn't in a paragraph, move forward to the
|
2005-11-11 05:13:28 +00:00
|
|
|
* last line of the next paragraph, if any. */
|
2005-07-25 02:33:45 +00:00
|
|
|
if (!inpar(openfile->current)) {
|
|
|
|
do_para_end(FALSE);
|
2005-11-29 18:25:53 +00:00
|
|
|
|
2005-11-11 05:13:28 +00:00
|
|
|
/* If we end up past the beginning of the line, it means that
|
|
|
|
* we're at the end of the last line of the file, and the line
|
|
|
|
* isn't blank, in which case the last line of the file is the
|
|
|
|
* last line of the next paragraph.
|
|
|
|
*
|
|
|
|
* Otherwise, if we end up on a line that's in a paragraph, it
|
|
|
|
* means that we're on the line after the last line of the next
|
|
|
|
* paragraph, in which case we should move back to the last line
|
|
|
|
* of the next paragraph. */
|
|
|
|
if (openfile->current_x == 0) {
|
|
|
|
if (!inpar(openfile->current->prev))
|
|
|
|
return FALSE;
|
|
|
|
if (openfile->current != openfile->fileage)
|
|
|
|
openfile->current = openfile->current->prev;
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
}
|
2005-11-29 18:25:53 +00:00
|
|
|
|
2005-11-11 05:13:28 +00:00
|
|
|
/* If the current line isn't the first line of the paragraph, move
|
2005-11-29 18:34:45 +00:00
|
|
|
* back to the first line of the paragraph. */
|
|
|
|
if (!begpar(openfile->current))
|
2005-07-25 02:33:45 +00:00
|
|
|
do_para_begin(FALSE);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Now current is the first line of the paragraph. Set quote_len to
|
|
|
|
* the quotation length of that line, and set par_len to the number
|
2005-11-11 05:13:28 +00:00
|
|
|
* of lines in this paragraph. */
|
2005-07-25 02:33:45 +00:00
|
|
|
quote_len = quote_length(openfile->current->data);
|
|
|
|
current_save = openfile->current;
|
|
|
|
current_y_save = openfile->current_y;
|
|
|
|
do_para_end(FALSE);
|
|
|
|
par_len = openfile->current->lineno - current_save->lineno;
|
2005-11-29 18:25:53 +00:00
|
|
|
|
2005-11-11 05:13:28 +00:00
|
|
|
/* If we end up past the beginning of the line, it means that we're
|
|
|
|
* at the end of the last line of the file, and the line isn't
|
|
|
|
* blank, in which case the last line of the file is part of the
|
|
|
|
* paragraph. */
|
2005-11-11 04:14:33 +00:00
|
|
|
if (openfile->current_x > 0)
|
|
|
|
par_len++;
|
2005-07-25 02:33:45 +00:00
|
|
|
openfile->current = current_save;
|
|
|
|
openfile->current_y = current_y_save;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Save the values of quote_len and par_len. */
|
|
|
|
assert(quote != NULL && par != NULL);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
*quote = quote_len;
|
|
|
|
*par = par_len;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
return TRUE;
|
2005-07-24 19:57:51 +00:00
|
|
|
}
|
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* If full_justify is TRUE, justify the entire file. Otherwise, justify
|
|
|
|
* the current paragraph. */
|
|
|
|
void do_justify(bool full_justify)
|
2005-07-24 19:57:51 +00:00
|
|
|
{
|
2005-07-25 02:33:45 +00:00
|
|
|
filestruct *first_par_line = NULL;
|
2005-11-30 21:19:42 +00:00
|
|
|
/* Will be the first line of the justified paragraph(s), if any.
|
|
|
|
* For restoring after unjustify. */
|
2005-11-10 19:28:27 +00:00
|
|
|
filestruct *last_par_line = NULL;
|
2005-11-09 19:06:01 +00:00
|
|
|
/* Will be the line after the last line of the justified
|
2005-11-30 21:19:42 +00:00
|
|
|
* paragraph(s), if any. Also for restoring after unjustify. */
|
2005-11-10 06:07:57 +00:00
|
|
|
bool filebot_inpar = FALSE;
|
2005-11-10 06:01:41 +00:00
|
|
|
/* Whether the text at filebot is part of the current
|
|
|
|
* paragraph. */
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 21:23:11 +00:00
|
|
|
/* We save these variables to be restored if the user
|
|
|
|
* unjustifies. */
|
2005-11-10 19:56:26 +00:00
|
|
|
filestruct *edittop_save = openfile->edittop;
|
|
|
|
filestruct *current_save = openfile->current;
|
2005-07-25 02:33:45 +00:00
|
|
|
size_t current_x_save = openfile->current_x;
|
|
|
|
size_t pww_save = openfile->placewewant;
|
|
|
|
size_t totsize_save = openfile->totsize;
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-25 02:33:45 +00:00
|
|
|
filestruct *mark_begin_save = openfile->mark_begin;
|
|
|
|
size_t mark_begin_x_save = openfile->mark_begin_x;
|
|
|
|
#endif
|
2005-11-10 19:56:26 +00:00
|
|
|
bool modified_save = openfile->modified;
|
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
int kbinput;
|
|
|
|
bool meta_key, func_key, s_or_t, ran_func, finished;
|
2008-03-13 08:23:52 +00:00
|
|
|
const sc *s;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-11-09 19:06:01 +00:00
|
|
|
/* Move to the beginning of the current line, so that justifying at
|
2005-11-11 04:14:33 +00:00
|
|
|
* the end of the last line of the file, if that line isn't blank,
|
|
|
|
* will work the first time through. */
|
2005-11-09 19:06:01 +00:00
|
|
|
openfile->current_x = 0;
|
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* If we're justifying the entire file, start at the beginning. */
|
|
|
|
if (full_justify)
|
|
|
|
openfile->current = openfile->fileage;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2014-04-04 15:52:52 +00:00
|
|
|
#ifndef NANO_TINY
|
2013-01-20 07:51:34 +00:00
|
|
|
allow_pending_sigwinch(FALSE);
|
2014-04-04 15:52:52 +00:00
|
|
|
#endif
|
2013-01-20 07:51:34 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
while (TRUE) {
|
|
|
|
size_t i;
|
|
|
|
/* Generic loop variable. */
|
2005-11-30 21:19:42 +00:00
|
|
|
filestruct *curr_first_par_line;
|
|
|
|
/* The first line of the current paragraph. */
|
2005-07-25 02:33:45 +00:00
|
|
|
size_t quote_len;
|
2005-11-30 21:19:42 +00:00
|
|
|
/* Length of the initial quotation of the current
|
|
|
|
* paragraph. */
|
2005-07-25 02:33:45 +00:00
|
|
|
size_t indent_len;
|
2005-11-30 21:19:42 +00:00
|
|
|
/* Length of the initial indentation of the current
|
|
|
|
* paragraph. */
|
2005-07-25 02:33:45 +00:00
|
|
|
size_t par_len;
|
2005-11-30 21:19:42 +00:00
|
|
|
/* Number of lines in the current paragraph. */
|
2005-07-25 02:33:45 +00:00
|
|
|
ssize_t break_pos;
|
|
|
|
/* Where we will break lines. */
|
|
|
|
char *indent_string;
|
|
|
|
/* The first indentation that doesn't match the initial
|
2005-11-30 21:19:42 +00:00
|
|
|
* indentation of the current paragraph. This is put at the
|
|
|
|
* beginning of every line broken off the first justified
|
|
|
|
* line of the paragraph. Note that this works because a
|
|
|
|
* paragraph can only contain two indentations at most: the
|
|
|
|
* initial one, and a different one starting on a line after
|
|
|
|
* the first. See the comment at begpar() for more about
|
|
|
|
* when a line is part of a paragraph. */
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Find the first line of the paragraph to be justified. That
|
|
|
|
* is the start of this paragraph if we're in one, or the start
|
|
|
|
* of the next otherwise. Save the quote length and paragraph
|
|
|
|
* length (number of lines). Don't refresh the screen yet,
|
|
|
|
* since we'll do that after we justify.
|
|
|
|
*
|
|
|
|
* If the search failed, we do one of two things. If we're
|
2005-11-11 03:17:44 +00:00
|
|
|
* justifying the whole file, and we've found at least one
|
|
|
|
* paragraph, it means that we should justify all the way to the
|
2005-07-25 02:33:45 +00:00
|
|
|
* last line of the file, so set the last line of the text to be
|
|
|
|
* justified to the last line of the file and break out of the
|
|
|
|
* loop. Otherwise, it means that there are no paragraph(s) to
|
|
|
|
* justify, so refresh the screen and get out. */
|
2005-11-29 18:34:45 +00:00
|
|
|
if (!find_paragraph("e_len, &par_len)) {
|
2005-11-11 03:17:44 +00:00
|
|
|
if (full_justify && first_par_line != NULL) {
|
2005-07-25 02:33:45 +00:00
|
|
|
last_par_line = openfile->filebot;
|
2005-07-24 19:57:51 +00:00
|
|
|
break;
|
2005-07-25 02:33:45 +00:00
|
|
|
} else {
|
2009-02-06 03:41:02 +00:00
|
|
|
edit_refresh_needed = TRUE;
|
2005-07-25 02:33:45 +00:00
|
|
|
return;
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
}
|
|
|
|
|
2005-11-10 06:01:41 +00:00
|
|
|
/* par_len will be one greater than the number of lines between
|
|
|
|
* current and filebot if filebot is the last line in the
|
|
|
|
* paragraph. Set filebot_inpar to TRUE if this is the case. */
|
|
|
|
filebot_inpar = (openfile->current->lineno + par_len ==
|
|
|
|
openfile->filebot->lineno + 1);
|
|
|
|
|
2005-11-10 21:20:32 +00:00
|
|
|
/* If we haven't already done it, move the original paragraph(s)
|
|
|
|
* to the justify buffer, splice a copy of the original
|
|
|
|
* paragraph(s) into the file in the same place, and set
|
|
|
|
* first_par_line to the first line of the copy. */
|
|
|
|
if (first_par_line == NULL) {
|
|
|
|
backup_lines(openfile->current, full_justify ?
|
2005-11-10 21:57:56 +00:00
|
|
|
openfile->filebot->lineno - openfile->current->lineno +
|
|
|
|
((openfile->filebot->data[0] != '\0') ? 1 : 0) :
|
2005-11-09 23:06:44 +00:00
|
|
|
par_len);
|
2005-11-10 21:20:32 +00:00
|
|
|
first_par_line = openfile->current;
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-11-30 21:19:42 +00:00
|
|
|
/* Set curr_first_par_line to the first line of the current
|
|
|
|
* paragraph. */
|
|
|
|
curr_first_par_line = openfile->current;
|
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Initialize indent_string to a blank string. */
|
|
|
|
indent_string = mallocstrcpy(NULL, "");
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Find the first indentation in the paragraph that doesn't
|
2006-05-28 18:43:21 +00:00
|
|
|
* match the indentation of the first line, and save it in
|
2005-07-25 02:33:45 +00:00
|
|
|
* indent_string. If all the indentations are the same, save
|
|
|
|
* the indentation of the first line in indent_string. */
|
|
|
|
{
|
|
|
|
const filestruct *indent_line = openfile->current;
|
|
|
|
bool past_first_line = FALSE;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
for (i = 0; i < par_len; i++) {
|
|
|
|
indent_len = quote_len +
|
|
|
|
indent_length(indent_line->data + quote_len);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
if (indent_len != strlen(indent_string)) {
|
|
|
|
indent_string = mallocstrncpy(indent_string,
|
|
|
|
indent_line->data, indent_len + 1);
|
|
|
|
indent_string[indent_len] = '\0';
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
if (past_first_line)
|
|
|
|
break;
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
if (indent_line == openfile->current)
|
|
|
|
past_first_line = TRUE;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
indent_line = indent_line->next;
|
|
|
|
}
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Now tack all the lines of the paragraph together, skipping
|
|
|
|
* the quoting and indentation on all lines after the first. */
|
|
|
|
for (i = 0; i < par_len - 1; i++) {
|
|
|
|
filestruct *next_line = openfile->current->next;
|
|
|
|
size_t line_len = strlen(openfile->current->data);
|
|
|
|
size_t next_line_len =
|
|
|
|
strlen(openfile->current->next->data);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
indent_len = quote_len +
|
|
|
|
indent_length(openfile->current->next->data +
|
|
|
|
quote_len);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
next_line_len -= indent_len;
|
|
|
|
openfile->totsize -= indent_len;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* We're just about to tack the next line onto this one. If
|
|
|
|
* this line isn't empty, make sure it ends in a space. */
|
|
|
|
if (line_len > 0 &&
|
|
|
|
openfile->current->data[line_len - 1] != ' ') {
|
|
|
|
line_len++;
|
|
|
|
openfile->current->data =
|
|
|
|
charealloc(openfile->current->data,
|
|
|
|
line_len + 1);
|
|
|
|
openfile->current->data[line_len - 1] = ' ';
|
|
|
|
openfile->current->data[line_len] = '\0';
|
|
|
|
openfile->totsize++;
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
openfile->current->data =
|
|
|
|
charealloc(openfile->current->data, line_len +
|
|
|
|
next_line_len + 1);
|
|
|
|
strcat(openfile->current->data, next_line->data +
|
|
|
|
indent_len);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-11-09 19:51:48 +00:00
|
|
|
/* Don't destroy edittop or filebot! */
|
2005-11-09 03:44:23 +00:00
|
|
|
if (next_line == openfile->edittop)
|
2005-07-25 02:33:45 +00:00
|
|
|
openfile->edittop = openfile->current;
|
2005-11-09 19:51:48 +00:00
|
|
|
if (next_line == openfile->filebot)
|
|
|
|
openfile->filebot = openfile->current;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Adjust the mark coordinates to compensate for the change
|
|
|
|
* in the next line. */
|
|
|
|
if (openfile->mark_set && openfile->mark_begin ==
|
|
|
|
next_line) {
|
|
|
|
openfile->mark_begin = openfile->current;
|
|
|
|
openfile->mark_begin_x += line_len - indent_len;
|
|
|
|
}
|
|
|
|
#endif
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
unlink_node(next_line);
|
|
|
|
delete_node(next_line);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* If we've removed the next line, we need to go through
|
|
|
|
* this line again. */
|
|
|
|
i--;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
par_len--;
|
|
|
|
openfile->totsize--;
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Call justify_format() on the paragraph, which will remove
|
|
|
|
* excess spaces from it and change all blank characters to
|
|
|
|
* spaces. */
|
|
|
|
justify_format(openfile->current, quote_len +
|
|
|
|
indent_length(openfile->current->data + quote_len));
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 22:54:16 +00:00
|
|
|
while (par_len > 0 && strlenpt(openfile->current->data) >
|
|
|
|
fill) {
|
2005-07-25 02:33:45 +00:00
|
|
|
size_t line_len = strlen(openfile->current->data);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
indent_len = strlen(indent_string);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* If this line is too long, try to wrap it to the next line
|
|
|
|
* to make it short enough. */
|
2005-07-25 22:54:16 +00:00
|
|
|
break_pos = break_line(openfile->current->data + indent_len,
|
2005-11-22 21:13:36 +00:00
|
|
|
fill - strnlenpt(openfile->current->data, indent_len)
|
|
|
|
#ifndef DISABLE_HELP
|
|
|
|
, FALSE
|
|
|
|
#endif
|
|
|
|
);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* We can't break the line, or don't need to, so get out. */
|
|
|
|
if (break_pos == -1 || break_pos + indent_len == line_len)
|
|
|
|
break;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Move forward to the character after the indentation and
|
|
|
|
* just after the space. */
|
|
|
|
break_pos += indent_len + 1;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
assert(break_pos <= line_len);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Make a new line, and copy the text after where we're
|
|
|
|
* going to break this line to the beginning of the new
|
|
|
|
* line. */
|
|
|
|
splice_node(openfile->current,
|
|
|
|
make_new_node(openfile->current),
|
|
|
|
openfile->current->next);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* If this paragraph is non-quoted, and autoindent isn't
|
|
|
|
* turned on, set the indentation length to zero so that the
|
|
|
|
* indentation is treated as part of the line. */
|
|
|
|
if (quote_len == 0
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-25 02:33:45 +00:00
|
|
|
&& !ISSET(AUTOINDENT)
|
2005-07-24 19:57:51 +00:00
|
|
|
#endif
|
2005-07-25 02:33:45 +00:00
|
|
|
)
|
|
|
|
indent_len = 0;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Copy the text after where we're going to break the
|
|
|
|
* current line to the next line. */
|
|
|
|
openfile->current->next->data = charalloc(indent_len + 1 +
|
|
|
|
line_len - break_pos);
|
|
|
|
strncpy(openfile->current->next->data, indent_string,
|
|
|
|
indent_len);
|
|
|
|
strcpy(openfile->current->next->data + indent_len,
|
|
|
|
openfile->current->data + break_pos);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
par_len++;
|
|
|
|
openfile->totsize += indent_len + 1;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Adjust the mark coordinates to compensate for the change
|
|
|
|
* in the current line. */
|
|
|
|
if (openfile->mark_set && openfile->mark_begin ==
|
|
|
|
openfile->current && openfile->mark_begin_x >
|
|
|
|
break_pos) {
|
|
|
|
openfile->mark_begin = openfile->current->next;
|
|
|
|
openfile->mark_begin_x -= break_pos - indent_len;
|
2005-07-24 19:57:51 +00:00
|
|
|
}
|
2005-07-25 02:33:45 +00:00
|
|
|
#endif
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Break the current line. */
|
|
|
|
null_at(&openfile->current->data, break_pos);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-11-09 20:17:12 +00:00
|
|
|
/* If the current line is the last line of the file, move
|
2005-11-10 05:20:25 +00:00
|
|
|
* the last line of the file down to the next line. */
|
2005-11-09 20:17:12 +00:00
|
|
|
if (openfile->filebot == openfile->current)
|
|
|
|
openfile->filebot = openfile->filebot->next;
|
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Go to the next line. */
|
|
|
|
par_len--;
|
2005-11-09 20:17:12 +00:00
|
|
|
openfile->current_y++;
|
|
|
|
openfile->current = openfile->current->next;
|
2005-07-25 02:33:45 +00:00
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* We're done breaking lines, so we don't need indent_string
|
|
|
|
* anymore. */
|
|
|
|
free(indent_string);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-11-09 20:17:12 +00:00
|
|
|
/* Go to the next line, if possible. If there is no next line,
|
|
|
|
* move to the end of the current line. */
|
2005-11-09 19:06:01 +00:00
|
|
|
if (openfile->current != openfile->filebot) {
|
|
|
|
openfile->current_y++;
|
|
|
|
openfile->current = openfile->current->next;
|
|
|
|
} else
|
|
|
|
openfile->current_x = strlen(openfile->current->data);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-11-30 21:19:42 +00:00
|
|
|
/* Renumber the lines of the now-justified current paragraph,
|
|
|
|
* since both find_paragraph() and edit_refresh() need the line
|
|
|
|
* numbers to be right. */
|
|
|
|
renumber(curr_first_par_line);
|
2005-11-29 19:00:09 +00:00
|
|
|
|
|
|
|
/* We've just finished justifying the paragraph. If we're not
|
|
|
|
* justifying the entire file, break out of the loop.
|
|
|
|
* Otherwise, continue the loop so that we justify all the
|
|
|
|
* paragraphs in the file. */
|
2005-07-25 02:33:45 +00:00
|
|
|
if (!full_justify)
|
|
|
|
break;
|
2005-07-24 19:57:51 +00:00
|
|
|
}
|
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* We are now done justifying the paragraph or the file, so clean
|
2005-11-10 19:28:27 +00:00
|
|
|
* up. current_y and totsize have been maintained above. If we
|
2005-11-29 19:00:09 +00:00
|
|
|
* actually justified something, set last_par_line to the new end of
|
|
|
|
* the paragraph. */
|
|
|
|
if (first_par_line != NULL)
|
2005-11-10 19:28:27 +00:00
|
|
|
last_par_line = openfile->current;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
edit_refresh();
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2006-05-10 13:41:53 +00:00
|
|
|
#ifndef NANO_TINY
|
2006-05-10 15:15:06 +00:00
|
|
|
/* We're going to set jump_buf so that we return here after a
|
|
|
|
* SIGWINCH instead of to main(). Indicate this. */
|
|
|
|
jump_buf_main = FALSE;
|
|
|
|
|
2006-05-10 13:41:53 +00:00
|
|
|
/* Return here after a SIGWINCH. */
|
2006-05-10 15:15:06 +00:00
|
|
|
sigsetjmp(jump_buf, 1);
|
2006-05-10 13:41:53 +00:00
|
|
|
#endif
|
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
statusbar(_("Can now UnJustify!"));
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* If constant cursor position display is on, make sure the current
|
|
|
|
* cursor position will be properly displayed on the statusbar. */
|
|
|
|
if (ISSET(CONST_UPDATE))
|
|
|
|
do_cursorpos(TRUE);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Display the shortcut list with UnJustify. */
|
|
|
|
shortcut_init(TRUE);
|
|
|
|
display_main_list();
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Now get a keystroke and see if it's unjustify. If not, put back
|
|
|
|
* the keystroke and return. */
|
|
|
|
kbinput = do_input(&meta_key, &func_key, &s_or_t, &ran_func,
|
|
|
|
&finished, FALSE);
|
2008-03-13 08:23:52 +00:00
|
|
|
s = get_shortcut(currmenu, &kbinput, &meta_key, &func_key);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2011-02-07 14:45:56 +00:00
|
|
|
if (s && s->scfunc == do_uncut_text) {
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Splice the justify buffer back into the file, but only if we
|
|
|
|
* actually justified something. */
|
|
|
|
if (first_par_line != NULL) {
|
|
|
|
filestruct *top_save;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Partition the filestruct so that it contains only the
|
|
|
|
* text of the justified paragraph. */
|
|
|
|
filepart = partition_filestruct(first_par_line, 0,
|
2005-11-18 20:21:48 +00:00
|
|
|
last_par_line, filebot_inpar ?
|
|
|
|
strlen(last_par_line->data) : 0);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Remove the text of the justified paragraph, and
|
2005-11-09 23:06:44 +00:00
|
|
|
* replace it with the text in the justify buffer. */
|
2005-07-25 02:33:45 +00:00
|
|
|
free_filestruct(openfile->fileage);
|
|
|
|
openfile->fileage = jusbuffer;
|
|
|
|
openfile->filebot = jusbottom;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
top_save = openfile->fileage;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Unpartition the filestruct so that it contains all the
|
|
|
|
* text again. Note that the justified paragraph has been
|
|
|
|
* replaced with the unjustified paragraph. */
|
|
|
|
unpartition_filestruct(&filepart);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Renumber starting with the beginning line of the old
|
|
|
|
* partition. */
|
|
|
|
renumber(top_save);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-11-10 19:28:27 +00:00
|
|
|
/* Restore the justify we just did (ungrateful user!). */
|
|
|
|
openfile->edittop = edittop_save;
|
|
|
|
openfile->current = current_save;
|
|
|
|
openfile->current_x = current_x_save;
|
|
|
|
openfile->placewewant = pww_save;
|
2005-07-25 02:33:45 +00:00
|
|
|
openfile->totsize = totsize_save;
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-25 02:33:45 +00:00
|
|
|
if (openfile->mark_set) {
|
|
|
|
openfile->mark_begin = mark_begin_save;
|
|
|
|
openfile->mark_begin_x = mark_begin_x_save;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
openfile->modified = modified_save;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Clear the justify buffer. */
|
|
|
|
jusbuffer = NULL;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
if (!openfile->modified)
|
|
|
|
titlebar(NULL);
|
2009-02-06 03:41:02 +00:00
|
|
|
edit_refresh_needed = TRUE;
|
2005-07-25 02:33:45 +00:00
|
|
|
}
|
|
|
|
} else {
|
|
|
|
unget_kbinput(kbinput, meta_key, func_key);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Blow away the text in the justify buffer. */
|
|
|
|
free_filestruct(jusbuffer);
|
|
|
|
jusbuffer = NULL;
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
blank_statusbar();
|
|
|
|
|
|
|
|
/* Display the shortcut list with UnCut. */
|
|
|
|
shortcut_init(FALSE);
|
|
|
|
display_main_list();
|
2013-01-20 07:51:34 +00:00
|
|
|
|
2014-04-04 15:52:52 +00:00
|
|
|
#ifndef NANO_TINY
|
2013-01-20 07:51:34 +00:00
|
|
|
allow_pending_sigwinch(TRUE);
|
2014-04-04 15:52:52 +00:00
|
|
|
#endif
|
2005-07-24 19:57:51 +00:00
|
|
|
}
|
|
|
|
|
2005-12-08 07:09:08 +00:00
|
|
|
/* Justify the current paragraph. */
|
2005-07-25 02:33:45 +00:00
|
|
|
void do_justify_void(void)
|
2005-07-24 19:57:51 +00:00
|
|
|
{
|
2005-07-25 02:33:45 +00:00
|
|
|
do_justify(FALSE);
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-12-08 07:09:08 +00:00
|
|
|
/* Justify the entire file. */
|
2005-07-25 02:33:45 +00:00
|
|
|
void do_full_justify(void)
|
|
|
|
{
|
|
|
|
do_justify(TRUE);
|
2005-07-24 19:57:51 +00:00
|
|
|
}
|
2005-07-25 02:33:45 +00:00
|
|
|
#endif /* !DISABLE_JUSTIFY */
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
#ifndef DISABLE_SPELLER
|
|
|
|
/* A word is misspelled in the file. Let the user replace it. We
|
|
|
|
* return FALSE if the user cancels. */
|
|
|
|
bool do_int_spell_fix(const char *word)
|
2005-07-24 19:57:51 +00:00
|
|
|
{
|
2005-07-25 02:33:45 +00:00
|
|
|
char *save_search, *save_replace;
|
|
|
|
size_t match_len, current_x_save = openfile->current_x;
|
|
|
|
size_t pww_save = openfile->placewewant;
|
2008-03-14 04:08:51 +00:00
|
|
|
bool meta_key = FALSE, func_key = FALSE;
|
2005-07-25 02:33:45 +00:00
|
|
|
filestruct *edittop_save = openfile->edittop;
|
|
|
|
filestruct *current_save = openfile->current;
|
|
|
|
/* Save where we are. */
|
|
|
|
bool canceled = FALSE;
|
|
|
|
/* The return value. */
|
|
|
|
bool case_sens_set = ISSET(CASE_SENSITIVE);
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-25 02:33:45 +00:00
|
|
|
bool backwards_search_set = ISSET(BACKWARDS_SEARCH);
|
|
|
|
#endif
|
|
|
|
#ifdef HAVE_REGEX_H
|
|
|
|
bool regexp_set = ISSET(USE_REGEXP);
|
|
|
|
#endif
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-24 19:57:51 +00:00
|
|
|
bool old_mark_set = openfile->mark_set;
|
2005-07-25 02:33:45 +00:00
|
|
|
bool added_magicline = FALSE;
|
|
|
|
/* Whether we added a magicline after filebot. */
|
|
|
|
bool right_side_up = FALSE;
|
|
|
|
/* TRUE if (mark_begin, mark_begin_x) is the top of the mark,
|
|
|
|
* FALSE if (current, current_x) is. */
|
|
|
|
filestruct *top, *bot;
|
|
|
|
size_t top_x, bot_x;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* Make sure spell-check is case sensitive. */
|
|
|
|
SET(CASE_SENSITIVE);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Make sure spell-check goes forward only. */
|
|
|
|
UNSET(BACKWARDS_SEARCH);
|
|
|
|
#endif
|
|
|
|
#ifdef HAVE_REGEX_H
|
|
|
|
/* Make sure spell-check doesn't use regular expressions. */
|
|
|
|
UNSET(USE_REGEXP);
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* Save the current search/replace strings. */
|
|
|
|
search_init_globals();
|
|
|
|
save_search = last_search;
|
|
|
|
save_replace = last_replace;
|
|
|
|
|
|
|
|
/* Set the search/replace strings to the misspelled word. */
|
|
|
|
last_search = mallocstrcpy(NULL, word);
|
|
|
|
last_replace = mallocstrcpy(NULL, word);
|
|
|
|
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-24 19:57:51 +00:00
|
|
|
if (old_mark_set) {
|
2005-07-25 02:33:45 +00:00
|
|
|
/* If the mark is on, partition the filestruct so that it
|
2005-11-08 18:34:12 +00:00
|
|
|
* contains only the marked text; if the NO_NEWLINES flag isn't
|
|
|
|
* set, keep track of whether the text will have a magicline
|
|
|
|
* added when we're done correcting misspelled words; and
|
|
|
|
* turn the mark off. */
|
2005-07-25 02:33:45 +00:00
|
|
|
mark_order((const filestruct **)&top, &top_x,
|
|
|
|
(const filestruct **)&bot, &bot_x, &right_side_up);
|
|
|
|
filepart = partition_filestruct(top, top_x, bot, bot_x);
|
2005-11-08 18:34:12 +00:00
|
|
|
if (!ISSET(NO_NEWLINES))
|
|
|
|
added_magicline = (openfile->filebot->data[0] != '\0');
|
2005-07-25 02:33:45 +00:00
|
|
|
openfile->mark_set = FALSE;
|
2005-07-24 19:57:51 +00:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Start from the top of the file. */
|
|
|
|
openfile->edittop = openfile->fileage;
|
|
|
|
openfile->current = openfile->fileage;
|
|
|
|
openfile->current_x = (size_t)-1;
|
|
|
|
openfile->placewewant = 0;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-11-15 23:45:29 +00:00
|
|
|
/* Find the first whole occurrence of word. */
|
2005-07-25 02:33:45 +00:00
|
|
|
findnextstr_wrap_reset();
|
2005-11-15 23:45:29 +00:00
|
|
|
while (findnextstr(TRUE, FALSE, openfile->fileage, 0, word,
|
2005-07-25 02:33:45 +00:00
|
|
|
&match_len)) {
|
|
|
|
if (is_whole_word(openfile->current_x, openfile->current->data,
|
|
|
|
word)) {
|
|
|
|
size_t xpt = xplustabs();
|
|
|
|
char *exp_word = display_string(openfile->current->data,
|
|
|
|
xpt, strnlenpt(openfile->current->data,
|
|
|
|
openfile->current_x + match_len) - xpt, FALSE);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
edit_refresh();
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
do_replace_highlight(TRUE, exp_word);
|
|
|
|
|
|
|
|
/* Allow all instances of the word to be corrected. */
|
2006-02-07 21:11:05 +00:00
|
|
|
canceled = (do_prompt(FALSE,
|
|
|
|
#ifndef DISABLE_TABCOMP
|
|
|
|
TRUE,
|
|
|
|
#endif
|
2008-03-05 07:34:01 +00:00
|
|
|
MSPELL, word,
|
2008-03-14 04:08:51 +00:00
|
|
|
&meta_key, &func_key,
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2006-02-07 21:11:05 +00:00
|
|
|
NULL,
|
2005-07-24 19:57:51 +00:00
|
|
|
#endif
|
2006-02-18 21:32:29 +00:00
|
|
|
edit_refresh, _("Edit a replacement")) == -1);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
do_replace_highlight(FALSE, exp_word);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
free(exp_word);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
if (!canceled && strcmp(word, answer) != 0) {
|
|
|
|
openfile->current_x--;
|
2005-11-15 23:45:29 +00:00
|
|
|
do_replace_loop(TRUE, &canceled, openfile->current,
|
|
|
|
&openfile->current_x, word);
|
2005-07-25 02:33:45 +00:00
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
break;
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
}
|
|
|
|
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-25 02:33:45 +00:00
|
|
|
if (old_mark_set) {
|
2005-11-08 18:34:12 +00:00
|
|
|
/* If the mark was on, the NO_NEWLINES flag isn't set, and we
|
|
|
|
* added a magicline, remove it now. */
|
|
|
|
if (!ISSET(NO_NEWLINES) && added_magicline)
|
2005-07-25 02:33:45 +00:00
|
|
|
remove_magicline();
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Put the beginning and the end of the mark at the beginning
|
|
|
|
* and the end of the spell-checked text. */
|
|
|
|
if (openfile->fileage == openfile->filebot)
|
|
|
|
bot_x += top_x;
|
|
|
|
if (right_side_up) {
|
|
|
|
openfile->mark_begin_x = top_x;
|
|
|
|
current_x_save = bot_x;
|
|
|
|
} else {
|
|
|
|
current_x_save = top_x;
|
|
|
|
openfile->mark_begin_x = bot_x;
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Unpartition the filestruct so that it contains all the text
|
|
|
|
* again, and turn the mark back on. */
|
|
|
|
unpartition_filestruct(&filepart);
|
|
|
|
openfile->mark_set = TRUE;
|
2005-07-24 19:57:51 +00:00
|
|
|
}
|
2005-07-25 02:33:45 +00:00
|
|
|
#endif
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Restore the search/replace strings. */
|
|
|
|
free(last_search);
|
|
|
|
last_search = save_search;
|
|
|
|
free(last_replace);
|
|
|
|
last_replace = save_replace;
|
|
|
|
|
|
|
|
/* Restore where we were. */
|
|
|
|
openfile->edittop = edittop_save;
|
2005-07-24 19:57:51 +00:00
|
|
|
openfile->current = current_save;
|
2005-07-25 02:33:45 +00:00
|
|
|
openfile->current_x = current_x_save;
|
|
|
|
openfile->placewewant = pww_save;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Restore case sensitivity setting. */
|
|
|
|
if (!case_sens_set)
|
|
|
|
UNSET(CASE_SENSITIVE);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Restore search/replace direction. */
|
|
|
|
if (backwards_search_set)
|
|
|
|
SET(BACKWARDS_SEARCH);
|
|
|
|
#endif
|
|
|
|
#ifdef HAVE_REGEX_H
|
|
|
|
/* Restore regular expression usage setting. */
|
|
|
|
if (regexp_set)
|
|
|
|
SET(USE_REGEXP);
|
|
|
|
#endif
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
return !canceled;
|
2005-07-24 19:57:51 +00:00
|
|
|
}
|
|
|
|
|
2005-12-08 07:09:08 +00:00
|
|
|
/* Internal (integrated) spell checking using the spell program,
|
|
|
|
* filtered through the sort and uniq programs. Return NULL for normal
|
|
|
|
* termination, and the error string otherwise. */
|
2005-07-25 02:33:45 +00:00
|
|
|
const char *do_int_speller(const char *tempfile_name)
|
2005-07-24 19:57:51 +00:00
|
|
|
{
|
2005-07-25 02:33:45 +00:00
|
|
|
char *read_buff, *read_buff_ptr, *read_buff_word;
|
|
|
|
size_t pipe_buff_size, read_buff_size, read_buff_read, bytesread;
|
|
|
|
int spell_fd[2], sort_fd[2], uniq_fd[2], tempfile_fd = -1;
|
|
|
|
pid_t pid_spell, pid_sort, pid_uniq;
|
|
|
|
int spell_status, sort_status, uniq_status;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Create all three pipes up front. */
|
|
|
|
if (pipe(spell_fd) == -1 || pipe(sort_fd) == -1 ||
|
|
|
|
pipe(uniq_fd) == -1)
|
|
|
|
return _("Could not create pipe");
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
statusbar(_("Creating misspelled word list, please wait..."));
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* A new process to run spell in. */
|
|
|
|
if ((pid_spell = fork()) == 0) {
|
2006-07-28 17:06:27 +00:00
|
|
|
/* Child continues (i.e. future spell process). */
|
2005-07-25 02:33:45 +00:00
|
|
|
close(spell_fd[0]);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Replace the standard input with the temp file. */
|
|
|
|
if ((tempfile_fd = open(tempfile_name, O_RDONLY)) == -1)
|
|
|
|
goto close_pipes_and_exit;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
if (dup2(tempfile_fd, STDIN_FILENO) != STDIN_FILENO)
|
|
|
|
goto close_pipes_and_exit;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
close(tempfile_fd);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Send spell's standard output to the pipe. */
|
|
|
|
if (dup2(spell_fd[1], STDOUT_FILENO) != STDOUT_FILENO)
|
|
|
|
goto close_pipes_and_exit;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
close(spell_fd[1]);
|
|
|
|
|
2005-11-29 20:01:06 +00:00
|
|
|
/* Start the spell program; we are using $PATH. */
|
2005-07-25 02:33:45 +00:00
|
|
|
execlp("spell", "spell", NULL);
|
|
|
|
|
|
|
|
/* This should not be reached if spell is found. */
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Parent continues here. */
|
|
|
|
close(spell_fd[1]);
|
|
|
|
|
|
|
|
/* A new process to run sort in. */
|
|
|
|
if ((pid_sort = fork()) == 0) {
|
2006-07-28 17:06:27 +00:00
|
|
|
/* Child continues (i.e. future spell process). Replace the
|
2005-07-25 02:33:45 +00:00
|
|
|
* standard input with the standard output of the old pipe. */
|
|
|
|
if (dup2(spell_fd[0], STDIN_FILENO) != STDIN_FILENO)
|
|
|
|
goto close_pipes_and_exit;
|
|
|
|
|
|
|
|
close(spell_fd[0]);
|
|
|
|
|
|
|
|
/* Send sort's standard output to the new pipe. */
|
|
|
|
if (dup2(sort_fd[1], STDOUT_FILENO) != STDOUT_FILENO)
|
|
|
|
goto close_pipes_and_exit;
|
|
|
|
|
|
|
|
close(sort_fd[1]);
|
|
|
|
|
|
|
|
/* Start the sort program. Use -f to remove mixed case. If
|
|
|
|
* this isn't portable, let me know. */
|
|
|
|
execlp("sort", "sort", "-f", NULL);
|
|
|
|
|
|
|
|
/* This should not be reached if sort is found. */
|
|
|
|
exit(1);
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
close(spell_fd[0]);
|
|
|
|
close(sort_fd[1]);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* A new process to run uniq in. */
|
|
|
|
if ((pid_uniq = fork()) == 0) {
|
2006-07-28 17:06:27 +00:00
|
|
|
/* Child continues (i.e. future uniq process). Replace the
|
2005-07-25 02:33:45 +00:00
|
|
|
* standard input with the standard output of the old pipe. */
|
|
|
|
if (dup2(sort_fd[0], STDIN_FILENO) != STDIN_FILENO)
|
|
|
|
goto close_pipes_and_exit;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
close(sort_fd[0]);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Send uniq's standard output to the new pipe. */
|
|
|
|
if (dup2(uniq_fd[1], STDOUT_FILENO) != STDOUT_FILENO)
|
|
|
|
goto close_pipes_and_exit;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
close(uniq_fd[1]);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Start the uniq program; we are using PATH. */
|
|
|
|
execlp("uniq", "uniq", NULL);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* This should not be reached if uniq is found. */
|
|
|
|
exit(1);
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
close(sort_fd[0]);
|
|
|
|
close(uniq_fd[1]);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* The child process was not forked successfully. */
|
|
|
|
if (pid_spell < 0 || pid_sort < 0 || pid_uniq < 0) {
|
|
|
|
close(uniq_fd[0]);
|
|
|
|
return _("Could not fork");
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Get the system pipe buffer size. */
|
|
|
|
if ((pipe_buff_size = fpathconf(uniq_fd[0], _PC_PIPE_BUF)) < 1) {
|
|
|
|
close(uniq_fd[0]);
|
|
|
|
return _("Could not get size of pipe buffer");
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Read in the returned spelling errors. */
|
|
|
|
read_buff_read = 0;
|
|
|
|
read_buff_size = pipe_buff_size + 1;
|
|
|
|
read_buff = read_buff_ptr = charalloc(read_buff_size);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
while ((bytesread = read(uniq_fd[0], read_buff_ptr,
|
|
|
|
pipe_buff_size)) > 0) {
|
|
|
|
read_buff_read += bytesread;
|
|
|
|
read_buff_size += pipe_buff_size;
|
|
|
|
read_buff = read_buff_ptr = charealloc(read_buff,
|
|
|
|
read_buff_size);
|
|
|
|
read_buff_ptr += read_buff_read;
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
*read_buff_ptr = '\0';
|
|
|
|
close(uniq_fd[0]);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Process the spelling errors. */
|
|
|
|
read_buff_word = read_buff_ptr = read_buff;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
while (*read_buff_ptr != '\0') {
|
|
|
|
if ((*read_buff_ptr == '\r') || (*read_buff_ptr == '\n')) {
|
|
|
|
*read_buff_ptr = '\0';
|
|
|
|
if (read_buff_word != read_buff_ptr) {
|
|
|
|
if (!do_int_spell_fix(read_buff_word)) {
|
|
|
|
read_buff_word = read_buff_ptr;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
read_buff_word = read_buff_ptr + 1;
|
2005-07-24 19:57:51 +00:00
|
|
|
}
|
2005-07-25 02:33:45 +00:00
|
|
|
read_buff_ptr++;
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Special case: the last word doesn't end with '\r' or '\n'. */
|
|
|
|
if (read_buff_word != read_buff_ptr)
|
|
|
|
do_int_spell_fix(read_buff_word);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
free(read_buff);
|
2005-12-08 07:09:08 +00:00
|
|
|
search_replace_abort();
|
2009-02-06 03:41:02 +00:00
|
|
|
edit_refresh_needed = TRUE;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Process the end of the spell process. */
|
|
|
|
waitpid(pid_spell, &spell_status, 0);
|
|
|
|
waitpid(pid_sort, &sort_status, 0);
|
|
|
|
waitpid(pid_uniq, &uniq_status, 0);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
if (WIFEXITED(spell_status) == 0 || WEXITSTATUS(spell_status))
|
|
|
|
return _("Error invoking \"spell\"");
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
if (WIFEXITED(sort_status) == 0 || WEXITSTATUS(sort_status))
|
|
|
|
return _("Error invoking \"sort -f\"");
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
if (WIFEXITED(uniq_status) == 0 || WEXITSTATUS(uniq_status))
|
|
|
|
return _("Error invoking \"uniq\"");
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Otherwise... */
|
|
|
|
return NULL;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
close_pipes_and_exit:
|
|
|
|
/* Don't leak any handles. */
|
|
|
|
close(tempfile_fd);
|
|
|
|
close(spell_fd[0]);
|
|
|
|
close(spell_fd[1]);
|
|
|
|
close(sort_fd[0]);
|
|
|
|
close(sort_fd[1]);
|
|
|
|
close(uniq_fd[0]);
|
|
|
|
close(uniq_fd[1]);
|
|
|
|
exit(1);
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-12-08 07:09:08 +00:00
|
|
|
/* External (alternate) spell checking. Return NULL for normal
|
|
|
|
* termination, and the error string otherwise. */
|
2005-07-25 02:33:45 +00:00
|
|
|
const char *do_alt_speller(char *tempfile_name)
|
|
|
|
{
|
|
|
|
int alt_spell_status;
|
|
|
|
size_t current_x_save = openfile->current_x;
|
|
|
|
size_t pww_save = openfile->placewewant;
|
|
|
|
ssize_t current_y_save = openfile->current_y;
|
|
|
|
ssize_t lineno_save = openfile->current->lineno;
|
|
|
|
pid_t pid_spell;
|
|
|
|
char *ptr;
|
|
|
|
static int arglen = 3;
|
|
|
|
static char **spellargs = NULL;
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-25 02:33:45 +00:00
|
|
|
bool old_mark_set = openfile->mark_set;
|
|
|
|
bool added_magicline = FALSE;
|
|
|
|
/* Whether we added a magicline after filebot. */
|
|
|
|
bool right_side_up = FALSE;
|
|
|
|
/* TRUE if (mark_begin, mark_begin_x) is the top of the mark,
|
|
|
|
* FALSE if (current, current_x) is. */
|
|
|
|
filestruct *top, *bot;
|
|
|
|
size_t top_x, bot_x;
|
|
|
|
ssize_t mb_lineno_save = 0;
|
|
|
|
/* We're going to close the current file, and open the output of
|
|
|
|
* the alternate spell command. The line that mark_begin points
|
|
|
|
* to will be freed, so we save the line number and restore it
|
|
|
|
* afterwards. */
|
|
|
|
size_t totsize_save = openfile->totsize;
|
|
|
|
/* Our saved value of totsize, used when we spell-check a marked
|
|
|
|
* selection. */
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
if (old_mark_set) {
|
|
|
|
/* If the mark is on, save the number of the line it starts on,
|
|
|
|
* and then turn the mark off. */
|
|
|
|
mb_lineno_save = openfile->mark_begin->lineno;
|
|
|
|
openfile->mark_set = FALSE;
|
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
#endif
|
|
|
|
|
2010-04-14 03:14:40 +00:00
|
|
|
if (openfile->totsize == 0) {
|
|
|
|
statusbar(_("Finished checking spelling"));
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
endwin();
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Set up an argument list to pass execvp(). */
|
|
|
|
if (spellargs == NULL) {
|
|
|
|
spellargs = (char **)nmalloc(arglen * sizeof(char *));
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
spellargs[0] = strtok(alt_speller, " ");
|
|
|
|
while ((ptr = strtok(NULL, " ")) != NULL) {
|
|
|
|
arglen++;
|
|
|
|
spellargs = (char **)nrealloc(spellargs, arglen *
|
|
|
|
sizeof(char *));
|
|
|
|
spellargs[arglen - 3] = ptr;
|
|
|
|
}
|
|
|
|
spellargs[arglen - 1] = NULL;
|
2005-07-24 19:57:51 +00:00
|
|
|
}
|
2005-07-25 02:33:45 +00:00
|
|
|
spellargs[arglen - 2] = tempfile_name;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Start a new process for the alternate speller. */
|
|
|
|
if ((pid_spell = fork()) == 0) {
|
2005-11-29 05:39:31 +00:00
|
|
|
/* Start alternate spell program; we are using $PATH. */
|
2005-07-25 02:33:45 +00:00
|
|
|
execvp(spellargs[0], spellargs);
|
|
|
|
|
|
|
|
/* Should not be reached, if alternate speller is found!!! */
|
|
|
|
exit(1);
|
2005-07-24 19:57:51 +00:00
|
|
|
}
|
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* If we couldn't fork, get out. */
|
|
|
|
if (pid_spell < 0)
|
|
|
|
return _("Could not fork");
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-26 00:06:34 +00:00
|
|
|
/* Don't handle a pending SIGWINCH until the alternate spell checker
|
2005-07-26 01:17:16 +00:00
|
|
|
* is finished and we've loaded the spell-checked file back in. */
|
2005-07-26 00:06:34 +00:00
|
|
|
allow_pending_sigwinch(FALSE);
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* Wait for the alternate spell checker to finish. */
|
2005-07-25 02:33:45 +00:00
|
|
|
wait(&alt_spell_status);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-08-14 20:08:49 +00:00
|
|
|
/* Reenter curses mode. */
|
|
|
|
doupdate();
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Restore the terminal to its previous state. */
|
|
|
|
terminal_init();
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Turn the cursor back on for sure. */
|
|
|
|
curs_set(1);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-26 01:17:16 +00:00
|
|
|
/* The screen might have been resized. If it has, reinitialize all
|
|
|
|
* the windows based on the new screen dimensions. */
|
|
|
|
window_init();
|
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
if (!WIFEXITED(alt_spell_status) ||
|
|
|
|
WEXITSTATUS(alt_spell_status) != 0) {
|
2007-01-11 22:46:22 +00:00
|
|
|
char *alt_spell_error;
|
2005-07-25 02:33:45 +00:00
|
|
|
char *invoke_error = _("Error invoking \"%s\"");
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Turn the mark back on if it was on before. */
|
|
|
|
openfile->mark_set = old_mark_set;
|
|
|
|
#endif
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2007-01-11 22:46:22 +00:00
|
|
|
alt_spell_error =
|
2005-07-25 02:33:45 +00:00
|
|
|
charalloc(strlen(invoke_error) +
|
|
|
|
strlen(alt_speller) + 1);
|
2007-01-11 22:46:22 +00:00
|
|
|
sprintf(alt_spell_error, invoke_error, alt_speller);
|
|
|
|
return alt_spell_error;
|
2005-07-25 02:33:45 +00:00
|
|
|
}
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-25 02:33:45 +00:00
|
|
|
if (old_mark_set) {
|
2005-11-08 18:34:12 +00:00
|
|
|
/* If the mark is on, partition the filestruct so that it
|
|
|
|
* contains only the marked text; if the NO_NEWLINES flag isn't
|
|
|
|
* set, keep track of whether the text will have a magicline
|
|
|
|
* added when we're done correcting misspelled words; and
|
|
|
|
* turn the mark off. */
|
2005-07-25 02:33:45 +00:00
|
|
|
mark_order((const filestruct **)&top, &top_x,
|
|
|
|
(const filestruct **)&bot, &bot_x, &right_side_up);
|
|
|
|
filepart = partition_filestruct(top, top_x, bot, bot_x);
|
2005-11-08 18:34:12 +00:00
|
|
|
if (!ISSET(NO_NEWLINES))
|
|
|
|
added_magicline = (openfile->filebot->data[0] != '\0');
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Get the number of characters in the marked text, and subtract
|
|
|
|
* it from the saved value of totsize. */
|
|
|
|
totsize_save -= get_totsize(top, bot);
|
|
|
|
}
|
|
|
|
#endif
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-11-08 19:15:58 +00:00
|
|
|
/* Replace the text of the current buffer with the spell-checked
|
|
|
|
* text. */
|
|
|
|
replace_buffer(tempfile_name);
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-25 02:33:45 +00:00
|
|
|
if (old_mark_set) {
|
|
|
|
filestruct *top_save = openfile->fileage;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-11-08 18:34:12 +00:00
|
|
|
/* If the mark was on, the NO_NEWLINES flag isn't set, and we
|
|
|
|
* added a magicline, remove it now. */
|
|
|
|
if (!ISSET(NO_NEWLINES) && added_magicline)
|
2005-07-25 02:33:45 +00:00
|
|
|
remove_magicline();
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Put the beginning and the end of the mark at the beginning
|
|
|
|
* and the end of the spell-checked text. */
|
|
|
|
if (openfile->fileage == openfile->filebot)
|
|
|
|
bot_x += top_x;
|
|
|
|
if (right_side_up) {
|
|
|
|
openfile->mark_begin_x = top_x;
|
|
|
|
current_x_save = bot_x;
|
|
|
|
} else {
|
|
|
|
current_x_save = top_x;
|
|
|
|
openfile->mark_begin_x = bot_x;
|
2005-07-24 19:57:51 +00:00
|
|
|
}
|
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Unpartition the filestruct so that it contains all the text
|
|
|
|
* again. Note that we've replaced the marked text originally
|
|
|
|
* in the partition with the spell-checked marked text in the
|
|
|
|
* temp file. */
|
|
|
|
unpartition_filestruct(&filepart);
|
|
|
|
|
|
|
|
/* Renumber starting with the beginning line of the old
|
2005-07-25 21:23:11 +00:00
|
|
|
* partition. Also add the number of characters in the
|
|
|
|
* spell-checked marked text to the saved value of totsize, and
|
|
|
|
* then make that saved value the actual value. */
|
2005-07-25 02:33:45 +00:00
|
|
|
renumber(top_save);
|
|
|
|
totsize_save += openfile->totsize;
|
|
|
|
openfile->totsize = totsize_save;
|
|
|
|
|
|
|
|
/* Assign mark_begin to the line where the mark began before. */
|
|
|
|
do_gotopos(mb_lineno_save, openfile->mark_begin_x,
|
|
|
|
current_y_save, 0);
|
|
|
|
openfile->mark_begin = openfile->current;
|
|
|
|
|
|
|
|
/* Assign mark_begin_x to the location in mark_begin where the
|
|
|
|
* mark began before, adjusted for any shortening of the
|
|
|
|
* line. */
|
|
|
|
openfile->mark_begin_x = openfile->current_x;
|
|
|
|
|
|
|
|
/* Turn the mark back on. */
|
|
|
|
openfile->mark_set = TRUE;
|
2005-07-24 19:57:51 +00:00
|
|
|
}
|
2005-07-25 02:33:45 +00:00
|
|
|
#endif
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* Go back to the old position, and mark the file as modified. */
|
|
|
|
do_gotopos(lineno_save, current_x_save, current_y_save, pww_save);
|
|
|
|
set_modified();
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-07-26 01:17:16 +00:00
|
|
|
/* Handle a pending SIGWINCH again. */
|
|
|
|
allow_pending_sigwinch(TRUE);
|
|
|
|
#endif
|
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
return NULL;
|
2005-07-24 19:57:51 +00:00
|
|
|
}
|
|
|
|
|
2005-12-08 07:09:08 +00:00
|
|
|
/* Spell check the current file. If an alternate spell checker is
|
|
|
|
* specified, use it. Otherwise, use the internal spell checker. */
|
2005-07-25 02:33:45 +00:00
|
|
|
void do_spell(void)
|
2005-07-24 19:57:51 +00:00
|
|
|
{
|
2007-01-11 22:46:22 +00:00
|
|
|
bool status;
|
2005-07-25 02:33:45 +00:00
|
|
|
FILE *temp_file;
|
|
|
|
char *temp = safe_tempfile(&temp_file);
|
|
|
|
const char *spell_msg;
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2010-11-12 06:22:12 +00:00
|
|
|
if (ISSET(RESTRICTED)) {
|
|
|
|
nano_disabled_msg();
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
if (temp == NULL) {
|
2006-05-03 13:11:00 +00:00
|
|
|
statusbar(_("Error writing temp file: %s"), strerror(errno));
|
2005-07-25 02:33:45 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2007-01-11 22:46:22 +00:00
|
|
|
status =
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2007-01-12 02:58:12 +00:00
|
|
|
openfile->mark_set ? write_marked_file(temp, temp_file, TRUE,
|
2006-11-25 22:38:17 +00:00
|
|
|
OVERWRITE) :
|
2005-07-25 02:33:45 +00:00
|
|
|
#endif
|
2006-11-25 22:38:17 +00:00
|
|
|
write_file(temp, temp_file, TRUE, OVERWRITE, FALSE);
|
2005-07-25 02:33:45 +00:00
|
|
|
|
2007-01-11 22:46:22 +00:00
|
|
|
if (!status) {
|
2005-07-25 02:33:45 +00:00
|
|
|
statusbar(_("Error writing temp file: %s"), strerror(errno));
|
|
|
|
free(temp);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
spell_msg = (alt_speller != NULL) ? do_alt_speller(temp) :
|
|
|
|
do_int_speller(temp);
|
|
|
|
unlink(temp);
|
|
|
|
free(temp);
|
|
|
|
|
2008-03-05 07:34:01 +00:00
|
|
|
currmenu = MMAIN;
|
2006-06-09 17:09:51 +00:00
|
|
|
|
2005-07-25 02:33:45 +00:00
|
|
|
/* If the spell-checker printed any error messages onscreen, make
|
|
|
|
* sure that they're cleared off. */
|
2006-06-09 17:09:51 +00:00
|
|
|
total_refresh();
|
2005-07-25 02:33:45 +00:00
|
|
|
|
|
|
|
if (spell_msg != NULL) {
|
|
|
|
if (errno == 0)
|
|
|
|
/* Don't display an error message of "Success". */
|
|
|
|
statusbar(_("Spell checking failed: %s"), spell_msg);
|
|
|
|
else
|
|
|
|
statusbar(_("Spell checking failed: %s: %s"), spell_msg,
|
|
|
|
strerror(errno));
|
|
|
|
} else
|
|
|
|
statusbar(_("Finished checking spelling"));
|
2005-07-24 19:57:51 +00:00
|
|
|
}
|
2005-07-25 02:33:45 +00:00
|
|
|
#endif /* !DISABLE_SPELLER */
|
2005-07-24 19:57:51 +00:00
|
|
|
|
2014-04-04 11:59:03 +00:00
|
|
|
#ifndef DISABLE_COLOR
|
2014-02-24 10:18:15 +00:00
|
|
|
/* Run linter. Based on alt-speller code. Return NULL for normal
|
|
|
|
* termination, and the error string otherwise. */
|
|
|
|
void do_linter(void)
|
|
|
|
{
|
|
|
|
char *read_buff, *read_buff_ptr, *read_buff_word, *ptr;
|
|
|
|
size_t pipe_buff_size, read_buff_size, read_buff_read, bytesread;
|
|
|
|
size_t parsesuccess = 0;
|
2014-03-04 03:55:43 +00:00
|
|
|
int lint_fd[2];
|
2014-02-24 10:18:15 +00:00
|
|
|
pid_t pid_lint;
|
|
|
|
int lint_status;
|
|
|
|
static int arglen = 3;
|
|
|
|
static char **lintargs = NULL;
|
|
|
|
char *lintcopy;
|
|
|
|
char *convendptr = NULL;
|
|
|
|
const sc *s;
|
|
|
|
lintstruct *lints = NULL, *tmplint = NULL, *curlint = NULL;
|
|
|
|
|
|
|
|
if (!openfile->syntax || !openfile->syntax->linter) {
|
|
|
|
statusbar(_("No linter defined for this file!"));
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (ISSET(RESTRICTED)) {
|
|
|
|
nano_disabled_msg();
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (openfile->modified) {
|
|
|
|
int i = do_yesno_prompt(FALSE,
|
|
|
|
_("Save modified buffer before linting?"));
|
|
|
|
|
|
|
|
if (i == 1) {
|
|
|
|
if (do_writeout(FALSE) != TRUE) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
lintcopy = mallocstrcpy(NULL, openfile->syntax->linter);
|
|
|
|
/* Create pipe up front. */
|
|
|
|
if (pipe(lint_fd) == -1) {
|
|
|
|
statusbar(_("Could not create pipe"));
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
statusbar(_("Invoking linter, please wait"));
|
|
|
|
|
|
|
|
/* Set up an argument list to pass execvp(). */
|
|
|
|
if (lintargs == NULL) {
|
|
|
|
lintargs = (char **)nmalloc(arglen * sizeof(char *));
|
|
|
|
|
|
|
|
lintargs[0] = strtok(lintcopy, " ");
|
|
|
|
while ((ptr = strtok(NULL, " ")) != NULL) {
|
|
|
|
arglen++;
|
|
|
|
lintargs = (char **)nrealloc(lintargs, arglen *
|
|
|
|
sizeof(char *));
|
|
|
|
lintargs[arglen - 3] = ptr;
|
|
|
|
}
|
|
|
|
lintargs[arglen - 1] = NULL;
|
|
|
|
}
|
|
|
|
lintargs[arglen - 2] = openfile->filename;
|
|
|
|
|
|
|
|
/* A new process to run linter. */
|
|
|
|
if ((pid_lint = fork()) == 0) {
|
|
|
|
|
|
|
|
/* Child continues (i.e. future spell process). */
|
|
|
|
close(lint_fd[0]);
|
|
|
|
|
|
|
|
/* Send spell's standard output/err to the pipe. */
|
|
|
|
if (dup2(lint_fd[1], STDOUT_FILENO) != STDOUT_FILENO)
|
|
|
|
exit(1);
|
|
|
|
if (dup2(lint_fd[1], STDERR_FILENO) != STDERR_FILENO)
|
|
|
|
exit(1);
|
|
|
|
|
|
|
|
close(lint_fd[1]);
|
|
|
|
|
|
|
|
/* Start the linter program; we are using $PATH. */
|
|
|
|
execvp(lintargs[0], lintargs);
|
|
|
|
|
|
|
|
/* This should not be reached if linter is found. */
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Parent continues here. */
|
|
|
|
close(lint_fd[1]);
|
|
|
|
|
|
|
|
/* The child process was not forked successfully. */
|
|
|
|
if (pid_lint < 0) {
|
|
|
|
close(lint_fd[0]);
|
|
|
|
statusbar(_("Could not fork"));
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Get the system pipe buffer size. */
|
|
|
|
if ((pipe_buff_size = fpathconf(lint_fd[0], _PC_PIPE_BUF)) < 1) {
|
|
|
|
close(lint_fd[0]);
|
2014-03-17 21:36:37 +00:00
|
|
|
statusbar(_("Could not get size of pipe buffer"));
|
2014-02-24 10:18:15 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Read in the returned spelling errors. */
|
|
|
|
read_buff_read = 0;
|
|
|
|
read_buff_size = pipe_buff_size + 1;
|
|
|
|
read_buff = read_buff_ptr = charalloc(read_buff_size);
|
|
|
|
|
|
|
|
while ((bytesread = read(lint_fd[0], read_buff_ptr,
|
|
|
|
pipe_buff_size)) > 0) {
|
|
|
|
#ifdef DEBUG
|
|
|
|
fprintf(stderr, "text.c:do_linter:%d bytes (%s)\n", bytesread, read_buff_ptr);
|
|
|
|
#endif
|
|
|
|
read_buff_read += bytesread;
|
|
|
|
read_buff_size += pipe_buff_size;
|
|
|
|
read_buff = read_buff_ptr = charealloc(read_buff,
|
|
|
|
read_buff_size);
|
|
|
|
read_buff_ptr += read_buff_read;
|
|
|
|
}
|
|
|
|
|
|
|
|
*read_buff_ptr = '\0';
|
|
|
|
close(lint_fd[0]);
|
|
|
|
|
|
|
|
#ifdef DEBUG
|
|
|
|
fprintf(stderr, "text.c:do_lint:Raw output: %s\n", read_buff);
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* Process output. */
|
|
|
|
read_buff_word = read_buff_ptr = read_buff;
|
|
|
|
|
|
|
|
while (*read_buff_ptr != '\0') {
|
|
|
|
if ((*read_buff_ptr == '\r') || (*read_buff_ptr == '\n')) {
|
|
|
|
*read_buff_ptr = '\0';
|
|
|
|
if (read_buff_word != read_buff_ptr) {
|
|
|
|
char *filename = NULL, *linestr = NULL, *maybecol = NULL;
|
|
|
|
char *message = mallocstrcpy(NULL, read_buff_word);
|
|
|
|
|
|
|
|
/* At the moment we're assuming the following formats:
|
|
|
|
filenameorcategory:line:column:message (e.g. splint)
|
|
|
|
filenameorcategory:line:message (e.g. pyflakes)
|
|
|
|
filenameorcategory:line,col:message (e.g. pylint)
|
|
|
|
This could be turnes into some scanf() based parser but ugh.
|
|
|
|
*/
|
|
|
|
if ((filename = strtok(read_buff_word, ":")) != NULL) {
|
|
|
|
if ((linestr = strtok(NULL, ":")) != NULL) {
|
|
|
|
if ((maybecol = strtok(NULL, ":")) != NULL) {
|
|
|
|
ssize_t tmplineno = 0, tmpcolno = 0;
|
|
|
|
char *tmplinecol;
|
|
|
|
|
|
|
|
tmplineno = strtol(linestr, NULL, 10);
|
|
|
|
if (tmplineno <= 0) {
|
|
|
|
read_buff_ptr++;
|
|
|
|
free(message);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
tmpcolno = strtol(maybecol, &convendptr, 10);
|
|
|
|
if (*convendptr != '\0') {
|
|
|
|
|
|
|
|
/* Prev field might still be line,col format */
|
|
|
|
strtok(linestr, ",");
|
|
|
|
if ((tmplinecol = strtok(NULL, ",")) != NULL)
|
|
|
|
tmpcolno = strtol(tmplinecol, NULL, 10);
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef DEBUG
|
|
|
|
fprintf(stderr, "text.c:do_lint:Successful parse! %d:%d:%s\n", tmplineno, tmpcolno, message);
|
|
|
|
#endif
|
|
|
|
/* Nice we have a lint message we can use */
|
|
|
|
parsesuccess++;
|
|
|
|
tmplint = curlint;
|
|
|
|
curlint = nmalloc(sizeof(lintstruct));
|
|
|
|
curlint->next = NULL;
|
|
|
|
curlint->prev = tmplint;
|
|
|
|
if (curlint->prev != NULL)
|
|
|
|
curlint->prev->next = curlint;
|
|
|
|
curlint->msg = mallocstrcpy(NULL, message);
|
|
|
|
curlint->lineno = tmplineno;
|
|
|
|
curlint->colno = tmpcolno;
|
|
|
|
curlint->filename = mallocstrcpy(NULL, filename);
|
|
|
|
|
|
|
|
if (lints == NULL)
|
|
|
|
lints = curlint;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} else
|
|
|
|
free(message);
|
|
|
|
}
|
|
|
|
read_buff_word = read_buff_ptr + 1;
|
|
|
|
}
|
|
|
|
read_buff_ptr++;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Process the end of the lint process. */
|
|
|
|
waitpid(pid_lint, &lint_status, 0);
|
|
|
|
|
|
|
|
free(read_buff);
|
|
|
|
|
|
|
|
if (parsesuccess == 0) {
|
|
|
|
statusbar(_("Got 0 parsable lines from command: %s"), openfile->syntax->linter);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
currmenu = MLINTER;
|
|
|
|
bottombars(MLINTER);
|
|
|
|
tmplint = NULL;
|
|
|
|
curlint = lints;
|
|
|
|
while (1) {
|
|
|
|
ssize_t tmpcol = 1;
|
|
|
|
int kbinput;
|
|
|
|
bool meta_key, func_key;
|
|
|
|
|
|
|
|
if (curlint->colno > 0)
|
|
|
|
tmpcol = curlint->colno;
|
|
|
|
|
|
|
|
if (tmplint != curlint) {
|
2014-04-03 21:06:30 +00:00
|
|
|
#ifndef NANO_TINY
|
2014-02-24 10:18:15 +00:00
|
|
|
struct stat lintfileinfo;
|
|
|
|
|
|
|
|
new_lint_loop:
|
|
|
|
if (stat(curlint->filename, &lintfileinfo) != -1) {
|
|
|
|
if (openfile->current_stat->st_ino != lintfileinfo.st_ino) {
|
|
|
|
openfilestruct *tmpof = openfile;
|
|
|
|
while (tmpof != openfile->next) {
|
|
|
|
if (tmpof->current_stat->st_ino == lintfileinfo.st_ino)
|
|
|
|
break;
|
|
|
|
tmpof = tmpof->next;
|
|
|
|
}
|
|
|
|
if (tmpof->current_stat->st_ino != lintfileinfo.st_ino) {
|
|
|
|
char *msg = charalloc(1024 + strlen(curlint->filename));
|
|
|
|
int i;
|
|
|
|
|
|
|
|
sprintf(msg, _("This message is for unopened file %s, open it in a new buffer?"),
|
|
|
|
curlint->filename);
|
|
|
|
i = do_yesno_prompt(FALSE, msg);
|
|
|
|
free(msg);
|
|
|
|
if (i == 1) {
|
|
|
|
SET(MULTIBUFFER);
|
|
|
|
open_buffer(curlint->filename, FALSE);
|
|
|
|
} else {
|
|
|
|
char *dontwantfile = curlint->filename;
|
|
|
|
|
|
|
|
while (curlint != NULL && !strcmp(curlint->filename, dontwantfile))
|
|
|
|
curlint = curlint->next;
|
|
|
|
if (curlint == NULL) {
|
|
|
|
statusbar("No more errors in un-opened filed, cancelling");
|
|
|
|
break;
|
|
|
|
} else
|
|
|
|
goto new_lint_loop;
|
|
|
|
}
|
|
|
|
} else
|
|
|
|
openfile = tmpof;
|
|
|
|
}
|
|
|
|
}
|
2014-03-17 14:15:57 +00:00
|
|
|
#endif /* !NANO_TINY */
|
2014-02-24 10:18:15 +00:00
|
|
|
do_gotolinecolumn(curlint->lineno, tmpcol, FALSE, FALSE, FALSE, FALSE);
|
|
|
|
titlebar(NULL);
|
|
|
|
edit_refresh();
|
|
|
|
statusbar(curlint->msg);
|
|
|
|
bottombars(MLINTER);
|
|
|
|
}
|
|
|
|
|
|
|
|
kbinput = get_kbinput(bottomwin, &meta_key, &func_key);
|
|
|
|
s = get_shortcut(currmenu, &kbinput, &meta_key, &func_key);
|
|
|
|
tmplint = curlint;
|
|
|
|
|
|
|
|
if (!s)
|
|
|
|
continue;
|
|
|
|
else if (s->scfunc == do_cancel)
|
|
|
|
break;
|
|
|
|
else if (s->scfunc == do_help_void) {
|
|
|
|
tmplint = NULL;
|
|
|
|
do_help_void();
|
|
|
|
} else if (s->scfunc == do_page_down) {
|
|
|
|
if (curlint->next != NULL)
|
|
|
|
curlint = curlint->next;
|
|
|
|
else {
|
|
|
|
statusbar(_("At last message"));
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
} else if (s->scfunc == do_page_up) {
|
|
|
|
if (curlint->prev != NULL)
|
|
|
|
curlint = curlint->prev;
|
|
|
|
else {
|
|
|
|
statusbar(_("At first message"));
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
for (tmplint = lints; tmplint != NULL; tmplint = tmplint->next) {
|
|
|
|
free(tmplint->msg);
|
|
|
|
free(tmplint->filename);
|
|
|
|
free(tmplint);
|
|
|
|
}
|
|
|
|
blank_statusbar();
|
|
|
|
currmenu = MMAIN;
|
|
|
|
display_main_list();
|
|
|
|
}
|
2014-04-04 11:59:03 +00:00
|
|
|
#endif /* !DISABLE_COLOR */
|
2014-02-24 10:18:15 +00:00
|
|
|
|
2005-11-15 03:17:35 +00:00
|
|
|
#ifndef NANO_TINY
|
2005-08-10 22:51:49 +00:00
|
|
|
/* Our own version of "wc". Note that its character counts are in
|
|
|
|
* multibyte characters instead of single-byte characters. */
|
2005-07-25 04:21:46 +00:00
|
|
|
void do_wordlinechar_count(void)
|
2005-07-24 19:57:51 +00:00
|
|
|
{
|
2005-07-25 21:23:11 +00:00
|
|
|
size_t words = 0, chars = 0;
|
2008-05-31 23:09:40 +00:00
|
|
|
ssize_t nlines = 0;
|
2005-07-25 03:47:08 +00:00
|
|
|
size_t current_x_save = openfile->current_x;
|
2005-07-24 19:57:51 +00:00
|
|
|
size_t pww_save = openfile->placewewant;
|
|
|
|
filestruct *current_save = openfile->current;
|
|
|
|
bool old_mark_set = openfile->mark_set;
|
|
|
|
filestruct *top, *bot;
|
|
|
|
size_t top_x, bot_x;
|
|
|
|
|
|
|
|
if (old_mark_set) {
|
|
|
|
/* If the mark is on, partition the filestruct so that it
|
2005-11-03 21:08:39 +00:00
|
|
|
* contains only the marked text, and turn the mark off. */
|
2005-07-24 19:57:51 +00:00
|
|
|
mark_order((const filestruct **)&top, &top_x,
|
|
|
|
(const filestruct **)&bot, &bot_x, NULL);
|
|
|
|
filepart = partition_filestruct(top, top_x, bot, bot_x);
|
|
|
|
openfile->mark_set = FALSE;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Start at the top of the file. */
|
|
|
|
openfile->current = openfile->fileage;
|
|
|
|
openfile->current_x = 0;
|
|
|
|
openfile->placewewant = 0;
|
|
|
|
|
|
|
|
/* Keep moving to the next word (counting punctuation characters as
|
2005-07-25 03:47:08 +00:00
|
|
|
* part of a word, as "wc -w" does), without updating the screen,
|
|
|
|
* until we reach the end of the file, incrementing the total word
|
|
|
|
* count whenever we're on a word just before moving. */
|
2005-07-24 19:57:51 +00:00
|
|
|
while (openfile->current != openfile->filebot ||
|
2005-11-03 21:08:39 +00:00
|
|
|
openfile->current->data[openfile->current_x] != '\0') {
|
2005-07-24 19:57:51 +00:00
|
|
|
if (do_next_word(TRUE, FALSE))
|
|
|
|
words++;
|
|
|
|
}
|
|
|
|
|
2005-07-25 03:47:08 +00:00
|
|
|
/* Get the total line and character counts, as "wc -l" and "wc -c"
|
|
|
|
* do, but get the latter in multibyte characters. */
|
2005-07-24 19:57:51 +00:00
|
|
|
if (old_mark_set) {
|
2008-05-31 23:09:40 +00:00
|
|
|
nlines = openfile->filebot->lineno -
|
2005-07-25 18:59:24 +00:00
|
|
|
openfile->fileage->lineno + 1;
|
2005-07-25 03:47:08 +00:00
|
|
|
chars = get_totsize(openfile->fileage, openfile->filebot);
|
|
|
|
|
2005-07-24 19:57:51 +00:00
|
|
|
/* Unpartition the filestruct so that it contains all the text
|
|
|
|
* again, and turn the mark back on. */
|
|
|
|
unpartition_filestruct(&filepart);
|
|
|
|
openfile->mark_set = TRUE;
|
2005-07-25 03:47:08 +00:00
|
|
|
} else {
|
2008-05-31 23:09:40 +00:00
|
|
|
nlines = openfile->filebot->lineno;
|
2005-07-25 03:47:08 +00:00
|
|
|
chars = openfile->totsize;
|
2005-07-24 19:57:51 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Restore where we were. */
|
|
|
|
openfile->current = current_save;
|
|
|
|
openfile->current_x = current_x_save;
|
|
|
|
openfile->placewewant = pww_save;
|
|
|
|
|
2005-07-25 03:47:08 +00:00
|
|
|
/* Display the total word, line, and character counts on the
|
|
|
|
* statusbar. */
|
2005-10-06 20:46:11 +00:00
|
|
|
statusbar(_("%sWords: %lu Lines: %ld Chars: %lu"), old_mark_set ?
|
2008-05-31 23:09:40 +00:00
|
|
|
_("In Selection: ") : "", (unsigned long)words, (long)nlines,
|
2005-07-25 21:23:11 +00:00
|
|
|
(unsigned long)chars);
|
2005-07-24 19:57:51 +00:00
|
|
|
}
|
2005-11-15 03:17:35 +00:00
|
|
|
#endif /* !NANO_TINY */
|
2005-11-07 06:06:05 +00:00
|
|
|
|
2005-12-08 07:09:08 +00:00
|
|
|
/* Get verbatim input. */
|
2005-11-07 06:06:05 +00:00
|
|
|
void do_verbatim_input(void)
|
|
|
|
{
|
|
|
|
int *kbinput;
|
|
|
|
size_t kbinput_len, i;
|
|
|
|
char *output;
|
|
|
|
|
2006-05-27 16:02:48 +00:00
|
|
|
/* TRANSLATORS: This is displayed when the next keystroke will be
|
|
|
|
* inserted verbatim. */
|
2005-11-07 06:06:05 +00:00
|
|
|
statusbar(_("Verbatim Input"));
|
|
|
|
|
|
|
|
/* Read in all the verbatim characters. */
|
|
|
|
kbinput = get_verbatim_kbinput(edit, &kbinput_len);
|
|
|
|
|
2006-05-27 18:19:03 +00:00
|
|
|
/* If constant cursor position display is on, make sure the current
|
|
|
|
* cursor position will be properly displayed on the statusbar.
|
|
|
|
* Otherwise, blank the statusbar. */
|
|
|
|
if (ISSET(CONST_UPDATE))
|
|
|
|
do_cursorpos(TRUE);
|
|
|
|
else {
|
|
|
|
blank_statusbar();
|
|
|
|
wnoutrefresh(bottomwin);
|
|
|
|
}
|
2006-05-27 17:39:19 +00:00
|
|
|
|
2005-11-07 06:06:05 +00:00
|
|
|
/* Display all the verbatim characters at once, not filtering out
|
|
|
|
* control characters. */
|
|
|
|
output = charalloc(kbinput_len + 1);
|
|
|
|
|
|
|
|
for (i = 0; i < kbinput_len; i++)
|
|
|
|
output[i] = (char)kbinput[i];
|
|
|
|
output[i] = '\0';
|
|
|
|
|
2006-12-02 17:22:21 +00:00
|
|
|
free(kbinput);
|
|
|
|
|
2005-11-07 06:06:05 +00:00
|
|
|
do_output(output, kbinput_len, TRUE);
|
|
|
|
|
|
|
|
free(output);
|
|
|
|
}
|
2008-07-10 20:13:04 +00:00
|
|
|
|