1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355
|
/* Support for reading /etc/ld.so.cache files written by Linux ldconfig.
Copyright (C) 1999-2025 Free Software Foundation, Inc.
This file is part of the GNU C Library.
The GNU C Library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
The GNU C Library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with the GNU C Library; if not, see
<https://www.gnu.org/licenses/>. */
#ifndef _DL_CACHE_H
#define _DL_CACHE_H
#include <endian.h>
#include <stdbool.h>
#include <stddef.h>
#include <stdint.h>
#include <string.h>
#ifndef _DL_CACHE_DEFAULT_ID
# define _DL_CACHE_DEFAULT_ID 3
#endif
#ifndef _dl_cache_check_flags
# define _dl_cache_check_flags(flags) \
((flags) == 1 || (flags) == _DL_CACHE_DEFAULT_ID)
#endif
#ifndef LD_SO_CACHE
# define LD_SO_CACHE SYSCONFDIR "/ld.so.cache"
#endif
#ifndef add_system_dir
# define add_system_dir(dir) add_dir (dir)
#endif
#define CACHEMAGIC "ld.so-1.7.0"
/* libc5 and glibc 2.0/2.1 use the same format. For glibc 2.2 another
format has been added in a compatible way:
The beginning of the string table is used for the new table:
old_magic
nlibs
libs[0]
...
libs[nlibs-1]
pad, new magic needs to be aligned
- this is string[0] for the old format
new magic - this is string[0] for the new format
newnlibs
...
newlibs[0]
...
newlibs[newnlibs-1]
string 1
string 2
...
*/
struct file_entry
{
int32_t flags; /* This is 1 for an ELF library. */
uint32_t key, value; /* String table indices. */
};
struct cache_file
{
char magic[sizeof CACHEMAGIC - 1];
unsigned int nlibs;
struct file_entry libs[0];
};
#define CACHEMAGIC_NEW "glibc-ld.so.cache"
#define CACHE_VERSION "1.1"
#define CACHEMAGIC_VERSION_NEW CACHEMAGIC_NEW CACHE_VERSION
struct file_entry_new
{
union
{
/* Fields shared with struct file_entry. */
struct file_entry entry;
/* Also expose these fields directly. */
struct
{
int32_t flags; /* This is 1 for an ELF library. */
uint32_t key, value; /* String table indices. */
};
};
uint32_t osversion_unused; /* Required OS version (unused). */
uint64_t hwcap; /* Hwcap entry. */
};
/* This bit in the hwcap field of struct file_entry_new indicates that
the lower 32 bits contain an index into the
cache_extension_tag_glibc_hwcaps section. Older glibc versions do
not know about this HWCAP bit, so they will ignore these
entries. */
#define DL_CACHE_HWCAP_EXTENSION (1ULL << 62)
/* The number of the ISA level bits in the upper 32 bits of the hwcap
field. */
#define DL_CACHE_HWCAP_ISA_LEVEL_COUNT 10
/* The mask of the ISA level bits in the hwcap field. */
#define DL_CACHE_HWCAP_ISA_LEVEL_MASK \
((1 << DL_CACHE_HWCAP_ISA_LEVEL_COUNT) -1)
/* Return true if the ENTRY->hwcap value indicates that
DL_CACHE_HWCAP_EXTENSION is used. */
static inline bool
dl_cache_hwcap_extension (struct file_entry_new *entry)
{
/* This is an hwcap extension if only the DL_CACHE_HWCAP_EXTENSION bit
is set, ignoring the lower 32 bits as well as the ISA level bits in
the upper 32 bits. */
return (((entry->hwcap >> 32) & ~DL_CACHE_HWCAP_ISA_LEVEL_MASK)
== (DL_CACHE_HWCAP_EXTENSION >> 32));
}
/* See flags member of struct cache_file_new below. */
enum
{
/* No endianness information available. An old ldconfig version
without endianness support wrote the file. */
cache_file_new_flags_endian_unset = 0,
/* Cache is invalid and should be ignored. */
cache_file_new_flags_endian_invalid = 1,
/* Cache format is little endian. */
cache_file_new_flags_endian_little = 2,
/* Cache format is big endian. */
cache_file_new_flags_endian_big = 3,
/* Bit mask to extract the cache_file_new_flags_endian_*
values. */
cache_file_new_flags_endian_mask = 3,
/* Expected value of the endian bits in the flags member for the
current architecture. */
cache_file_new_flags_endian_current
= (__BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__
? cache_file_new_flags_endian_little
: cache_file_new_flags_endian_big),
};
struct cache_file_new
{
char magic[sizeof CACHEMAGIC_NEW - 1];
char version[sizeof CACHE_VERSION - 1];
uint32_t nlibs; /* Number of entries. */
uint32_t len_strings; /* Size of string table. */
/* flags & cache_file_new_flags_endian_mask is one of the values
cache_file_new_flags_endian_unset, cache_file_new_flags_endian_invalid,
cache_file_new_flags_endian_little, cache_file_new_flags_endian_big.
The remaining bits are unused and should be generated as zero and
ignored by readers. */
uint8_t flags;
uint8_t padding_unsed[3]; /* Not used, for future extensions. */
/* File offset of the extension directory. See struct
cache_extension below. Must be a multiple of four. */
uint32_t extension_offset;
uint32_t unused[3]; /* Leave space for future extensions
and align to 8 byte boundary. */
struct file_entry_new libs[0]; /* Entries describing libraries. */
/* After this the string table of size len_strings is found. */
};
_Static_assert (sizeof (struct cache_file_new) == 48,
"size of struct cache_file_new");
/* Returns false if *CACHE has the wrong endianness for this
architecture, and true if the endianness matches (or is
unknown). */
static inline bool
cache_file_new_matches_endian (const struct cache_file_new *cache)
{
/* A zero value for cache->flags means that no endianness
information is available. */
return cache->flags == 0
|| ((cache->flags & cache_file_new_flags_endian_big)
== cache_file_new_flags_endian_current);
}
/* Randomly chosen magic value, which allows for additional
consistency verification. */
enum { cache_extension_magic = (uint32_t) -358342284 };
/* Tag values for different kinds of extension sections. Similar to
SHT_* constants. */
enum cache_extension_tag
{
/* Array of bytes containing the glibc version that generated this
cache file. */
cache_extension_tag_generator,
/* glibc-hwcaps subdirectory information. An array of uint32_t
values, which are indices into the string table. The strings
are sorted lexicographically (according to strcmp). The extra
level of indirection (instead of using string table indices
directly) allows the dynamic loader to compute the preference
order of the hwcaps names more efficiently.
For this section, 4-byte alignment is required, and the section
size must be a multiple of 4. */
cache_extension_tag_glibc_hwcaps,
/* Total number of known cache extension tags. */
cache_extension_count
};
/* Element in the array following struct cache_extension. Similar to
an ELF section header. */
struct cache_extension_section
{
/* Type of the extension section. A enum cache_extension_tag value. */
uint32_t tag;
/* Extension-specific flags. Currently generated as zero. */
uint32_t flags;
/* Offset from the start of the file for the data in this extension
section. Specific extensions can have alignment constraints. */
uint32_t offset;
/* Length in bytes of the extension data. Specific extensions may
have size requirements. */
uint32_t size;
};
/* The extension directory in the cache. An array of struct
cache_extension_section entries. */
struct cache_extension
{
uint32_t magic; /* Always cache_extension_magic. */
uint32_t count; /* Number of following entries. */
/* count section descriptors of type struct cache_extension_section
follow. */
struct cache_extension_section sections[];
};
/* A relocated version of struct cache_extension_section. */
struct cache_extension_loaded
{
/* Address and size of this extension section. base is NULL if the
section is missing from the file. */
const void *base;
size_t size;
/* Flags from struct cache_extension_section. */
uint32_t flags;
};
/* All supported extension sections, relocated. Filled in by
cache_extension_load below. */
struct cache_extension_all_loaded
{
struct cache_extension_loaded sections[cache_extension_count];
};
/* Performs basic data validation based on section tag, and removes
the sections which are invalid. */
static void
cache_extension_verify (struct cache_extension_all_loaded *loaded)
{
{
/* Section must not be empty, it must be aligned at 4 bytes, and
the size must be a multiple of 4. */
struct cache_extension_loaded *hwcaps
= &loaded->sections[cache_extension_tag_glibc_hwcaps];
if (hwcaps->size == 0
|| ((uintptr_t) hwcaps->base % 4) != 0
|| (hwcaps->size % 4) != 0)
{
hwcaps->base = NULL;
hwcaps->size = 0;
hwcaps->flags = 0;
}
}
}
static bool __attribute__ ((unused))
cache_extension_load (const struct cache_file_new *cache,
const void *file_base, size_t file_size,
struct cache_extension_all_loaded *loaded)
{
memset (loaded, 0, sizeof (*loaded));
if (cache->extension_offset == 0)
/* No extensions present. This is not a format error. */
return true;
if ((cache->extension_offset % 4) != 0)
/* Extension offset is misaligned. */
return false;
size_t size_tmp;
if (__builtin_add_overflow (cache->extension_offset,
sizeof (struct cache_extension), &size_tmp)
|| size_tmp > file_size)
/* Extension extends beyond the end of the file. */
return false;
const struct cache_extension *ext = file_base + cache->extension_offset;
if (ext->magic != cache_extension_magic)
return false;
if (__builtin_mul_overflow (ext->count,
sizeof (struct cache_extension_section),
&size_tmp)
|| __builtin_add_overflow (cache->extension_offset
+ sizeof (struct cache_extension), size_tmp,
&size_tmp)
|| size_tmp > file_size)
/* Extension array extends beyond the end of the file. */
return false;
for (uint32_t i = 0; i < ext->count; ++i)
{
if (__builtin_add_overflow (ext->sections[i].offset,
ext->sections[i].size, &size_tmp)
|| size_tmp > file_size)
/* Extension data extends beyond the end of the file. */
return false;
uint32_t tag = ext->sections[i].tag;
if (tag >= cache_extension_count)
/* Tag is out of range and unrecognized. */
continue;
loaded->sections[tag].base = file_base + ext->sections[i].offset;
loaded->sections[tag].size = ext->sections[i].size;
loaded->sections[tag].flags = ext->sections[i].flags;
}
cache_extension_verify (loaded);
return true;
}
/* Used to align cache_file_new. */
#define ALIGN_CACHE(addr) \
(((addr) + __alignof__ (struct cache_file_new) -1) \
& (~(__alignof__ (struct cache_file_new) - 1)))
extern int _dl_cache_libcmp (const char *p1, const char *p2) attribute_hidden;
#endif /* _DL_CACHE_H */
|