elf/cache.c

   1 /* Copyright (C) 1999,2000,2001,2002,2003,2005
   2         Free Software Foundation, Inc.
   3    This file is part of the GNU C Library.
   4    Contributed by Andreas Jaeger <aj@suse.de>, 1999.
   5
   6    This program is free software; you can redistribute it and/or modify
   7    it under the terms of the GNU General Public License version 2 as
   8    published by the Free Software Foundation.
   9
  10    This program is distributed in the hope that it will be useful,
  11    but WITHOUT ANY WARRANTY; without even the implied warranty of
  12    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  13    GNU General Public License for more details.
  14
  15    You should have received a copy of the GNU General Public License
  16    along with this program; if not, write to the Free Software Foundation,
  17    Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.  */
  18
  19 #include <errno.h>
  20 #include <error.h>
  21 #include <dirent.h>
  22 #include <inttypes.h>
  23 #include <libintl.h>
  24 #include <stdio.h>
  25 #include <stdlib.h>
  26 #include <string.h>
  27 #include <unistd.h>
  28 #include <sys/fcntl.h>
  29 #include <sys/mman.h>
  30 #include <sys/stat.h>
  31 #include <sys/types.h>
  32
  33 #include "ldconfig.h"
  34 #include "dl-cache.h"
  35
  36 struct cache_entry
  37 {
  38   char *lib;                    /* Library name.  */
  39   char *path;                   /* Path to find library.  */
  40   int flags;                    /* Flags to indicate kind of library.  */
  41   unsigned int osversion;       /* Required OS version.  */
  42   uint64_t hwcap;               /* Important hardware capabilities.  */
  43   int bits_hwcap;               /* Number of bits set in hwcap.  */
  44   struct cache_entry *next;     /* Next entry in list.  */
  45 };
  46
  47 /* List of all cache entries.  */
  48 static struct cache_entry *entries;
  49
  50 static const char *flag_descr[] =
  51 { "libc4", "ELF", "libc5", "libc6"};
  52
  53 /* Print a single entry.  */
  54 static void
  55 print_entry (const char *lib, int flag, unsigned int osversion,
  56              uint64_t hwcap, const char *key)
  57 {
  58   printf ("\t%s (", lib);
  59   switch (flag & FLAG_TYPE_MASK)
  60     {
  61     case FLAG_LIBC4:
  62     case FLAG_ELF:
  63     case FLAG_ELF_LIBC5:
  64     case FLAG_ELF_LIBC6:
  65       fputs (flag_descr[flag & FLAG_TYPE_MASK], stdout);
  66       break;
  67     default:
  68       fputs (_("unknown"), stdout);
  69       break;
  70     }
  71   switch (flag & FLAG_REQUIRED_MASK)
  72     {
  73     case FLAG_SPARC_LIB64:
  74       fputs (",64bit", stdout);
  75       break;
  76     case FLAG_IA64_LIB64:
  77       fputs (",IA-64", stdout);
  78       break;
  79     case FLAG_X8664_LIB64:
  80       fputs (",x86-64", stdout);
  81       break;
  82     case FLAG_S390_LIB64:
  83       fputs(",64bit", stdout);
  84       break;
  85     case FLAG_POWERPC_LIB64:
  86       fputs(",64bit", stdout);
  87       break;
  88     case FLAG_MIPS64_LIBN32:
  89       fputs(",N32", stdout);
  90       break;
  91     case FLAG_MIPS64_LIBN64:
  92       fputs(",64bit", stdout);
  93     case 0:
  94       break;
  95     default:
  96       printf (",%d", flag & FLAG_REQUIRED_MASK);
  97       break;
  98     }
  99   if (hwcap != 0)
 100     printf (", hwcap: %#.16" PRIx64, hwcap);
 101   if (osversion != 0)
 102     {
 103       static const char *const abi_tag_os[] =
 104       {
 105         [0] = "Linux",
 106         [1] = "Hurd",
 107         [2] = "Solaris",
 108         [3] = "FreeBSD",
 109         [4] = "kNetBSD",
 110         [5] = N_("Unknown OS")
 111       };
 112 #define MAXTAG (sizeof abi_tag_os / sizeof abi_tag_os[0] - 1)
 113       unsigned int os = osversion >> 24;
 114
 115       printf (_(", OS ABI: %s %d.%d.%d"),
 116               _(abi_tag_os[os > MAXTAG ? MAXTAG : os]),
 117               (osversion >> 16) & 0xff,
 118               (osversion >> 8) & 0xff,
 119               osversion & 0xff);
 120     }
 121   printf (") => %s\n", key);
 122 }
 123
 124
 125 /* Print the whole cache file, if a file contains the new cache format
 126    hidden in the old one, print the contents of the new format.  */
 127 void
 128 print_cache (const char *cache_name)
 129 {
 130   size_t cache_size;
 131   struct stat64 st;
 132   int fd;
 133   unsigned int i;
 134   struct cache_file *cache;
 135   struct cache_file_new *cache_new = NULL;
 136   const char *cache_data;
 137   int format = 0;
 138
 139   fd = open (cache_name, O_RDONLY);
 140   if (fd < 0)
 141     error (EXIT_FAILURE, errno, _("Can't open cache file %s\n"), cache_name);
 142
 143   if (fstat64 (fd, &st) < 0
 144       /* No need to map the file if it is empty.  */
 145       || st.st_size == 0)
 146     {
 147       close (fd);
 148       return;
 149     }
 150
 151   cache = mmap (0, st.st_size, PROT_READ, MAP_SHARED, fd, 0);
 152   if (cache == MAP_FAILED)
 153     error (EXIT_FAILURE, errno, _("mmap of cache file failed.\n"));
 154   cache_size = st.st_size;
 155
 156   if (cache_size < sizeof (struct cache_file))
 157     error (EXIT_FAILURE, 0, _("File is not a cache file.\n"));
 158
 159   if (memcmp (cache->magic, CACHEMAGIC, sizeof CACHEMAGIC - 1))
 160     {
 161       /* This can only be the new format without the old one.  */
 162       cache_new = (struct cache_file_new *) cache;
 163
 164       if (memcmp (cache_new->magic, CACHEMAGIC_NEW, sizeof CACHEMAGIC_NEW - 1)
 165           || memcmp (cache_new->version, CACHE_VERSION,
 166                       sizeof CACHE_VERSION - 1))
 167         error (EXIT_FAILURE, 0, _("File is not a cache file.\n"));
 168       format = 1;
 169       /* This is where the strings start.  */
 170       cache_data = (const char *) cache_new;
 171     }
 172   else
 173     {
 174       size_t offset = ALIGN_CACHE (sizeof (struct cache_file)
 175                                    + (cache->nlibs
 176                                       * sizeof (struct file_entry)));
 177       /* This is where the strings start.  */
 178       cache_data = (const char *) &cache->libs[cache->nlibs];
 179
 180       /* Check for a new cache embedded in the old format.  */
 181       if (cache_size >
 182           (offset + sizeof (struct cache_file_new)))
 183         {
 184
 185           cache_new = (struct cache_file_new *) ((void *)cache + offset);
 186
 187           if (memcmp (cache_new->magic, CACHEMAGIC_NEW,
 188                       sizeof CACHEMAGIC_NEW - 1) == 0
 189               && memcmp (cache_new->version, CACHE_VERSION,
 190                          sizeof CACHE_VERSION - 1) == 0)
 191             {
 192               cache_data = (const char *) cache_new;
 193               format = 1;
 194             }
 195         }
 196     }
 197
 198   if (format == 0)
 199     {
 200       printf (_("%d libs found in cache `%s'\n"), cache->nlibs, cache_name);
 201
 202       /* Print everything.  */
 203       for (i = 0; i < cache->nlibs; i++)
 204         print_entry (cache_data + cache->libs[i].key,
 205                      cache->libs[i].flags, 0, 0,
 206                      cache_data + cache->libs[i].value);
 207     }
 208   else if (format == 1)
 209     {
 210       printf (_("%d libs found in cache `%s'\n"),
 211               cache_new->nlibs, cache_name);
 212
 213       /* Print everything.  */
 214       for (i = 0; i < cache_new->nlibs; i++)
 215         print_entry (cache_data + cache_new->libs[i].key,
 216                      cache_new->libs[i].flags,
 217                      cache_new->libs[i].osversion,
 218                      cache_new->libs[i].hwcap,
 219                      cache_data + cache_new->libs[i].value);
 220     }
 221   /* Cleanup.  */
 222   munmap (cache, cache_size);
 223   close (fd);
 224 }
 225
 226 /* Initialize cache data structures.  */
 227 void
 228 init_cache (void)
 229 {
 230   entries = NULL;
 231 }
 232
 233
 234
 235 static
 236 int compare (const struct cache_entry *e1, const struct cache_entry *e2)
 237 {
 238   int res;
 239
 240   /* We need to swap entries here to get the correct sort order.  */
 241   res = _dl_cache_libcmp (e2->lib, e1->lib);
 242   if (res == 0)
 243     {
 244       if (e1->flags < e2->flags)
 245         return 1;
 246       else if (e1->flags > e2->flags)
 247         return -1;
 248       /* Sort by most specific hwcap.  */
 249       else if (e2->bits_hwcap > e1->bits_hwcap)
 250         return 1;
 251       else if (e2->bits_hwcap < e1->bits_hwcap)
 252         return -1;
 253       else if (e2->hwcap > e1->hwcap)
 254         return 1;
 255       else if (e2->hwcap < e1->hwcap)
 256         return -1;
 257       if (e2->osversion > e1->osversion)
 258         return 1;
 259       if (e2->osversion < e1->osversion)
 260         return -1;
 261     }
 262   return res;
 263 }
 264
 265 /* Save the contents of the cache.  */
 266 void
 267 save_cache (const char *cache_name)
 268 {
 269   struct cache_entry *entry;
 270   int fd, idx_old, idx_new;
 271   size_t total_strlen, len;
 272   char *strings, *str, *temp_name;
 273   struct cache_file *file_entries = NULL;
 274   struct cache_file_new *file_entries_new = NULL;
 275   size_t file_entries_size = 0;
 276   size_t file_entries_new_size = 0;
 277   unsigned int str_offset;
 278   /* Number of cache entries.  */
 279   int cache_entry_count = 0;
 280   /* Number of normal cache entries.  */
 281   int cache_entry_old_count = 0;
 282   /* Pad for alignment of cache_file_new.  */
 283   size_t pad;
 284
 285   /* The cache entries are sorted already, save them in this order. */
 286
 287   /* Count the length of all strings.  */
 288   /* The old format doesn't contain hwcap entries and doesn't contain
 289      libraries in subdirectories with hwcaps entries.  Count therefore
 290      also all entries with hwcap == 0.  */
 291   total_strlen = 0;
 292   for (entry = entries; entry != NULL; entry = entry->next)
 293     {
 294       /* Account the final NULs.  */
 295       total_strlen += strlen (entry->lib) + strlen (entry->path) + 2;
 296       ++cache_entry_count;
 297       if (entry->hwcap == 0)
 298         ++cache_entry_old_count;
 299     }
 300
 301   /* Create the on disk cache structure.  */
 302   /* First an array for all strings.  */
 303   strings = (char *)xmalloc (total_strlen);
 304
 305   if (opt_format != 2)
 306     {
 307       /* struct cache_file_new is 64-bit aligned on some arches while
 308          only 32-bit aligned on other arches.  Duplicate last old
 309          cache entry so that new cache in ld.so.cache can be used by
 310          both.  */
 311       if (opt_format != 0)
 312         cache_entry_old_count = (cache_entry_old_count + 1) & ~1;
 313
 314       /* And the list of all entries in the old format.  */
 315       file_entries_size = sizeof (struct cache_file)
 316         + cache_entry_old_count * sizeof (struct file_entry);
 317       file_entries = (struct cache_file *) xmalloc (file_entries_size);
 318
 319       /* Fill in the header.  */
 320       memset (file_entries, 0, sizeof (struct cache_file));
 321       memcpy (file_entries->magic, CACHEMAGIC, sizeof CACHEMAGIC - 1);
 322
 323       file_entries->nlibs = cache_entry_old_count;
 324     }
 325
 326   if (opt_format != 0)
 327     {
 328       /* And the list of all entries in the new format.  */
 329       file_entries_new_size = sizeof (struct cache_file_new)
 330         + cache_entry_count * sizeof (struct file_entry_new);
 331       file_entries_new =
 332         (struct cache_file_new *) xmalloc (file_entries_new_size);
 333
 334       /* Fill in the header.  */
 335       memset (file_entries_new, 0, sizeof (struct cache_file_new));
 336       memcpy (file_entries_new->magic, CACHEMAGIC_NEW,
 337               sizeof CACHEMAGIC_NEW - 1);
 338       memcpy (file_entries_new->version, CACHE_VERSION,
 339               sizeof CACHE_VERSION - 1);
 340
 341       file_entries_new->nlibs = cache_entry_count;
 342       file_entries_new->len_strings = total_strlen;
 343     }
 344
 345   pad = ALIGN_CACHE (file_entries_size) - file_entries_size;
 346
 347   /* If we have both formats, we hide the new format in the strings
 348      table, we have to adjust all string indices for this so that
 349      old libc5/glibc 2 dynamic linkers just ignore them.  */
 350   if (opt_format != 0)
 351     str_offset = file_entries_new_size;
 352   else
 353     str_offset = 0;
 354
 355   str = strings;
 356   for (idx_old = 0, idx_new = 0, entry = entries; entry != NULL;
 357        entry = entry->next, ++idx_new)
 358     {
 359       /* First the library.  */
 360       if (opt_format != 2 && entry->hwcap == 0)
 361         {
 362           file_entries->libs[idx_old].flags = entry->flags;
 363           /* XXX: Actually we can optimize here and remove duplicates.  */
 364           file_entries->libs[idx_old].key = str_offset + pad;
 365         }
 366       if (opt_format != 0)
 367         {
 368           /* We could subtract file_entries_new_size from str_offset -
 369              not doing so makes the code easier, the string table
 370              always begins at the beginning of the the new cache
 371              struct.  */
 372           file_entries_new->libs[idx_new].flags = entry->flags;
 373           file_entries_new->libs[idx_new].osversion = entry->osversion;
 374           file_entries_new->libs[idx_new].hwcap = entry->hwcap;
 375           file_entries_new->libs[idx_new].key = str_offset;
 376         }
 377       len = strlen (entry->lib);
 378       str = stpcpy (str, entry->lib);
 379       /* Account the final NUL.  */
 380       ++str;
 381       str_offset += len + 1;
 382       /* Then the path.  */
 383       if (opt_format != 2 && entry->hwcap == 0)
 384         file_entries->libs[idx_old].value = str_offset + pad;
 385       if (opt_format != 0)
 386         file_entries_new->libs[idx_new].value = str_offset;
 387       len = strlen (entry->path);
 388       str = stpcpy (str, entry->path);
 389       /* Account the final NUL.  */
 390       ++str;
 391       str_offset += len + 1;
 392       /* Ignore entries with hwcap for old format.  */
 393       if (entry->hwcap == 0)
 394         ++idx_old;
 395     }
 396
 397   /* Duplicate last old cache entry if needed.  */
 398   if (opt_format != 2
 399       && idx_old < cache_entry_old_count)
 400     file_entries->libs[idx_old] = file_entries->libs[idx_old - 1];
 401
 402   /* Write out the cache.  */
 403
 404   /* Write cache first to a temporary file and rename it later.  */
 405   temp_name = xmalloc (strlen (cache_name) + 2);
 406   sprintf (temp_name, "%s~", cache_name);
 407   /* First remove an old copy if it exists.  */
 408   if (unlink (temp_name) && errno != ENOENT)
 409     error (EXIT_FAILURE, errno, _("Can't remove old temporary cache file %s"),
 410            temp_name);
 411
 412   /* Create file.  */
 413   fd = open (temp_name, O_CREAT|O_WRONLY|O_TRUNC|O_NOFOLLOW,
 414              S_IROTH|S_IRGRP|S_IRUSR|S_IWUSR);
 415   if (fd < 0)
 416     error (EXIT_FAILURE, errno, _("Can't create temporary cache file %s"),
 417            temp_name);
 418
 419   /* Write contents.  */
 420   if (opt_format != 2)
 421     {
 422       if (write (fd, file_entries, file_entries_size)
 423           != (ssize_t)file_entries_size)
 424         error (EXIT_FAILURE, errno, _("Writing of cache data failed"));
 425     }
 426   if (opt_format != 0)
 427     {
 428       /* Align cache.  */
 429       if (opt_format != 2)
 430         {
 431           char zero[pad];
 432           if (write (fd, zero, pad) != (ssize_t)pad)
 433             error (EXIT_FAILURE, errno, _("Writing of cache data failed"));
 434         }
 435       if (write (fd, file_entries_new, file_entries_new_size)
 436           != (ssize_t)file_entries_new_size)
 437         error (EXIT_FAILURE, errno, _("Writing of cache data failed"));
 438     }
 439
 440   if (write (fd, strings, total_strlen) != (ssize_t)total_strlen)
 441     error (EXIT_FAILURE, errno, _("Writing of cache data failed."));
 442
 443   close (fd);
 444
 445   /* Make sure user can always read cache file */
 446   if (chmod (temp_name, S_IROTH|S_IRGRP|S_IRUSR|S_IWUSR))
 447     error (EXIT_FAILURE, errno,
 448            _("Changing access rights of %s to %#o failed"), temp_name,
 449            S_IROTH|S_IRGRP|S_IRUSR|S_IWUSR);
 450
 451   /* Move temporary to its final location.  */
 452   if (rename (temp_name, cache_name))
 453     error (EXIT_FAILURE, errno, _("Renaming of %s to %s failed"), temp_name,
 454            cache_name);
 455
 456   /* Free all allocated memory.  */
 457   free (file_entries);
 458   free (strings);
 459
 460   while (entries)
 461     {
 462       entry = entries;
 463       free (entry->path);
 464       free (entry->lib);
 465       entries = entries->next;
 466       free (entry);
 467     }
 468 }
 469
 470
 471 /* Add one library to the cache.  */
 472 void
 473 add_to_cache (const char *path, const char *lib, int flags,
 474               unsigned int osversion, uint64_t hwcap)
 475 {
 476   struct cache_entry *new_entry, *ptr, *prev;
 477   char *full_path;
 478   size_t len, i;
 479
 480   new_entry = (struct cache_entry *) xmalloc (sizeof (struct cache_entry));
 481
 482   len = strlen (lib) + strlen (path) + 2;
 483
 484   full_path = (char *) xmalloc (len);
 485   snprintf (full_path, len, "%s/%s", path, lib);
 486
 487   new_entry->lib = xstrdup (lib);
 488   new_entry->path = full_path;
 489   new_entry->flags = flags;
 490   new_entry->osversion = osversion;
 491   new_entry->hwcap = hwcap;
 492   new_entry->bits_hwcap = 0;
 493
 494   /* Count the number of bits set in the masked value.  */
 495   for (i = 0; (~((1ULL << i) - 1) & hwcap) != 0 && i < 8 * sizeof (hwcap); ++i)
 496     if ((hwcap & (1ULL << i)) != 0)
 497       ++new_entry->bits_hwcap;
 498
 499
 500   /* Keep the list sorted - search for right place to insert.  */
 501   ptr = entries;
 502   prev = entries;
 503   while (ptr != NULL)
 504     {
 505       if (compare (ptr, new_entry) > 0)
 506         break;
 507       prev = ptr;
 508       ptr = ptr->next;
 509     }
 510   /* Is this the first entry?  */
 511   if (ptr == entries)
 512     {
 513       new_entry->next = entries;
 514       entries = new_entry;
 515     }
 516   else
 517     {
 518       new_entry->next = prev->next;
 519       prev->next = new_entry;
 520     }
 521 }