/usr/src/bin/csh/set.c

Bug Summary

File:	src/bin/csh/set.c
Warning:	line 507, column 13 Access to field 'vec' results in a dereference of a null pointer (loaded from variable 'p')

Annotated Source Code

Press '?' to see keyboard shortcuts

Show analyzer invocation

clang -cc1 -cc1 -triple amd64-unknown-openbsd7.0 -analyze -disable-free -disable-llvm-verifier -discard-value-names -main-file-name set.c -analyzer-store=region -analyzer-opt-analyze-nested-blocks -analyzer-checker=core -analyzer-checker=apiModeling -analyzer-checker=unix -analyzer-checker=deadcode -analyzer-checker=security.insecureAPI.UncheckedReturn -analyzer-checker=security.insecureAPI.getpw -analyzer-checker=security.insecureAPI.gets -analyzer-checker=security.insecureAPI.mktemp -analyzer-checker=security.insecureAPI.mkstemp -analyzer-checker=security.insecureAPI.vfork -analyzer-checker=nullability.NullPassedToNonnull -analyzer-checker=nullability.NullReturnedFromNonnull -analyzer-output plist -w -setup-static-analyzer -mrelocation-model pic -pic-level 1 -pic-is-pie -mframe-pointer=all -relaxed-aliasing -fno-rounding-math -mconstructor-aliases -munwind-tables -target-cpu x86-64 -target-feature +retpoline-indirect-calls -target-feature +retpoline-indirect-branches -tune-cpu generic -debugger-tuning=gdb -fcoverage-compilation-dir=/usr/src/bin/csh/obj -resource-dir /usr/local/lib/clang/13.0.0 -I /usr/src/bin/csh -I . -internal-isystem /usr/local/lib/clang/13.0.0/include -internal-externc-isystem /usr/include -O2 -fdebug-compilation-dir=/usr/src/bin/csh/obj -ferror-limit 19 -fwrapv -D_RET_PROTECTOR -ret-protector -fgnuc-version=4.2.1 -vectorize-loops -vectorize-slp -fno-builtin-malloc -fno-builtin-calloc -fno-builtin-realloc -fno-builtin-valloc -fno-builtin-free -fno-builtin-strdup -fno-builtin-strndup -analyzer-output=html -faddrsig -D__GCC_HAVE_DWARF2_CFI_ASM=1 -o /home/ben/Projects/vmm/scan-build/2022-01-12-194120-40624-1 -x c /usr/src/bin/csh/set.c

1/*	$OpenBSD: set.c,v 1.23 2019/07/03 03:24:01 deraadt Exp $	*/
2/*	$NetBSD: set.c,v 1.8 1995/03/21 18:35:52 mycroft Exp $	*/

4/*-
* Copyright (c) 1980, 1991, 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.
*/

33#include <sys/types.h>
34#include <stdlib.h>
35#include <stdarg.h>

37#include "csh.h"
38#include "extern.h"

40static Char	*getinx(Char *, int *);
41static void	 asx(Char *, int, Char *);
42static struct varent
*getvx(Char *, int);
44static Char	*xset(Char *, Char ***);
45static Char	*operate(int, Char *, Char *);
46static struct varent
*madrof(Char *, struct varent *);
48static void	 unsetv1(struct varent *);
49static void	 exportpath(Char **);
50static void	 balance(struct varent *, int, int);


53/*
* C Shell
*/

