1 /* 2 * CDDL HEADER START 3 * 4 * The contents of this file are subject to the terms of the 5 * Common Development and Distribution License (the "License"). 6 * You may not use this file except in compliance with the License. 7 * 8 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE 9 * or http://www.opensolaris.org/os/licensing. 10 * See the License for the specific language governing permissions 11 * and limitations under the License. 12 * 13 * When distributing Covered Code, include this CDDL HEADER in each 14 * file and include the License file at usr/src/OPENSOLARIS.LICENSE. 15 * If applicable, add the following below this CDDL HEADER, with the 16 * fields enclosed by brackets "[]" replaced with your own identifying 17 * information: Portions Copyright [yyyy] [name of copyright owner] 18 * 19 * CDDL HEADER END 20 */ 21 22 /* 23 * Copyright 2007 Sun Microsystems, Inc. All rights reserved. 24 * Use is subject to license terms. 25 */ 26 #pragma ident "%Z%%M% %I% %E% SMI" 27 28 #include "_synonyms.h" 29 30 #include <sys/types.h> 31 #include <sys/mman.h> 32 #include <dirent.h> 33 #include <stdio.h> 34 #include <stdlib.h> 35 #include <string.h> 36 #include <limits.h> 37 #include <debug.h> 38 #include <conv.h> 39 #include "_rtld.h" 40 #include "_audit.h" 41 #include "msg.h" 42 43 /* 44 * qsort(3c) comparison function. 45 */ 46 static int 47 compare(const void *fdesc1, const void *fdesc2) 48 { 49 ulong_t hwcap1 = ((Fdesc *)fdesc1)->fd_fmap.fm_hwptr; 50 ulong_t hwcap2 = ((Fdesc *)fdesc2)->fd_fmap.fm_hwptr; 51 52 if (hwcap1 && (hwcap2 == 0)) 53 return (-1); 54 if ((hwcap1 == 0) && hwcap2) 55 return (1); 56 if ((hwcap1 == 0) && (hwcap2 == 0)) 57 return (0); 58 59 if (hwcap1 > hwcap2) 60 return (-1); 61 if (hwcap1 < hwcap2) 62 return (1); 63 return (0); 64 } 65 66 /* 67 * If this object defines a set of hardware capability requirements, insure the 68 * kernal can cope with them. 69 */ 70 int 71 hwcap_check(Rej_desc *rej, Ehdr *ehdr) 72 { 73 Cap *cptr; 74 Phdr *phdr; 75 int cnt; 76 77 /* LINTED */ 78 phdr = (Phdr *)((char *)ehdr + ehdr->e_phoff); 79 for (cnt = 0; cnt < ehdr->e_phnum; cnt++, phdr++) { 80 Lword val; 81 82 if (phdr->p_type != PT_SUNWCAP) 83 continue; 84 85 /* LINTED */ 86 cptr = (Cap *)((char *)ehdr + phdr->p_offset); 87 while (cptr->c_tag != CA_SUNW_NULL) { 88 if (cptr->c_tag == CA_SUNW_HW_1) 89 break; 90 cptr++; 91 } 92 if (cptr->c_tag == CA_SUNW_NULL) 93 break; 94 95 if ((val = (cptr->c_un.c_val & ~hwcap)) != 0) { 96 static Conv_cap_val_hw1_buf_t cap_buf; 97 98 rej->rej_type = SGS_REJ_HWCAP_1; 99 rej->rej_str = conv_cap_val_hw1(val, M_MACH, &cap_buf); 100 return (0); 101 } 102 103 /* 104 * Retain this hardware capabilities pointer for possible later 105 * inspection should this object be processed as a filtee. 106 */ 107 fmap->fm_hwptr = cptr->c_un.c_val; 108 } 109 return (1); 110 } 111 112 static void 113 remove_fdesc(Fdesc *fdp) 114 { 115 #if defined(MAP_ALIGN) 116 if (fdp->fd_fmap.fm_maddr && 117 ((fdp->fd_fmap.fm_mflags & MAP_ALIGN) == 0)) { 118 #else 119 if (fdp->fd_fmap.fm_maddr) { 120 #endif 121 (void) munmap(fdp->fd_fmap.fm_maddr, fdp->fd_fmap.fm_msize); 122 123 /* 124 * Note, this file descriptor might be duplicating information 125 * from the global fmap descriptor. If so, clean up the global 126 * descriptor to prevent a duplicate (unnecessary) unmap. 127 */ 128 if (fmap->fm_maddr == fdp->fd_fmap.fm_maddr) { 129 fmap->fm_maddr = 0; 130 fmap_setup(); 131 } 132 } 133 if (fdp->fd_fd) 134 (void) close(fdp->fd_fd); 135 if (fdp->fd_pname && (fdp->fd_pname != fdp->fd_nname)) 136 free((void *)fdp->fd_pname); 137 if (fdp->fd_nname) 138 free((void *)fdp->fd_nname); 139 } 140 141 /* 142 * When $HWCAP is used to represent dependencies, take the associated directory 143 * and analyze all the files it contains. 144 */ 145 int 146 hwcap_dir(Alist **fdalpp, Lm_list *lml, const char *name, Rt_map *clmp, 147 uint_t flags, Rej_desc *rej) 148 { 149 char path[PATH_MAX], *dst; 150 const char *src; 151 DIR *dir; 152 struct dirent *dirent; 153 Aliste off; 154 Alist *fdalp = 0; 155 Fdesc *fdp; 156 int error = 0; 157 158 /* 159 * Access the directory in preparation for reading its entries. If 160 * successful, establish the initial pathname. 161 */ 162 if ((dir = opendir(name)) == 0) { 163 Rej_desc _rej = { 0 }; 164 165 _rej.rej_type = SGS_REJ_STR; 166 _rej.rej_name = name; 167 _rej.rej_str = strerror(errno); 168 DBG_CALL(Dbg_file_rejected(lml, &_rej)); 169 rejection_inherit(rej, &_rej); 170 return (0); 171 } 172 173 for (dst = path, src = name; *src; dst++, src++) 174 *dst = *src; 175 *dst++ = '/'; 176 177 /* 178 * Read each entry from the directory and determine whether it is a 179 * valid ELF file. 180 */ 181 while ((dirent = readdir(dir)) != NULL) { 182 const char *file = dirent->d_name, *oname; 183 char *_dst; 184 Fdesc fdesc = { 0 }; 185 Rej_desc _rej = { 0 }; 186 187 /* 188 * Ignore "." and ".." entries. 189 */ 190 if ((file[0] == '.') && ((file[1] == '\0') || 191 ((file[1] == '.') && (file[2] == '\0')))) 192 continue; 193 194 /* 195 * Complete the full pathname, and verify its usability. Note, 196 * an auditor can supply an alternative name. 197 */ 198 for (_dst = dst, src = file, file = dst; *src; _dst++, src++) 199 *_dst = *src; 200 *_dst = '\0'; 201 202 if ((oname = strdup(path)) == NULL) { 203 error = 1; 204 break; 205 } 206 207 if (load_trace(lml, &oname, clmp) == 0) { 208 free((void *)oname); 209 continue; 210 } 211 name = oname; 212 213 /* 214 * Note, all directory entries are processed by find_path(), 215 * even entries that are directories themselves. This single 216 * point for control keeps the number of stat()'s down, and 217 * provides a single point for error diagnostics. 218 */ 219 if (find_path(lml, name, clmp, flags, &fdesc, &_rej) == 0) { 220 rejection_inherit(rej, &_rej); 221 if ((rej->rej_name != _rej.rej_name) && 222 (_rej.rej_name == name)) 223 free((void *)name); 224 continue; 225 } 226 227 DBG_CALL(Dbg_cap_hw_candidate(lml, name)); 228 229 /* 230 * If this object has already been loaded, obtain the hardware 231 * capabilities for later sorting. Otherwise we have a new 232 * candidate. 233 */ 234 if (fdesc.fd_lmp) 235 fdesc.fd_fmap.fm_hwptr = HWCAP(fdesc.fd_lmp); 236 else 237 fdesc.fd_fmap = *fmap; 238 239 if (alist_append(&fdalp, &fdesc, sizeof (Fdesc), 10) == 0) { 240 remove_fdesc(&fdesc); 241 error = 1; 242 break; 243 } 244 245 /* 246 * Clear the global file mapping structure so that the mapping 247 * for this file won't be overriden. 248 */ 249 fmap->fm_mflags = MAP_PRIVATE; 250 fmap->fm_maddr = 0; 251 fmap->fm_msize = FMAP_SIZE; 252 fmap->fm_hwptr = 0; 253 } 254 (void) closedir(dir); 255 256 /* 257 * If no objects have been found, we're done. Also, if an allocation 258 * error occurred while processing any object, remove any objects that 259 * had already been added to the list and return. 260 */ 261 if ((fdalp == 0) || error) { 262 if (fdalp) { 263 for (ALIST_TRAVERSE(fdalp, off, fdp)) 264 remove_fdesc(fdp); 265 free(fdalp); 266 } 267 return (0); 268 } 269 270 /* 271 * Having processed and retained all candidates from this directory, 272 * sort them, based on the precedence of their hardware capabilities. 273 */ 274 qsort(&(fdalp->al_data[0]), ((fdalp->al_next - (sizeof (Alist) - 275 sizeof (void *))) / fdalp->al_size), fdalp->al_size, compare); 276 277 *fdalpp = fdalp; 278 return (1); 279 } 280 281 static Pnode * 282 _hwcap_filtees(Pnode **pnpp, Aliste nlmco, Lm_cntl *nlmc, Rt_map *flmp, 283 const char *ref, const char *dir, int mode, uint_t flags) 284 { 285 Alist *fdalp = 0; 286 Aliste off; 287 Pnode *fpnp = 0, *lpnp, *npnp = (*pnpp)->p_next; 288 Fdesc *fdp; 289 Lm_list *lml = LIST(flmp); 290 int unused = 0; 291 Rej_desc rej = { 0 }; 292 293 if (hwcap_dir(&fdalp, lml, dir, flmp, flags, &rej) == 0) { 294 remove_rej(&rej); 295 return (0); 296 } 297 298 /* 299 * Now complete the mapping of each of the ordered objects, adding 300 * each object to a new Pnode. 301 */ 302 for (ALIST_TRAVERSE(fdalp, off, fdp)) { 303 Rt_map *nlmp; 304 Grp_hdl *ghp = 0; 305 Pnode *pnp; 306 int audit = 0; 307 308 if (unused) { 309 /* 310 * Flush out objects remaining. 311 */ 312 remove_fdesc(fdp); 313 continue; 314 } 315 316 /* 317 * Complete mapping the file, obtaining a handle, and continue 318 * to analyze the object, establishing dependencies and 319 * relocating. Remove the file descriptor at this point, as it 320 * is no longer required. 321 */ 322 DBG_CALL(Dbg_file_filtee(lml, NAME(flmp), fdp->fd_nname, 0)); 323 324 nlmp = load_path(lml, nlmco, &fdp->fd_nname, flmp, mode, 325 (flags | FLG_RT_HANDLE), &ghp, fdp, &rej); 326 remove_fdesc(fdp); 327 if (nlmp == 0) 328 continue; 329 330 /* 331 * Create a new Pnode to represent this filtee, and substitute 332 * the calling Pnode (which was used to represent the hardware 333 * capability directory). 334 */ 335 if ((pnp = calloc(1, sizeof (Pnode))) == 0) { 336 if (ghp) { 337 remove_lmc(lml, flmp, nlmc, nlmco, 338 fdp->fd_nname); 339 } 340 return (0); 341 } 342 if ((pnp->p_name = strdup(NAME(nlmp))) == NULL) { 343 if (ghp) { 344 remove_lmc(lml, flmp, nlmc, nlmco, 345 fdp->fd_nname); 346 } 347 free(pnp); 348 return (0); 349 } 350 pnp->p_len = strlen(NAME(nlmp)); 351 pnp->p_info = (void *)ghp; 352 pnp->p_next = npnp; 353 354 if (fpnp == 0) { 355 Pnode *opnp = (*pnpp); 356 357 /* 358 * If this is the first pnode, reuse the original after 359 * freeing any of its pathnames. 360 */ 361 if (opnp->p_name) 362 free((void *)opnp->p_name); 363 if (opnp->p_oname) 364 free((void *)opnp->p_oname); 365 *opnp = *pnp; 366 free((void *)pnp); 367 fpnp = lpnp = pnp = opnp; 368 } else { 369 lpnp->p_next = pnp; 370 lpnp = pnp; 371 } 372 373 /* 374 * Establish the filter handle to prevent any recursion. 375 */ 376 if (nlmp && ghp) { 377 ghp->gh_flags |= GPH_FILTEE; 378 pnp->p_info = (void *)ghp; 379 } 380 381 /* 382 * Audit the filter/filtee established. A return of 0 383 * indicates the auditor wishes to ignore this filtee. 384 */ 385 if (nlmp && (lml->lm_tflags | FLAGS1(flmp)) & 386 LML_TFLG_AUD_OBJFILTER) { 387 if (audit_objfilter(flmp, ref, nlmp, 0) == 0) { 388 audit = 1; 389 nlmp = 0; 390 } 391 } 392 393 /* 394 * Finish processing the objects associated with this request. 395 */ 396 if (nlmp && ghp && ((analyze_lmc(lml, nlmco, nlmp) == 0) || 397 (relocate_lmc(lml, nlmco, flmp, nlmp) == 0))) 398 nlmp = 0; 399 400 /* 401 * If the filtee has been successfully processed, then create 402 * an association between the filter and the filtee. This 403 * association provides sufficient information to tear down the 404 * filter and filtee if necessary. 405 */ 406 DBG_CALL(Dbg_file_hdl_title(DBG_DEP_ADD)); 407 if (nlmp && ghp && (hdl_add(ghp, flmp, GPD_FILTER) == 0)) 408 nlmp = 0; 409 410 /* 411 * If this object is marked an end-filtee, we're done. 412 */ 413 if (nlmp && ghp && (FLAGS1(nlmp) & FL1_RT_ENDFILTE)) 414 unused = 1; 415 416 /* 417 * If this filtee loading has failed, generate a diagnostic. 418 * Null out the pnode entry, and continue the search. 419 */ 420 if (nlmp == 0) { 421 /* 422 * If attempting to load this filtee required a new 423 * link-map control list to which this request has 424 * added objects, then remove all the objects that 425 * have been associated to this request. 426 */ 427 if (nlmc && nlmc->lc_head) 428 remove_lmc(lml, flmp, nlmc, nlmco, pnp->p_name); 429 430 DBG_CALL(Dbg_file_filtee(lml, 0, pnp->p_name, audit)); 431 432 pnp->p_len = 0; 433 pnp->p_info = 0; 434 } 435 } 436 437 free(fdalp); 438 return (fpnp); 439 } 440 441 Pnode * 442 hwcap_filtees(Pnode **pnpp, Aliste nlmco, Lm_cntl *nlmc, Dyninfo *dip, 443 Rt_map *flmp, const char *ref, int mode, uint_t flags) 444 { 445 Pnode *pnp = *pnpp; 446 const char *dir = pnp->p_name; 447 Lm_list *flml = LIST(flmp); 448 449 DBG_CALL(Dbg_cap_hw_filter(flml, dir, flmp)); 450 451 if ((pnp = _hwcap_filtees(pnpp, nlmco, nlmc, flmp, ref, dir, mode, 452 flags)) != 0) 453 return (pnp); 454 455 /* 456 * If no hardware capability filtees have been found, provide suitable 457 * diagnostics and mark the incoming Pnode as unused. 458 */ 459 if ((flml->lm_flags & LML_FLG_TRC_ENABLE) && 460 (dip->di_flags & FLG_DI_AUXFLTR) && (rtld_flags & RT_FL_WARNFLTR)) 461 (void) printf(MSG_INTL(MSG_LDD_HWCAP_NFOUND), dir); 462 463 DBG_CALL(Dbg_cap_hw_filter(flml, dir, 0)); 464 465 pnp = *pnpp; 466 pnp->p_len = 0; 467 return (pnp); 468 } 469 470 /* 471 * Load an individual hardware capabilities object. 472 */ 473 Rt_map * 474 load_hwcap(Lm_list *lml, Aliste lmco, const char *dir, Rt_map *clmp, 475 uint_t mode, uint_t flags, Grp_hdl **hdl, Rej_desc *rej) 476 { 477 Alist *fdalp = 0; 478 Aliste off; 479 Fdesc *fdp; 480 int found = 0; 481 Rt_map *lmp = 0; 482 483 /* 484 * Obtain the sorted list of hardware capabilites objects available. 485 */ 486 if (hwcap_dir(&fdalp, lml, dir, clmp, flags, rej) == 0) 487 return (0); 488 489 /* 490 * From the list of hardware capability objects, use the first and 491 * discard the rest. 492 */ 493 for (ALIST_TRAVERSE(fdalp, off, fdp)) { 494 if ((found == 0) && ((lmp = load_path(lml, lmco, &fdp->fd_nname, 495 clmp, mode, flags, hdl, fdp, rej)) != 0)) 496 found++; 497 498 /* 499 * Remove the used file descriptor and any objects remaining. 500 */ 501 remove_fdesc(fdp); 502 } 503 504 free(fdalp); 505 return (lmp); 506 } 507