xref: /dragonfly/usr.bin/window/var.c (revision 0bb9290e)
1 /*
2  * Copyright (c) 1983, 1993
3  *	The Regents of the University of California.  All rights reserved.
4  *
5  * This code is derived from software contributed to Berkeley by
6  * Edward Wang at The University of California, Berkeley.
7  *
8  * Redistribution and use in source and binary forms, with or without
9  * modification, are permitted provided that the following conditions
10  * are met:
11  * 1. Redistributions of source code must retain the above copyright
12  *    notice, this list of conditions and the following disclaimer.
13  * 2. Redistributions in binary form must reproduce the above copyright
14  *    notice, this list of conditions and the following disclaimer in the
15  *    documentation and/or other materials provided with the distribution.
16  * 3. All advertising materials mentioning features or use of this software
17  *    must display the following acknowledgement:
18  *	This product includes software developed by the University of
19  *	California, Berkeley and its contributors.
20  * 4. Neither the name of the University nor the names of its contributors
21  *    may be used to endorse or promote products derived from this software
22  *    without specific prior written permission.
23  *
24  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34  * SUCH DAMAGE.
35  *
36  * @(#)var.c	8.1 (Berkeley) 6/6/93
37  * $FreeBSD: src/usr.bin/window/var.c,v 1.2.6.2 2001/05/17 09:45:01 obrien Exp $
38  * $DragonFly: src/usr.bin/window/var.c,v 1.3 2005/02/28 13:57:05 joerg Exp $
39  */
40 
41 #include "value.h"
42 #include "var.h"
43 #include "mystring.h"
44 
45 struct var *
46 var_set1(head, name, v)
47 struct var **head;
48 char *name;
49 struct value *v;
50 {
51 	register struct var **p;
52 	register struct var *r;
53 	struct value val;
54 
55 	/* do this first, easier to recover */
56 	val = *v;
57 	if (val.v_type == V_STR && val.v_str != 0 &&
58 	    (val.v_str = str_cpy(val.v_str)) == 0)
59 		return 0;
60 	if (*(p = var_lookup1(head, name)) == 0) {
61 		r = (struct var *) malloc(sizeof (struct var));
62 		if (r == 0) {
63 			val_free(val);
64 			return 0;
65 		}
66 		if ((r->r_name = str_cpy(name)) == 0) {
67 			val_free(val);
68 			free((char *) r);
69 			return 0;
70 		}
71 		r->r_left = r->r_right = 0;
72 		*p = r;
73 	} else {
74 		r = *p;
75 		val_free(r->r_val);
76 	}
77 	r->r_val = val;
78 	return r;
79 }
80 
81 struct var *
82 var_setstr1(head, name, str)
83 struct var **head;
84 char *name;
85 char *str;
86 {
87 	struct value v;
88 
89 	v.v_type = V_STR;
90 	v.v_str = str;
91 	return var_set1(head, name, &v);
92 }
93 
94 struct var *
95 var_setnum1(head, name, num)
96 struct var **head;
97 char *name;
98 int num;
99 {
100 	struct value v;
101 
102 	v.v_type = V_NUM;
103 	v.v_num = num;
104 	return var_set1(head, name, &v);
105 }
106 
107 var_unset1(head, name)
108 struct var **head;
109 char *name;
110 {
111 	register struct var **p;
112 	register struct var *r;
113 
114 	if (*(p = var_lookup1(head, name)) == 0)
115 		return -1;
116 	r = *p;
117 	*p = r->r_left;
118 	while (*p != 0)
119 		p = &(*p)->r_right;
120 	*p = r->r_right;
121 	val_free(r->r_val);
122 	str_free(r->r_name);
123 	free((char *) r);
124 	return 0;
125 }
126 
127 struct var **
128 var_lookup1(p, name)
129 register struct var **p;
130 register char *name;
131 {
132 	register cmp;
133 
134 	while (*p != 0) {
135 		if ((cmp = strcmp(name, (*p)->r_name)) < 0)
136 			p = &(*p)->r_left;
137 		else if (cmp > 0)
138 			p = &(*p)->r_right;
139 		else
140 			break;
141 	}
142 	return p;
143 }
144 
145 var_walk1(r, func, a)
146 register struct var *r;
147 int (*func)();
148 long a;
149 {
150 	if (r == 0)
151 		return 0;
152 	if (var_walk1(r->r_left, func, a) < 0 || (*func)(a, r) < 0
153 	    || var_walk1(r->r_right, func, a) < 0)
154 		return -1;
155 	return 0;
156 }
157