57void
58/*ARGSUSED*/
59doset(Char **v, struct command *t)
60{
  Char *p;
  Char   *vp, op;
  Char  **vecp;
  bool    hadsub;
  int     subscr;

  v++;
  p = *v++;
  if (p == 0) {
prvars();
return;
  }
  do {
hadsub = 0;
vp = p;
if (letter(*p)(((*p) & 0100000U) ? 0 : (isalpha((unsigned char) (*p)) ||
 (*p) == '_')))
   for (; alnum(*p)(((*p) & 0100000U) ? 0 : (isalnum((unsigned char) (*p)) ||
 (*p) == '_')); p++)
continue;
if (vp == p || !letter(*vp)(((*vp) & 0100000U) ? 0 : (isalpha((unsigned char) (*vp))
 || (*vp) == '_')))
   stderror(ERR_NAME0x10000000 | ERR_VARBEGIN30);
if ((p - vp) > MAXVARLEN30) {
   stderror(ERR_NAME0x10000000 | ERR_VARTOOLONG31);
   return;
}
if (*p == '[') {
   hadsub++;
   p = getinx(p, &subscr);
}
if ((op = *p) != '\0') {
   *p++ = 0;
   if (*p == 0 && *v && **v == '(')
p = *v++;
}
else if (*v && eq(*v, STRequal)(Strcmp(*v, STRequal) == 0)) {
   op = '=', v++;
   if (*v)
p = *v++;
}
if (op && op != '=')
   stderror(ERR_NAME0x10000000 | ERR_SYNTAX0);
if (eq(p, STRLparen)(Strcmp(p, STRLparen) == 0)) {
   Char **e = v;

   if (hadsub)
stderror(ERR_NAME0x10000000 | ERR_SYNTAX0);
   for (;;) {
if (!*e)
    stderror(ERR_NAME0x10000000 | ERR_MISSING51, ')');
if (**e == ')')
    break;
e++;
   }
   p = *e;
   *e = 0;
   vecp = saveblk(v);
   set1(vp, vecp, &shvhed);
   *e = p;
   v = e + 1;
}
else if (hadsub)
   asx(vp, subscr, Strsave(p));
else
   set(vp, Strsave(p));
if (eq(vp, STRpath)(Strcmp(vp, STRpath) == 0)) {
   exportpath(adrof(STRpath)adrof1(STRpath, &shvhed)->vec);
   dohash(NULL((void *)0), NULL((void *)0));
}
else if (eq(vp, STRhistchars)(Strcmp(vp, STRhistchars) == 0)) {
   Char *pn = value(STRhistchars)value1(STRhistchars, &shvhed);

   HIST = *pn++;
   HISTSUB = *pn;
}
else if (eq(vp, STRuser)(Strcmp(vp, STRuser) == 0)) {
   Setenv(STRUSER, value(vp)value1(vp, &shvhed));
   Setenv(STRLOGNAME, value(vp)value1(vp, &shvhed));
}
else if (eq(vp, STRwordchars)(Strcmp(vp, STRwordchars) == 0)) {
   word_chars = value(vp)value1(vp, &shvhed);
}
else if (eq(vp, STRterm)(Strcmp(vp, STRterm) == 0))
   Setenv(STRTERM, value(vp)value1(vp, &shvhed));
else if (eq(vp, STRhome)(Strcmp(vp, STRhome) == 0)) {
   Char *cp;

   cp = Strsave(value(vp)value1(vp, &shvhed));	/* get the old value back */

   /*
    * convert to canonical pathname (possibly resolving symlinks)
    */
   cp = dcanon(cp, cp);

   set(vp, Strsave(cp));	/* have to save the new val */

   /* and now mirror home with HOME */
   Setenv(STRHOME, cp);
   /* fix directory stack for new tilde home */
   dtilde();
   free(cp);
}
else if (eq(vp, STRfilec)(Strcmp(vp, STRfilec) == 0))
   filec = 1;
  } while ((p = *v++) != NULL((void *)0));
164}

166static Char *
167getinx(Char *cp, int *ip)
168{

  *ip = 0;
  *cp++ = 0;
  while (*cp && Isdigit(*cp)(((*cp) & 0100000U) ? 0 : isdigit((unsigned char) (*cp))))
*ip = *ip * 10 + *cp++ - '0';
  if (*cp++ != ']')
stderror(ERR_NAME0x10000000 | ERR_SUBSCRIPT9);
  return (cp);
177}

