Logo Search packages:      
Sourcecode: heirloom-mailx version File versions  Download package

vars.c

/*
 * Heirloom mailx - a mail user agent derived from Berkeley Mail.
 *
 * Copyright (c) 2000-2004 Gunnar Ritter, Freiburg i. Br., Germany.
 */
/*
 * Copyright (c) 1980, 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. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *    This product includes software developed by the University of
 *    California, Berkeley and its contributors.
 * 4. 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.
 */

#ifndef lint
#ifdef      DOSCCS
static char sccsid[] = "@(#)vars.c  2.11 (gritter) 3/4/06";
#endif
#endif /* not lint */

#include "rcv.h"
#include "extern.h"

/*
 * Mail -- a mail program
 *
 * Variable handling stuff.
 */

static char *canonify(const char *vn);
static void vfree(char *cp);
static struct var *lookup(const char *name);
static void remove_grouplist(struct grouphead *gh);

/*
 * If a variable name begins with a lowercase-character and contains at
 * least one '@', it is converted to all-lowercase. This is necessary
 * for lookups of names based on email addresses.
 *
 * Following the standard, only the part following the last '@' should
 * be lower-cased, but practice has established otherwise here.
 */
static char *
canonify(const char *vn)
{
      const char  *vp;

      if (upperchar(*vn&0377))
            return (char *)vn;
      for (vp = vn; *vp && *vp != '@'; vp++);
      if (*vp == '@')
            return i_strdup(vn);
      return (char *)vn;
}

/*
 * Assign a value to a variable.
 */
void 
assign(char *name, char *value)
{
      struct var *vp;
      int h;

      name = canonify(name);
      h = hash(name);
      vp = lookup(name);
      if (vp == NULL) {
            vp = (struct var *)scalloc(1, sizeof *vp);
            vp->v_name = vcopy(name);
            vp->v_link = variables[h];
            variables[h] = vp;
      }
      else
            vfree(vp->v_value);
      vp->v_value = vcopy(value);
}

/*
 * Free up a variable string.  We do not bother to allocate
 * strings whose value is "" since they are expected to be frequent.
 * Thus, we cannot free same!
 */
static void 
vfree(char *cp)
{
      if (*cp)
            free(cp);
}

/*
 * Copy a variable value into permanent (ie, not collected after each
 * command) space.  Do not bother to alloc space for ""
 */

char *
vcopy(const char *str)
{
      char *new;
      unsigned len;

      if (*str == '\0')
            return "";
      len = strlen(str) + 1;
      new = smalloc(len);
      memcpy(new, str, (int) len);
      return new;
}

/*
 * Get the value of a variable and return it.
 * Look in the environment if its not available locally.
 */

char *
value(const char *name)
{
      struct var *vp;
      char  *vs;

      name = canonify(name);
      if ((vp = lookup(name)) == NULL) {
            if ((vs = getenv(name)) != NULL && *vs)
                  vs = savestr(vs);
            return vs;
      }
      return vp->v_value;
}

/*
 * Locate a variable and return its variable
 * node.
 */

static struct var *
lookup(const char *name)
{
      struct var *vp;

      for (vp = variables[hash(name)]; vp != NULL; vp = vp->v_link)
            if (*vp->v_name == *name && equal(vp->v_name, name))
                  return(vp);
      return(NULL);
}

/*
 * Locate a group name and return it.
 */

struct grouphead *
findgroup(char *name)
{
      struct grouphead *gh;

      for (gh = groups[hash(name)]; gh != NULL; gh = gh->g_link)
            if (*gh->g_name == *name && equal(gh->g_name, name))
                  return(gh);
      return(NULL);
}

/*
 * Print a group out on stdout
 */
void 
printgroup(char *name)
{
      struct grouphead *gh;
      struct group *gp;

      if ((gh = findgroup(name)) == NULL) {
            printf(catgets(catd, CATSET, 202, "\"%s\": not a group\n"),
                        name);
            return;
      }
      printf("%s\t", gh->g_name);
      for (gp = gh->g_list; gp != NULL; gp = gp->ge_link)
            printf(" %s", gp->ge_name);
      putchar('\n');
}

/*
 * Hash the passed string and return an index into
 * the variable or group hash table.
 */
int 
hash(const char *name)
{
      int h = 0;

      while (*name) {
            h <<= 2;
            h += *name++;
      }
      if (h < 0 && (h = -h) < 0)
            h = 0;
      return (h % HSHSIZE);
}

int 
unset_internal(char *name)
{
      struct var *vp, *vp2;
      int h;

      name = canonify(name);
      if ((vp2 = lookup(name)) == NULL) {
            if (!sourcing && !unset_allow_undefined) {
                  printf(catgets(catd, CATSET, 203,
                        "\"%s\": undefined variable\n"), name);
                  return 1;
            }
            return 0;
      }
      h = hash(name);
      if (vp2 == variables[h]) {
            variables[h] = variables[h]->v_link;
            vfree(vp2->v_name);
            vfree(vp2->v_value);
            free(vp2);
            return 0;
      }
      for (vp = variables[h]; vp->v_link != vp2; vp = vp->v_link);
      vp->v_link = vp2->v_link;
      vfree(vp2->v_name);
      vfree(vp2->v_value);
      free(vp2);
      return 0;
}

static void
remove_grouplist(struct grouphead *gh)
{
      struct group *gp, *gq;

      if ((gp = gh->g_list) != NULL) {
            for (; gp; gp = gq) {
                  gq = gp->ge_link;
                  vfree(gp->ge_name);
                  free(gp);
            }
      }
}

void
remove_group(const char *name)
{
      struct grouphead *gh, *gp = NULL;
      int h = hash(name);

      for (gh = groups[h]; gh != NULL; gh = gh->g_link) {
            if (*gh->g_name == *name && equal(gh->g_name, name)) {
                  remove_grouplist(gh);
                  vfree(gh->g_name);
                  if (gp != NULL)
                        gp->g_link = gh->g_link;
                  else
                        groups[h] = NULL;
                  free(gh);
                  break;
            }
            gp = gh;
      }
}

Generated by  Doxygen 1.6.0   Back to index