sewardj | de4a1d0 | 2002-03-22 01:27:54 +0000 | [diff] [blame] | 1 | |
| 2 | /*--------------------------------------------------------------------*/ |
sewardj | 55f9d1a | 2005-04-25 11:11:44 +0000 | [diff] [blame] | 3 | /*--- The address space manager: segment initialisation and ---*/ |
| 4 | /*--- tracking, stack operations ---*/ |
njn | 945ed2e | 2005-06-24 03:28:30 +0000 | [diff] [blame] | 5 | /*--- m_aspacemgr.c ---*/ |
sewardj | de4a1d0 | 2002-03-22 01:27:54 +0000 | [diff] [blame] | 6 | /*--------------------------------------------------------------------*/ |
| 7 | |
| 8 | /* |
njn | b9c427c | 2004-12-01 14:14:42 +0000 | [diff] [blame] | 9 | This file is part of Valgrind, a dynamic binary instrumentation |
| 10 | framework. |
sewardj | de4a1d0 | 2002-03-22 01:27:54 +0000 | [diff] [blame] | 11 | |
njn | 5361242 | 2005-03-12 16:22:54 +0000 | [diff] [blame] | 12 | Copyright (C) 2000-2005 Julian Seward |
sewardj | de4a1d0 | 2002-03-22 01:27:54 +0000 | [diff] [blame] | 13 | jseward@acm.org |
sewardj | de4a1d0 | 2002-03-22 01:27:54 +0000 | [diff] [blame] | 14 | |
| 15 | This program is free software; you can redistribute it and/or |
| 16 | modify it under the terms of the GNU General Public License as |
| 17 | published by the Free Software Foundation; either version 2 of the |
| 18 | License, or (at your option) any later version. |
| 19 | |
| 20 | This program is distributed in the hope that it will be useful, but |
| 21 | WITHOUT ANY WARRANTY; without even the implied warranty of |
| 22 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 23 | General Public License for more details. |
| 24 | |
| 25 | You should have received a copy of the GNU General Public License |
| 26 | along with this program; if not, write to the Free Software |
| 27 | Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA |
| 28 | 02111-1307, USA. |
| 29 | |
njn25 | e49d8e7 | 2002-09-23 09:36:25 +0000 | [diff] [blame] | 30 | The GNU General Public License is contained in the file COPYING. |
sewardj | de4a1d0 | 2002-03-22 01:27:54 +0000 | [diff] [blame] | 31 | */ |
| 32 | |
njn | c7561b9 | 2005-06-19 01:24:32 +0000 | [diff] [blame] | 33 | #include "pub_core_basics.h" |
njn | f6ec8ec | 2005-07-21 23:26:25 +0000 | [diff] [blame] | 34 | #include "pub_core_debuginfo.h" // Needed for pub_core_aspacemgr.h :( |
sewardj | 55f9d1a | 2005-04-25 11:11:44 +0000 | [diff] [blame] | 35 | #include "pub_core_aspacemgr.h" |
njn | 97405b2 | 2005-06-02 03:39:33 +0000 | [diff] [blame] | 36 | #include "pub_core_libcbase.h" |
njn | 132bfcc | 2005-06-04 19:16:06 +0000 | [diff] [blame] | 37 | #include "pub_core_libcassert.h" |
njn | 67741c6 | 2005-06-20 02:23:07 +0000 | [diff] [blame] | 38 | #include "pub_core_libcfile.h" // For VG_(fstat), VG_(resolve_filename_nodup) |
njn | 36a20fa | 2005-06-03 03:08:39 +0000 | [diff] [blame] | 39 | #include "pub_core_libcprint.h" |
njn | 9abd608 | 2005-06-17 21:31:45 +0000 | [diff] [blame] | 40 | #include "pub_core_syscall.h" |
njn | 43b9a8a | 2005-05-10 04:37:01 +0000 | [diff] [blame] | 41 | #include "pub_core_tooliface.h" |
njn | 945ed2e | 2005-06-24 03:28:30 +0000 | [diff] [blame] | 42 | #include "pub_core_transtab.h" // For VG_(discard_translations) |
njn | 3c660b6 | 2005-05-13 22:18:47 +0000 | [diff] [blame] | 43 | #include "vki_unistd.h" |
sewardj | 55f9d1a | 2005-04-25 11:11:44 +0000 | [diff] [blame] | 44 | |
sewardj | de4a1d0 | 2002-03-22 01:27:54 +0000 | [diff] [blame] | 45 | |
sewardj | a449568 | 2002-10-21 07:29:59 +0000 | [diff] [blame] | 46 | /* Define to debug the memory-leak-detector. */ |
| 47 | /* #define VG_DEBUG_LEAKCHECK */ |
| 48 | |
sewardj | e517b80 | 2005-02-16 01:58:51 +0000 | [diff] [blame] | 49 | static const Bool mem_debug = False; |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 50 | |
| 51 | /*--------------------------------------------------------------*/ |
njn | 04e1698 | 2005-05-31 00:23:43 +0000 | [diff] [blame] | 52 | /*--- Basic globals about the address space. ---*/ |
| 53 | /*--------------------------------------------------------------*/ |
| 54 | |
| 55 | /* Client address space, lowest to highest (see top of ume.c) */ |
| 56 | Addr VG_(client_base); /* client address space limits */ |
| 57 | Addr VG_(client_end); |
| 58 | Addr VG_(client_mapbase); |
njn | 04e1698 | 2005-05-31 00:23:43 +0000 | [diff] [blame] | 59 | Addr VG_(clstk_base); |
| 60 | Addr VG_(clstk_end); |
rjwalsh | 0140af5 | 2005-06-04 20:42:33 +0000 | [diff] [blame] | 61 | UWord VG_(clstk_id); |
njn | 04e1698 | 2005-05-31 00:23:43 +0000 | [diff] [blame] | 62 | |
| 63 | Addr VG_(brk_base); /* start of brk */ |
| 64 | Addr VG_(brk_limit); /* current brk */ |
| 65 | |
| 66 | Addr VG_(shadow_base); /* tool's shadow memory */ |
| 67 | Addr VG_(shadow_end); |
| 68 | |
| 69 | Addr VG_(valgrind_base); /* valgrind's address range */ |
| 70 | |
| 71 | // Note that VG_(valgrind_last) names the last byte of the section, whereas |
| 72 | // the VG_(*_end) vars name the byte one past the end of the section. |
| 73 | Addr VG_(valgrind_last); |
| 74 | |
| 75 | /*--------------------------------------------------------------*/ |
njn | b69f7c1 | 2005-06-24 22:17:38 +0000 | [diff] [blame] | 76 | /*--- The raw mman syscalls ---*/ |
| 77 | /*--------------------------------------------------------------*/ |
| 78 | |
| 79 | SysRes VG_(mmap_native)(void *start, SizeT length, UInt prot, UInt flags, |
| 80 | UInt fd, OffT offset) |
| 81 | { |
| 82 | SysRes res; |
| 83 | #if defined(VGP_x86_linux) |
| 84 | { |
| 85 | UWord args[6]; |
| 86 | args[0] = (UWord)start; |
| 87 | args[1] = length; |
| 88 | args[2] = prot; |
| 89 | args[3] = flags; |
| 90 | args[4] = fd; |
| 91 | args[5] = offset; |
| 92 | res = VG_(do_syscall1)(__NR_mmap, (UWord)args ); |
| 93 | } |
| 94 | #elif defined(VGP_amd64_linux) |
| 95 | res = VG_(do_syscall6)(__NR_mmap, (UWord)start, length, |
| 96 | prot, flags, fd, offset); |
| 97 | #elif defined(VGP_ppc32_linux) |
| 98 | res = VG_(do_syscall6)(__NR_mmap, (UWord)(start), (length), |
| 99 | prot, flags, fd, offset); |
| 100 | #else |
| 101 | # error Unknown platform |
| 102 | #endif |
| 103 | return res; |
| 104 | } |
| 105 | |
| 106 | SysRes VG_(munmap_native)(void *start, SizeT length) |
| 107 | { |
| 108 | return VG_(do_syscall2)(__NR_munmap, (UWord)start, length ); |
| 109 | } |
| 110 | |
| 111 | SysRes VG_(mprotect_native)( void *start, SizeT length, UInt prot ) |
| 112 | { |
| 113 | return VG_(do_syscall3)(__NR_mprotect, (UWord)start, length, prot ); |
| 114 | } |
| 115 | |
| 116 | /*--------------------------------------------------------------*/ |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 117 | /*--- A simple, self-contained ordered array of segments. ---*/ |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 118 | /*--------------------------------------------------------------*/ |
| 119 | |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 120 | /* Max number of segments we can track. */ |
| 121 | #define VG_N_SEGMENTS 1000 |
| 122 | |
| 123 | /* Max number of segment file names we can track. */ |
| 124 | #define VG_N_SEGNAMES 200 |
| 125 | |
| 126 | /* Max length of a segment file name. */ |
| 127 | #define VG_MAX_SEGNAMELEN 1000 |
| 128 | |
| 129 | |
| 130 | /* ------ STATE for the address-space manager ------ */ |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 131 | |
| 132 | /* Array [0 .. segments_used-1] of all mappings. */ |
| 133 | /* Sorted by .addr field. */ |
| 134 | /* I: len may not be zero. */ |
| 135 | /* I: overlapping segments are not allowed. */ |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 136 | /* Each segment can optionally hold an index into the filename table. */ |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 137 | |
| 138 | static Segment segments[VG_N_SEGMENTS]; |
| 139 | static Int segments_used = 0; |
| 140 | |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 141 | typedef |
| 142 | struct { |
| 143 | Bool inUse; |
| 144 | Bool mark; |
| 145 | HChar fname[VG_MAX_SEGNAMELEN]; |
| 146 | } |
| 147 | SegName; |
| 148 | |
| 149 | /* Filename table. _used is the high water mark; an entry is only |
| 150 | valid if its index >= 0, < _used, and its .inUse field == True. |
| 151 | The .mark field is used to garbage-collect dead entries. |
| 152 | */ |
| 153 | static SegName segnames[VG_N_SEGNAMES]; |
| 154 | static Int segnames_used = 0; |
| 155 | |
| 156 | |
| 157 | /* ------ end of STATE for the address-space manager ------ */ |
| 158 | |
| 159 | |
| 160 | /* Searches the filename table to find an index for the given name. |
| 161 | If none is found, an index is allocated and the name stored. If no |
| 162 | space is available we just give up. If the string is too long to |
| 163 | store, return -1. |
| 164 | */ |
| 165 | static Int allocate_segname ( const HChar* name ) |
| 166 | { |
| 167 | Int i, j, len; |
| 168 | |
| 169 | vg_assert(name); |
| 170 | |
njn | f6ec8ec | 2005-07-21 23:26:25 +0000 | [diff] [blame] | 171 | if (0) VG_(printf)("allocate_segname %s\n", name); |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 172 | |
| 173 | len = VG_(strlen)(name); |
| 174 | if (len >= VG_MAX_SEGNAMELEN-1) { |
| 175 | return -1; |
| 176 | } |
| 177 | |
| 178 | /* first see if we already have the name. */ |
| 179 | for (i = 0; i < segnames_used; i++) { |
| 180 | if (!segnames[i].inUse) |
| 181 | continue; |
| 182 | if (0 == VG_(strcmp)(name, &segnames[i].fname[0])) { |
| 183 | return i; |
| 184 | } |
| 185 | } |
| 186 | |
| 187 | /* no we don't. So look for a free slot. */ |
| 188 | for (i = 0; i < segnames_used; i++) |
| 189 | if (!segnames[i].inUse) |
| 190 | break; |
| 191 | |
| 192 | if (i == segnames_used) { |
| 193 | /* no free slots .. advance the high-water mark. */ |
| 194 | if (segnames_used+1 < VG_N_SEGNAMES) { |
| 195 | i = segnames_used; |
| 196 | segnames_used++; |
| 197 | } else { |
| 198 | VG_(printf)( |
tom | 3a07e9b | 2005-05-17 11:03:52 +0000 | [diff] [blame] | 199 | "coregrind/m_aspacemgr/aspacemgr.c:\n" |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 200 | " VG_N_SEGNAMES is too small: " |
| 201 | "increase it and rebuild Valgrind.\n" |
| 202 | ); |
| 203 | VG_(printf)( |
tom | 3a07e9b | 2005-05-17 11:03:52 +0000 | [diff] [blame] | 204 | "coregrind/m_aspacemgr/aspacemgr.c:\n" |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 205 | " giving up now.\n\n" |
| 206 | ); |
| 207 | VG_(exit)(0); |
| 208 | } |
| 209 | } |
| 210 | |
| 211 | /* copy it in */ |
| 212 | segnames[i].inUse = True; |
| 213 | for (j = 0; j < len; j++) |
| 214 | segnames[i].fname[j] = name[j]; |
| 215 | vg_assert(len < VG_MAX_SEGNAMELEN); |
| 216 | segnames[i].fname[len] = 0; |
| 217 | return i; |
| 218 | } |
| 219 | |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 220 | |
| 221 | /* Returns -1 if 'a' denotes an address prior to seg, 1 if it denotes |
| 222 | an address after it, and 0 if it denotes an address covered by |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 223 | seg. |
| 224 | */ |
sewardj | 447f2a1 | 2005-07-07 13:52:53 +0000 | [diff] [blame] | 225 | static inline Int compare_addr_with_seg ( Addr a, Segment* seg ) |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 226 | { |
| 227 | if (a < seg->addr) |
| 228 | return -1; |
| 229 | if (a >= seg->addr + seg->len) |
| 230 | return 1; |
| 231 | return 0; |
| 232 | } |
| 233 | |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 234 | |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 235 | /* Find the (index of the) segment that contains 'a', or -1 if |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 236 | none. |
| 237 | */ |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 238 | static Int find_segment ( Addr a ) |
| 239 | { |
| 240 | Int i; |
| 241 | for (i = 0; i < segments_used; i++) { |
| 242 | if (compare_addr_with_seg(a, &segments[i]) == 0) |
| 243 | return i; |
| 244 | } |
| 245 | return -1; |
| 246 | } |
| 247 | |
| 248 | |
| 249 | /* Assumes that 'a' is not in any segment. Finds the index of the |
| 250 | lowest-addressed segment above 'a', or -1 if none. Passing 'a' |
| 251 | which is in fact in a segment is a checked error. |
| 252 | */ |
| 253 | static Int find_segment_above_unmapped ( Addr a ) |
| 254 | { |
| 255 | Int i, r; |
| 256 | for (i = 0; i < segments_used; i++) { |
| 257 | r = compare_addr_with_seg(a, &segments[i]); |
| 258 | vg_assert(r != 0); /* 'a' should not be in any segment. */ |
| 259 | if (r == 1) |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 260 | continue; |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 261 | vg_assert(r == -1); |
| 262 | break; |
| 263 | } |
| 264 | |
| 265 | if (i == segments_used) |
| 266 | return -1; /* not found */ |
| 267 | else |
| 268 | return i; |
| 269 | } |
| 270 | |
| 271 | |
| 272 | /* Assumes that 'a' is in some segment. Finds the next segment along, |
| 273 | or NULL if none. Passing 'a' which is in fact not in a segment is |
| 274 | a checked error. |
| 275 | */ |
| 276 | static Int find_segment_above_mapped ( Addr a ) |
| 277 | { |
| 278 | Int i, r; |
| 279 | for (i = 0; i < segments_used; i++) { |
| 280 | r = compare_addr_with_seg(a, &segments[i]); |
| 281 | if (r == 1) |
| 282 | continue; /* not yet there */ |
| 283 | if (r == 0) |
| 284 | break; /* found it */ |
| 285 | vg_assert(0); |
| 286 | /* we shouldn't get here -- r == -1 and so it means we went past |
| 287 | 'a' without seeing it -- it is therefore unmapped. */ |
| 288 | /*NOTREACHED*/ |
| 289 | } |
| 290 | |
| 291 | vg_assert(i < segments_used); |
| 292 | if (i == segments_used-1) |
| 293 | return -1; /* not found */ |
| 294 | else |
| 295 | return i+1; |
| 296 | } |
| 297 | |
| 298 | |
| 299 | /* Shift segments[i .. segments_used-1] up by one. */ |
| 300 | static void make_space_at ( Int i ) |
| 301 | { |
| 302 | Int j; |
| 303 | vg_assert(i >= 0 && i <= segments_used); |
| 304 | vg_assert(segments_used >= 0); |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 305 | if (segments_used+1 == VG_N_SEGMENTS) { |
| 306 | VG_(printf)( |
tom | 8a51bb8 | 2005-06-15 10:24:26 +0000 | [diff] [blame] | 307 | "coregrind/m_aspacemgr/aspacemgr.c:\n" |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 308 | " VG_N_SEGMENTS is too small: " |
| 309 | "increase it and rebuild Valgrind.\n" |
| 310 | ); |
| 311 | VG_(printf)( |
tom | 8a51bb8 | 2005-06-15 10:24:26 +0000 | [diff] [blame] | 312 | "coregrind/m_aspacemgr/aspacemgr.c:\n" |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 313 | " giving up now.\n\n" |
| 314 | ); |
| 315 | VG_(exit)(0); |
| 316 | } |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 317 | vg_assert(segments_used+1 < VG_N_SEGMENTS); |
| 318 | for (j = segments_used; j > i; j--) |
| 319 | segments[j] = segments[j-1]; |
| 320 | segments_used++; |
| 321 | } |
| 322 | |
njn | f6ec8ec | 2005-07-21 23:26:25 +0000 | [diff] [blame] | 323 | // Forward declaration |
| 324 | static void dealloc_seg_memory(Segment *s); |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 325 | |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 326 | /* Shift segments [i+1 .. segments_used-1] down by one, and decrement |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 327 | segments_used. |
| 328 | */ |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 329 | static void delete_segment_at ( Int i ) |
| 330 | { |
| 331 | Int j; |
| 332 | vg_assert(i >= 0 && i < segments_used); |
njn | f6ec8ec | 2005-07-21 23:26:25 +0000 | [diff] [blame] | 333 | dealloc_seg_memory(&segments[i]); |
| 334 | for (j = i+1; j < segments_used; j++) { |
| 335 | segments[j-1] = segments[j]; |
| 336 | } |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 337 | segments_used--; |
| 338 | vg_assert(segments_used >= 0 && segments_used < VG_N_SEGMENTS); |
| 339 | } |
| 340 | |
| 341 | |
| 342 | /* Fill the i'th record all with zeroes. */ |
| 343 | static void zeroise_segment ( Int i ) |
| 344 | { |
| 345 | vg_assert(i >= 0 && i < segments_used); |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 346 | segments[i].prot = 0; |
| 347 | segments[i].flags = 0; |
| 348 | segments[i].addr = 0; |
| 349 | segments[i].len = 0; |
| 350 | segments[i].offset = 0; |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 351 | segments[i].filename = NULL; |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 352 | segments[i].fnIdx = -1; |
| 353 | segments[i].dev = 0; |
| 354 | segments[i].ino = 0; |
njn | 36ef6ba | 2005-05-14 18:42:26 +0000 | [diff] [blame] | 355 | segments[i].seginfo = NULL; |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 356 | } |
| 357 | |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 358 | |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 359 | /* Create a segment to contain 'a', and return its index. Or -1 if |
| 360 | this failed because some other segment already contains 'a'. If |
| 361 | successful, fill in the segment's .addr field with 'a' but leave |
| 362 | all other fields alone. |
| 363 | */ |
| 364 | static Int create_segment ( Addr a ) |
| 365 | { |
| 366 | Int i, r; |
| 367 | for (i = 0; i < segments_used; i++) { |
| 368 | r = compare_addr_with_seg( a, &segments[i] ); |
| 369 | if (r == 1) |
| 370 | continue; /* seg[i] precedes a */ |
| 371 | if (r == 0) |
| 372 | return -1; /* seg[i] contains a. Give up */ |
| 373 | vg_assert(r == -1); |
| 374 | break; |
| 375 | } |
| 376 | /* a precedes seg[i]. Shift segs at i and above up one, and use |
| 377 | this slot. */ |
| 378 | make_space_at(i); |
| 379 | zeroise_segment(i); |
| 380 | segments[i].addr = a; |
| 381 | return i; |
| 382 | } |
| 383 | |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 384 | |
| 385 | /* Print out the segment array (debugging only!). Note, this calls |
| 386 | VG_(printf), and I'm not 100% clear that that wouldn't require |
| 387 | dynamic memory allocation and hence more segments to be allocated. |
| 388 | */ |
| 389 | static void show_segments ( HChar* who ) |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 390 | { |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 391 | Int i; |
| 392 | VG_(printf)("<<< SHOW_SEGMENTS: %s (%d segments, %d segnames)\n", |
| 393 | who, segments_used, segnames_used); |
| 394 | for (i = 0; i < segnames_used; i++) { |
| 395 | if (!segnames[i].inUse) |
| 396 | continue; |
| 397 | VG_(printf)("(%2d) %s\n", i, segnames[i].fname); |
| 398 | } |
| 399 | for (i = 0; i < segments_used; i++) { |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 400 | VG_(printf)( |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 401 | "%3d: %08p-%08p %7llu pr=0x%x fl=0x%04x d=0x%03x i=%-7d o=%-7lld (%d)\n", |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 402 | i, |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 403 | segments[i].addr, segments[i].addr + segments[i].len, |
| 404 | (ULong)segments[i].len, segments[i].prot, |
| 405 | segments[i].flags, segments[i].dev, segments[i].ino, |
| 406 | (Long)segments[i].offset, |
| 407 | segments[i].fnIdx); |
| 408 | } |
| 409 | VG_(printf)(">>>\n"); |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 410 | } |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 411 | |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 412 | |
| 413 | /* Find the segment containing 'a' and split it into two pieces at |
| 414 | 'a'. Does nothing if no segment contains 'a', or if the split |
| 415 | would cause either of the pieces to have zero size. |
| 416 | |
| 417 | If 'a' is not found, or if no splitting happens, -1 is returned. |
| 418 | |
| 419 | If a value 'r' other than -1 is returned, this is the index of the |
| 420 | higher-addressed segment resulting from the split, and the index of |
| 421 | the lower-addressed segment is r-1. |
| 422 | */ |
| 423 | static Int split_segment ( Addr a ) |
| 424 | { |
| 425 | Int r; |
| 426 | HWord delta; |
njn | be91aae | 2005-03-27 01:42:41 +0000 | [diff] [blame] | 427 | vg_assert(VG_IS_PAGE_ALIGNED(a)); |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 428 | r = find_segment(a); |
| 429 | if (r == -1) |
| 430 | /* not found */ |
| 431 | return -1; |
| 432 | if (segments[r].addr == a) |
| 433 | /* segment starts at 'a', so splitting it would create a |
| 434 | zero-sized segment */ |
| 435 | return -1; |
| 436 | |
| 437 | /* copy original; make adjustments. */ |
| 438 | vg_assert(a > segments[r].addr); |
| 439 | delta = a - segments[r].addr; |
| 440 | make_space_at(r); |
njn | f6ec8ec | 2005-07-21 23:26:25 +0000 | [diff] [blame] | 441 | |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 442 | segments[r] = segments[r+1]; |
| 443 | segments[r].len = delta; |
njn | f6ec8ec | 2005-07-21 23:26:25 +0000 | [diff] [blame] | 444 | if (segments[r].seginfo) |
| 445 | VG_(seginfo_incref)(segments[r].seginfo); |
| 446 | |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 447 | segments[r+1].len -= delta; |
| 448 | segments[r+1].addr += delta; |
| 449 | segments[r+1].offset += delta; |
| 450 | return r+1; |
| 451 | } |
| 452 | |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 453 | |
| 454 | /* Return true if two segments are adjacent and mergable (s1 is |
| 455 | assumed to have a lower ->addr than s2) */ |
| 456 | static inline Bool segments_are_mergeable(Segment *s1, Segment *s2) |
| 457 | { |
| 458 | if (s1->addr+s1->len != s2->addr) |
| 459 | return False; |
| 460 | |
| 461 | if (s1->flags != s2->flags) |
| 462 | return False; |
| 463 | |
| 464 | if (s1->prot != s2->prot) |
| 465 | return False; |
| 466 | |
njn | 36ef6ba | 2005-05-14 18:42:26 +0000 | [diff] [blame] | 467 | if (s1->seginfo != s2->seginfo) |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 468 | return False; |
| 469 | |
| 470 | if (s1->flags & SF_FILE){ |
| 471 | if ((s1->offset + s1->len) != s2->offset) |
| 472 | return False; |
| 473 | if (s1->dev != s2->dev) |
| 474 | return False; |
| 475 | if (s1->ino != s2->ino) |
| 476 | return False; |
| 477 | if (s1->fnIdx != s2->fnIdx) |
| 478 | return False; |
| 479 | } |
| 480 | |
| 481 | return True; |
| 482 | } |
| 483 | |
| 484 | |
| 485 | /* Clean up and sanity check the segment array: |
| 486 | - check segments are in ascending order |
| 487 | - check segments do not overlap |
| 488 | - check no segment has zero size |
| 489 | - merge adjacent where possible |
| 490 | - perform checks on the filename table, and reclaim dead entries |
| 491 | */ |
| 492 | static void preen_segments ( void ) |
| 493 | { |
| 494 | Int i, j, rd, wr; |
| 495 | Segment *s, *s1; |
| 496 | vg_assert(segments_used >= 0 && segments_used < VG_N_SEGMENTS); |
| 497 | vg_assert(segnames_used >= 0 && segnames_used < VG_N_SEGNAMES); |
| 498 | |
| 499 | if (0) show_segments("before preen"); |
| 500 | |
| 501 | /* clear string table mark bits */ |
| 502 | for (i = 0; i < segnames_used; i++) |
| 503 | segnames[i].mark = False; |
| 504 | |
| 505 | /* check for non-zero size, and set mark bits for any used strings */ |
| 506 | for (i = 0; i < segments_used; i++) { |
| 507 | vg_assert(segments[i].len > 0); |
| 508 | j = segments[i].fnIdx; |
| 509 | vg_assert(j >= -1 && j < segnames_used); |
| 510 | if (j >= 0) { |
| 511 | vg_assert(segnames[j].inUse); |
| 512 | segnames[j].mark = True; |
| 513 | } |
| 514 | } |
| 515 | |
| 516 | /* check ascendingness and non-overlap */ |
| 517 | for (i = 0; i < segments_used-1; i++) { |
| 518 | s = &segments[i]; |
| 519 | s1 = &segments[i+1]; |
| 520 | vg_assert(s->addr < s1->addr); |
| 521 | vg_assert(s->addr + s->len <= s1->addr); |
| 522 | } |
| 523 | |
| 524 | /* merge */ |
| 525 | if (segments_used < 1) |
| 526 | return; |
| 527 | |
| 528 | wr = 1; |
| 529 | for (rd = 1; rd < segments_used; rd++) { |
| 530 | s = &segments[wr-1]; |
| 531 | s1 = &segments[rd]; |
| 532 | if (segments_are_mergeable(s,s1)) { |
| 533 | if (0) |
| 534 | VG_(printf)("merge %p-%p with %p-%p\n", |
| 535 | s->addr, s->addr+s->len, |
| 536 | s1->addr, s1->addr+s1->len); |
| 537 | s->len += s1->len; |
njn | f6ec8ec | 2005-07-21 23:26:25 +0000 | [diff] [blame] | 538 | |
| 539 | vg_assert(s->seginfo == s1->seginfo); |
| 540 | dealloc_seg_memory(s1); |
| 541 | |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 542 | continue; |
| 543 | } |
| 544 | if (wr < rd) |
| 545 | segments[wr] = segments[rd]; |
| 546 | wr++; |
| 547 | } |
| 548 | vg_assert(wr >= 0 && wr <= segments_used); |
| 549 | segments_used = wr; |
| 550 | |
| 551 | /* Free up any strings which are no longer referenced. */ |
| 552 | for (i = 0; i < segnames_used; i++) { |
| 553 | if (segnames[i].mark == False) { |
| 554 | segnames[i].inUse = False; |
| 555 | segnames[i].fname[0] = 0; |
| 556 | } |
| 557 | } |
| 558 | |
| 559 | if (0) show_segments("after preen"); |
| 560 | } |
| 561 | |
| 562 | |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 563 | /*--------------------------------------------------------------*/ |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 564 | /*--- Maintain an ordered list of all the client's mappings ---*/ |
| 565 | /*--------------------------------------------------------------*/ |
| 566 | |
nethercote | 8991d5a | 2004-11-03 17:07:46 +0000 | [diff] [blame] | 567 | Bool VG_(seg_contains)(const Segment *s, Addr p, SizeT len) |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 568 | { |
| 569 | Addr se = s->addr+s->len; |
| 570 | Addr pe = p+len; |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 571 | vg_assert(pe >= p); |
| 572 | |
| 573 | return (p >= s->addr && pe <= se); |
| 574 | } |
| 575 | |
nethercote | 8991d5a | 2004-11-03 17:07:46 +0000 | [diff] [blame] | 576 | Bool VG_(seg_overlaps)(const Segment *s, Addr p, SizeT len) |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 577 | { |
| 578 | Addr se = s->addr+s->len; |
| 579 | Addr pe = p+len; |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 580 | vg_assert(pe >= p); |
| 581 | |
| 582 | return (p < se && pe > s->addr); |
| 583 | } |
| 584 | |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 585 | /* When freeing a Segment, also clean up every one else's ideas of |
| 586 | what was going on in that range of memory */ |
njn | f6ec8ec | 2005-07-21 23:26:25 +0000 | [diff] [blame] | 587 | static void dealloc_seg_memory(Segment *s) |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 588 | { |
njn | 36ef6ba | 2005-05-14 18:42:26 +0000 | [diff] [blame] | 589 | if (s->seginfo != NULL) { |
| 590 | VG_(seginfo_decref)(s->seginfo, s->addr); |
| 591 | s->seginfo = NULL; |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 592 | } |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 593 | } |
sewardj | 1024cf7 | 2005-02-28 14:39:21 +0000 | [diff] [blame] | 594 | |
| 595 | /* Get rid of any translations arising from s. */ |
| 596 | /* Note, this is not really the job of the low level memory manager. |
| 597 | When it comes time to rewrite this subsystem, clean this up. */ |
| 598 | static void dump_translations_from ( Segment* s ) |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 599 | { |
sewardj | 1024cf7 | 2005-02-28 14:39:21 +0000 | [diff] [blame] | 600 | if (s->flags & SF_CODE) { |
| 601 | VG_(discard_translations)(s->addr, s->len); |
| 602 | if (0) |
| 603 | VG_(printf)("dumping translations in %p .. %p\n", |
| 604 | s->addr, s->addr+s->len); |
| 605 | } |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 606 | } |
| 607 | |
sewardj | 1024cf7 | 2005-02-28 14:39:21 +0000 | [diff] [blame] | 608 | |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 609 | /* This unmaps all the segments in the range [addr, addr+len); any |
| 610 | partial mappings at the ends are truncated. */ |
nethercote | 8b5f40c | 2004-11-02 13:29:50 +0000 | [diff] [blame] | 611 | void VG_(unmap_range)(Addr addr, SizeT len) |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 612 | { |
tom | c2bf09c | 2005-07-29 18:33:19 +0000 | [diff] [blame^] | 613 | const Bool debug = False || mem_debug; |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 614 | Segment* s; |
| 615 | Addr end, s_end; |
| 616 | Int i; |
sewardj | 47c98a7 | 2005-03-12 20:36:15 +0000 | [diff] [blame] | 617 | Bool deleted; |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 618 | |
| 619 | if (len == 0) |
| 620 | return; |
| 621 | |
njn | 13bfd85 | 2005-06-02 03:52:53 +0000 | [diff] [blame] | 622 | len = VG_PGROUNDUP(len); |
fitzhardinge | 1a4adf0 | 2003-12-22 10:42:59 +0000 | [diff] [blame] | 623 | |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 624 | if (debug) |
sewardj | a8d8e23 | 2005-06-07 20:04:56 +0000 | [diff] [blame] | 625 | VG_(printf)("unmap_range(%p, %llu)\n", addr, (ULong)len); |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 626 | if (0) show_segments("unmap_range(BEFORE)"); |
fitzhardinge | 1a4adf0 | 2003-12-22 10:42:59 +0000 | [diff] [blame] | 627 | end = addr+len; |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 628 | |
| 629 | /* Everything must be page-aligned */ |
njn | be91aae | 2005-03-27 01:42:41 +0000 | [diff] [blame] | 630 | vg_assert(VG_IS_PAGE_ALIGNED(addr)); |
| 631 | vg_assert(VG_IS_PAGE_ALIGNED(len)); |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 632 | |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 633 | for (i = 0; i < segments_used; i++) { |
sewardj | 47c98a7 | 2005-03-12 20:36:15 +0000 | [diff] [blame] | 634 | |
| 635 | /* do not delete .. even though it looks stupid */ |
| 636 | vg_assert(i >= 0); |
| 637 | |
| 638 | deleted = False; |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 639 | s = &segments[i]; |
| 640 | s_end = s->addr + s->len; |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 641 | |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 642 | if (0 && debug) |
fitzhardinge | 1a30304 | 2003-12-22 08:48:50 +0000 | [diff] [blame] | 643 | VG_(printf)("unmap: addr=%p-%p s=%p ->addr=%p-%p len=%d\n", |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 644 | addr, end, s, s->addr, s_end, s->len); |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 645 | |
fitzhardinge | 1a30304 | 2003-12-22 08:48:50 +0000 | [diff] [blame] | 646 | if (!VG_(seg_overlaps)(s, addr, len)) { |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 647 | if (0 && debug) |
fitzhardinge | 1a30304 | 2003-12-22 08:48:50 +0000 | [diff] [blame] | 648 | VG_(printf)(" (no overlap)\n"); |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 649 | continue; |
fitzhardinge | 1a30304 | 2003-12-22 08:48:50 +0000 | [diff] [blame] | 650 | } |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 651 | |
| 652 | /* 4 cases: */ |
fitzhardinge | 1a30304 | 2003-12-22 08:48:50 +0000 | [diff] [blame] | 653 | if (addr > s->addr && |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 654 | addr < s_end && |
| 655 | end >= s_end) { |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 656 | /* this segment's tail is truncated by [addr, addr+len) |
| 657 | -> truncate tail |
| 658 | */ |
sewardj | 1024cf7 | 2005-02-28 14:39:21 +0000 | [diff] [blame] | 659 | dump_translations_from(s); |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 660 | s->len = addr - s->addr; |
| 661 | |
| 662 | if (debug) |
tom | 9be7c98 | 2005-04-25 16:55:44 +0000 | [diff] [blame] | 663 | VG_(printf)(" case 1: s->len=%lu\n", s->len); |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 664 | } else if (addr <= s->addr && end > s->addr && end < s_end) { |
fitzhardinge | e3632c6 | 2003-12-22 10:58:06 +0000 | [diff] [blame] | 665 | /* this segment's head is truncated by [addr, addr+len) |
| 666 | -> truncate head |
| 667 | */ |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 668 | Word delta = end - s->addr; |
fitzhardinge | e3632c6 | 2003-12-22 10:58:06 +0000 | [diff] [blame] | 669 | |
| 670 | if (debug) |
tom | 9be7c98 | 2005-04-25 16:55:44 +0000 | [diff] [blame] | 671 | VG_(printf)(" case 2: s->addr=%p s->len=%lu delta=%d\n", |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 672 | s->addr, s->len, delta); |
fitzhardinge | e3632c6 | 2003-12-22 10:58:06 +0000 | [diff] [blame] | 673 | |
sewardj | 1024cf7 | 2005-02-28 14:39:21 +0000 | [diff] [blame] | 674 | dump_translations_from(s); |
fitzhardinge | e3632c6 | 2003-12-22 10:58:06 +0000 | [diff] [blame] | 675 | s->addr += delta; |
| 676 | s->offset += delta; |
| 677 | s->len -= delta; |
| 678 | |
| 679 | vg_assert(s->len != 0); |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 680 | } else if (addr <= s->addr && end >= s_end) { |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 681 | /* this segment is completely contained within [addr, addr+len) |
| 682 | -> delete segment |
| 683 | */ |
sewardj | 1024cf7 | 2005-02-28 14:39:21 +0000 | [diff] [blame] | 684 | dump_translations_from(s); |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 685 | delete_segment_at(i); |
sewardj | 47c98a7 | 2005-03-12 20:36:15 +0000 | [diff] [blame] | 686 | deleted = True; |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 687 | |
| 688 | if (debug) |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 689 | VG_(printf)(" case 3: seg %d deleted\n", i); |
| 690 | } else if (addr > s->addr && end < s_end) { |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 691 | /* [addr, addr+len) is contained within a single segment |
| 692 | -> split segment into 3, delete middle portion |
| 693 | */ |
sewardj | 1024cf7 | 2005-02-28 14:39:21 +0000 | [diff] [blame] | 694 | Int i_middle; |
| 695 | dump_translations_from(s); |
| 696 | i_middle = split_segment(addr); |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 697 | vg_assert(i_middle != -1); |
| 698 | (void)split_segment(addr+len); |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 699 | vg_assert(segments[i_middle].addr == addr); |
| 700 | delete_segment_at(i_middle); |
sewardj | 47c98a7 | 2005-03-12 20:36:15 +0000 | [diff] [blame] | 701 | deleted = True; |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 702 | |
| 703 | if (debug) |
| 704 | VG_(printf)(" case 4: subrange %p-%p deleted\n", |
| 705 | addr, addr+len); |
| 706 | } |
sewardj | 47c98a7 | 2005-03-12 20:36:15 +0000 | [diff] [blame] | 707 | |
| 708 | /* If we deleted this segment (or any above), those above will |
| 709 | have been moved down to fill in the hole in the segment |
| 710 | array. In order that we don't miss them, we have to |
| 711 | re-consider this slot number; hence the i--. */ |
| 712 | if (deleted) |
| 713 | i--; |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 714 | } |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 715 | preen_segments(); |
| 716 | if (0) show_segments("unmap_range(AFTER)"); |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 717 | } |
| 718 | |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 719 | |
| 720 | /* Add a binding of [addr,addr+len) to |
| 721 | (prot,flags,dev,ino,off,filename) in the segment array. |
| 722 | Delete/truncate any previous mapping(s) covering that range. |
| 723 | */ |
| 724 | void |
| 725 | VG_(map_file_segment)( Addr addr, SizeT len, |
| 726 | UInt prot, UInt flags, |
| 727 | UInt dev, UInt ino, ULong off, |
| 728 | const Char *filename) |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 729 | { |
tom | c2bf09c | 2005-07-29 18:33:19 +0000 | [diff] [blame^] | 730 | const Bool debug = False || mem_debug; |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 731 | Segment* s; |
| 732 | Int idx; |
njn | 6081fce | 2005-06-25 19:45:34 +0000 | [diff] [blame] | 733 | HChar* stage2_suffix1 = "lib/valgrind/stage2"; |
| 734 | HChar* stage2_suffix2 = "coregrind/stage2"; |
| 735 | Bool is_stage2 = False; |
| 736 | |
| 737 | is_stage2 = is_stage2 || ( VG_(strstr)(filename, stage2_suffix1) != NULL ); |
| 738 | is_stage2 = is_stage2 || ( VG_(strstr)(filename, stage2_suffix2) != NULL ); |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 739 | |
| 740 | if (debug) |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 741 | VG_(printf)( |
| 742 | "\n" |
tom | 9be7c98 | 2005-04-25 16:55:44 +0000 | [diff] [blame] | 743 | "map_file_segment(addr=%p len=%lu prot=0x%x flags=0x%x\n" |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 744 | " dev=0x%4x ino=%d off=%ld\n" |
| 745 | " filename='%s')\n", |
| 746 | addr, (ULong)len, prot, flags, dev, ino, off, filename); |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 747 | |
sewardj | a8d8e23 | 2005-06-07 20:04:56 +0000 | [diff] [blame] | 748 | if (0) show_segments("before map_file_segment"); |
| 749 | |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 750 | /* Everything must be page-aligned */ |
njn | be91aae | 2005-03-27 01:42:41 +0000 | [diff] [blame] | 751 | vg_assert(VG_IS_PAGE_ALIGNED(addr)); |
njn | 13bfd85 | 2005-06-02 03:52:53 +0000 | [diff] [blame] | 752 | len = VG_PGROUNDUP(len); |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 753 | |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 754 | /* Nuke/truncate any existing segment(s) covering [addr,addr+len) */ |
| 755 | VG_(unmap_range)(addr, len); |
| 756 | |
| 757 | /* and now install this one */ |
| 758 | idx = create_segment(addr); |
| 759 | vg_assert(segments_used >= 0 && segments_used <= VG_N_SEGMENTS); |
| 760 | vg_assert(idx != -1); |
| 761 | vg_assert(idx >= 0 && idx < segments_used); |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 762 | |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 763 | s = &segments[idx]; |
| 764 | vg_assert(s->addr == addr); |
| 765 | s->prot = prot; |
| 766 | s->flags = flags; |
| 767 | s->len = len; |
| 768 | s->offset = off; |
| 769 | s->fnIdx = filename==NULL ? -1 : allocate_segname(filename); |
| 770 | s->filename = s->fnIdx==-1 ? NULL : &segnames[s->fnIdx].fname[0]; |
| 771 | s->dev = dev; |
| 772 | s->ino = ino; |
njn | 36ef6ba | 2005-05-14 18:42:26 +0000 | [diff] [blame] | 773 | s->seginfo = NULL; |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 774 | |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 775 | /* Clean up right now */ |
| 776 | preen_segments(); |
| 777 | if (0) show_segments("after map_file_segment"); |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 778 | |
njn | f6ec8ec | 2005-07-21 23:26:25 +0000 | [diff] [blame] | 779 | /* If this mapping is at the beginning of a file, isn't part of |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 780 | Valgrind, is at least readable and seems to contain an object |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 781 | file, then try reading symbols from it. |
sewardj | 78164b9 | 2005-07-09 10:36:25 +0000 | [diff] [blame] | 782 | |
| 783 | Getting this heuristic right is critical. On x86-linux, |
| 784 | objects are typically mapped twice: |
| 785 | |
| 786 | 1b8fb000-1b8ff000 r-xp 00000000 08:02 4471477 vgpreload_memcheck.so |
| 787 | 1b8ff000-1b900000 rw-p 00004000 08:02 4471477 vgpreload_memcheck.so |
| 788 | |
| 789 | whereas ppc32-linux mysteriously does this: |
| 790 | |
| 791 | 118a6000-118ad000 r-xp 00000000 08:05 14209428 vgpreload_memcheck.so |
| 792 | 118ad000-118b6000 ---p 00007000 08:05 14209428 vgpreload_memcheck.so |
| 793 | 118b6000-118bd000 rwxp 00000000 08:05 14209428 vgpreload_memcheck.so |
| 794 | |
| 795 | The third mapping should not be considered to have executable code in. |
| 796 | Therefore a test which works for both is: r and x and NOT w. Reading |
| 797 | symbols from the rwx segment -- which overlaps the r-x segment in the |
| 798 | file -- causes the redirection mechanism to redirect to addresses in |
| 799 | that third segment, which is wrong and causes crashes. |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 800 | */ |
njn | 36ef6ba | 2005-05-14 18:42:26 +0000 | [diff] [blame] | 801 | if (s->seginfo == NULL |
sewardj | a8d8e23 | 2005-06-07 20:04:56 +0000 | [diff] [blame] | 802 | && ( (addr+len < VG_(valgrind_base) || addr > VG_(valgrind_last)) |
| 803 | || is_stage2 |
| 804 | ) |
njn | 88c5148 | 2005-06-25 20:49:33 +0000 | [diff] [blame] | 805 | && (flags & (SF_MMAP|SF_NOSYMS)) == SF_MMAP |
njn | 88c5148 | 2005-06-25 20:49:33 +0000 | [diff] [blame] | 806 | ) { |
sewardj | 78164b9 | 2005-07-09 10:36:25 +0000 | [diff] [blame] | 807 | if (off == 0 |
| 808 | && s->fnIdx != -1 |
| 809 | /* r, x are set */ |
| 810 | && (prot & (VKI_PROT_READ|VKI_PROT_EXEC)) == (VKI_PROT_READ|VKI_PROT_EXEC) |
| 811 | /* w is clear */ |
| 812 | && (prot & VKI_PROT_WRITE) == 0 |
| 813 | /* other checks .. */ |
| 814 | && len >= VKI_PAGE_SIZE |
| 815 | && VG_(is_object_file)((void *)addr) ) { |
njn | 88c5148 | 2005-06-25 20:49:33 +0000 | [diff] [blame] | 816 | s->seginfo = VG_(read_seg_symbols)(s->addr, s->len, s->offset, |
| 817 | s->filename); |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 818 | } |
njn | f6ec8ec | 2005-07-21 23:26:25 +0000 | [diff] [blame] | 819 | else if (flags & SF_MMAP) |
| 820 | { |
| 821 | const SegInfo *si; |
| 822 | |
| 823 | /* Otherwise see if an existing SegInfo applies to this Segment */ |
| 824 | for (si = VG_(next_seginfo)(NULL); |
| 825 | si != NULL; |
| 826 | si = VG_(next_seginfo)(si)) |
| 827 | { |
| 828 | if (VG_(seg_overlaps)(s, VG_(seginfo_start)(si), |
| 829 | VG_(seginfo_size)(si))) |
| 830 | { |
| 831 | s->seginfo = (SegInfo *)si; |
| 832 | VG_(seginfo_incref)((SegInfo *)si); |
| 833 | } |
| 834 | } |
| 835 | } |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 836 | } |
| 837 | |
| 838 | /* clean up */ |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 839 | preen_segments(); |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 840 | } |
| 841 | |
nethercote | 8b5f40c | 2004-11-02 13:29:50 +0000 | [diff] [blame] | 842 | void VG_(map_fd_segment)(Addr addr, SizeT len, UInt prot, UInt flags, |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 843 | Int fd, ULong off, const Char *filename) |
| 844 | { |
njn | f845f8f | 2005-06-23 02:26:47 +0000 | [diff] [blame] | 845 | Char buf[VKI_PATH_MAX]; |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 846 | struct vki_stat st; |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 847 | |
| 848 | st.st_dev = 0; |
| 849 | st.st_ino = 0; |
| 850 | |
| 851 | if (fd != -1 && (flags & SF_FILE)) { |
nethercote | 73b526f | 2004-10-31 18:48:21 +0000 | [diff] [blame] | 852 | vg_assert((off & (VKI_PAGE_SIZE-1)) == 0); |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 853 | |
| 854 | if (VG_(fstat)(fd, &st) < 0) |
| 855 | flags &= ~SF_FILE; |
| 856 | } |
| 857 | |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 858 | if ((flags & SF_FILE) && filename == NULL && fd != -1) |
njn | f845f8f | 2005-06-23 02:26:47 +0000 | [diff] [blame] | 859 | if (VG_(resolve_filename)(fd, buf, VKI_PATH_MAX)) |
| 860 | filename = buf; |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 861 | |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 862 | VG_(map_file_segment)(addr, len, prot, flags, |
| 863 | st.st_dev, st.st_ino, off, filename); |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 864 | } |
| 865 | |
nethercote | 8b5f40c | 2004-11-02 13:29:50 +0000 | [diff] [blame] | 866 | void VG_(map_segment)(Addr addr, SizeT len, UInt prot, UInt flags) |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 867 | { |
| 868 | flags &= ~SF_FILE; |
| 869 | |
| 870 | VG_(map_file_segment)(addr, len, prot, flags, 0, 0, 0, 0); |
| 871 | } |
| 872 | |
| 873 | /* set new protection flags on an address range */ |
nethercote | 8b5f40c | 2004-11-02 13:29:50 +0000 | [diff] [blame] | 874 | void VG_(mprotect_range)(Addr a, SizeT len, UInt prot) |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 875 | { |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 876 | Int r; |
tom | c2bf09c | 2005-07-29 18:33:19 +0000 | [diff] [blame^] | 877 | const Bool debug = False || mem_debug; |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 878 | |
| 879 | if (debug) |
tom | 9be7c98 | 2005-04-25 16:55:44 +0000 | [diff] [blame] | 880 | VG_(printf)("\nmprotect_range(%p, %lu, %x)\n", a, len, prot); |
sewardj | e517b80 | 2005-02-16 01:58:51 +0000 | [diff] [blame] | 881 | |
| 882 | if (0) show_segments( "mprotect_range(before)" ); |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 883 | |
| 884 | /* Everything must be page-aligned */ |
njn | be91aae | 2005-03-27 01:42:41 +0000 | [diff] [blame] | 885 | vg_assert(VG_IS_PAGE_ALIGNED(a)); |
njn | 13bfd85 | 2005-06-02 03:52:53 +0000 | [diff] [blame] | 886 | len = VG_PGROUNDUP(len); |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 887 | |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 888 | split_segment(a); |
| 889 | split_segment(a+len); |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 890 | |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 891 | r = find_segment(a); |
| 892 | vg_assert(r != -1); |
| 893 | segments[r].prot = prot; |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 894 | |
| 895 | preen_segments(); |
| 896 | |
sewardj | e517b80 | 2005-02-16 01:58:51 +0000 | [diff] [blame] | 897 | if (0) show_segments( "mprotect_range(after)"); |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 898 | } |
| 899 | |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 900 | |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 901 | /* Try to find a map space for [addr,addr+len). If addr==0, it means |
| 902 | the caller is prepared to accept a space at any location; if not, |
| 903 | we will try for addr, but fail if we can't get it. This mimics |
| 904 | mmap fixed vs mmap not-fixed. |
| 905 | */ |
nethercote | 8b5f40c | 2004-11-02 13:29:50 +0000 | [diff] [blame] | 906 | Addr VG_(find_map_space)(Addr addr, SizeT len, Bool for_client) |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 907 | { |
tom | c2bf09c | 2005-07-29 18:33:19 +0000 | [diff] [blame^] | 908 | const Bool debug = False || mem_debug; |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 909 | Addr ret; |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 910 | Addr addrOrig = addr; |
nethercote | a8bc380 | 2004-10-19 17:54:02 +0000 | [diff] [blame] | 911 | Addr limit = (for_client ? VG_(client_end)-1 : VG_(valgrind_last)); |
| 912 | Addr base = (for_client ? VG_(client_mapbase) : VG_(valgrind_base)); |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 913 | Addr hole_start, hole_end, hstart_any, hstart_fixed, hstart_final; |
| 914 | Int i, i_any, i_fixed, i_final; |
| 915 | SizeT hole_len; |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 916 | |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 917 | Bool fixed; |
| 918 | |
sewardj | e517b80 | 2005-02-16 01:58:51 +0000 | [diff] [blame] | 919 | if (debug) { |
| 920 | VG_(printf)("\n\n"); |
sewardj | a8d8e23 | 2005-06-07 20:04:56 +0000 | [diff] [blame] | 921 | VG_(printf)("find_map_space(%p, %llu, %d) ...\n", |
| 922 | addr, (ULong)len, for_client); |
sewardj | e517b80 | 2005-02-16 01:58:51 +0000 | [diff] [blame] | 923 | } |
| 924 | |
| 925 | if (0) show_segments("find_map_space: start"); |
| 926 | |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 927 | if (addr == 0) { |
| 928 | fixed = False; |
| 929 | } else { |
| 930 | fixed = True; |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 931 | /* leave space for redzone and still try to get the exact |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 932 | address asked for */ |
nethercote | 73b526f | 2004-10-31 18:48:21 +0000 | [diff] [blame] | 933 | addr -= VKI_PAGE_SIZE; |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 934 | } |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 935 | |
| 936 | /* Everything must be page-aligned */ |
nethercote | 73b526f | 2004-10-31 18:48:21 +0000 | [diff] [blame] | 937 | vg_assert((addr & (VKI_PAGE_SIZE-1)) == 0); |
njn | 13bfd85 | 2005-06-02 03:52:53 +0000 | [diff] [blame] | 938 | len = VG_PGROUNDUP(len); |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 939 | |
nethercote | 73b526f | 2004-10-31 18:48:21 +0000 | [diff] [blame] | 940 | len += VKI_PAGE_SIZE * 2; /* leave redzone gaps before and after mapping */ |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 941 | |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 942 | /* Scan the segment list, looking for a hole which satisfies the |
| 943 | requirements. At each point i we ask the question "can we use |
| 944 | the hole in between segments[i-1] and segments[i] ?" */ |
| 945 | i_any = i_fixed = -1; |
| 946 | hstart_any = hstart_fixed = 0; |
| 947 | |
| 948 | hole_start = hole_end = 0; |
| 949 | |
| 950 | /* Iterate over all possible holes, generating them into |
| 951 | hole_start/hole_end. Filter out invalid ones. Then see if any |
| 952 | are usable; if so set i_fixed/i_any and hstart_fixed/hstart_any. |
| 953 | */ |
| 954 | for (i = 0; i <=/*yes,really*/ segments_used; i++) { |
| 955 | if (i == 0) { |
| 956 | hole_start = 0; |
| 957 | hole_end = segments[0].addr-1; |
| 958 | } |
| 959 | else { |
| 960 | vg_assert(segments_used > 0); |
| 961 | if (i == segments_used) { |
| 962 | hole_start = segments[i-1].addr + segments[i-1].len; |
| 963 | hole_end = ~(Addr)0; |
| 964 | } else { |
| 965 | hole_start = segments[i-1].addr + segments[i-1].len; |
| 966 | hole_end = segments[i].addr - 1; |
| 967 | } |
| 968 | } |
| 969 | |
| 970 | vg_assert(hole_start <= hole_end || hole_start == hole_end+1); |
| 971 | |
| 972 | /* ignore zero-sized holes */ |
| 973 | if (hole_start == hole_end+1) |
| 974 | continue; |
| 975 | |
njn | be91aae | 2005-03-27 01:42:41 +0000 | [diff] [blame] | 976 | vg_assert(VG_IS_PAGE_ALIGNED(hole_start)); |
| 977 | vg_assert(VG_IS_PAGE_ALIGNED(hole_end+1)); |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 978 | |
| 979 | /* ignore holes which fall outside the allowable area */ |
| 980 | if (!(hole_start >= base && hole_end <= limit)) |
| 981 | continue; |
| 982 | |
| 983 | vg_assert(hole_end > hole_start); |
| 984 | hole_len = hole_end - hole_start + 1; |
njn | be91aae | 2005-03-27 01:42:41 +0000 | [diff] [blame] | 985 | vg_assert(VG_IS_PAGE_ALIGNED(hole_len)); |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 986 | |
| 987 | if (hole_len >= len && i_any == -1) { |
| 988 | /* It will at least fit in this hole. */ |
| 989 | i_any = i; |
| 990 | hstart_any = hole_start; |
| 991 | } |
| 992 | |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 993 | if (fixed && hole_start <= addr |
| 994 | && hole_start+hole_len >= addr+len) { |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 995 | /* We were asked for a fixed mapping, and this hole works. |
| 996 | Bag it -- and stop searching as further searching is |
| 997 | pointless. */ |
| 998 | i_fixed = i; |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 999 | hstart_fixed = addr; |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 1000 | break; |
| 1001 | } |
| 1002 | } |
| 1003 | |
| 1004 | /* Summarise the final decision into i_final/hstart_final. */ |
| 1005 | i_final = -1; |
| 1006 | hstart_final = 0; |
| 1007 | |
| 1008 | if (fixed) { |
| 1009 | i_final = i_fixed; |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 1010 | hstart_final = hstart_fixed + VKI_PAGE_SIZE; /* skip leading redzone */ |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 1011 | } else { |
| 1012 | i_final = i_any; |
| 1013 | hstart_final = hstart_any; |
| 1014 | } |
| 1015 | |
| 1016 | |
| 1017 | if (i_final != -1) |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 1018 | ret = hstart_final; |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 1019 | else |
| 1020 | ret = 0; /* not found */ |
| 1021 | |
| 1022 | if (debug) |
sewardj | a8d8e23 | 2005-06-07 20:04:56 +0000 | [diff] [blame] | 1023 | VG_(printf)("find_map_space(%p, %llu, %d) -> %p\n\n", |
| 1024 | addr, (ULong)len, for_client, ret); |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 1025 | |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 1026 | if (fixed) { |
| 1027 | vg_assert(ret == 0 || ret == addrOrig); |
| 1028 | } |
| 1029 | |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 1030 | return ret; |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 1031 | } |
| 1032 | |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 1033 | |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 1034 | /* Pad the entire process address space, from "start" |
nethercote | 820bd8c | 2004-09-07 23:04:49 +0000 | [diff] [blame] | 1035 | to VG_(valgrind_last) by creating an anonymous and inaccessible |
thughes | 646c6aa | 2004-07-16 15:36:45 +0000 | [diff] [blame] | 1036 | mapping over any part of the address space which is not covered |
| 1037 | by an entry in the segment list. |
| 1038 | |
| 1039 | This is designed for use around system calls which allocate |
| 1040 | memory in the process address space without providing a way to |
nethercote | ccc9ecd | 2004-07-16 17:32:15 +0000 | [diff] [blame] | 1041 | control its location such as io_setup. By choosing a suitable |
thughes | 646c6aa | 2004-07-16 15:36:45 +0000 | [diff] [blame] | 1042 | address with VG_(find_map_space) and then adding a segment for |
| 1043 | it and padding the address space valgrind can ensure that the |
| 1044 | kernel has no choice but to put the memory where we want it. */ |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 1045 | void VG_(pad_address_space)(Addr start) |
thughes | 9aaebc3 | 2004-07-15 23:13:37 +0000 | [diff] [blame] | 1046 | { |
sewardj | 394790d | 2005-03-17 02:14:44 +0000 | [diff] [blame] | 1047 | Addr addr = (start == 0) ? VG_(client_base) : start; |
sewardj | a8d8e23 | 2005-06-07 20:04:56 +0000 | [diff] [blame] | 1048 | SysRes ret; |
sewardj | 394790d | 2005-03-17 02:14:44 +0000 | [diff] [blame] | 1049 | |
| 1050 | Int i = 0; |
| 1051 | Segment* s = i >= segments_used ? NULL : &segments[i]; |
thughes | 9aaebc3 | 2004-07-15 23:13:37 +0000 | [diff] [blame] | 1052 | |
nethercote | 820bd8c | 2004-09-07 23:04:49 +0000 | [diff] [blame] | 1053 | while (s && addr <= VG_(valgrind_last)) { |
thughes | 9aaebc3 | 2004-07-15 23:13:37 +0000 | [diff] [blame] | 1054 | if (addr < s->addr) { |
njn | 7df470b | 2005-05-29 18:46:38 +0000 | [diff] [blame] | 1055 | ret = VG_(mmap_native)((void*)addr, s->addr - addr, 0, |
njn | f6d228b | 2005-03-26 02:42:31 +0000 | [diff] [blame] | 1056 | VKI_MAP_FIXED | VKI_MAP_PRIVATE | VKI_MAP_ANONYMOUS, |
| 1057 | -1, 0); |
tom | 32327ec | 2005-07-19 07:37:51 +0000 | [diff] [blame] | 1058 | vg_assert(!ret.isError); |
thughes | 9aaebc3 | 2004-07-15 23:13:37 +0000 | [diff] [blame] | 1059 | } |
thughes | 9aaebc3 | 2004-07-15 23:13:37 +0000 | [diff] [blame] | 1060 | addr = s->addr + s->len; |
sewardj | 394790d | 2005-03-17 02:14:44 +0000 | [diff] [blame] | 1061 | i++; |
| 1062 | s = i >= segments_used ? NULL : &segments[i]; |
thughes | 9aaebc3 | 2004-07-15 23:13:37 +0000 | [diff] [blame] | 1063 | } |
| 1064 | |
nethercote | 820bd8c | 2004-09-07 23:04:49 +0000 | [diff] [blame] | 1065 | if (addr <= VG_(valgrind_last)) { |
njn | 7df470b | 2005-05-29 18:46:38 +0000 | [diff] [blame] | 1066 | ret = VG_(mmap_native)((void*)addr, VG_(valgrind_last) - addr + 1, 0, |
njn | f6d228b | 2005-03-26 02:42:31 +0000 | [diff] [blame] | 1067 | VKI_MAP_FIXED | VKI_MAP_PRIVATE | VKI_MAP_ANONYMOUS, |
| 1068 | -1, 0); |
tom | 32327ec | 2005-07-19 07:37:51 +0000 | [diff] [blame] | 1069 | vg_assert(!ret.isError); |
thughes | 9aaebc3 | 2004-07-15 23:13:37 +0000 | [diff] [blame] | 1070 | } |
thughes | 9aaebc3 | 2004-07-15 23:13:37 +0000 | [diff] [blame] | 1071 | } |
| 1072 | |
thughes | c70b8c6 | 2004-07-16 23:07:58 +0000 | [diff] [blame] | 1073 | /* Remove the address space padding added by VG_(pad_address_space) |
thughes | 646c6aa | 2004-07-16 15:36:45 +0000 | [diff] [blame] | 1074 | by removing any mappings that it created. */ |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 1075 | void VG_(unpad_address_space)(Addr start) |
thughes | 9aaebc3 | 2004-07-15 23:13:37 +0000 | [diff] [blame] | 1076 | { |
sewardj | 394790d | 2005-03-17 02:14:44 +0000 | [diff] [blame] | 1077 | Addr addr = (start == 0) ? VG_(client_base) : start; |
sewardj | a8d8e23 | 2005-06-07 20:04:56 +0000 | [diff] [blame] | 1078 | SysRes ret; |
sewardj | 394790d | 2005-03-17 02:14:44 +0000 | [diff] [blame] | 1079 | |
| 1080 | Int i = 0; |
| 1081 | Segment* s = i >= segments_used ? NULL : &segments[i]; |
thughes | 9aaebc3 | 2004-07-15 23:13:37 +0000 | [diff] [blame] | 1082 | |
nethercote | 820bd8c | 2004-09-07 23:04:49 +0000 | [diff] [blame] | 1083 | while (s && addr <= VG_(valgrind_last)) { |
thughes | 9aaebc3 | 2004-07-15 23:13:37 +0000 | [diff] [blame] | 1084 | if (addr < s->addr) { |
njn | b69f7c1 | 2005-06-24 22:17:38 +0000 | [diff] [blame] | 1085 | //ret = VG_(do_syscall2)(__NR_munmap, addr, s->addr - addr); |
njn | ca6fef0 | 2004-11-29 16:49:18 +0000 | [diff] [blame] | 1086 | ret = VG_(do_syscall2)(__NR_munmap, addr, s->addr - addr); |
thughes | 9aaebc3 | 2004-07-15 23:13:37 +0000 | [diff] [blame] | 1087 | } |
thughes | 9aaebc3 | 2004-07-15 23:13:37 +0000 | [diff] [blame] | 1088 | addr = s->addr + s->len; |
sewardj | 394790d | 2005-03-17 02:14:44 +0000 | [diff] [blame] | 1089 | i++; |
| 1090 | s = i >= segments_used ? NULL : &segments[i]; |
thughes | 9aaebc3 | 2004-07-15 23:13:37 +0000 | [diff] [blame] | 1091 | } |
| 1092 | |
nethercote | 820bd8c | 2004-09-07 23:04:49 +0000 | [diff] [blame] | 1093 | if (addr <= VG_(valgrind_last)) { |
sewardj | 394790d | 2005-03-17 02:14:44 +0000 | [diff] [blame] | 1094 | ret = VG_(do_syscall2)(__NR_munmap, addr, |
| 1095 | (VG_(valgrind_last) - addr) + 1); |
thughes | 9aaebc3 | 2004-07-15 23:13:37 +0000 | [diff] [blame] | 1096 | } |
thughes | 9aaebc3 | 2004-07-15 23:13:37 +0000 | [diff] [blame] | 1097 | } |
| 1098 | |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 1099 | /* Find the segment holding 'a', or NULL if none. */ |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 1100 | Segment *VG_(find_segment)(Addr a) |
| 1101 | { |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 1102 | Int r = find_segment(a); |
| 1103 | if (0) show_segments("find_segment"); |
| 1104 | if (r == -1) return NULL; |
| 1105 | return &segments[r]; |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 1106 | } |
| 1107 | |
sewardj | 548be6d | 2005-02-16 01:31:37 +0000 | [diff] [blame] | 1108 | /* Assumes that 'a' is not in any segment. Finds the lowest-addressed |
| 1109 | segment above 'a', or NULL if none. Passing 'a' which is in fact in |
| 1110 | a segment is a checked error. |
| 1111 | */ |
| 1112 | Segment *VG_(find_segment_above_unmapped)(Addr a) |
| 1113 | { |
| 1114 | Int r = find_segment_above_unmapped(a); |
| 1115 | if (0) show_segments("find_segment_above_unmapped"); |
| 1116 | if (r == -1) return NULL; |
| 1117 | return &segments[r]; |
| 1118 | } |
| 1119 | |
| 1120 | /* Assumes that 'a' is in some segment. Finds the next segment along, |
| 1121 | or NULL if none. Passing 'a' which is in fact not in a segment is |
| 1122 | a checked error. |
| 1123 | */ |
| 1124 | Segment *VG_(find_segment_above_mapped)(Addr a) |
| 1125 | { |
| 1126 | Int r = find_segment_above_mapped(a); |
| 1127 | if (0) show_segments("find_segment_above_mapped"); |
| 1128 | if (r == -1) return NULL; |
| 1129 | return &segments[r]; |
| 1130 | } |
| 1131 | |
| 1132 | |
jsgf | 855d93d | 2003-10-13 22:26:55 +0000 | [diff] [blame] | 1133 | /* |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 1134 | Test if a piece of memory is addressable with at least the "prot" |
| 1135 | protection permissions by examining the underlying segments. |
| 1136 | |
| 1137 | Really this is a very stupid algorithm and we could do much |
| 1138 | better by iterating through the segment array instead of through |
| 1139 | the address space. |
jsgf | 855d93d | 2003-10-13 22:26:55 +0000 | [diff] [blame] | 1140 | */ |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 1141 | Bool VG_(is_addressable)(Addr p, SizeT size, UInt prot) |
jsgf | 855d93d | 2003-10-13 22:26:55 +0000 | [diff] [blame] | 1142 | { |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 1143 | Segment *seg; |
jsgf | 855d93d | 2003-10-13 22:26:55 +0000 | [diff] [blame] | 1144 | |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 1145 | if ((p + size) < p) |
| 1146 | return False; /* reject wraparounds */ |
| 1147 | if (size == 0) |
| 1148 | return True; /* isn't this a bit of a strange case? */ |
jsgf | 855d93d | 2003-10-13 22:26:55 +0000 | [diff] [blame] | 1149 | |
njn | 13bfd85 | 2005-06-02 03:52:53 +0000 | [diff] [blame] | 1150 | p = VG_PGROUNDDN(p); |
| 1151 | size = VG_PGROUNDUP(size); |
njn | be91aae | 2005-03-27 01:42:41 +0000 | [diff] [blame] | 1152 | vg_assert(VG_IS_PAGE_ALIGNED(p)); |
| 1153 | vg_assert(VG_IS_PAGE_ALIGNED(size)); |
jsgf | 855d93d | 2003-10-13 22:26:55 +0000 | [diff] [blame] | 1154 | |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 1155 | for (; size > 0; size -= VKI_PAGE_SIZE) { |
| 1156 | seg = VG_(find_segment)(p); |
| 1157 | if (!seg) |
| 1158 | return False; |
| 1159 | if ((seg->prot & prot) != prot) |
| 1160 | return False; |
| 1161 | p += VKI_PAGE_SIZE; |
| 1162 | } |
jsgf | 855d93d | 2003-10-13 22:26:55 +0000 | [diff] [blame] | 1163 | |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 1164 | return True; |
jsgf | 855d93d | 2003-10-13 22:26:55 +0000 | [diff] [blame] | 1165 | } |
| 1166 | |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 1167 | |
sewardj | de4a1d0 | 2002-03-22 01:27:54 +0000 | [diff] [blame] | 1168 | /*--------------------------------------------------------------------*/ |
njn | 9260c78 | 2005-06-19 21:57:54 +0000 | [diff] [blame] | 1169 | /*--- Random function that doesn't really belong here ---*/ |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 1170 | /*--------------------------------------------------------------------*/ |
| 1171 | |
njn | 86f12dc | 2005-03-14 01:16:05 +0000 | [diff] [blame] | 1172 | /* We'll call any RW mmaped memory segment, within the client address |
sewardj | 882af5f | 2005-03-16 12:27:53 +0000 | [diff] [blame] | 1173 | range, which isn't SF_CORE, a root. |
| 1174 | */ |
njn | 86f12dc | 2005-03-14 01:16:05 +0000 | [diff] [blame] | 1175 | void VG_(find_root_memory)(void (*add_rootrange)(Addr a, SizeT sz)) |
| 1176 | { |
sewardj | 882af5f | 2005-03-16 12:27:53 +0000 | [diff] [blame] | 1177 | Int i; |
| 1178 | UInt flags; |
njn | 86f12dc | 2005-03-14 01:16:05 +0000 | [diff] [blame] | 1179 | Segment *s; |
| 1180 | |
sewardj | 882af5f | 2005-03-16 12:27:53 +0000 | [diff] [blame] | 1181 | for (i = 0; i < segments_used; i++) { |
| 1182 | s = &segments[i]; |
njn | f253dac | 2005-06-28 22:38:24 +0000 | [diff] [blame] | 1183 | flags = s->flags & (SF_SHARED|SF_MMAP|SF_VALGRIND|SF_CORE|SF_STACK); |
tom | 5912dd7 | 2005-07-18 09:40:29 +0000 | [diff] [blame] | 1184 | if (flags != SF_MMAP && flags != SF_STACK && flags != (SF_MMAP|SF_STACK)) |
njn | 86f12dc | 2005-03-14 01:16:05 +0000 | [diff] [blame] | 1185 | continue; |
sewardj | 882af5f | 2005-03-16 12:27:53 +0000 | [diff] [blame] | 1186 | if ((s->prot & (VKI_PROT_READ|VKI_PROT_WRITE)) |
| 1187 | != (VKI_PROT_READ|VKI_PROT_WRITE)) |
njn | 86f12dc | 2005-03-14 01:16:05 +0000 | [diff] [blame] | 1188 | continue; |
| 1189 | if (!VG_(is_client_addr)(s->addr) || |
njn | f253dac | 2005-06-28 22:38:24 +0000 | [diff] [blame] | 1190 | !VG_(is_client_addr)(s->addr+s->len-1)) |
njn | 86f12dc | 2005-03-14 01:16:05 +0000 | [diff] [blame] | 1191 | continue; |
| 1192 | |
| 1193 | (*add_rootrange)(s->addr, s->len); |
| 1194 | } |
njn | 86f12dc | 2005-03-14 01:16:05 +0000 | [diff] [blame] | 1195 | } |
| 1196 | |
| 1197 | |
nethercote | 88a9016 | 2004-07-10 16:59:25 +0000 | [diff] [blame] | 1198 | /*--------------------------------------------------------------------*/ |
| 1199 | /*--- Querying memory layout ---*/ |
| 1200 | /*--------------------------------------------------------------------*/ |
| 1201 | |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 1202 | Bool VG_(is_client_addr)(Addr a) |
| 1203 | { |
| 1204 | return a >= VG_(client_base) && a < VG_(client_end); |
| 1205 | } |
| 1206 | |
| 1207 | Bool VG_(is_shadow_addr)(Addr a) |
| 1208 | { |
| 1209 | return a >= VG_(shadow_base) && a < VG_(shadow_end); |
| 1210 | } |
| 1211 | |
sewardj | fa8202f | 2005-04-24 11:05:55 +0000 | [diff] [blame] | 1212 | |
nethercote | 88a9016 | 2004-07-10 16:59:25 +0000 | [diff] [blame] | 1213 | /*--------------------------------------------------------------------*/ |
nethercote | 2f54e0d | 2004-07-10 17:27:20 +0000 | [diff] [blame] | 1214 | /*--- Handling shadow memory ---*/ |
nethercote | 88a9016 | 2004-07-10 16:59:25 +0000 | [diff] [blame] | 1215 | /*--------------------------------------------------------------------*/ |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 1216 | |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 1217 | void *VG_(shadow_alloc)(UInt size) |
| 1218 | { |
| 1219 | static Addr shadow_alloc = 0; |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 1220 | Addr try_here; |
njn | e9befc6 | 2005-06-11 15:51:30 +0000 | [diff] [blame] | 1221 | SysRes r; |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 1222 | |
| 1223 | if (0) show_segments("shadow_alloc(before)"); |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 1224 | |
| 1225 | vg_assert(VG_(needs).shadow_memory); |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 1226 | |
njn | 13bfd85 | 2005-06-02 03:52:53 +0000 | [diff] [blame] | 1227 | size = VG_PGROUNDUP(size); |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 1228 | |
| 1229 | if (shadow_alloc == 0) |
| 1230 | shadow_alloc = VG_(shadow_base); |
| 1231 | |
| 1232 | if (shadow_alloc >= VG_(shadow_end)) |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 1233 | goto failed; |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 1234 | |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 1235 | try_here = shadow_alloc; |
njn | be91aae | 2005-03-27 01:42:41 +0000 | [diff] [blame] | 1236 | vg_assert(VG_IS_PAGE_ALIGNED(try_here)); |
| 1237 | vg_assert(VG_IS_PAGE_ALIGNED(size)); |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 1238 | vg_assert(size > 0); |
| 1239 | |
| 1240 | if (0) |
| 1241 | VG_(printf)("shadow_alloc: size %d, trying at %p\n", size, (void*)try_here); |
| 1242 | |
| 1243 | /* this is big-bang allocated, so we don't expect to find a listed |
| 1244 | segment for it. */ |
| 1245 | /* This is really an absolute disgrace. Sometimes the big-bang |
| 1246 | mapping is in the list (due to re-reads of /proc/self/maps, |
| 1247 | presumably) and sometimes it isn't. */ |
| 1248 | #if 0 |
| 1249 | r = find_segment(try_here); |
| 1250 | vg_assert(r == -1); |
| 1251 | r = find_segment(try_here+size-1); |
| 1252 | vg_assert(r == -1); |
| 1253 | #endif |
| 1254 | |
| 1255 | r = VG_(mprotect_native)( (void*)try_here, |
| 1256 | size, VKI_PROT_READ|VKI_PROT_WRITE ); |
| 1257 | |
njn | e9befc6 | 2005-06-11 15:51:30 +0000 | [diff] [blame] | 1258 | if (r.isError) |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 1259 | goto failed; |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 1260 | |
| 1261 | shadow_alloc += size; |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 1262 | return (void*)try_here; |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 1263 | |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 1264 | failed: |
| 1265 | VG_(printf)( |
sewardj | 96db5e1 | 2005-03-21 17:43:34 +0000 | [diff] [blame] | 1266 | "valgrind: Could not allocate address space (0x%x bytes)\n" |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 1267 | "valgrind: for shadow memory chunk.\n", |
sewardj | 96db5e1 | 2005-03-21 17:43:34 +0000 | [diff] [blame] | 1268 | size |
sewardj | 79048ce | 2005-02-18 08:28:32 +0000 | [diff] [blame] | 1269 | ); |
| 1270 | VG_(exit)(1); |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 1271 | } |
| 1272 | |
njn | e3f0635 | 2005-06-01 03:48:33 +0000 | [diff] [blame] | 1273 | /*------------------------------------------------------------*/ |
| 1274 | /*--- pointercheck ---*/ |
| 1275 | /*------------------------------------------------------------*/ |
| 1276 | |
njn | af839f5 | 2005-06-23 03:27:57 +0000 | [diff] [blame] | 1277 | Bool VG_(setup_pointercheck)(Addr client_base, Addr client_end) |
njn | e3f0635 | 2005-06-01 03:48:33 +0000 | [diff] [blame] | 1278 | { |
| 1279 | vg_assert(0 != client_end); |
| 1280 | #if defined(VGP_x86_linux) |
| 1281 | /* Client address space segment limit descriptor entry */ |
| 1282 | #define POINTERCHECK_SEGIDX 1 |
| 1283 | |
| 1284 | vki_modify_ldt_t ldt = { |
| 1285 | POINTERCHECK_SEGIDX, // entry_number |
| 1286 | client_base, // base_addr |
| 1287 | (client_end - client_base) / VKI_PAGE_SIZE, // limit |
| 1288 | 1, // seg_32bit |
| 1289 | 0, // contents: data, RW, non-expanding |
| 1290 | 0, // ! read_exec_only |
| 1291 | 1, // limit_in_pages |
| 1292 | 0, // ! seg not present |
| 1293 | 1, // useable |
| 1294 | }; |
sewardj | a8d8e23 | 2005-06-07 20:04:56 +0000 | [diff] [blame] | 1295 | SysRes ret = VG_(do_syscall3)(__NR_modify_ldt, 1, (UWord)&ldt, sizeof(ldt)); |
| 1296 | if (ret.isError) { |
njn | e3f0635 | 2005-06-01 03:48:33 +0000 | [diff] [blame] | 1297 | VG_(message)(Vg_UserMsg, |
| 1298 | "Warning: ignoring --pointercheck=yes, " |
sewardj | a8d8e23 | 2005-06-07 20:04:56 +0000 | [diff] [blame] | 1299 | "because modify_ldt failed (errno=%d)", ret.val); |
njn | e3f0635 | 2005-06-01 03:48:33 +0000 | [diff] [blame] | 1300 | return False; |
| 1301 | } else { |
| 1302 | return True; |
| 1303 | } |
| 1304 | #elif defined(VGP_amd64_linux) |
| 1305 | if (0) |
| 1306 | VG_(message)(Vg_DebugMsg, "ignoring --pointercheck (unimplemented)"); |
| 1307 | return True; |
cerion | 85665ca | 2005-06-20 15:51:07 +0000 | [diff] [blame] | 1308 | #elif defined(VGP_ppc32_linux) |
| 1309 | if (0) |
| 1310 | VG_(message)(Vg_DebugMsg, "ignoring --pointercheck (unimplemented)"); |
| 1311 | return True; |
njn | e3f0635 | 2005-06-01 03:48:33 +0000 | [diff] [blame] | 1312 | #else |
| 1313 | # error Unknown architecture |
| 1314 | #endif |
| 1315 | } |
| 1316 | |
fitzhardinge | 98abfc7 | 2003-12-16 02:05:15 +0000 | [diff] [blame] | 1317 | /*--------------------------------------------------------------------*/ |
njn | 945ed2e | 2005-06-24 03:28:30 +0000 | [diff] [blame] | 1318 | /*--- end ---*/ |
sewardj | de4a1d0 | 2002-03-22 01:27:54 +0000 | [diff] [blame] | 1319 | /*--------------------------------------------------------------------*/ |