179static void
180asx(Char *vp, int subscr, Char *p)
181{
  struct varent *v = getvx(vp, subscr);

  free(v->vec[subscr - 1]);
  v->vec[subscr - 1] = globone(p, G_APPEND2);
186}

188static struct varent *
189getvx(Char *vp, int subscr)
190{
  struct varent *v = adrof(vp)adrof1(vp, &shvhed);

  if (v == 0)
udvar(vp);
  if (subscr < 1 || subscr > blklen(v->vec))
stderror(ERR_NAME0x10000000 | ERR_RANGE43);
  return (v);
198}

200void
201/*ARGSUSED*/
202dolet(Char **v, struct command *t)
203{
  Char *p;
  Char   *vp, c, op;
  bool    hadsub;
  int     subscr;

  v++;
  p = *v++;
  if (p == 0) {
prvars();
return;
  }
  do {
hadsub = 0;
vp = p;
if (letter(*p)(((*p) & 0100000U) ? 0 : (isalpha((unsigned char) (*p)) ||
 (*p) == '_')))
   for (; alnum(*p)(((*p) & 0100000U) ? 0 : (isalnum((unsigned char) (*p)) ||
 (*p) == '_')); p++)
continue;
if (vp == p || !letter(*vp)(((*vp) & 0100000U) ? 0 : (isalpha((unsigned char) (*vp))
 || (*vp) == '_')))
   stderror(ERR_NAME0x10000000 | ERR_VARBEGIN30);
if ((p - vp) > MAXVARLEN30)
   stderror(ERR_NAME0x10000000 | ERR_VARTOOLONG31);
if (*p == '[') {
   hadsub++;
   p = getinx(p, &subscr);
}
if (*p == 0 && *v)
   p = *v++;
if ((op = *p) != '\0')
   *p++ = 0;
else
   stderror(ERR_NAME0x10000000 | ERR_ASSIGN38);

if (*p == '\0' && *v == NULL((void *)0))
   stderror(ERR_NAME0x10000000 | ERR_ASSIGN38);

vp = Strsave(vp);
if (op == '=') {
   c = '=';
   p = xset(p, &v);
}
else {
   c = *p++;
   if (any("+-", c)) {
if (c != op || *p)
    stderror(ERR_NAME0x10000000 | ERR_UNKNOWNOP39);
p = Strsave(STR1);
   }
   else {
if (any("<>", op)) {
    if (c != op)
	stderror(ERR_NAME0x10000000 | ERR_UNKNOWNOP39);
    c = *p++;
    stderror(ERR_NAME0x10000000 | ERR_SYNTAX0);
}
if (c != '=')
    stderror(ERR_NAME0x10000000 | ERR_UNKNOWNOP39);
p = xset(p, &v);
   }
}
if (op == '=')
   if (hadsub)
asx(vp, subscr, p);
   else
set(vp, p);
else if (hadsub) {
   struct varent *gv = getvx(vp, subscr);

   asx(vp, subscr, operate(op, gv->vec[subscr - 1], p));
}
else
   set(vp, operate(op, value(vp)value1(vp, &shvhed), p));
if (eq(vp, STRpath)(Strcmp(vp, STRpath) == 0)) {
   exportpath(adrof(STRpath)adrof1(STRpath, &shvhed)->vec);
   dohash(NULL((void *)0), NULL((void *)0));
}
free(vp);
if (c != '=')
   free(p);
  } while ((p = *v++) != NULL((void *)0));
283}

285static Char *
286xset(Char *cp, Char ***vp)
287{
  Char *dp;

  if (*cp) {
dp = Strsave(cp);
--(*vp);
free(** vp);
**vp = dp;
  }
  return (putn(expr(vp)));
297}

