368 lines
6.6 KiB
C
368 lines
6.6 KiB
C
/*-
|
|
* Copyright (c) 1993, 1994
|
|
* The Regents of the University of California. All rights reserved.
|
|
* Copyright (c) 1993, 1994, 1995, 1996
|
|
* Keith Bostic. All rights reserved.
|
|
*
|
|
* See the LICENSE file for redistribution information.
|
|
*/
|
|
|
|
#include "config.h"
|
|
|
|
#ifndef lint
|
|
static const char sccsid[] = "@(#)options_f.c 10.23 (Berkeley) 5/4/96";
|
|
#endif /* not lint */
|
|
|
|
#include <sys/types.h>
|
|
#include <sys/queue.h>
|
|
#include <sys/stat.h>
|
|
|
|
#include <bitstring.h>
|
|
#include <ctype.h>
|
|
#include <errno.h>
|
|
#include <limits.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <unistd.h>
|
|
|
|
#include "common.h"
|
|
|
|
/*
|
|
* PUBLIC: int f_altwerase __P((SCR *, OPTION *, char *, u_long *));
|
|
*/
|
|
int
|
|
f_altwerase(sp, op, str, valp)
|
|
SCR *sp;
|
|
OPTION *op;
|
|
char *str;
|
|
u_long *valp;
|
|
{
|
|
if (!*valp)
|
|
O_CLR(sp, O_TTYWERASE);
|
|
return (0);
|
|
}
|
|
|
|
/*
|
|
* PUBLIC: int f_columns __P((SCR *, OPTION *, char *, u_long *));
|
|
*/
|
|
int
|
|
f_columns(sp, op, str, valp)
|
|
SCR *sp;
|
|
OPTION *op;
|
|
char *str;
|
|
u_long *valp;
|
|
{
|
|
/* Validate the number. */
|
|
if (*valp < MINIMUM_SCREEN_COLS) {
|
|
msgq(sp, M_ERR, "040|Screen columns too small, less than %d",
|
|
MINIMUM_SCREEN_COLS);
|
|
return (1);
|
|
}
|
|
|
|
/*
|
|
* !!!
|
|
* It's not uncommon for allocation of huge chunks of memory to cause
|
|
* core dumps on various systems. So, we prune out numbers that are
|
|
* "obviously" wrong. Vi will not work correctly if it has the wrong
|
|
* number of lines/columns for the screen, but at least we don't drop
|
|
* core.
|
|
*/
|
|
#define MAXIMUM_SCREEN_COLS 500
|
|
if (*valp > MAXIMUM_SCREEN_COLS) {
|
|
msgq(sp, M_ERR, "041|Screen columns too large, greater than %d",
|
|
MAXIMUM_SCREEN_COLS);
|
|
return (1);
|
|
}
|
|
return (0);
|
|
}
|
|
|
|
/*
|
|
* PUBLIC: int f_lines __P((SCR *, OPTION *, char *, u_long *));
|
|
*/
|
|
int
|
|
f_lines(sp, op, str, valp)
|
|
SCR *sp;
|
|
OPTION *op;
|
|
char *str;
|
|
u_long *valp;
|
|
{
|
|
/* Validate the number. */
|
|
if (*valp < MINIMUM_SCREEN_ROWS) {
|
|
msgq(sp, M_ERR, "042|Screen lines too small, less than %d",
|
|
MINIMUM_SCREEN_ROWS);
|
|
return (1);
|
|
}
|
|
|
|
/*
|
|
* !!!
|
|
* It's not uncommon for allocation of huge chunks of memory to cause
|
|
* core dumps on various systems. So, we prune out numbers that are
|
|
* "obviously" wrong. Vi will not work correctly if it has the wrong
|
|
* number of lines/columns for the screen, but at least we don't drop
|
|
* core.
|
|
*/
|
|
#define MAXIMUM_SCREEN_ROWS 500
|
|
if (*valp > MAXIMUM_SCREEN_ROWS) {
|
|
msgq(sp, M_ERR, "043|Screen lines too large, greater than %d",
|
|
MAXIMUM_SCREEN_ROWS);
|
|
return (1);
|
|
}
|
|
|
|
/*
|
|
* Set the value, and the related scroll value. If no window
|
|
* value set, set a new default window.
|
|
*/
|
|
o_set(sp, O_LINES, 0, NULL, *valp);
|
|
if (*valp == 1) {
|
|
sp->defscroll = 1;
|
|
|
|
if (O_VAL(sp, O_WINDOW) == O_D_VAL(sp, O_WINDOW) ||
|
|
O_VAL(sp, O_WINDOW) > *valp) {
|
|
o_set(sp, O_WINDOW, 0, NULL, 1);
|
|
o_set(sp, O_WINDOW, OS_DEF, NULL, 1);
|
|
}
|
|
} else {
|
|
sp->defscroll = (*valp - 1) / 2;
|
|
|
|
if (O_VAL(sp, O_WINDOW) == O_D_VAL(sp, O_WINDOW) ||
|
|
O_VAL(sp, O_WINDOW) > *valp) {
|
|
o_set(sp, O_WINDOW, 0, NULL, *valp - 1);
|
|
o_set(sp, O_WINDOW, OS_DEF, NULL, *valp - 1);
|
|
}
|
|
}
|
|
return (0);
|
|
}
|
|
|
|
/*
|
|
* PUBLIC: int f_lisp __P((SCR *, OPTION *, char *, u_long *));
|
|
*/
|
|
int
|
|
f_lisp(sp, op, str, valp)
|
|
SCR *sp;
|
|
OPTION *op;
|
|
char *str;
|
|
u_long *valp;
|
|
{
|
|
msgq(sp, M_ERR, "044|The lisp option is not implemented");
|
|
return (0);
|
|
}
|
|
|
|
/*
|
|
* PUBLIC: int f_msgcat __P((SCR *, OPTION *, char *, u_long *));
|
|
*/
|
|
int
|
|
f_msgcat(sp, op, str, valp)
|
|
SCR *sp;
|
|
OPTION *op;
|
|
char *str;
|
|
u_long *valp;
|
|
{
|
|
(void)msg_open(sp, str);
|
|
return (0);
|
|
}
|
|
|
|
/*
|
|
* PUBLIC: int f_paragraph __P((SCR *, OPTION *, char *, u_long *));
|
|
*/
|
|
int
|
|
f_paragraph(sp, op, str, valp)
|
|
SCR *sp;
|
|
OPTION *op;
|
|
char *str;
|
|
u_long *valp;
|
|
{
|
|
if (strlen(str) & 1) {
|
|
msgq(sp, M_ERR,
|
|
"048|The paragraph option must be in two character groups");
|
|
return (1);
|
|
}
|
|
return (0);
|
|
}
|
|
|
|
/*
|
|
* PUBLIC: int f_print __P((SCR *, OPTION *, char *, u_long *));
|
|
*/
|
|
int
|
|
f_print(sp, op, str, valp)
|
|
SCR *sp;
|
|
OPTION *op;
|
|
char *str;
|
|
u_long *valp;
|
|
{
|
|
/* Reinitialize the key fast lookup table. */
|
|
v_key_ilookup(sp);
|
|
|
|
/* Reformat the screen. */
|
|
F_SET(sp, SC_SCR_REFORMAT);
|
|
return (0);
|
|
}
|
|
|
|
/*
|
|
* PUBLIC: int f_readonly __P((SCR *, OPTION *, char *, u_long *));
|
|
*/
|
|
int
|
|
f_readonly(sp, op, str, valp)
|
|
SCR *sp;
|
|
OPTION *op;
|
|
char *str;
|
|
u_long *valp;
|
|
{
|
|
/*
|
|
* !!!
|
|
* See the comment in exf.c.
|
|
*/
|
|
if (*valp)
|
|
F_CLR(sp, SC_READONLY);
|
|
else
|
|
F_SET(sp, SC_READONLY);
|
|
return (0);
|
|
}
|
|
|
|
/*
|
|
* PUBLIC: int f_recompile __P((SCR *, OPTION *, char *, u_long *));
|
|
*/
|
|
int
|
|
f_recompile(sp, op, str, valp)
|
|
SCR *sp;
|
|
OPTION *op;
|
|
char *str;
|
|
u_long *valp;
|
|
{
|
|
if (F_ISSET(sp, SC_RE_SEARCH)) {
|
|
regfree(&sp->re_c);
|
|
F_CLR(sp, SC_RE_SEARCH);
|
|
}
|
|
if (F_ISSET(sp, SC_RE_SUBST)) {
|
|
regfree(&sp->subre_c);
|
|
F_CLR(sp, SC_RE_SUBST);
|
|
}
|
|
return (0);
|
|
}
|
|
|
|
/*
|
|
* PUBLIC: int f_reformat __P((SCR *, OPTION *, char *, u_long *));
|
|
*/
|
|
int
|
|
f_reformat(sp, op, str, valp)
|
|
SCR *sp;
|
|
OPTION *op;
|
|
char *str;
|
|
u_long *valp;
|
|
{
|
|
F_SET(sp, SC_SCR_REFORMAT);
|
|
return (0);
|
|
}
|
|
|
|
/*
|
|
* PUBLIC: int f_section __P((SCR *, OPTION *, char *, u_long *));
|
|
*/
|
|
int
|
|
f_section(sp, op, str, valp)
|
|
SCR *sp;
|
|
OPTION *op;
|
|
char *str;
|
|
u_long *valp;
|
|
{
|
|
if (strlen(str) & 1) {
|
|
msgq(sp, M_ERR,
|
|
"049|The section option must be in two character groups");
|
|
return (1);
|
|
}
|
|
return (0);
|
|
}
|
|
|
|
/*
|
|
* PUBLIC: int f_ttywerase __P((SCR *, OPTION *, char *, u_long *));
|
|
*/
|
|
int
|
|
f_ttywerase(sp, op, str, valp)
|
|
SCR *sp;
|
|
OPTION *op;
|
|
char *str;
|
|
u_long *valp;
|
|
{
|
|
if (!*valp)
|
|
O_CLR(sp, O_ALTWERASE);
|
|
return (0);
|
|
}
|
|
|
|
/*
|
|
* PUBLIC: int f_w300 __P((SCR *, OPTION *, char *, u_long *));
|
|
*/
|
|
int
|
|
f_w300(sp, op, str, valp)
|
|
SCR *sp;
|
|
OPTION *op;
|
|
char *str;
|
|
u_long *valp;
|
|
{
|
|
u_long v;
|
|
|
|
/* Historical behavior for w300 was < 1200. */
|
|
if (sp->gp->scr_baud(sp, &v))
|
|
return (1);
|
|
if (v >= 1200)
|
|
return (0);
|
|
|
|
return (f_window(sp, op, str, valp));
|
|
}
|
|
|
|
/*
|
|
* PUBLIC: int f_w1200 __P((SCR *, OPTION *, char *, u_long *));
|
|
*/
|
|
int
|
|
f_w1200(sp, op, str, valp)
|
|
SCR *sp;
|
|
OPTION *op;
|
|
char *str;
|
|
u_long *valp;
|
|
{
|
|
u_long v;
|
|
|
|
/* Historical behavior for w1200 was == 1200. */
|
|
if (sp->gp->scr_baud(sp, &v))
|
|
return (1);
|
|
if (v < 1200 || v > 4800)
|
|
return (0);
|
|
|
|
return (f_window(sp, op, str, valp));
|
|
}
|
|
|
|
/*
|
|
* PUBLIC: int f_w9600 __P((SCR *, OPTION *, char *, u_long *));
|
|
*/
|
|
int
|
|
f_w9600(sp, op, str, valp)
|
|
SCR *sp;
|
|
OPTION *op;
|
|
char *str;
|
|
u_long *valp;
|
|
{
|
|
u_long v;
|
|
|
|
/* Historical behavior for w9600 was > 1200. */
|
|
if (sp->gp->scr_baud(sp, &v))
|
|
return (1);
|
|
if (v <= 4800)
|
|
return (0);
|
|
|
|
return (f_window(sp, op, str, valp));
|
|
}
|
|
|
|
/*
|
|
* PUBLIC: int f_window __P((SCR *, OPTION *, char *, u_long *));
|
|
*/
|
|
int
|
|
f_window(sp, op, str, valp)
|
|
SCR *sp;
|
|
OPTION *op;
|
|
char *str;
|
|
u_long *valp;
|
|
{
|
|
if (*valp >= O_VAL(sp, O_LINES) - 1 &&
|
|
(*valp = O_VAL(sp, O_LINES) - 1) == 0)
|
|
*valp = 1;
|
|
return (0);
|
|
}
|