Home | History | Annotate | Line # | Download | only in mail
vars.c revision 1.13
      1  1.13  christos /*	$NetBSD: vars.c,v 1.13 2005/07/19 01:38:38 christos Exp $	*/
      2   1.4  christos 
      3   1.1       cgd /*
      4   1.3   deraadt  * Copyright (c) 1980, 1993
      5   1.3   deraadt  *	The Regents of the University of California.  All rights reserved.
      6   1.1       cgd  *
      7   1.1       cgd  * Redistribution and use in source and binary forms, with or without
      8   1.1       cgd  * modification, are permitted provided that the following conditions
      9   1.1       cgd  * are met:
     10   1.1       cgd  * 1. Redistributions of source code must retain the above copyright
     11   1.1       cgd  *    notice, this list of conditions and the following disclaimer.
     12   1.1       cgd  * 2. Redistributions in binary form must reproduce the above copyright
     13   1.1       cgd  *    notice, this list of conditions and the following disclaimer in the
     14   1.1       cgd  *    documentation and/or other materials provided with the distribution.
     15  1.11       agc  * 3. Neither the name of the University nor the names of its contributors
     16   1.1       cgd  *    may be used to endorse or promote products derived from this software
     17   1.1       cgd  *    without specific prior written permission.
     18   1.1       cgd  *
     19   1.1       cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     20   1.1       cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     21   1.1       cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     22   1.1       cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     23   1.1       cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     24   1.1       cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     25   1.1       cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     26   1.1       cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     27   1.1       cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     28   1.1       cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     29   1.1       cgd  * SUCH DAMAGE.
     30   1.1       cgd  */
     31   1.1       cgd 
     32   1.5     lukem #include <sys/cdefs.h>
     33   1.1       cgd #ifndef lint
     34   1.4  christos #if 0
     35   1.4  christos static char sccsid[] = "@(#)vars.c	8.1 (Berkeley) 6/6/93";
     36   1.4  christos #else
     37  1.13  christos __RCSID("$NetBSD: vars.c,v 1.13 2005/07/19 01:38:38 christos Exp $");
     38   1.4  christos #endif
     39   1.1       cgd #endif /* not lint */
     40   1.1       cgd 
     41   1.1       cgd #include "rcv.h"
     42   1.3   deraadt #include "extern.h"
     43   1.1       cgd 
     44   1.1       cgd /*
     45   1.1       cgd  * Mail -- a mail program
     46   1.1       cgd  *
     47   1.1       cgd  * Variable handling stuff.
     48   1.1       cgd  */
     49   1.1       cgd 
     50   1.1       cgd /*
     51   1.1       cgd  * Assign a value to a variable.
     52   1.1       cgd  */
     53   1.3   deraadt void
     54  1.13  christos assign(const char name[], const char values[])
     55   1.1       cgd {
     56   1.5     lukem 	struct var *vp;
     57   1.5     lukem 	int h;
     58   1.1       cgd 
     59   1.1       cgd 	h = hash(name);
     60   1.1       cgd 	vp = lookup(name);
     61   1.9       wiz 	if (vp == NULL) {
     62  1.10    itojun 		vp = (struct var *) calloc(1, sizeof *vp);
     63  1.12      ross 		if (vp == NULL)
     64  1.12      ross 			errx(1, "Out of memory");
     65   1.1       cgd 		vp->v_name = vcopy(name);
     66   1.1       cgd 		vp->v_link = variables[h];
     67   1.1       cgd 		variables[h] = vp;
     68   1.1       cgd 	}
     69   1.1       cgd 	else
     70   1.6  wsanchez                 v_free(vp->v_value);
     71   1.8       wiz 	vp->v_value = vcopy(values);
     72   1.1       cgd }
     73   1.1       cgd 
     74   1.1       cgd /*
     75   1.1       cgd  * Free up a variable string.  We do not bother to allocate
     76   1.1       cgd  * strings whose value is "" since they are expected to be frequent.
     77   1.1       cgd  * Thus, we cannot free same!
     78   1.1       cgd  */
     79   1.3   deraadt void
     80   1.7       wiz v_free(char *cp)
     81   1.1       cgd {
     82   1.1       cgd 	if (*cp)
     83   1.1       cgd 		free(cp);
     84   1.1       cgd }
     85   1.1       cgd 
     86   1.1       cgd /*
     87   1.1       cgd  * Copy a variable value into permanent (ie, not collected after each
     88   1.1       cgd  * command) space.  Do not bother to alloc space for ""
     89   1.1       cgd  */
     90   1.1       cgd 
     91   1.1       cgd char *
     92  1.13  christos vcopy(const char str[])
     93   1.1       cgd {
     94   1.1       cgd 	char *new;
     95   1.1       cgd 	unsigned len;
     96   1.1       cgd 
     97   1.1       cgd 	if (*str == '\0')
     98  1.13  christos 		return strdup("");
     99   1.1       cgd 	len = strlen(str) + 1;
    100   1.1       cgd 	if ((new = malloc(len)) == NULL)
    101   1.5     lukem 		errx(1, "Out of memory");
    102   1.5     lukem 	memmove(new, str, (int) len);
    103   1.1       cgd 	return new;
    104   1.1       cgd }
    105   1.1       cgd 
    106   1.1       cgd /*
    107   1.1       cgd  * Get the value of a variable and return it.
    108   1.1       cgd  * Look in the environment if its not available locally.
    109   1.1       cgd  */
    110   1.1       cgd 
    111   1.1       cgd char *
    112  1.13  christos value(const char name[])
    113   1.1       cgd {
    114   1.5     lukem 	struct var *vp;
    115   1.1       cgd 
    116   1.9       wiz 	if ((vp = lookup(name)) == NULL)
    117   1.1       cgd 		return(getenv(name));
    118   1.1       cgd 	return(vp->v_value);
    119   1.1       cgd }
    120   1.1       cgd 
    121   1.1       cgd /*
    122   1.1       cgd  * Locate a variable and return its variable
    123   1.1       cgd  * node.
    124   1.1       cgd  */
    125   1.1       cgd 
    126   1.1       cgd struct var *
    127  1.13  christos lookup(const char name[])
    128   1.1       cgd {
    129   1.5     lukem 	struct var *vp;
    130   1.1       cgd 
    131   1.9       wiz 	for (vp = variables[hash(name)]; vp != NULL; vp = vp->v_link)
    132   1.1       cgd 		if (*vp->v_name == *name && equal(vp->v_name, name))
    133   1.1       cgd 			return(vp);
    134   1.9       wiz 	return(NULL);
    135   1.1       cgd }
    136   1.1       cgd 
    137   1.1       cgd /*
    138   1.1       cgd  * Locate a group name and return it.
    139   1.1       cgd  */
    140   1.1       cgd 
    141   1.1       cgd struct grouphead *
    142   1.7       wiz findgroup(char name[])
    143   1.1       cgd {
    144   1.5     lukem 	struct grouphead *gh;
    145   1.1       cgd 
    146   1.9       wiz 	for (gh = groups[hash(name)]; gh != NULL; gh = gh->g_link)
    147   1.1       cgd 		if (*gh->g_name == *name && equal(gh->g_name, name))
    148   1.1       cgd 			return(gh);
    149   1.9       wiz 	return(NULL);
    150   1.1       cgd }
    151   1.1       cgd 
    152   1.1       cgd /*
    153   1.1       cgd  * Print a group out on stdout
    154   1.1       cgd  */
    155   1.3   deraadt void
    156   1.7       wiz printgroup(char name[])
    157   1.1       cgd {
    158   1.5     lukem 	struct grouphead *gh;
    159   1.5     lukem 	struct group *gp;
    160   1.1       cgd 
    161   1.9       wiz 	if ((gh = findgroup(name)) == NULL) {
    162   1.1       cgd 		printf("\"%s\": not a group\n", name);
    163   1.1       cgd 		return;
    164   1.1       cgd 	}
    165   1.1       cgd 	printf("%s\t", gh->g_name);
    166   1.9       wiz 	for (gp = gh->g_list; gp != NULL; gp = gp->ge_link)
    167   1.1       cgd 		printf(" %s", gp->ge_name);
    168   1.1       cgd 	putchar('\n');
    169   1.1       cgd }
    170   1.1       cgd 
    171   1.1       cgd /*
    172   1.1       cgd  * Hash the passed string and return an index into
    173   1.1       cgd  * the variable or group hash table.
    174   1.1       cgd  */
    175   1.3   deraadt int
    176  1.13  christos hash(const char *name)
    177   1.1       cgd {
    178   1.5     lukem 	int h = 0;
    179   1.1       cgd 
    180   1.1       cgd 	while (*name) {
    181   1.1       cgd 		h <<= 2;
    182   1.1       cgd 		h += *name++;
    183   1.1       cgd 	}
    184   1.1       cgd 	if (h < 0 && (h = -h) < 0)
    185   1.1       cgd 		h = 0;
    186   1.1       cgd 	return (h % HSHSIZE);
    187   1.1       cgd }
    188