299static Char *
300operate(int op, Char *vp, Char *p)
301{
  Char    opr[2];
  Char   *vec[5];
  Char **v = vec;
  Char  **vecp = v;
  int i;

  if (op != '=') {
if (*vp)
   *v++ = vp;
opr[0] = op;
opr[1] = 0;
*v++ = opr;
if (op == '<' || op == '>')
   *v++ = opr;
  }
  *v++ = p;
  *v++ = 0;
  i = expr(&vecp);
  if (*vecp)
stderror(ERR_NAME0x10000000 | ERR_EXPRESSION34);
  return (putn(i));
323}

325Char   *
326putn(int n)
327{
  char number[15];
  int i;

  i = snprintf(number, sizeof(number), "%d", n);
  if (i < 0 || i >= sizeof(number))
return (STRNULL);
  return (SAVE(number)(Strsave(str2short(number))));
335}

337int
338getn(Char *cp)
339{
  int n;
  int     sign;

  sign = 0;
  if (cp[0] == '+' && cp[1])
cp++;
  if (*cp == '-') {
sign++;
cp++;
if (!Isdigit(*cp)(((*cp) & 0100000U) ? 0 : isdigit((unsigned char) (*cp))))
   stderror(ERR_NAME0x10000000 | ERR_BADNUM10);
  }
  n = 0;
  while (Isdigit(*cp)(((*cp) & 0100000U) ? 0 : isdigit((unsigned char) (*cp))))
n = n * 10 + *cp++ - '0';
  if (*cp)
stderror(ERR_NAME0x10000000 | ERR_BADNUM10);
  return (sign ? -n : n);
358}

360Char   *
361value1(Char *var, struct varent *head)
362{
  struct varent *vp;

  vp = adrof1(var, head);
  return (vp == 0 || vp->vec[0] == 0 ? STRNULL : vp->vec[0]);
367}

369static struct varent *
370madrof(Char *pat, struct varent *vp)
371{
  struct varent *vp1;

  for (; vp; vp = vp->v_rightv_link[1]) {
if (vp->v_leftv_link[0] && (vp1 = madrof(pat, vp->v_leftv_link[0])))
   return vp1;
if (Gmatch(vp->v_name, pat))
   return vp;
  }
  return vp;
381}

383struct varent *
384adrof1(Char *name, struct varent *v)
385{
  int cmp;

  v = v->v_leftv_link[0];
  while (v && ((cmp = *name - *v->v_name) ||
 (cmp = Strcmp(name, v->v_name))))
if (cmp < 0)
   v = v->v_leftv_link[0];
else
   v = v->v_rightv_link[1];
  return v;
396}

398/*
* The caller is responsible for putting value in a safe place
*/
401void
402set(Char *var, Char *val)
403{
  Char **vec = xreallocarray(NULL((void *)0), 2, sizeof(*vec));

  vec[0] = val;
  vec[1] = 0;
  set1(var, vec, &shvhed);
409}

411void
412set1(Char *var, Char **vec, struct varent *head)
413{
  Char **oldv = vec;

  gflag = 0;
  tglob(oldv);
  if (gflag) {
vec = globall(oldv);
if (vec == 0) {
   blkfree(oldv);
   stderror(ERR_NAME0x10000000 | ERR_NOMATCH50);
   return;
}
blkfree(oldv);
gargv = 0;
  }
  setq(var, vec, head);
429}


432void
433setq(Char *name, Char **vec, struct varent *p)
434{
  struct varent *c;
  int f;

  f = 0;			/* tree hangs off the header's left link */
  while ((c = p->v_link[f]) != NULL((void *)0)) {
if ((f = *name - *c->v_name) == 0 &&
   (f = Strcmp(name, c->v_name)) == 0) {
   blkfree(c->vec);
   goto found;
}
p = c;
f = f > 0;
  }
  p->v_link[f] = c = (struct varent *) xmalloc((size_t) sizeof(struct varent));
  c->v_name = Strsave(name);
  c->v_bal = 0;
  c->v_leftv_link[0] = c->v_rightv_link[1] = 0;
  c->v_parentv_link[2] = p;
  balance(p, f, 0);
454found:
  trim(c->vec = vec);
456}

