344 lines
6.7 KiB
C
344 lines
6.7 KiB
C
/* $NetBSD: value.c,v 1.14 2006/12/14 17:09:43 christos Exp $ */
|
|
|
|
/*
|
|
* Copyright (c) 1983, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*/
|
|
|
|
#include <sys/cdefs.h>
|
|
#ifndef lint
|
|
#if 0
|
|
static char sccsid[] = "@(#)value.c 8.1 (Berkeley) 6/6/93";
|
|
#endif
|
|
__RCSID("$NetBSD: value.c,v 1.14 2006/12/14 17:09:43 christos Exp $");
|
|
#endif /* not lint */
|
|
|
|
#include "tip.h"
|
|
|
|
#define MIDDLE 35
|
|
|
|
static int col = 0;
|
|
|
|
static int vaccess(int, int);
|
|
static void vassign(value_t *, char *);
|
|
static value_t *vlookup(const char *);
|
|
static void vprint(value_t *);
|
|
static void vtoken(char *);
|
|
|
|
/*
|
|
* Variable manipulation
|
|
*/
|
|
void
|
|
vinit(void)
|
|
{
|
|
value_t *p;
|
|
char *cp;
|
|
FILE *f;
|
|
char file[MAXPATHLEN];
|
|
|
|
for (p = vtable; p->v_name != NULL; p++) {
|
|
if (p->v_type&ENVIRON)
|
|
if ((cp = getenv(p->v_name)) != NULL)
|
|
p->v_value = cp;
|
|
if (p->v_type&IREMOTE)
|
|
setnumber(p->v_value, *address(p->v_value));
|
|
}
|
|
/*
|
|
* Read the .tiprc file in the HOME directory
|
|
* for sets
|
|
*/
|
|
(void)snprintf(file, sizeof(file), "%s/.tiprc", (char *)value(HOME));
|
|
if ((f = fopen(file, "r")) != NULL) {
|
|
char *tp;
|
|
|
|
while (fgets(file, sizeof(file)-1, f) != NULL) {
|
|
if (vflag)
|
|
(void)printf("set %s", file);
|
|
if ((tp = strrchr(file, '\n')) != NULL)
|
|
*tp = '\0';
|
|
vlex(file);
|
|
}
|
|
(void)fclose(f);
|
|
}
|
|
/*
|
|
* To allow definition of exception prior to fork
|
|
*/
|
|
vtable[EXCEPTIONS].v_access &= ~(WRITE<<PUBLIC);
|
|
}
|
|
|
|
void
|
|
vassign(value_t *p, char *v)
|
|
{
|
|
|
|
if (!vaccess(p->v_access, (unsigned int)WRITE)) {
|
|
(void)printf("access denied\r\n");
|
|
return;
|
|
}
|
|
switch (p->v_type&TMASK) {
|
|
|
|
case STRING:
|
|
if (p->v_value && equal(p->v_value, v))
|
|
return;
|
|
if (!(p->v_type&(ENVIRON|INIT)))
|
|
free(p->v_value);
|
|
if ((p->v_value = strdup(v)) == NULL) {
|
|
(void)printf("out of core\r\n");
|
|
return;
|
|
}
|
|
p->v_type &= ~(ENVIRON|INIT);
|
|
break;
|
|
|
|
case NUMBER:
|
|
if (number(p->v_value) == number(v))
|
|
return;
|
|
setnumber(p->v_value, number(v));
|
|
break;
|
|
|
|
case BOOL:
|
|
if (boolean(p->v_value) == (*v != '!'))
|
|
return;
|
|
setboolean(p->v_value, (*v != '!'));
|
|
break;
|
|
|
|
case CHAR:
|
|
if (character(p->v_value) == *v)
|
|
return;
|
|
setcharacter(p->v_value, *v);
|
|
}
|
|
p->v_access |= CHANGED;
|
|
}
|
|
|
|
void
|
|
vlex(char *s)
|
|
{
|
|
value_t *p;
|
|
|
|
if (equal(s, "all")) {
|
|
for (p = vtable; p->v_name; p++)
|
|
if (vaccess(p->v_access, READ))
|
|
vprint(p);
|
|
} else {
|
|
char *cp;
|
|
|
|
do {
|
|
if ((cp = vinterp(s, ' ')) != NULL)
|
|
cp++;
|
|
vtoken(s);
|
|
s = cp;
|
|
} while (s);
|
|
}
|
|
if (col > 0) {
|
|
(void)printf("\r\n");
|
|
col = 0;
|
|
}
|
|
}
|
|
|
|
static void
|
|
vtoken(char *s)
|
|
{
|
|
value_t *p;
|
|
char *cp;
|
|
|
|
if ((cp = strchr(s, '=')) != NULL) {
|
|
*cp = '\0';
|
|
if ((p = vlookup(s)) != NULL) {
|
|
cp++;
|
|
if (p->v_type&NUMBER)
|
|
vassign(p, (char *)(long)atoi(cp));
|
|
else {
|
|
if (strcmp(s, "record") == 0)
|
|
cp = expand(cp);
|
|
vassign(p, cp);
|
|
}
|
|
return;
|
|
}
|
|
} else if ((cp = strchr(s, '?')) != NULL) {
|
|
*cp = '\0';
|
|
if ((p = vlookup(s)) && vaccess(p->v_access, READ)) {
|
|
vprint(p);
|
|
return;
|
|
}
|
|
} else {
|
|
if (*s != '!')
|
|
p = vlookup(s);
|
|
else
|
|
p = vlookup(s+1);
|
|
if (p != NULL) {
|
|
vassign(p, s);
|
|
return;
|
|
}
|
|
}
|
|
(void)printf("%s: unknown variable\r\n", s);
|
|
}
|
|
|
|
static void
|
|
vprint(value_t *p)
|
|
{
|
|
char *cp;
|
|
|
|
if (col > 0 && col < MIDDLE)
|
|
while (col++ < MIDDLE)
|
|
(void)putchar(' ');
|
|
col += strlen(p->v_name);
|
|
switch (p->v_type&TMASK) {
|
|
|
|
case BOOL:
|
|
if (boolean(p->v_value) == FALSE) {
|
|
col++;
|
|
(void)putchar('!');
|
|
}
|
|
(void)printf("%s", p->v_name);
|
|
break;
|
|
|
|
case STRING:
|
|
(void)printf("%s=", p->v_name);
|
|
col++;
|
|
if (p->v_value) {
|
|
cp = interp(p->v_value);
|
|
col += strlen(cp);
|
|
(void)printf("%s", cp);
|
|
}
|
|
break;
|
|
|
|
case NUMBER:
|
|
col += 6;
|
|
(void)printf("%s=%-5d", p->v_name, (int)number(p->v_value));
|
|
break;
|
|
|
|
case CHAR:
|
|
(void)printf("%s=", p->v_name);
|
|
col++;
|
|
if (p->v_value) {
|
|
cp = ctrl(character(p->v_value));
|
|
col += strlen(cp);
|
|
(void)printf("%s", cp);
|
|
}
|
|
break;
|
|
}
|
|
if (col >= MIDDLE) {
|
|
col = 0;
|
|
(void)printf("\r\n");
|
|
return;
|
|
}
|
|
}
|
|
|
|
|
|
static int
|
|
vaccess(int mode, int rw)
|
|
{
|
|
|
|
if (mode & (rw<<PUBLIC))
|
|
return (1);
|
|
if (mode & (rw<<PRIVATE))
|
|
return (1);
|
|
return ((mode & (rw<<ROOT)) && getuid() == 0);
|
|
}
|
|
|
|
static value_t *
|
|
vlookup(const char *s)
|
|
{
|
|
value_t *p;
|
|
|
|
for (p = vtable; p->v_name; p++)
|
|
if (equal(p->v_name, s) || (p->v_abrev && equal(p->v_abrev, s)))
|
|
return (p);
|
|
return (NULL);
|
|
}
|
|
|
|
char *
|
|
vinterp(char *s, char stp)
|
|
{
|
|
char *p = s, c;
|
|
int num;
|
|
|
|
while ((c = *s++) && c != stp)
|
|
switch (c) {
|
|
|
|
case '^':
|
|
if (*s)
|
|
*p++ = *s++ - 0100;
|
|
else
|
|
*p++ = c;
|
|
break;
|
|
|
|
case '\\':
|
|
num = 0;
|
|
c = *s++;
|
|
if (c >= '0' && c <= '7')
|
|
num = (num<<3)+(c-'0');
|
|
else {
|
|
const char *q = "n\nr\rt\tb\bf\f";
|
|
|
|
for (; *q; q++)
|
|
if (c == *q++) {
|
|
*p++ = *q;
|
|
goto cont;
|
|
}
|
|
*p++ = c;
|
|
cont:
|
|
break;
|
|
}
|
|
if ((c = *s++) >= '0' && c <= '7') {
|
|
num = (num<<3)+(c-'0');
|
|
if ((c = *s++) >= '0' && c <= '7')
|
|
num = (num<<3)+(c-'0');
|
|
else
|
|
s--;
|
|
} else
|
|
s--;
|
|
*p++ = num;
|
|
break;
|
|
|
|
default:
|
|
*p++ = c;
|
|
}
|
|
*p = '\0';
|
|
return (c == stp ? s-1 : NULL);
|
|
}
|
|
|
|
/*
|
|
* assign variable s with value v (for NUMBER or STRING or CHAR types)
|
|
*/
|
|
|
|
int
|
|
vstring(const char *s, char *v)
|
|
{
|
|
value_t *p;
|
|
|
|
p = vlookup(s);
|
|
if (p == 0)
|
|
return (1);
|
|
if (p->v_type&NUMBER)
|
|
vassign(p, (char *)(long)atoi(v));
|
|
else {
|
|
if (strcmp(s, "record") == 0)
|
|
v = expand(v);
|
|
vassign(p, v);
|
|
}
|
|
return (0);
|
|
}
|