1 1.14 mrg /* $NetBSD: citrus_module.c,v 1.14 2024/06/09 18:55:00 mrg Exp $ */ 2 1.1 tshiozak 3 1.1 tshiozak /*- 4 1.1 tshiozak * Copyright (c)1999, 2000, 2001, 2002 Citrus Project, 5 1.1 tshiozak * All rights reserved. 6 1.1 tshiozak * 7 1.1 tshiozak * Redistribution and use in source and binary forms, with or without 8 1.1 tshiozak * modification, are permitted provided that the following conditions 9 1.1 tshiozak * are met: 10 1.1 tshiozak * 1. Redistributions of source code must retain the above copyright 11 1.1 tshiozak * notice, this list of conditions and the following disclaimer. 12 1.1 tshiozak * 2. Redistributions in binary form must reproduce the above copyright 13 1.1 tshiozak * notice, this list of conditions and the following disclaimer in the 14 1.1 tshiozak * documentation and/or other materials provided with the distribution. 15 1.1 tshiozak * 16 1.1 tshiozak * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 17 1.1 tshiozak * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 18 1.1 tshiozak * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 19 1.1 tshiozak * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 20 1.1 tshiozak * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 21 1.1 tshiozak * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 22 1.1 tshiozak * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 23 1.1 tshiozak * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 24 1.1 tshiozak * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 25 1.1 tshiozak * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 26 1.1 tshiozak * SUCH DAMAGE. 27 1.1 tshiozak */ 28 1.1 tshiozak 29 1.1 tshiozak /*- 30 1.1 tshiozak * Copyright (c) 1998 The NetBSD Foundation, Inc. 31 1.1 tshiozak * All rights reserved. 32 1.1 tshiozak * 33 1.1 tshiozak * This code is derived from software contributed to The NetBSD Foundation 34 1.1 tshiozak * by Paul Kranenburg. 35 1.1 tshiozak * 36 1.1 tshiozak * Redistribution and use in source and binary forms, with or without 37 1.1 tshiozak * modification, are permitted provided that the following conditions 38 1.1 tshiozak * are met: 39 1.1 tshiozak * 1. Redistributions of source code must retain the above copyright 40 1.1 tshiozak * notice, this list of conditions and the following disclaimer. 41 1.1 tshiozak * 2. Redistributions in binary form must reproduce the above copyright 42 1.1 tshiozak * notice, this list of conditions and the following disclaimer in the 43 1.1 tshiozak * documentation and/or other materials provided with the distribution. 44 1.1 tshiozak * 45 1.1 tshiozak * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 46 1.1 tshiozak * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 47 1.1 tshiozak * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 48 1.1 tshiozak * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 49 1.1 tshiozak * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 50 1.1 tshiozak * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 51 1.1 tshiozak * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 52 1.1 tshiozak * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 53 1.1 tshiozak * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 54 1.1 tshiozak * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 55 1.1 tshiozak * POSSIBILITY OF SUCH DAMAGE. 56 1.1 tshiozak */ 57 1.1 tshiozak 58 1.1 tshiozak /*- 59 1.1 tshiozak * Copyright (c) 1993 60 1.1 tshiozak * The Regents of the University of California. All rights reserved. 61 1.1 tshiozak * 62 1.1 tshiozak * This code is derived from software contributed to Berkeley by 63 1.1 tshiozak * Paul Borman at Krystal Technologies. 64 1.1 tshiozak * 65 1.1 tshiozak * Redistribution and use in source and binary forms, with or without 66 1.1 tshiozak * modification, are permitted provided that the following conditions 67 1.1 tshiozak * are met: 68 1.1 tshiozak * 1. Redistributions of source code must retain the above copyright 69 1.1 tshiozak * notice, this list of conditions and the following disclaimer. 70 1.1 tshiozak * 2. Redistributions in binary form must reproduce the above copyright 71 1.1 tshiozak * notice, this list of conditions and the following disclaimer in the 72 1.1 tshiozak * documentation and/or other materials provided with the distribution. 73 1.3 agc * 3. Neither the name of the University nor the names of its contributors 74 1.1 tshiozak * may be used to endorse or promote products derived from this software 75 1.1 tshiozak * without specific prior written permission. 76 1.1 tshiozak * 77 1.1 tshiozak * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 78 1.1 tshiozak * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 79 1.1 tshiozak * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 80 1.1 tshiozak * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 81 1.1 tshiozak * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 82 1.1 tshiozak * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 83 1.1 tshiozak * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 84 1.1 tshiozak * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 85 1.1 tshiozak * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 86 1.1 tshiozak * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 87 1.1 tshiozak * SUCH DAMAGE. 88 1.1 tshiozak */ 89 1.1 tshiozak 90 1.1 tshiozak #include <sys/cdefs.h> 91 1.1 tshiozak #if defined(LIBC_SCCS) && !defined(lint) 92 1.14 mrg __RCSID("$NetBSD: citrus_module.c,v 1.14 2024/06/09 18:55:00 mrg Exp $"); 93 1.1 tshiozak #endif /* LIBC_SCCS and not lint */ 94 1.1 tshiozak 95 1.13 kamil #include "namespace.h" 96 1.13 kamil 97 1.1 tshiozak #include <assert.h> 98 1.1 tshiozak #include <errno.h> 99 1.1 tshiozak #include <limits.h> 100 1.1 tshiozak #include <string.h> 101 1.1 tshiozak #include <stdio.h> 102 1.1 tshiozak #include <stdlib.h> 103 1.1 tshiozak #include <unistd.h> 104 1.1 tshiozak #include <stddef.h> 105 1.1 tshiozak #include <paths.h> 106 1.8 tnozaki #include "citrus_namespace.h" 107 1.8 tnozaki #include "citrus_bcs.h" 108 1.1 tshiozak #include "citrus_module.h" 109 1.1 tshiozak 110 1.1 tshiozak #include <sys/types.h> 111 1.1 tshiozak #include <dirent.h> 112 1.1 tshiozak #include <dlfcn.h> 113 1.1 tshiozak 114 1.1 tshiozak #ifdef _I18N_DYNAMIC 115 1.1 tshiozak 116 1.10 msaitoh static unsigned int _getdewey(int [], char *); 117 1.10 msaitoh static int _cmpndewey(int [], unsigned int, int [], unsigned int); 118 1.1 tshiozak static const char *_findshlib(char *, int *, int *); 119 1.1 tshiozak 120 1.5 christos static const char *_pathI18nModule = NULL; 121 1.1 tshiozak 122 1.1 tshiozak /* from libexec/ld.aout_so/shlib.c */ 123 1.1 tshiozak #undef major 124 1.1 tshiozak #undef minor 125 1.1 tshiozak #define MAXDEWEY 3 /*ELF*/ 126 1.1 tshiozak 127 1.10 msaitoh static unsigned int 128 1.1 tshiozak _getdewey(int dewey[], char *cp) 129 1.1 tshiozak { 130 1.10 msaitoh unsigned int i, n; 131 1.1 tshiozak 132 1.1 tshiozak _DIAGASSERT(dewey != NULL); 133 1.1 tshiozak _DIAGASSERT(cp != NULL); 134 1.1 tshiozak 135 1.1 tshiozak for (n = 0, i = 0; i < MAXDEWEY; i++) { 136 1.1 tshiozak if (*cp == '\0') 137 1.1 tshiozak break; 138 1.1 tshiozak 139 1.1 tshiozak if (*cp == '.') cp++; 140 1.1 tshiozak if (*cp < '0' || '9' < *cp) 141 1.1 tshiozak return 0; 142 1.1 tshiozak 143 1.8 tnozaki dewey[n++] = (int)_bcs_strtol(cp, &cp, 10); 144 1.1 tshiozak } 145 1.1 tshiozak 146 1.1 tshiozak return n; 147 1.1 tshiozak } 148 1.1 tshiozak 149 1.1 tshiozak /* 150 1.1 tshiozak * Compare two dewey arrays. 151 1.1 tshiozak * Return -1 if `d1' represents a smaller value than `d2'. 152 1.1 tshiozak * Return 1 if `d1' represents a greater value than `d2'. 153 1.1 tshiozak * Return 0 if equal. 154 1.1 tshiozak */ 155 1.1 tshiozak static int 156 1.10 msaitoh _cmpndewey(int d1[], unsigned int n1, int d2[], unsigned int n2) 157 1.1 tshiozak { 158 1.10 msaitoh register unsigned int i; 159 1.1 tshiozak 160 1.1 tshiozak _DIAGASSERT(d1 != NULL); 161 1.1 tshiozak _DIAGASSERT(d2 != NULL); 162 1.1 tshiozak 163 1.1 tshiozak for (i = 0; i < n1 && i < n2; i++) { 164 1.1 tshiozak if (d1[i] < d2[i]) 165 1.1 tshiozak return -1; 166 1.1 tshiozak if (d1[i] > d2[i]) 167 1.1 tshiozak return 1; 168 1.1 tshiozak } 169 1.1 tshiozak 170 1.1 tshiozak if (n1 == n2) 171 1.1 tshiozak return 0; 172 1.1 tshiozak 173 1.1 tshiozak if (i == n1) 174 1.1 tshiozak return -1; 175 1.1 tshiozak 176 1.1 tshiozak if (i == n2) 177 1.1 tshiozak return 1; 178 1.1 tshiozak 179 1.1 tshiozak /* XXX cannot happen */ 180 1.1 tshiozak return 0; 181 1.1 tshiozak } 182 1.1 tshiozak 183 1.1 tshiozak static const char * 184 1.1 tshiozak _findshlib(char *name, int *majorp, int *minorp) 185 1.1 tshiozak { 186 1.1 tshiozak int dewey[MAXDEWEY]; 187 1.10 msaitoh unsigned int ndewey; 188 1.1 tshiozak int tmp[MAXDEWEY]; 189 1.1 tshiozak int i; 190 1.1 tshiozak int len; 191 1.1 tshiozak char *lname; 192 1.1 tshiozak static char path[PATH_MAX]; 193 1.1 tshiozak int major, minor; 194 1.1 tshiozak const char *search_dirs[1]; 195 1.1 tshiozak const int n_search_dirs = 1; 196 1.1 tshiozak 197 1.1 tshiozak _DIAGASSERT(name != NULL); 198 1.1 tshiozak _DIAGASSERT(majorp != NULL); 199 1.1 tshiozak _DIAGASSERT(minorp != NULL); 200 1.1 tshiozak 201 1.1 tshiozak major = *majorp; 202 1.1 tshiozak minor = *minorp; 203 1.1 tshiozak path[0] = '\0'; 204 1.1 tshiozak search_dirs[0] = _pathI18nModule; 205 1.1 tshiozak len = strlen(name); 206 1.1 tshiozak lname = name; 207 1.1 tshiozak 208 1.1 tshiozak ndewey = 0; 209 1.1 tshiozak 210 1.1 tshiozak for (i = 0; i < n_search_dirs; i++) { 211 1.1 tshiozak DIR *dd = opendir(search_dirs[i]); 212 1.1 tshiozak struct dirent *dp; 213 1.1 tshiozak int found_dot_a = 0; 214 1.1 tshiozak int found_dot_so = 0; 215 1.1 tshiozak 216 1.1 tshiozak if (dd == NULL) 217 1.1 tshiozak continue; 218 1.1 tshiozak 219 1.1 tshiozak while ((dp = readdir(dd)) != NULL) { 220 1.10 msaitoh unsigned int n; 221 1.1 tshiozak 222 1.1 tshiozak if (dp->d_namlen < len + 4) 223 1.1 tshiozak continue; 224 1.1 tshiozak if (strncmp(dp->d_name, lname, (size_t)len) != 0) 225 1.1 tshiozak continue; 226 1.1 tshiozak if (strncmp(dp->d_name+len, ".so.", 4) != 0) 227 1.1 tshiozak continue; 228 1.1 tshiozak 229 1.1 tshiozak if ((n = _getdewey(tmp, dp->d_name+len+4)) == 0) 230 1.1 tshiozak continue; 231 1.1 tshiozak 232 1.1 tshiozak if (major != -1 && found_dot_a) 233 1.1 tshiozak found_dot_a = 0; 234 1.1 tshiozak 235 1.1 tshiozak /* XXX should verify the library is a.out/ELF? */ 236 1.1 tshiozak 237 1.1 tshiozak if (major == -1 && minor == -1) { 238 1.1 tshiozak goto compare_version; 239 1.1 tshiozak } else if (major != -1 && minor == -1) { 240 1.1 tshiozak if (tmp[0] == major) 241 1.1 tshiozak goto compare_version; 242 1.1 tshiozak } else if (major != -1 && minor != -1) { 243 1.1 tshiozak if (tmp[0] == major) { 244 1.1 tshiozak if (n == 1 || tmp[1] >= minor) 245 1.1 tshiozak goto compare_version; 246 1.1 tshiozak } 247 1.1 tshiozak } 248 1.1 tshiozak 249 1.1 tshiozak /* else, this file does not qualify */ 250 1.1 tshiozak continue; 251 1.1 tshiozak 252 1.1 tshiozak compare_version: 253 1.1 tshiozak if (_cmpndewey(tmp, n, dewey, ndewey) <= 0) 254 1.1 tshiozak continue; 255 1.1 tshiozak 256 1.1 tshiozak /* We have a better version */ 257 1.1 tshiozak found_dot_so = 1; 258 1.1 tshiozak snprintf(path, sizeof(path), "%s/%s", search_dirs[i], 259 1.1 tshiozak dp->d_name); 260 1.1 tshiozak found_dot_a = 0; 261 1.1 tshiozak bcopy(tmp, dewey, sizeof(dewey)); 262 1.1 tshiozak ndewey = n; 263 1.1 tshiozak *majorp = dewey[0]; 264 1.1 tshiozak *minorp = dewey[1]; 265 1.1 tshiozak } 266 1.1 tshiozak closedir(dd); 267 1.1 tshiozak 268 1.1 tshiozak if (found_dot_a || found_dot_so) 269 1.1 tshiozak /* 270 1.1 tshiozak * There's a lib in this dir; take it. 271 1.1 tshiozak */ 272 1.1 tshiozak return path[0] ? path : NULL; 273 1.1 tshiozak } 274 1.1 tshiozak 275 1.1 tshiozak return path[0] ? path : NULL; 276 1.1 tshiozak } 277 1.1 tshiozak 278 1.14 mrg #ifdef __m68k__ /* See doc/HACKS. */ 279 1.14 mrg __attribute((__optimize__("-fno-stack-protector"))) 280 1.14 mrg #endif 281 1.1 tshiozak void * 282 1.1 tshiozak _citrus_find_getops(_citrus_module_t handle, const char *modname, 283 1.1 tshiozak const char *ifname) 284 1.1 tshiozak { 285 1.1 tshiozak char name[PATH_MAX]; 286 1.1 tshiozak void *p; 287 1.1 tshiozak 288 1.1 tshiozak _DIAGASSERT(handle != NULL); 289 1.1 tshiozak _DIAGASSERT(modname != NULL); 290 1.1 tshiozak _DIAGASSERT(ifname != NULL); 291 1.1 tshiozak 292 1.4 yamt snprintf(name, sizeof(name), _C_LABEL_STRING("_citrus_%s_%s_getops"), 293 1.4 yamt modname, ifname); 294 1.1 tshiozak p = dlsym((void *)handle, name); 295 1.1 tshiozak return p; 296 1.1 tshiozak } 297 1.1 tshiozak 298 1.1 tshiozak int 299 1.1 tshiozak _citrus_load_module(_citrus_module_t *rhandle, const char *encname) 300 1.1 tshiozak { 301 1.1 tshiozak const char *p; 302 1.1 tshiozak char path[PATH_MAX]; 303 1.1 tshiozak int maj, min; 304 1.1 tshiozak void *handle; 305 1.1 tshiozak 306 1.1 tshiozak _DIAGASSERT(rhandle != NULL); 307 1.1 tshiozak 308 1.1 tshiozak if (_pathI18nModule == NULL) { 309 1.1 tshiozak p = getenv("PATH_I18NMODULE"); 310 1.11 christos if (p == NULL || issetugid()) { 311 1.11 christos _pathI18nModule = _PATH_I18NMODULE; 312 1.11 christos #ifdef MLIBDIR 313 1.11 christos p = strrchr(_pathI18nModule, '/'); 314 1.12 joerg if (p != NULL) { 315 1.11 christos snprintf(path, sizeof(path), "%.*s/%s/%s", 316 1.11 christos (int)(p - _pathI18nModule), 317 1.11 christos _pathI18nModule, MLIBDIR, p + 1); 318 1.11 christos p = path; 319 1.11 christos } else 320 1.11 christos p = NULL; 321 1.11 christos #endif 322 1.11 christos } 323 1.11 christos if (p != NULL) { 324 1.1 tshiozak _pathI18nModule = strdup(p); 325 1.1 tshiozak if (_pathI18nModule == NULL) 326 1.1 tshiozak return ENOMEM; 327 1.11 christos } 328 1.1 tshiozak } 329 1.1 tshiozak 330 1.1 tshiozak (void)snprintf(path, sizeof(path), "lib%s", encname); 331 1.1 tshiozak maj = I18NMODULE_MAJOR; 332 1.1 tshiozak min = -1; 333 1.1 tshiozak p = _findshlib(path, &maj, &min); 334 1.1 tshiozak if (!p) 335 1.1 tshiozak return (EINVAL); 336 1.1 tshiozak handle = dlopen(p, RTLD_LAZY); 337 1.1 tshiozak if (!handle) 338 1.1 tshiozak return (EINVAL); 339 1.1 tshiozak 340 1.1 tshiozak *rhandle = (_citrus_module_t)handle; 341 1.1 tshiozak 342 1.1 tshiozak return (0); 343 1.1 tshiozak } 344 1.1 tshiozak 345 1.1 tshiozak void 346 1.1 tshiozak _citrus_unload_module(_citrus_module_t handle) 347 1.1 tshiozak { 348 1.1 tshiozak if (handle) 349 1.1 tshiozak dlclose((void *)handle); 350 1.1 tshiozak } 351 1.1 tshiozak #else 352 1.1 tshiozak /* !_I18N_DYNAMIC */ 353 1.1 tshiozak 354 1.1 tshiozak void * 355 1.1 tshiozak /*ARGSUSED*/ 356 1.1 tshiozak _citrus_find_getops(_citrus_module_t handle, const char *modname, 357 1.1 tshiozak const char *ifname) 358 1.1 tshiozak { 359 1.1 tshiozak return (NULL); 360 1.1 tshiozak } 361 1.1 tshiozak 362 1.1 tshiozak int 363 1.1 tshiozak /*ARGSUSED*/ 364 1.1 tshiozak _citrus_load_module(_citrus_module_t *rhandle, char const *modname) 365 1.1 tshiozak { 366 1.1 tshiozak return (EINVAL); 367 1.1 tshiozak } 368 1.1 tshiozak 369 1.1 tshiozak void 370 1.1 tshiozak /*ARGSUSED*/ 371 1.1 tshiozak _citrus_unload_module(_citrus_module_t handle) 372 1.1 tshiozak { 373 1.1 tshiozak } 374 1.1 tshiozak #endif 375