458void
459/*ARGSUSED*/
460unset(Char **v, struct command *t)
461{
  unset1(v, &shvhed);
  if (adrof(STRfilec)adrof1(STRfilec, &shvhed) == 0)
filec = 0;
  if (adrof(STRhistchars)adrof1(STRhistchars, &shvhed) == 0) {
HIST = '!';
HISTSUB = '^';
  }
  if (adrof(STRwordchars)adrof1(STRwordchars, &shvhed) == 0)
word_chars = STR_WORD_CHARS;
471}

473void
474unset1(Char *v[], struct varent *head)
475{
  struct varent *vp;
  int cnt;

  while (*++v) {
cnt = 0;
while ((vp = madrof(*v, head->v_leftv_link[0])) != NULL((void *)0))
   unsetv1(vp), cnt++;
if (cnt == 0)
   setname(vis_str(*v))(bname = (vis_str(*v)));
  }
486}

488void
489unsetv(Char *var)
490{
  struct varent *vp;

  if ((vp = adrof1(var, &shvhed)) == 0)
1
Value assigned to 'vp'→
2
←
Assuming pointer value is null→
3
←
Taking true branch→
udvar(var);
  unsetv1(vp);
4
←
Passing null pointer value via 1st parameter 'p'→
5
←
Calling 'unsetv1'→
496}

498static void
499unsetv1(struct varent *p)
500{
  struct varent *c, *pp;
  int f;

  /*
   * Free associated memory first to avoid complications.
   */
  blkfree(p->vec);
6
←
Access to field 'vec' results in a dereference of a null pointer (loaded from variable 'p')
  free(p->v_name);
  /*
   * If p is missing one child, then we can move the other into where p is.
   * Otherwise, we find the predecessor of p, which is guaranteed to have no
   * right child, copy it into p, and move it's left child into it.
   */
  if (p->v_rightv_link[1] == 0)
c = p->v_leftv_link[0];
  else if (p->v_leftv_link[0] == 0)
c = p->v_rightv_link[1];
  else {
for (c = p->v_leftv_link[0]; c->v_rightv_link[1]; c = c->v_rightv_link[1])
   continue;
p->v_name = c->v_name;
p->vec = c->vec;
p = c;
c = p->v_leftv_link[0];
  }
  /*
   * Move c into where p is.
   */
  pp = p->v_parentv_link[2];
  f = pp->v_rightv_link[1] == p;
  if ((pp->v_link[f] = c) != NULL((void *)0))
c->v_parentv_link[2] = pp;
  /*
   * Free the deleted node, and rebalance.
   */
  free(p);
  balance(pp, f, 1);
538}

540void
541setNS(Char *cp)
542{
  set(cp, Strsave(STRNULL));
544}

546void
547/*ARGSUSED*/
548shift(Char **v, struct command *t)
549{
  struct varent *argv;
  Char *name;

  v++;
  name = *v;
  if (name == 0)
name = STRargv;
  else
(void) strip(name);
  argv = adrof(name)adrof1(name, &shvhed);
  if (argv == 0)
udvar(name);
  if (argv->vec[0] == 0)
stderror(ERR_NAME0x10000000 | ERR_NOMORE11);
  lshift(argv->vec, 1);
565}

567static void
568exportpath(Char **val)
569{
  Char    exppath[BUFSIZ1024];

  exppath[0] = 0;
  if (val)
while (*val) {
   if (Strlen(*val) + Strlen(exppath) + 2 > BUFSIZ1024) {
(void) fprintf(csherr,
	       "Warning: ridiculously long PATH truncated\n");
break;
   }
   (void) Strlcat(exppath, *val++, sizeof exppath/sizeof(Char));
   if (*val == 0 || eq(*val, STRRparen)(Strcmp(*val, STRRparen) == 0))
break;
   (void) Strlcat(exppath, STRcolon, sizeof exppath/sizeof(Char));
}
  Setenv(STRPATH, exppath);
586}

