vars.c (da52b4caaf187775f6b56a72c6b16e94ad728f7b) vars.c (6d8484b0d0191b66f9bfd0dfa89c06a29647f02a)
1/*
2 * Copyright (c) 1980, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright

--- 34 unchanged lines hidden (view full) ---

43 *
44 * Variable handling stuff.
45 */
46
47/*
48 * Assign a value to a variable.
49 */
50void
1/*
2 * Copyright (c) 1980, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright

--- 34 unchanged lines hidden (view full) ---

43 *
44 * Variable handling stuff.
45 */
46
47/*
48 * Assign a value to a variable.
49 */
50void
51assign(name, value)
52 const char *name, *value;
51assign(const char *name, const char *value)
53{
54 struct var *vp;
55 int h;
56
57 h = hash(name);
58 vp = lookup(name);
59 if (vp == NULL) {
60 vp = calloc(sizeof(*vp), 1);

--- 7 unchanged lines hidden (view full) ---

68}
69
70/*
71 * Free up a variable string. We do not bother to allocate
72 * strings whose value is "" since they are expected to be frequent.
73 * Thus, we cannot free same!
74 */
75void
52{
53 struct var *vp;
54 int h;
55
56 h = hash(name);
57 vp = lookup(name);
58 if (vp == NULL) {
59 vp = calloc(sizeof(*vp), 1);

--- 7 unchanged lines hidden (view full) ---

67}
68
69/*
70 * Free up a variable string. We do not bother to allocate
71 * strings whose value is "" since they are expected to be frequent.
72 * Thus, we cannot free same!
73 */
74void
76vfree(cp)
77 char *cp;
75vfree(char *cp)
78{
79 if (*cp != '\0')
80 (void)free(cp);
81}
82
83/*
84 * Copy a variable value into permanent (ie, not collected after each
85 * command) space. Do not bother to alloc space for ""
86 */
87
88char *
76{
77 if (*cp != '\0')
78 (void)free(cp);
79}
80
81/*
82 * Copy a variable value into permanent (ie, not collected after each
83 * command) space. Do not bother to alloc space for ""
84 */
85
86char *
89vcopy(str)
90 const char *str;
87vcopy(const char *str)
91{
92 char *new;
93 unsigned len;
94
95 if (*str == '\0')
96 return ("");
97 len = strlen(str) + 1;
98 if ((new = malloc(len)) == NULL)
99 err(1, "Out of memory");
100 bcopy(str, new, (int)len);
101 return (new);
102}
103
104/*
105 * Get the value of a variable and return it.
106 * Look in the environment if its not available locally.
107 */
108
109char *
88{
89 char *new;
90 unsigned len;
91
92 if (*str == '\0')
93 return ("");
94 len = strlen(str) + 1;
95 if ((new = malloc(len)) == NULL)
96 err(1, "Out of memory");
97 bcopy(str, new, (int)len);
98 return (new);
99}
100
101/*
102 * Get the value of a variable and return it.
103 * Look in the environment if its not available locally.
104 */
105
106char *
110value(name)
111 const char *name;
107value(const char *name)
112{
113 struct var *vp;
114
115 if ((vp = lookup(name)) == NULL)
116 return (getenv(name));
117 return (vp->v_value);
118}
119
120/*
121 * Locate a variable and return its variable
122 * node.
123 */
124
125struct var *
108{
109 struct var *vp;
110
111 if ((vp = lookup(name)) == NULL)
112 return (getenv(name));
113 return (vp->v_value);
114}
115
116/*
117 * Locate a variable and return its variable
118 * node.
119 */
120
121struct var *
126lookup(name)
127 const char *name;
122lookup(const char *name)
128{
129 struct var *vp;
130
131 for (vp = variables[hash(name)]; vp != NULL; vp = vp->v_link)
132 if (*vp->v_name == *name && equal(vp->v_name, name))
133 return (vp);
134 return (NULL);
135}
136
137/*
138 * Locate a group name and return it.
139 */
140
141struct grouphead *
123{
124 struct var *vp;
125
126 for (vp = variables[hash(name)]; vp != NULL; vp = vp->v_link)
127 if (*vp->v_name == *name && equal(vp->v_name, name))
128 return (vp);
129 return (NULL);
130}
131
132/*
133 * Locate a group name and return it.
134 */
135
136struct grouphead *
142findgroup(name)
143 char name[];
137findgroup(char name[])
144{
145 struct grouphead *gh;
146
147 for (gh = groups[hash(name)]; gh != NULL; gh = gh->g_link)
148 if (*gh->g_name == *name && equal(gh->g_name, name))
149 return (gh);
150 return (NULL);
151}
152
153/*
154 * Print a group out on stdout
155 */
156void
138{
139 struct grouphead *gh;
140
141 for (gh = groups[hash(name)]; gh != NULL; gh = gh->g_link)
142 if (*gh->g_name == *name && equal(gh->g_name, name))
143 return (gh);
144 return (NULL);
145}
146
147/*
148 * Print a group out on stdout
149 */
150void
157printgroup(name)
158 char name[];
151printgroup(char name[])
159{
160 struct grouphead *gh;
161 struct group *gp;
162
163 if ((gh = findgroup(name)) == NULL) {
164 printf("\"%s\": not a group\n", name);
165 return;
166 }
167 printf("%s\t", gh->g_name);
168 for (gp = gh->g_list; gp != NULL; gp = gp->ge_link)
169 printf(" %s", gp->ge_name);
170 printf("\n");
171}
172
173/*
174 * Hash the passed string and return an index into
175 * the variable or group hash table.
176 */
177int
152{
153 struct grouphead *gh;
154 struct group *gp;
155
156 if ((gh = findgroup(name)) == NULL) {
157 printf("\"%s\": not a group\n", name);
158 return;
159 }
160 printf("%s\t", gh->g_name);
161 for (gp = gh->g_list; gp != NULL; gp = gp->ge_link)
162 printf(" %s", gp->ge_name);
163 printf("\n");
164}
165
166/*
167 * Hash the passed string and return an index into
168 * the variable or group hash table.
169 */
170int
178hash(name)
179 const char *name;
171hash(const char *name)
180{
181 int h = 0;
182
183 while (*name != '\0') {
184 h <<= 2;
185 h += *name++;
186 }
187 if (h < 0 && (h = -h) < 0)
188 h = 0;
189 return (h % HSHSIZE);
190}
172{
173 int h = 0;
174
175 while (*name != '\0') {
176 h <<= 2;
177 h += *name++;
178 }
179 if (h < 0 && (h = -h) < 0)
180 h = 0;
181 return (h % HSHSIZE);
182}