1*53e64a77Schristos /* $NetBSD: _env.c,v 1.15 2024/01/02 19:27:26 christos Exp $ */
2fbf4aa16Stron
3fbf4aa16Stron /*-
4fbf4aa16Stron * Copyright (c) 2010 The NetBSD Foundation, Inc.
5fbf4aa16Stron * All rights reserved.
6fbf4aa16Stron *
7fbf4aa16Stron * This code is derived from software contributed to The NetBSD Foundation
8fbf4aa16Stron * by Matthias Scheler.
9fbf4aa16Stron *
10fbf4aa16Stron * Redistribution and use in source and binary forms, with or without
11fbf4aa16Stron * modification, are permitted provided that the following conditions
12fbf4aa16Stron * are met:
13fbf4aa16Stron * 1. Redistributions of source code must retain the above copyright
14fbf4aa16Stron * notice, this list of conditions and the following disclaimer.
15fbf4aa16Stron * 2. Redistributions in binary form must reproduce the above copyright
16fbf4aa16Stron * notice, this list of conditions and the following disclaimer in the
17fbf4aa16Stron * documentation and/or other materials provided with the distribution.
18fbf4aa16Stron *
19fbf4aa16Stron * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20fbf4aa16Stron * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21fbf4aa16Stron * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22fbf4aa16Stron * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23fbf4aa16Stron * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24fbf4aa16Stron * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25fbf4aa16Stron * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26fbf4aa16Stron * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27fbf4aa16Stron * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28fbf4aa16Stron * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29fbf4aa16Stron * POSSIBILITY OF SUCH DAMAGE.
30fbf4aa16Stron */
31fbf4aa16Stron
32d0e6f50dStron #include <sys/cdefs.h>
33d0e6f50dStron #if defined(LIBC_SCCS) && !defined(lint)
34*53e64a77Schristos __RCSID("$NetBSD: _env.c,v 1.15 2024/01/02 19:27:26 christos Exp $");
35d0e6f50dStron #endif /* LIBC_SCCS and not lint */
36d0e6f50dStron
374a3a3138Stron #include "namespace.h"
384a3a3138Stron
39fbf4aa16Stron #include <sys/rbtree.h>
40fbf4aa16Stron
41fbf4aa16Stron #include <assert.h>
42fbf4aa16Stron #include <errno.h>
432f85740eStron #include <limits.h>
44fbf4aa16Stron #include <stdlib.h>
45fbf4aa16Stron #include <stddef.h>
46fbf4aa16Stron #include <string.h>
47c510faceSchristos #include "csu-common.h"
48fbf4aa16Stron
49fbf4aa16Stron #include "env.h"
50fbf4aa16Stron #include "local.h"
51fbf4aa16Stron
52fbf4aa16Stron /*
53fbf4aa16Stron * Red-Black tree node for tracking memory used by environment variables.
54fbf4aa16Stron * The tree is sorted by the address of the nodes themselves.
55fbf4aa16Stron */
56fbf4aa16Stron typedef struct {
57fbf4aa16Stron rb_node_t rb_node;
58fbf4aa16Stron size_t length;
59d0e6f50dStron uint8_t marker;
60fbf4aa16Stron char data[];
61fbf4aa16Stron } env_node_t;
62fbf4aa16Stron
63fbf4aa16Stron /* Compare functions for above tree. */
64fbf4aa16Stron static signed int env_tree_compare_nodes(void *, const void *, const void *);
65fbf4aa16Stron static signed int env_tree_compare_key(void *, const void *, const void *);
66fbf4aa16Stron
67fbf4aa16Stron /* Operations for above tree. */
68fbf4aa16Stron static const rb_tree_ops_t env_tree_ops = {
69fbf4aa16Stron .rbto_compare_nodes = env_tree_compare_nodes,
70fbf4aa16Stron .rbto_compare_key = env_tree_compare_key,
71fbf4aa16Stron .rbto_node_offset = offsetof(env_node_t, rb_node),
72fbf4aa16Stron .rbto_context = NULL
73fbf4aa16Stron };
74fbf4aa16Stron
75fbf4aa16Stron /* The single instance of above tree. */
766df7a1dcSriastradh static rb_tree_t env_tree =
776df7a1dcSriastradh RB_TREE_INITIALIZER(env_tree, &env_tree_ops);
78fbf4aa16Stron
79fbf4aa16Stron /* The allocated environment. */
80fbf4aa16Stron static char **allocated_environ;
81fbf4aa16Stron static size_t allocated_environ_size;
82fbf4aa16Stron
83fbf4aa16Stron #define ENV_ARRAY_SIZE_MIN 16
84fbf4aa16Stron
854f54ea76Senami /* The lock protecting access to the environment. */
86fbf4aa16Stron #ifdef _REENTRANT
87fbf4aa16Stron static rwlock_t env_lock = RWLOCK_INITIALIZER;
88fbf4aa16Stron #endif
89fbf4aa16Stron
902f85740eStron /* Compatibility function. */
91*53e64a77Schristos extern char *__findenv(const char *name, int *offsetp);
922f85740eStron
932f85740eStron __warn_references(__findenv,
942f85740eStron "warning: __findenv is an internal obsolete function.")
952f85740eStron
96fbf4aa16Stron /* Our initialization function. */
97fbf4aa16Stron void __libc_env_init(void);
98fbf4aa16Stron
99fbf4aa16Stron /*ARGSUSED*/
100fbf4aa16Stron static signed int
env_tree_compare_nodes(void * ctx,const void * node_a,const void * node_b)101fbf4aa16Stron env_tree_compare_nodes(void *ctx, const void *node_a, const void *node_b)
102fbf4aa16Stron {
103fbf4aa16Stron uintptr_t addr_a, addr_b;
104fbf4aa16Stron
105fbf4aa16Stron addr_a = (uintptr_t)node_a;
106fbf4aa16Stron addr_b = (uintptr_t)node_b;
107fbf4aa16Stron
108fbf4aa16Stron if (addr_a < addr_b)
109fbf4aa16Stron return -1;
110fbf4aa16Stron
111fbf4aa16Stron if (addr_a > addr_b)
112fbf4aa16Stron return 1;
113fbf4aa16Stron
114fbf4aa16Stron return 0;
115fbf4aa16Stron }
116fbf4aa16Stron
117fbf4aa16Stron static signed int
env_tree_compare_key(void * ctx,const void * node,const void * key)118fbf4aa16Stron env_tree_compare_key(void *ctx, const void *node, const void *key)
119fbf4aa16Stron {
120fbf4aa16Stron return env_tree_compare_nodes(ctx, node,
121fbf4aa16Stron (const uint8_t *)key - offsetof(env_node_t, data));
122fbf4aa16Stron }
123fbf4aa16Stron
124fbf4aa16Stron /*
125fbf4aa16Stron * Determine the of the name in an environment string. Return 0 if the
126fbf4aa16Stron * name is not valid.
127fbf4aa16Stron */
128fbf4aa16Stron size_t
__envvarnamelen(const char * str,bool withequal)129fbf4aa16Stron __envvarnamelen(const char *str, bool withequal)
130fbf4aa16Stron {
131fbf4aa16Stron size_t l_name;
132fbf4aa16Stron
133fbf4aa16Stron if (str == NULL)
134fbf4aa16Stron return 0;
135fbf4aa16Stron
136fbf4aa16Stron l_name = strcspn(str, "=");
137fbf4aa16Stron if (l_name == 0)
138fbf4aa16Stron return 0;
139fbf4aa16Stron
140fbf4aa16Stron if (withequal) {
141fbf4aa16Stron if (str[l_name] != '=')
142fbf4aa16Stron return 0;
143fbf4aa16Stron } else {
144fbf4aa16Stron if (str[l_name] == '=')
145fbf4aa16Stron return 0;
146fbf4aa16Stron }
147fbf4aa16Stron
148fbf4aa16Stron return l_name;
149fbf4aa16Stron }
150fbf4aa16Stron
151fbf4aa16Stron /*
152fbf4aa16Stron * Free memory occupied by environment variable if possible. This function
153fbf4aa16Stron * must be called with the environment write locked.
154fbf4aa16Stron */
155fbf4aa16Stron void
__freeenvvar(char * envvar)156fbf4aa16Stron __freeenvvar(char *envvar)
157fbf4aa16Stron {
158fbf4aa16Stron env_node_t *node;
159fbf4aa16Stron
160fbf4aa16Stron _DIAGASSERT(envvar != NULL);
161fbf4aa16Stron node = rb_tree_find_node(&env_tree, envvar);
162fbf4aa16Stron if (node != NULL) {
163fbf4aa16Stron rb_tree_remove_node(&env_tree, node);
164fbf4aa16Stron free(node);
165fbf4aa16Stron }
166fbf4aa16Stron }
167fbf4aa16Stron
168fbf4aa16Stron /*
169fbf4aa16Stron * Allocate memory for an environment variable. This function must be called
170fbf4aa16Stron * with the environment write locked.
171fbf4aa16Stron */
172fbf4aa16Stron char *
__allocenvvar(size_t length)173fbf4aa16Stron __allocenvvar(size_t length)
174fbf4aa16Stron {
175fbf4aa16Stron env_node_t *node;
176fbf4aa16Stron
177fbf4aa16Stron node = malloc(sizeof(*node) + length);
178fbf4aa16Stron if (node != NULL) {
179fbf4aa16Stron node->length = length;
180d0e6f50dStron node->marker = 0;
181fbf4aa16Stron rb_tree_insert_node(&env_tree, node);
182fbf4aa16Stron return node->data;
183fbf4aa16Stron } else {
184fbf4aa16Stron return NULL;
185fbf4aa16Stron }
186fbf4aa16Stron }
187fbf4aa16Stron
188fbf4aa16Stron /*
1894f54ea76Senami * Check whether an environment variable is writable. This function must be
190fbf4aa16Stron * called with the environment write locked as the caller will probably
1914f54ea76Senami * overwrite the environment variable afterwards.
192fbf4aa16Stron */
193fbf4aa16Stron bool
__canoverwriteenvvar(char * envvar,size_t length)194fbf4aa16Stron __canoverwriteenvvar(char *envvar, size_t length)
195fbf4aa16Stron {
196fbf4aa16Stron env_node_t *node;
197fbf4aa16Stron
198fbf4aa16Stron _DIAGASSERT(envvar != NULL);
199fbf4aa16Stron
200fbf4aa16Stron node = rb_tree_find_node(&env_tree, envvar);
201fbf4aa16Stron return (node != NULL && length <= node->length);
202fbf4aa16Stron }
203fbf4aa16Stron
204d0e6f50dStron /* Free all allocated environment variables that are no longer used. */
205d0e6f50dStron static void
__scrubenv(void)206d0e6f50dStron __scrubenv(void)
207d0e6f50dStron {
208d0e6f50dStron static uint8_t marker = 0;
209d0e6f50dStron size_t num_entries;
210d0e6f50dStron env_node_t *node, *next;
211d0e6f50dStron
212d0e6f50dStron while (++marker == 0);
213d0e6f50dStron
214d0e6f50dStron /* Mark all nodes which are currently used. */
215d0e6f50dStron for (num_entries = 0; environ[num_entries] != NULL; num_entries++) {
216d0e6f50dStron node = rb_tree_find_node(&env_tree, environ[num_entries]);
217d0e6f50dStron if (node != NULL)
218d0e6f50dStron node->marker = marker;
219d0e6f50dStron }
220d0e6f50dStron
221d0e6f50dStron /* Free all nodes which are currently not used. */
222d0e6f50dStron for (node = RB_TREE_MIN(&env_tree); node != NULL; node = next) {
223d0e6f50dStron next = rb_tree_iterate(&env_tree, node, RB_DIR_RIGHT);
224d0e6f50dStron
225d0e6f50dStron if (node->marker != marker) {
226d0e6f50dStron rb_tree_remove_node(&env_tree, node);
227d0e6f50dStron free(node);
228d0e6f50dStron }
229d0e6f50dStron }
230d0e6f50dStron
231d0e6f50dStron /* Deal with the environment array itself. */
232d0e6f50dStron if (environ == allocated_environ) {
233d0e6f50dStron /* Clear out spurious entries in the environment. */
234d0e6f50dStron (void)memset(&environ[num_entries + 1], 0,
235d0e6f50dStron (allocated_environ_size - num_entries - 1) *
236d0e6f50dStron sizeof(*environ));
237d0e6f50dStron } else {
238d0e6f50dStron /*
239d0e6f50dStron * The environment array was not allocated by "libc".
240d0e6f50dStron * Free our array if we allocated one.
241d0e6f50dStron */
242d0e6f50dStron free(allocated_environ);
243d0e6f50dStron allocated_environ = NULL;
244d0e6f50dStron allocated_environ_size = 0;
245d0e6f50dStron }
246d0e6f50dStron }
247d0e6f50dStron
248fbf4aa16Stron /*
249fbf4aa16Stron * Get a (new) slot in the environment. This function must be called with
250fbf4aa16Stron * the environment write locked.
251fbf4aa16Stron */
252fbf4aa16Stron ssize_t
__getenvslot(const char * name,size_t l_name,bool allocate)253fbf4aa16Stron __getenvslot(const char *name, size_t l_name, bool allocate)
254fbf4aa16Stron {
255fbf4aa16Stron size_t new_size, num_entries, required_size;
256fbf4aa16Stron char **new_environ;
257fbf4aa16Stron
258fbf4aa16Stron /* Search for an existing environment variable of the given name. */
259fbf4aa16Stron num_entries = 0;
260e1278de2Skamil if (environ != NULL) {
261fbf4aa16Stron while (environ[num_entries] != NULL) {
262fbf4aa16Stron if (strncmp(environ[num_entries], name, l_name) == 0 &&
263fbf4aa16Stron environ[num_entries][l_name] == '=') {
264fbf4aa16Stron /* We found a match. */
265fbf4aa16Stron return num_entries;
266fbf4aa16Stron }
267fbf4aa16Stron num_entries ++;
268fbf4aa16Stron }
269e1278de2Skamil }
270fbf4aa16Stron
271fbf4aa16Stron /* No match found, return if we don't want to allocate a new slot. */
272fbf4aa16Stron if (!allocate)
273fbf4aa16Stron return -1;
274fbf4aa16Stron
2751ad2891bStron /* Does the environ need scrubbing? */
2761ad2891bStron if (environ != allocated_environ && allocated_environ != NULL)
2771ad2891bStron __scrubenv();
2781ad2891bStron
279fbf4aa16Stron /* Create a new slot in the environment. */
280fbf4aa16Stron required_size = num_entries + 1;
281fbf4aa16Stron if (environ == allocated_environ &&
282fbf4aa16Stron required_size < allocated_environ_size) {
283d0e6f50dStron /* Does the environment need scrubbing? */
284d0e6f50dStron if (required_size < allocated_environ_size &&
285d0e6f50dStron allocated_environ[required_size] != NULL) {
286d0e6f50dStron __scrubenv();
287fbf4aa16Stron }
288fbf4aa16Stron
289fbf4aa16Stron /* Return a free slot. */
290fbf4aa16Stron return num_entries;
291fbf4aa16Stron }
292fbf4aa16Stron
293fbf4aa16Stron /* Determine size of a new environment array. */
294fbf4aa16Stron new_size = ENV_ARRAY_SIZE_MIN;
295fbf4aa16Stron while (new_size <= required_size)
296fbf4aa16Stron new_size <<= 1;
297fbf4aa16Stron
298fbf4aa16Stron /* Allocate a new environment array. */
299fbf4aa16Stron if (environ == allocated_environ) {
3002204e873Snia new_environ = environ;
3013249d3dcSchristos errno = reallocarr(&new_environ,
3023249d3dcSchristos new_size, sizeof(*new_environ));
3033249d3dcSchristos if (errno)
304fbf4aa16Stron return -1;
305fbf4aa16Stron } else {
306fbf4aa16Stron free(allocated_environ);
307fbf4aa16Stron allocated_environ = NULL;
308fbf4aa16Stron allocated_environ_size = 0;
309fbf4aa16Stron
3102204e873Snia new_environ = NULL;
3113249d3dcSchristos errno = reallocarr(&new_environ,
3123249d3dcSchristos new_size, sizeof(*new_environ));
3133249d3dcSchristos if (errno)
314fbf4aa16Stron return -1;
315fbf4aa16Stron (void)memcpy(new_environ, environ,
316fbf4aa16Stron num_entries * sizeof(*new_environ));
317fbf4aa16Stron }
318fbf4aa16Stron
319fbf4aa16Stron /* Clear remaining entries. */
320fbf4aa16Stron (void)memset(&new_environ[num_entries], 0,
321fbf4aa16Stron (new_size - num_entries) * sizeof(*new_environ));
322fbf4aa16Stron
3234f54ea76Senami /* Use the new environment array. */
324fbf4aa16Stron environ = allocated_environ = new_environ;
325fbf4aa16Stron allocated_environ_size = new_size;
326fbf4aa16Stron
327fbf4aa16Stron /* Return a free slot. */
328fbf4aa16Stron return num_entries;
329fbf4aa16Stron }
330fbf4aa16Stron
331fbf4aa16Stron /* Find a string in the environment. */
332fbf4aa16Stron char *
__findenvvar(const char * name,size_t l_name)3332f85740eStron __findenvvar(const char *name, size_t l_name)
334fbf4aa16Stron {
335fbf4aa16Stron ssize_t offset;
336fbf4aa16Stron
337fbf4aa16Stron offset = __getenvslot(name, l_name, false);
338fbf4aa16Stron return (offset != -1) ? environ[offset] + l_name + 1 : NULL;
339fbf4aa16Stron }
340fbf4aa16Stron
3412f85740eStron /* Compatibility interface, do *not* call this function. */
3422f85740eStron char *
__findenv(const char * name,int * offsetp)3432f85740eStron __findenv(const char *name, int *offsetp)
3442f85740eStron {
3452f85740eStron size_t l_name;
3462f85740eStron ssize_t offset;
3472f85740eStron
3482f85740eStron l_name = __envvarnamelen(name, false);
3492f85740eStron if (l_name == 0)
3502f85740eStron return NULL;
3512f85740eStron
3522f85740eStron offset = __getenvslot(name, l_name, false);
3532f85740eStron if (offset < 0 || offset > INT_MAX)
3542f85740eStron return NULL;
3552f85740eStron
3562f85740eStron *offsetp = (int)offset;
3572f85740eStron return environ[offset] + l_name + 1;
3582f85740eStron }
3592f85740eStron
360fbf4aa16Stron #ifdef _REENTRANT
361fbf4aa16Stron
362fbf4aa16Stron /* Lock the environment for read. */
363fbf4aa16Stron bool
__readlockenv(void)364fbf4aa16Stron __readlockenv(void)
365fbf4aa16Stron {
366fbf4aa16Stron int error;
367fbf4aa16Stron
368fbf4aa16Stron error = rwlock_rdlock(&env_lock);
369fbf4aa16Stron if (error == 0)
370fbf4aa16Stron return true;
371fbf4aa16Stron
372fbf4aa16Stron errno = error;
373fbf4aa16Stron return false;
374fbf4aa16Stron }
375fbf4aa16Stron
376fbf4aa16Stron /* Lock the environment for write. */
377fbf4aa16Stron bool
__writelockenv(void)378fbf4aa16Stron __writelockenv(void)
379fbf4aa16Stron {
380fbf4aa16Stron int error;
381fbf4aa16Stron
382fbf4aa16Stron error = rwlock_wrlock(&env_lock);
383fbf4aa16Stron if (error == 0)
384fbf4aa16Stron return true;
385fbf4aa16Stron
386fbf4aa16Stron errno = error;
387fbf4aa16Stron return false;
388fbf4aa16Stron }
389fbf4aa16Stron
390fbf4aa16Stron /* Unlock the environment for write. */
391fbf4aa16Stron bool
__unlockenv(void)392fbf4aa16Stron __unlockenv(void)
393fbf4aa16Stron {
394fbf4aa16Stron int error;
395fbf4aa16Stron
396fbf4aa16Stron error = rwlock_unlock(&env_lock);
397fbf4aa16Stron if (error == 0)
398fbf4aa16Stron return true;
399fbf4aa16Stron
400fbf4aa16Stron errno = error;
401fbf4aa16Stron return false;
402fbf4aa16Stron }
403fbf4aa16Stron
404fbf4aa16Stron #endif
405