588/* macros to do single rotations on node p */
589#define rright(p)( t = (p)->v_link[0], (t)->v_link[2] = (p)->v_link[2
], ((p)->v_link[0] = t->v_link[1]) ? (t->v_link[1]->
v_link[2] = (p)) : 0, (t->v_link[1] = (p))->v_link[2] =
 t, (p) = t) (\
t = (p)->v_leftv_link[0],\
(t)->v_parentv_link[2] = (p)->v_parentv_link[2],\
((p)->v_leftv_link[0] = t->v_rightv_link[1]) ? (t->v_rightv_link[1]->v_parentv_link[2] = (p)) : 0,\
(t->v_rightv_link[1] = (p))->v_parentv_link[2] = t,\
(p) = t)
595#define rleft(p)( t = (p)->v_link[1], (t)->v_link[2] = (p)->v_link[2
], ((p)->v_link[1] = t->v_link[0]) ? (t->v_link[0]->
v_link[2] = (p)) : 0, (t->v_link[0] = (p))->v_link[2] =
 t, (p) = t) (\
t = (p)->v_rightv_link[1],\
(t)->v_parentv_link[2] = (p)->v_parentv_link[2],\
((p)->v_rightv_link[1] = t->v_leftv_link[0]) ? (t->v_leftv_link[0]->v_parentv_link[2] = (p)) : 0,\
(t->v_leftv_link[0] = (p))->v_parentv_link[2] = t,\
(p) = t)

