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 <stdlib.h> 42 43 #include "value.h" 44 #include "var.h" 45 #include "mystring.h" 46 47 struct var * 48 var_set1(head, name, v) 49 struct var **head; 50 char *name; 51 struct value *v; 52 { 53 register struct var **p; 54 register struct var *r; 55 struct value val; 56 57 /* do this first, easier to recover */ 58 val = *v; 59 if (val.v_type == V_STR && val.v_str != 0 && 60 (val.v_str = str_cpy(val.v_str)) == 0) 61 return 0; 62 if (*(p = var_lookup1(head, name)) == 0) { 63 r = (struct var *) malloc(sizeof (struct var)); 64 if (r == 0) { 65 val_free(val); 66 return 0; 67 } 68 if ((r->r_name = str_cpy(name)) == 0) { 69 val_free(val); 70 free((char *) r); 71 return 0; 72 } 73 r->r_left = r->r_right = 0; 74 *p = r; 75 } else { 76 r = *p; 77 val_free(r->r_val); 78 } 79 r->r_val = val; 80 return r; 81 } 82 83 struct var * 84 var_setstr1(head, name, str) 85 struct var **head; 86 char *name; 87 char *str; 88 { 89 struct value v; 90 91 v.v_type = V_STR; 92 v.v_str = str; 93 return var_set1(head, name, &v); 94 } 95 96 struct var * 97 var_setnum1(head, name, num) 98 struct var **head; 99 char *name; 100 int num; 101 { 102 struct value v; 103 104 v.v_type = V_NUM; 105 v.v_num = num; 106 return var_set1(head, name, &v); 107 } 108 109 var_unset1(head, name) 110 struct var **head; 111 char *name; 112 { 113 register struct var **p; 114 register struct var *r; 115 116 if (*(p = var_lookup1(head, name)) == 0) 117 return -1; 118 r = *p; 119 *p = r->r_left; 120 while (*p != 0) 121 p = &(*p)->r_right; 122 *p = r->r_right; 123 val_free(r->r_val); 124 str_free(r->r_name); 125 free((char *) r); 126 return 0; 127 } 128 129 struct var ** 130 var_lookup1(p, name) 131 register struct var **p; 132 register char *name; 133 { 134 register cmp; 135 136 while (*p != 0) { 137 if ((cmp = strcmp(name, (*p)->r_name)) < 0) 138 p = &(*p)->r_left; 139 else if (cmp > 0) 140 p = &(*p)->r_right; 141 else 142 break; 143 } 144 return p; 145 } 146 147 var_walk1(r, func, a) 148 register struct var *r; 149 int (*func)(); 150 long a; 151 { 152 if (r == 0) 153 return 0; 154 if (var_walk1(r->r_left, func, a) < 0 || (*func)(a, r) < 0 155 || var_walk1(r->r_right, func, a) < 0) 156 return -1; 157 return 0; 158 } 159