1 /* $Header: /src/pub/tcsh/sh.set.c,v 3.39 2001/03/18 19:06:30 christos Exp $ */
3 * sh.set.c: Setting and Clearing of variables
6 * Copyright (c) 1980, 1991 The Regents of the University of California.
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 3. All advertising materials mentioning features or use of this software
18 * must display the following acknowledgement:
19 * This product includes software developed by the University of
20 * California, Berkeley and its contributors.
21 * 4. Neither the name of the University nor the names of its contributors
22 * may be used to endorse or promote products derived from this software
23 * without specific prior written permission.
25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
39 RCSID("$Id: sh.set.c,v 3.39 2001/03/18 19:06:30 christos Exp $")
45 extern bool GotTermCaps;
47 static void update_vars __P((Char *));
48 static Char *getinx __P((Char *, int *));
49 static void asx __P((Char *, int, Char *));
50 static struct varent *getvx __P((Char *, int));
51 static Char *xset __P((Char *, Char ***));
52 static Char *operate __P((int, Char *, Char *));
53 static void putn1 __P((int));
54 static struct varent *madrof __P((Char *, struct varent *));
55 static void unsetv1 __P((struct varent *));
56 static void exportpath __P((Char **));
57 static void balance __P((struct varent *, int, int));
67 if (eq(vp, STRpath)) {
68 exportpath(adrof(STRpath)->vec);
71 else if (eq(vp, STRhistchars)) {
72 register Char *pn = varval(vp);
77 else if (eq(vp, STRpromptchars)) {
78 register Char *pn = varval(vp);
83 else if (eq(vp, STRhistlit)) {
86 else if (eq(vp, STRuser)) {
87 tsetenv(STRKUSER, varval(vp));
88 tsetenv(STRLOGNAME, varval(vp));
90 else if (eq(vp, STRgroup)) {
91 tsetenv(STRKGROUP, varval(vp));
93 else if (eq(vp, STRwordchars)) {
94 word_chars = varval(vp);
96 else if (eq(vp, STRloginsh)) {
99 else if (eq(vp, STRsymlinks)) {
100 register Char *pn = varval(vp);
102 if (eq(pn, STRignore))
103 symlinks = SYM_IGNORE;
104 else if (eq(pn, STRexpand))
105 symlinks = SYM_EXPAND;
106 else if (eq(pn, STRchase))
107 symlinks = SYM_CHASE;
111 else if (eq(vp, STRterm)) {
112 Char *cp = varval(vp);
113 tsetenv(STRKTERM, cp);
114 #ifdef DOESNT_WORK_RIGHT
115 cp = getenv("TERMCAP");
116 if (cp && (*cp != '/')) /* if TERMCAP and not a path */
117 Unsetenv(STRTERMCAP);
118 #endif /* DOESNT_WORK_RIGHT */
120 if (noediting && Strcmp(cp, STRnetwork) != 0 &&
121 Strcmp(cp, STRunknown) != 0 && Strcmp(cp, STRdumb) != 0) {
124 set(STRedit, Strsave(STRNULL), VAR_READWRITE);
126 ed_Init(); /* reset the editor */
128 else if (eq(vp, STRhome)) {
131 cp = Strsave(varval(vp)); /* get the old value back */
134 * convert to cononical pathname (possibly resolving symlinks)
138 set(vp, Strsave(cp), VAR_READWRITE); /* have to save the new val */
140 /* and now mirror home with HOME */
141 tsetenv(STRKHOME, cp);
142 /* fix directory stack for new tilde home */
146 else if (eq(vp, STRedit)) {
149 /* PWP: add more stuff in here later */
151 else if (eq(vp, STRshlvl)) {
152 tsetenv(STRKSHLVL, varval(vp));
154 else if (eq(vp, STRbackslash_quote)) {
157 else if (eq(vp, STRdirstack)) {
160 else if (eq(vp, STRrecognize_only_executables)) {
163 else if (eq(vp, STRkillring)) {
164 SetKillRing(getn(varval(vp)));
167 else if (eq(vp, STRwatch)) {
170 #endif /* HAVENOUTMP */
171 else if (eq(vp, STRimplicitcd)) {
172 implicit_cd = ((eq(varval(vp), STRverbose)) ? 2 : 1);
175 else if (eq(vp, STRcolor)) {
178 #endif /* COLOR_LS_F */
179 #if defined(KANJI) && defined(SHORT_STRINGS) && defined(DSPMBYTE)
180 else if(eq(vp, CHECK_MBYTEVAR) || eq(vp, STRnokanji)) {
181 update_dspmbyte_vars();
185 else if (eq(vp, STRcatalog)) {
186 (void) catclose(catd);
189 #endif /* NLS_CATALOGS */
204 int flags = VAR_READWRITE;
205 bool first_match = 0;
214 * Readonly addition From: Tim P. Starrin <noid@cyborg.larc.nasa.gov>
216 if (*v && eq(*v, STRmr)) {
217 flags = VAR_READONLY;
221 if (*v && eq(*v, STRmf) && !last_match) {
226 if (*v && eq(*v, STRml) && !first_match) {
234 plist(&shvhed, flags);
241 for (; alnum(*p); p++)
243 if (vp == p || !letter(*vp))
244 stderror(ERR_NAME | ERR_VARBEGIN);
245 if ((p - vp) > MAXVARLEN) {
246 stderror(ERR_NAME | ERR_VARTOOLONG);
251 p = getinx(p, &subscr);
253 if ((op = *p) != 0) {
255 if (*p == 0 && *v && **v == '(')
258 else if (*v && eq(*v, STRequal)) {
264 stderror(ERR_NAME | ERR_SYNTAX);
265 if (eq(p, STRLparen)) {
266 register Char **e = v;
269 stderror(ERR_NAME | ERR_SYNTAX);
272 stderror(ERR_NAME | ERR_MISSING, ')');
285 set1(vp, vecp, &shvhed, flags);
290 asx(vp, subscr, Strsave(p));
292 set(vp, Strsave(p), flags);
294 } while ((p = *v++) != NULL);
304 while (*cp && Isdigit(*cp))
305 *ip = *ip * 10 + *cp++ - '0';
307 stderror(ERR_NAME | ERR_SUBSCRIPT);
317 register struct varent *v = getvx(vp, subscr);
319 if (v->v_flags & VAR_READONLY)
320 stderror(ERR_READONLY|ERR_NAME, v->v_name);
321 xfree((ptr_t) v->vec[subscr - 1]);
322 v->vec[subscr - 1] = globone(p, G_APPEND);
325 static struct varent *
330 register struct varent *v = adrof(vp);
334 if (subscr < 1 || subscr > blklen(v->vec))
335 stderror(ERR_NAME | ERR_RANGE);
343 struct command *dummy;
361 for (; alnum(*p); p++)
363 if (vp == p || !letter(*vp))
364 stderror(ERR_NAME | ERR_VARBEGIN);
365 if ((p - vp) > MAXVARLEN)
366 stderror(ERR_NAME | ERR_VARTOOLONG);
369 p = getinx(p, &subscr);
376 stderror(ERR_NAME | ERR_ASSIGN);
379 * if there is no expression after the '=' then print a "Syntax Error"
382 if (*p == '\0' && *v == NULL)
383 stderror(ERR_NAME | ERR_ASSIGN);
394 stderror(ERR_NAME | ERR_UNKNOWNOP);
400 stderror(ERR_NAME | ERR_UNKNOWNOP);
402 stderror(ERR_NAME | ERR_SYNTAX);
405 stderror(ERR_NAME | ERR_UNKNOWNOP);
413 set(vp, p, VAR_READWRITE);
416 struct varent *gv = getvx(vp, subscr);
418 asx(vp, subscr, operate(op, gv->vec[subscr - 1], p));
421 set(vp, operate(op, varval(vp), p), VAR_READWRITE);
426 } while ((p = *v++) != NULL);
438 xfree((ptr_t) ** vp);
441 return (putn(expr(vp)));
451 register Char **v = vec;
461 if (op == '<' || op == '>')
468 stderror(ERR_NAME | ERR_EXPRESSION);
472 static Char *putp, nbuf[50];
485 num = 2; /* confuse lint */
486 if (sizeof(int) == num && ((unsigned int) n) == 0x8000) {
494 num = 4; /* confuse lint */
495 if (sizeof(int) == num && ((unsigned int) n) == 0x80000000) {
503 return (Strsave(nbuf));
512 *putp++ = n % 10 + '0';
522 if (!cp) /* PWP: extra error checking */
523 stderror(ERR_NAME | ERR_BADNUM);
526 if (cp[0] == '+' && cp[1])
532 stderror(ERR_NAME | ERR_BADNUM);
536 n = n * 10 + *cp++ - '0';
538 stderror(ERR_NAME | ERR_BADNUM);
539 return (sign ? -n : n);
547 register struct varent *vp;
549 if (!var || !head) /* PWP: extra error checking */
552 vp = adrof1(var, head);
553 return (vp == 0 || vp->vec[0] == 0 ? STRNULL : vp->vec[0]);
556 static struct varent *
559 register struct varent *vp;
561 register struct varent *vp1;
563 for (vp = vp->v_left; vp; vp = vp->v_right) {
564 if (vp->v_left && (vp1 = madrof(pat, vp)) != NULL)
566 if (Gmatch(vp->v_name, pat))
575 register struct varent *v;
580 while (v && ((cmp = *name - *v->v_name) != 0 ||
581 (cmp = Strcmp(name, v->v_name)) != 0))
590 * The caller is responsible for putting value in a safe place
597 register Char **vec = (Char **) xmalloc((size_t) (2 * sizeof(Char **)));
601 set1(var, vec, &shvhed, flags);
605 set1(var, vec, head, flags)
610 register Char **oldv = vec;
612 if ((flags & VAR_NOGLOB) == 0) {
619 stderror(ERR_NAME | ERR_NOMATCH);
627 * Uniqueness addition from: Michael Veksler <mveksler@vnet.ibm.com>
629 if ( flags & (VAR_FIRST | VAR_LAST) ) {
631 * Code for -f (VAR_FIRST) and -l (VAR_LAST) options.
633 * Delete all duplicate words leaving "holes" in the word array (vec).
634 * Then remove the "holes", keeping the order of the words unchanged.
636 if (vec && vec[0] && vec[1]) { /* more than one word ? */
640 for (num_items = 0; vec[num_items]; num_items++)
642 if (flags & VAR_FIRST) {
643 /* delete duplications, keeping first occurance */
644 for (i = 1; i < num_items; i++)
645 for (j = 0; j < i; j++)
646 /* If have earlier identical item, remove i'th item */
647 if (vec[i] && vec[j] && Strcmp(vec[j], vec[i]) == 0) {
652 } else if (flags & VAR_LAST) {
653 /* delete duplications, keeping last occurance */
654 for (i = 0; i < num_items - 1; i++)
655 for (j = i + 1; j < num_items; j++)
656 /* If have later identical item, remove i'th item */
657 if (vec[i] && vec[j] && Strcmp(vec[j], vec[i]) == 0) {
658 /* remove identical item (the first) */
663 /* Compress items - remove empty items */
664 for (j = i = 0; i < num_items; i++)
668 /* NULL-fy remaining items */
669 for (; j < num_items; j++)
672 /* don't let the attribute propagate */
673 flags &= ~(VAR_FIRST|VAR_LAST);
675 setq(var, vec, head, flags);
680 setq(name, vec, p, flags)
682 register struct varent *p;
685 register struct varent *c;
688 f = 0; /* tree hangs off the header's left link */
689 while ((c = p->v_link[f]) != 0) {
690 if ((f = *name - *c->v_name) == 0 &&
691 (f = Strcmp(name, c->v_name)) == 0) {
692 if (c->v_flags & VAR_READONLY)
693 stderror(ERR_READONLY|ERR_NAME, c->v_name);
702 p->v_link[f] = c = (struct varent *) xmalloc((size_t)sizeof(struct varent));
703 c->v_name = Strsave(name);
706 c->v_left = c->v_right = 0;
718 bool did_roe, did_edit;
721 did_roe = adrof(STRrecognize_only_executables) != NULL;
722 did_edit = adrof(STRedit) != NULL;
724 if (adrof(STRhistchars) == 0) {
728 if (adrof(STRpromptchars) == 0) {
732 if (adrof(STRhistlit) == 0)
734 if (adrof(STRloginsh) == 0)
736 if (adrof(STRwordchars) == 0)
737 word_chars = STR_WORD_CHARS;
738 if (adrof(STRedit) == 0)
740 if (adrof(STRbackslash_quote) == 0)
742 if (adrof(STRsymlinks) == 0)
744 if (adrof(STRimplicitcd) == 0)
746 if (adrof(STRkillring) == 0)
748 if (did_edit && noediting && adrof(STRedit) == 0)
750 if (did_roe && adrof(STRrecognize_only_executables) == 0)
753 if (adrof(STRcolor) == 0)
755 #endif /* COLOR_LS_F */
756 #if defined(KANJI) && defined(SHORT_STRINGS) && defined(DSPMBYTE)
757 update_dspmbyte_vars();
760 (void) catclose(catd);
762 #endif /* NLS_CATALOGS */
770 register struct varent *vp;
775 while ((vp = madrof(*v, head)) != NULL)
776 if (vp->v_flags & VAR_READONLY)
777 stderror(ERR_READONLY|ERR_NAME, vp->v_name);
781 setname(short2str(*v));
789 register struct varent *vp;
791 if ((vp = adrof1(var, &shvhed)) == 0)
798 register struct varent *p;
800 register struct varent *c, *pp;
804 * Free associated memory first to avoid complications.
807 xfree((ptr_t) p->v_name);
809 * If p is missing one child, then we can move the other into where p is.
810 * Otherwise, we find the predecessor of p, which is guaranteed to have no
811 * right child, copy it into p, and move it's left child into it.
815 else if (p->v_left == 0)
818 for (c = p->v_left; c->v_right; c = c->v_right)
820 p->v_name = c->v_name;
821 p->v_flags = c->v_flags;
828 * Move c into where p is.
831 f = pp->v_right == p;
832 if ((pp->v_link[f] = c) != 0)
835 * Free the deleted node, and rebalance.
845 set(cp, Strsave(STRNULL), VAR_READWRITE);
854 register struct varent *argv;
867 if (argv->vec[0] == 0)
868 stderror(ERR_NAME | ERR_NOMORE);
869 lshift(argv->vec, 1);
873 static Char STRsep[2] = { PATHSEP, '\0' };
880 size_t exppath_size = BUFSIZE;
881 exppath = (Char *)xmalloc(sizeof(Char)*exppath_size);
886 while (Strlen(*val) + Strlen(exppath) + 2 > exppath_size) {
888 = (Char *)xrealloc(exppath, sizeof(Char)*(exppath_size *= 2)))
891 "Warning: ridiculously long PATH truncated\n"));
895 (void) Strcat(exppath, *val++);
896 if (*val == 0 || eq(*val, STRRparen))
898 (void) Strcat(exppath, STRsep);
900 tsetenv(STRKPATH, exppath);
906 * Lint thinks these have null effect
908 /* macros to do single rotations on node p */
909 # define rright(p) (\
911 (t)->v_parent = (p)->v_parent,\
912 (((p)->v_left = t->v_right) != NULL) ?\
913 (t->v_right->v_parent = (p)) : 0,\
914 (t->v_right = (p))->v_parent = t,\
918 ((t)->v_parent = (p)->v_parent,\
919 ((p)->v_right = t->v_left) != NULL) ? \
920 (t->v_left->v_parent = (p)) : 0,\
921 (t->v_left = (p))->v_parent = t,\
924 static struct varent *
930 static struct varent *
941 * Rebalance a tree, starting at p and up.
942 * F == 0 means we've come from p's left child.
943 * D == 1 means we've just done a delete, otherwise an insert.
947 register struct varent *p;
950 register struct varent *pp;
953 register struct varent *t; /* used by the rotate macros */
957 ff = 0; /* Sun's lint is dumb! */
961 * Ok, from here on, p is the node we're operating on; pp is it's parent; f
962 * is the branch of p from which we have come; ff is the branch of pp which
965 for (; (pp = p->v_parent) != 0; p = pp, f = ff) {
966 ff = pp->v_right == p;
967 if (f ^ d) { /* right heavy */
969 case -1: /* was left heavy */
972 case 0: /* was balanced */
975 case 1: /* was already right heavy */
976 switch (p->v_right->v_bal) {
977 case 1: /* sigle rotate */
978 pp->v_link[ff] = rleft(p);
979 p->v_left->v_bal = 0;
982 case 0: /* single rotate */
983 pp->v_link[ff] = rleft(p);
984 p->v_left->v_bal = 1;
987 case -1: /* double rotate */
988 (void) rright(p->v_right);
989 pp->v_link[ff] = rleft(p);
991 p->v_bal < 1 ? 0 : -1;
993 p->v_bal > -1 ? 0 : 1;
1004 else { /* left heavy */
1006 case 1: /* was right heavy */
1009 case 0: /* was balanced */
1012 case -1: /* was already left heavy */
1013 switch (p->v_left->v_bal) {
1014 case -1: /* single rotate */
1015 pp->v_link[ff] = rright(p);
1016 p->v_right->v_bal = 0;
1019 case 0: /* signle rotate */
1020 pp->v_link[ff] = rright(p);
1021 p->v_right->v_bal = -1;
1024 case 1: /* double rotate */
1025 (void) rleft(p->v_left);
1026 pp->v_link[ff] = rright(p);
1028 p->v_bal < 1 ? 0 : -1;
1030 p->v_bal > -1 ? 0 : 1;
1042 * If from insert, then we terminate when p is balanced. If from
1043 * delete, then we terminate when p is unbalanced.
1045 if ((p->v_bal == 0) ^ d)
1052 register struct varent *p;
1055 register struct varent *c;
1060 (void) sigsetmask(sigblock((sigmask_t) 0) & ~sigmask(SIGINT));
1061 #else /* !BSDSIGS */
1062 (void) sigrelse(SIGINT);
1063 #endif /* BSDSIGS */
1069 if (p->v_parent == 0) /* is it the header? */
1071 if ((p->v_flags & what) != 0) {
1072 len = blklen(p->vec);
1073 xprintf("%S\t", p->v_name);
1088 } while (p->v_right == c);
1093 #if defined(KANJI) && defined(SHORT_STRINGS) && defined(DSPMBYTE)
1097 update_dspmbyte_vars()
1103 /* if variable "nokanji" is set, multi-byte display is disabled */
1104 if ((vp = adrof(CHECK_MBYTEVAR)) && !adrof(STRnokanji)) {
1107 if(eq (dstr1, STRKSJIS))
1109 else if (eq(dstr1, STRKEUC))
1111 else if (eq(dstr1, STRKBIG5))
1113 else if ((dstr1[0] - '0') >= 0 && (dstr1[0] - '0') <= 3) {
1117 xprintf(CGETS(18, 2,
1118 "Warning: unknown multibyte display; using default(euc(JP))\n"));
1121 if (dstr1 && vp->vec[1] && eq(vp->vec[1], STRls))
1125 for (lp = 0; lp < 256 && iskcode > 0; lp++) {
1129 _cmap[lp] = _cmap_mbyte[lp];
1130 _mbmap[lp] = _mbmap_sjis[lp];
1134 _cmap[lp] = _cmap_mbyte[lp];
1135 _mbmap[lp] = _mbmap_euc[lp];
1139 _cmap[lp] = _cmap_mbyte[lp];
1140 _mbmap[lp] = _mbmap_big5[lp];
1143 xprintf(CGETS(18, 3,
1144 "Warning: unknown multibyte code %d; multibyte disabled\n"),
1146 _cmap[lp] = _cmap_c[lp];
1147 _mbmap[lp] = 0; /* Default map all 0 */
1153 /* check original table */
1154 if (Strlen(dstr1) != 256) {
1155 xprintf(CGETS(18, 4,
1156 "Warning: Invalid multibyte table length (%d); multibyte disabled\n"),
1160 for (lp = 0; lp < 256 && _enable_mbdisp == 1; lp++) {
1161 if (!((dstr1[lp] - '0') >= 0 && (dstr1[lp] - '0') <= 3)) {
1162 xprintf(CGETS(18, 4,
1163 "Warning: bad multibyte code at offset +%d; multibyte diabled\n"),
1169 /* set original table */
1170 for (lp = 0; lp < 256; lp++) {
1171 if (_enable_mbdisp == 1) {
1172 _cmap[lp] = _cmap_mbyte[lp];
1173 _mbmap[lp] = (unsigned short) ((dstr1[lp] - '0') & 0x0f);
1176 _cmap[lp] = _cmap_c[lp];
1177 _mbmap[lp] = 0; /* Default map all 0 */
1183 for (lp = 0; lp < 256; lp++) {
1184 _cmap[lp] = _cmap_c[lp];
1185 _mbmap[lp] = 0; /* Default map all 0 */
1190 #ifdef MBYTEDEBUG /* Sorry, use for beta testing */
1193 for (lp = 0; lp < 256; lp++) {
1194 mbmapstr[lp] = _mbmap[lp] + '0';
1197 set(STRmbytemap, Strsave(mbmapstr), VAR_READWRITE);
1199 #endif /* MBYTEMAP */
1202 /* dspkanji/dspmbyte autosetting */
1203 /* PATCH IDEA FROM Issei.Suzuki VERY THANKS */
1205 autoset_dspmbyte(pcp)
1209 struct dspm_autoset_Table {
1213 { STRLANGEUCJP, STRKEUC },
1214 { STRLANGEUCKR, STRKEUC },
1215 { STRLANGEUCJPB, STRKEUC },
1216 { STRLANGEUCKRB, STRKEUC },
1217 { STRLANGSJIS, STRKSJIS },
1218 { STRLANGSJISB, STRKSJIS },
1219 { STRLANGBIG5, STRKBIG5 },
1226 for (i = 0; dspmt[i].n; i++) {
1227 if (eq(pcp, dspmt[i].n)) {
1228 set(CHECK_MBYTEVAR, Strsave(dspmt[i].v), VAR_READWRITE);
1229 update_dspmbyte_vars();