602/*
* Rebalance a tree, starting at p and up.
* F == 0 means we've come from p's left child.
* D == 1 means we've just done a delete, otherwise an insert.
*/
607static void
608balance(struct varent *p, int f, int d)
609{
  struct varent *pp;
  struct varent *t;	/* used by the rotate macros */
  int ff;

  /*
   * Ok, from here on, p is the node we're operating on; pp is it's parent; f
   * is the branch of p from which we have come; ff is the branch of pp which
   * is p.
   */
  for (; (pp = p->v_parentv_link[2]) != NULL((void *)0); p = pp, f = ff) {
ff = pp->v_rightv_link[1] == p;
if (f ^ d) {		/* right heavy */
   switch (p->v_bal) {
   case -1:		/* was left heavy */
p->v_bal = 0;
break;
   case 0:		/* was balanced */
p->v_bal = 1;
break;
   case 1:		/* was already right heavy */
switch (p->v_rightv_link[1]->v_bal) {
case 1:	/* single rotate */
    pp->v_link[ff] = rleft(p)( t = (p)->v_link[1], (t)->v_link[2] = (p)->v_link[2
], ((p)->v_link[1] = t->v_link[0]) ? (t->v_link[0]->
v_link[2] = (p)) : 0, (t->v_link[0] = (p))->v_link[2] =
 t, (p) = t);
    p->v_leftv_link[0]->v_bal = 0;
    p->v_bal = 0;
    break;
case 0:	/* single rotate */
    pp->v_link[ff] = rleft(p)( t = (p)->v_link[1], (t)->v_link[2] = (p)->v_link[2
], ((p)->v_link[1] = t->v_link[0]) ? (t->v_link[0]->
v_link[2] = (p)) : 0, (t->v_link[0] = (p))->v_link[2] =
 t, (p) = t);
    p->v_leftv_link[0]->v_bal = 1;
    p->v_bal = -1;
    break;
case -1:	/* double rotate */
    (void) rright(p->v_right)( t = (p->v_link[1])->v_link[0], (t)->v_link[2] = (p
->v_link[1])->v_link[2], ((p->v_link[1])->v_link[
0] = t->v_link[1]) ? (t->v_link[1]->v_link[2] = (p->
v_link[1])) : 0, (t->v_link[1] = (p->v_link[1]))->v_link
[2] = t, (p->v_link[1]) = t);
    pp->v_link[ff] = rleft(p)( t = (p)->v_link[1], (t)->v_link[2] = (p)->v_link[2
], ((p)->v_link[1] = t->v_link[0]) ? (t->v_link[0]->
v_link[2] = (p)) : 0, (t->v_link[0] = (p))->v_link[2] =
 t, (p) = t);
    p->v_leftv_link[0]->v_bal =
	p->v_bal < 1 ? 0 : -1;
    p->v_rightv_link[1]->v_bal =
	p->v_bal > -1 ? 0 : 1;
    p->v_bal = 0;
    break;
}
break;
   }
}
else {			/* left heavy */
   switch (p->v_bal) {
   case 1:		/* was right heavy */
p->v_bal = 0;
break;
   case 0:		/* was balanced */
p->v_bal = -1;
break;
   case -1:		/* was already left heavy */
switch (p->v_leftv_link[0]->v_bal) {
case -1:	/* single rotate */
    pp->v_link[ff] = rright(p)( t = (p)->v_link[0], (t)->v_link[2] = (p)->v_link[2
], ((p)->v_link[0] = t->v_link[1]) ? (t->v_link[1]->
v_link[2] = (p)) : 0, (t->v_link[1] = (p))->v_link[2] =
 t, (p) = t);
    p->v_rightv_link[1]->v_bal = 0;
    p->v_bal = 0;
    break;
case 0:	/* single rotate */
    pp->v_link[ff] = rright(p)( t = (p)->v_link[0], (t)->v_link[2] = (p)->v_link[2
], ((p)->v_link[0] = t->v_link[1]) ? (t->v_link[1]->
v_link[2] = (p)) : 0, (t->v_link[1] = (p))->v_link[2] =
 t, (p) = t);
    p->v_rightv_link[1]->v_bal = -1;
    p->v_bal = 1;
    break;
case 1:	/* double rotate */
    (void) rleft(p->v_left)( t = (p->v_link[0])->v_link[1], (t)->v_link[2] = (p
->v_link[0])->v_link[2], ((p->v_link[0])->v_link[
1] = t->v_link[0]) ? (t->v_link[0]->v_link[2] = (p->
v_link[0])) : 0, (t->v_link[0] = (p->v_link[0]))->v_link
[2] = t, (p->v_link[0]) = t);
    pp->v_link[ff] = rright(p)( t = (p)->v_link[0], (t)->v_link[2] = (p)->v_link[2
], ((p)->v_link[0] = t->v_link[1]) ? (t->v_link[1]->
v_link[2] = (p)) : 0, (t->v_link[1] = (p))->v_link[2] =
 t, (p) = t);
    p->v_leftv_link[0]->v_bal =
	p->v_bal < 1 ? 0 : -1;
    p->v_rightv_link[1]->v_bal =
	p->v_bal > -1 ? 0 : 1;
    p->v_bal = 0;
    break;
}
break;
   }
}
/*
* If from insert, then we terminate when p is balanced. If from
* delete, then we terminate when p is unbalanced.
*/
if ((p->v_bal == 0) ^ d)
   break;
  }
694}

696void
697plist(struct varent *p)
698{
  struct varent *c;
  int len;
  sigset_t sigset;

  if (setintr) {
sigemptyset(&sigset);
sigaddset(&sigset, SIGINT2);
sigprocmask(SIG_UNBLOCK2, &sigset, NULL((void *)0));
  }

  for (;;) {
while (p->v_leftv_link[0])
   p = p->v_leftv_link[0];
712x:
if (p->v_parentv_link[2] == 0)	/* is it the header? */
   return;
len = blklen(p->vec);
(void) fprintf(cshout, "%s\t", short2str(p->v_name));
if (len != 1)
   (void) fputc('(', cshout);
blkpr(cshout, p->vec);
if (len != 1)
   (void) fputc(')', cshout);
(void) fputc('\n', cshout);
if (p->v_rightv_link[1]) {
   p = p->v_rightv_link[1];
   continue;
}
do {
   c = p;
   p = p->v_parentv_link[2];
} while (p->v_rightv_link[1] == c);
goto x;
  }
733}