njn | 43c799e | 2003-04-08 00:08:52 +0000 | [diff] [blame] | 1 | |
| 2 | /*--------------------------------------------------------------------*/ |
njn | 1d0825f | 2006-03-27 11:37:07 +0000 | [diff] [blame] | 3 | /*--- The leak checker. mc_leakcheck.c ---*/ |
njn | 43c799e | 2003-04-08 00:08:52 +0000 | [diff] [blame] | 4 | /*--------------------------------------------------------------------*/ |
| 5 | |
| 6 | /* |
nethercote | 137bc55 | 2003-11-14 17:47:54 +0000 | [diff] [blame] | 7 | This file is part of MemCheck, a heavyweight Valgrind tool for |
njn | 1d0825f | 2006-03-27 11:37:07 +0000 | [diff] [blame] | 8 | detecting memory errors. |
njn | 43c799e | 2003-04-08 00:08:52 +0000 | [diff] [blame] | 9 | |
sewardj | 9eecbbb | 2010-05-03 21:37:12 +0000 | [diff] [blame] | 10 | Copyright (C) 2000-2010 Julian Seward |
njn | 43c799e | 2003-04-08 00:08:52 +0000 | [diff] [blame] | 11 | jseward@acm.org |
| 12 | |
| 13 | This program is free software; you can redistribute it and/or |
| 14 | modify it under the terms of the GNU General Public License as |
| 15 | published by the Free Software Foundation; either version 2 of the |
| 16 | License, or (at your option) any later version. |
| 17 | |
| 18 | This program is distributed in the hope that it will be useful, but |
| 19 | WITHOUT ANY WARRANTY; without even the implied warranty of |
| 20 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 21 | General Public License for more details. |
| 22 | |
| 23 | You should have received a copy of the GNU General Public License |
| 24 | along with this program; if not, write to the Free Software |
| 25 | Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA |
| 26 | 02111-1307, USA. |
| 27 | |
| 28 | The GNU General Public License is contained in the file COPYING. |
| 29 | */ |
| 30 | |
njn | c7561b9 | 2005-06-19 01:24:32 +0000 | [diff] [blame] | 31 | #include "pub_tool_basics.h" |
sewardj | 4cfea4f | 2006-10-14 19:26:10 +0000 | [diff] [blame] | 32 | #include "pub_tool_vki.h" |
njn | ac1e033 | 2009-05-08 00:39:31 +0000 | [diff] [blame] | 33 | #include "pub_tool_aspacehl.h" |
njn | 4802b38 | 2005-06-11 04:58:29 +0000 | [diff] [blame] | 34 | #include "pub_tool_aspacemgr.h" |
njn | 1d0825f | 2006-03-27 11:37:07 +0000 | [diff] [blame] | 35 | #include "pub_tool_execontext.h" |
| 36 | #include "pub_tool_hashtable.h" |
njn | 97405b2 | 2005-06-02 03:39:33 +0000 | [diff] [blame] | 37 | #include "pub_tool_libcbase.h" |
njn | 132bfcc | 2005-06-04 19:16:06 +0000 | [diff] [blame] | 38 | #include "pub_tool_libcassert.h" |
njn | 36a20fa | 2005-06-03 03:08:39 +0000 | [diff] [blame] | 39 | #include "pub_tool_libcprint.h" |
njn | de62cbf | 2005-06-10 22:08:14 +0000 | [diff] [blame] | 40 | #include "pub_tool_libcsignal.h" |
njn | 6ace3ea | 2005-06-17 03:06:27 +0000 | [diff] [blame] | 41 | #include "pub_tool_machine.h" |
njn | c7561b9 | 2005-06-19 01:24:32 +0000 | [diff] [blame] | 42 | #include "pub_tool_mallocfree.h" |
| 43 | #include "pub_tool_options.h" |
njn | 29a5c01 | 2009-05-06 06:15:55 +0000 | [diff] [blame] | 44 | #include "pub_tool_oset.h" |
njn | 73c5134 | 2005-06-18 15:18:15 +0000 | [diff] [blame] | 45 | #include "pub_tool_signals.h" |
njn | 1d0825f | 2006-03-27 11:37:07 +0000 | [diff] [blame] | 46 | #include "pub_tool_tooliface.h" // Needed for mc_include.h |
njn | 43c799e | 2003-04-08 00:08:52 +0000 | [diff] [blame] | 47 | |
njn | 1d0825f | 2006-03-27 11:37:07 +0000 | [diff] [blame] | 48 | #include "mc_include.h" |
njn | c7561b9 | 2005-06-19 01:24:32 +0000 | [diff] [blame] | 49 | |
| 50 | #include <setjmp.h> // For jmp_buf |
| 51 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 52 | /*------------------------------------------------------------*/ |
| 53 | /*--- An overview of leak checking. ---*/ |
| 54 | /*------------------------------------------------------------*/ |
njn | c7561b9 | 2005-06-19 01:24:32 +0000 | [diff] [blame] | 55 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 56 | // Leak-checking is a directed-graph traversal problem. The graph has |
| 57 | // two kinds of nodes: |
| 58 | // - root-set nodes: |
| 59 | // - GP registers of all threads; |
| 60 | // - valid, aligned, pointer-sized data words in valid client memory, |
| 61 | // including stacks, but excluding words within client heap-allocated |
| 62 | // blocks (they are excluded so that later on we can differentiate |
| 63 | // between heap blocks that are indirectly leaked vs. directly leaked). |
| 64 | // - heap-allocated blocks. A block is a mempool chunk or a malloc chunk |
| 65 | // that doesn't contain a mempool chunk. Nb: the terms "blocks" and |
| 66 | // "chunks" are used interchangeably below. |
| 67 | // |
| 68 | // There are two kinds of edges: |
| 69 | // - start-pointers, i.e. pointers to the start of a block; |
| 70 | // - interior-pointers, i.e. pointers to the interior of a block. |
| 71 | // |
| 72 | // We use "pointers" rather than "edges" below. |
| 73 | // |
| 74 | // Root set nodes only point to blocks. Blocks only point to blocks; |
| 75 | // a block can point to itself. |
| 76 | // |
| 77 | // The aim is to traverse the graph and determine the status of each block. |
| 78 | // |
| 79 | // There are 9 distinct cases. See memcheck/docs/mc-manual.xml for details. |
| 80 | // Presenting all nine categories to the user is probably too much. |
| 81 | // Currently we do this: |
| 82 | // - definitely lost: case 3 |
| 83 | // - indirectly lost: case 4, 9 |
| 84 | // - possibly lost: cases 5..8 |
| 85 | // - still reachable: cases 1, 2 |
| 86 | // |
| 87 | // It's far from clear that this is the best possible categorisation; it's |
| 88 | // accreted over time without any central guiding principle. |
| 89 | |
| 90 | /*------------------------------------------------------------*/ |
| 91 | /*--- XXX: Thoughts for improvement. ---*/ |
| 92 | /*------------------------------------------------------------*/ |
| 93 | |
| 94 | // From the user's point of view: |
| 95 | // - If they aren't using interior-pointers, they just have to fix the |
| 96 | // directly lost blocks, and the indirectly lost ones will be fixed as |
| 97 | // part of that. Any possibly lost blocks will just be due to random |
| 98 | // pointer garbage and can be ignored. |
| 99 | // |
| 100 | // - If they are using interior-pointers, the fact that they currently are not |
| 101 | // being told which ones might be directly lost vs. indirectly lost makes |
| 102 | // it hard to know where to begin. |
| 103 | // |
| 104 | // All this makes me wonder if new option is warranted: |
| 105 | // --follow-interior-pointers. By default it would be off, the leak checker |
| 106 | // wouldn't follow interior-pointers and there would only be 3 categories: |
| 107 | // R, DL, IL. |
| 108 | // |
| 109 | // If turned on, then it would show 7 categories (R, DL, IL, DR/DL, IR/IL, |
| 110 | // IR/IL/DL, IL/DL). That output is harder to understand but it's your own |
| 111 | // damn fault for using interior-pointers... |
| 112 | // |
| 113 | // ---- |
| 114 | // |
| 115 | // Also, why are two blank lines printed between each loss record? |
njn | c2f8b1b | 2009-08-10 06:47:00 +0000 | [diff] [blame] | 116 | // [bug 197930] |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 117 | // |
| 118 | // ---- |
| 119 | // |
| 120 | // Also, --show-reachable is a bad name because it also turns on the showing |
| 121 | // of indirectly leaked blocks(!) It would be better named --show-all or |
| 122 | // --show-all-heap-blocks, because that's the end result. |
| 123 | // |
| 124 | // ---- |
| 125 | // |
| 126 | // Also, the VALGRIND_LEAK_CHECK and VALGRIND_QUICK_LEAK_CHECK aren't great |
| 127 | // names. VALGRIND_FULL_LEAK_CHECK and VALGRIND_SUMMARY_LEAK_CHECK would be |
| 128 | // better. |
| 129 | // |
| 130 | // ---- |
| 131 | // |
| 132 | // Also, VALGRIND_COUNT_LEAKS and VALGRIND_COUNT_LEAK_BLOCKS aren't great as |
| 133 | // they combine direct leaks and indirect leaks into one. New, more precise |
| 134 | // ones (they'll need new names) would be good. If more categories are |
| 135 | // used, as per the --follow-interior-pointers option, they should be |
| 136 | // updated accordingly. And they should use a struct to return the values. |
| 137 | // |
| 138 | // ---- |
| 139 | // |
| 140 | // Also, for this case: |
| 141 | // |
| 142 | // (4) p4 BBB ---> AAA |
| 143 | // |
| 144 | // BBB is definitely directly lost. AAA is definitely indirectly lost. |
| 145 | // Here's the relevant loss records printed for a full check (each block is |
| 146 | // 16 bytes): |
| 147 | // |
| 148 | // ==20397== 16 bytes in 1 blocks are indirectly lost in loss record 9 of 15 |
| 149 | // ==20397== at 0x4C2694E: malloc (vg_replace_malloc.c:177) |
| 150 | // ==20397== by 0x400521: mk (leak-cases.c:49) |
| 151 | // ==20397== by 0x400578: main (leak-cases.c:72) |
| 152 | // |
| 153 | // ==20397== 32 (16 direct, 16 indirect) bytes in 1 blocks are definitely |
| 154 | // lost in loss record 14 of 15 |
| 155 | // ==20397== at 0x4C2694E: malloc (vg_replace_malloc.c:177) |
| 156 | // ==20397== by 0x400521: mk (leak-cases.c:49) |
| 157 | // ==20397== by 0x400580: main (leak-cases.c:72) |
| 158 | // |
| 159 | // The first one is fine -- it describes AAA. |
| 160 | // |
| 161 | // The second one is for BBB. It's correct in that 16 bytes in 1 block are |
| 162 | // directly lost. It's also correct that 16 are indirectly lost as a result, |
| 163 | // but it means that AAA is being counted twice in the loss records. (It's |
| 164 | // not, thankfully, counted twice in the summary counts). Argh. |
| 165 | // |
| 166 | // This would be less confusing for the second one: |
| 167 | // |
| 168 | // ==20397== 16 bytes in 1 blocks are definitely lost in loss record 14 |
| 169 | // of 15 (and 16 bytes in 1 block are indirectly lost as a result; they |
| 170 | // are mentioned elsewhere (if --show-reachable=yes is given!)) |
| 171 | // ==20397== at 0x4C2694E: malloc (vg_replace_malloc.c:177) |
| 172 | // ==20397== by 0x400521: mk (leak-cases.c:49) |
| 173 | // ==20397== by 0x400580: main (leak-cases.c:72) |
| 174 | // |
| 175 | // But ideally we'd present the loss record for the directly lost block and |
| 176 | // then the resultant indirectly lost blocks and make it clear the |
| 177 | // dependence. Double argh. |
| 178 | |
| 179 | /*------------------------------------------------------------*/ |
| 180 | /*--- The actual algorithm. ---*/ |
| 181 | /*------------------------------------------------------------*/ |
| 182 | |
| 183 | // - Find all the blocks (a.k.a. chunks) to check. Mempool chunks require |
| 184 | // some special treatment because they can be within malloc'd blocks. |
| 185 | // - Scan every word in the root set (GP registers and valid |
| 186 | // non-heap memory words). |
| 187 | // - First, we skip if it doesn't point to valid memory. |
| 188 | // - Then, we see if it points to the start or interior of a block. If |
| 189 | // so, we push the block onto the mark stack and mark it as having been |
| 190 | // reached. |
| 191 | // - Then, we process the mark stack, repeating the scanning for each block; |
| 192 | // this can push more blocks onto the mark stack. We repeat until the |
| 193 | // mark stack is empty. Each block is marked as definitely or possibly |
| 194 | // reachable, depending on whether interior-pointers were required to |
| 195 | // reach it. |
| 196 | // - At this point we know for every block if it's reachable or not. |
| 197 | // - We then push each unreached block onto the mark stack, using the block |
| 198 | // number as the "clique" number. |
| 199 | // - We process the mark stack again, this time grouping blocks into cliques |
| 200 | // in order to facilitate the directly/indirectly lost categorisation. |
| 201 | // - We group blocks by their ExeContexts and categorisation, and print them |
| 202 | // if --leak-check=full. We also print summary numbers. |
| 203 | // |
| 204 | // A note on "cliques": |
| 205 | // - A directly lost block is one with no pointers to it. An indirectly |
| 206 | // lost block is one that is pointed to by a directly or indirectly lost |
| 207 | // block. |
| 208 | // - Each directly lost block has zero or more indirectly lost blocks |
| 209 | // hanging off it. All these blocks together form a "clique". The |
| 210 | // directly lost block is called the "clique leader". The clique number |
| 211 | // is the number (in lc_chunks[]) of the clique leader. |
| 212 | // - Actually, a directly lost block may be pointed to if it's part of a |
| 213 | // cycle. In that case, there may be more than one choice for the clique |
| 214 | // leader, and the choice is arbitrary. Eg. if you have A-->B and B-->A |
| 215 | // either A or B could be the clique leader. |
| 216 | // - Cliques cannot overlap, and will be truncated to avoid this. Eg. if we |
| 217 | // have A-->C and B-->C, the two cliques will be {A,C} and {B}, or {A} and |
| 218 | // {B,C} (again the choice is arbitrary). This is because we don't want |
| 219 | // to count a block as indirectly lost more than once. |
| 220 | // |
| 221 | // A note on 'is_prior_definite': |
| 222 | // - This is a boolean used in various places that indicates if the chain |
| 223 | // up to the prior node (prior to the one being considered) is definite. |
| 224 | // - In the clique == -1 case: |
| 225 | // - if True it means that the prior node is a root-set node, or that the |
| 226 | // prior node is a block which is reachable from the root-set via |
| 227 | // start-pointers. |
| 228 | // - if False it means that the prior node is a block that is only |
| 229 | // reachable from the root-set via a path including at least one |
| 230 | // interior-pointer. |
| 231 | // - In the clique != -1 case, currently it's always True because we treat |
| 232 | // start-pointers and interior-pointers the same for direct/indirect leak |
| 233 | // checking. If we added a PossibleIndirectLeak state then this would |
| 234 | // change. |
| 235 | |
| 236 | |
| 237 | // Define to debug the memory-leak-detector. |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 238 | #define VG_DEBUG_LEAKCHECK 0 |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 239 | #define VG_DEBUG_CLIQUE 0 |
| 240 | |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 241 | |
njn | 43c799e | 2003-04-08 00:08:52 +0000 | [diff] [blame] | 242 | /*------------------------------------------------------------*/ |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 243 | /*--- Getting the initial chunks, and searching them. ---*/ |
njn | 43c799e | 2003-04-08 00:08:52 +0000 | [diff] [blame] | 244 | /*------------------------------------------------------------*/ |
| 245 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 246 | // Compare the MC_Chunks by 'data' (i.e. the address of the block). |
| 247 | static Int compare_MC_Chunks(void* n1, void* n2) |
njn | 43c799e | 2003-04-08 00:08:52 +0000 | [diff] [blame] | 248 | { |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 249 | MC_Chunk* mc1 = *(MC_Chunk**)n1; |
| 250 | MC_Chunk* mc2 = *(MC_Chunk**)n2; |
| 251 | if (mc1->data < mc2->data) return -1; |
| 252 | if (mc1->data > mc2->data) return 1; |
| 253 | return 0; |
njn | 43c799e | 2003-04-08 00:08:52 +0000 | [diff] [blame] | 254 | } |
| 255 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 256 | #if VG_DEBUG_LEAKCHECK |
| 257 | // Used to sanity-check the fast binary-search mechanism. |
| 258 | static |
| 259 | Int find_chunk_for_OLD ( Addr ptr, |
| 260 | MC_Chunk** chunks, |
| 261 | Int n_chunks ) |
| 262 | |
| 263 | { |
| 264 | Int i; |
| 265 | Addr a_lo, a_hi; |
| 266 | PROF_EVENT(70, "find_chunk_for_OLD"); |
| 267 | for (i = 0; i < n_chunks; i++) { |
| 268 | PROF_EVENT(71, "find_chunk_for_OLD(loop)"); |
| 269 | a_lo = chunks[i]->data; |
| 270 | a_hi = ((Addr)chunks[i]->data) + chunks[i]->szB; |
| 271 | if (a_lo <= ptr && ptr < a_hi) |
| 272 | return i; |
| 273 | } |
| 274 | return -1; |
| 275 | } |
| 276 | #endif |
| 277 | |
| 278 | // Find the i such that ptr points at or inside the block described by |
| 279 | // chunks[i]. Return -1 if none found. This assumes that chunks[] |
| 280 | // has been sorted on the 'data' field. |
| 281 | static |
| 282 | Int find_chunk_for ( Addr ptr, |
| 283 | MC_Chunk** chunks, |
| 284 | Int n_chunks ) |
| 285 | { |
| 286 | Addr a_mid_lo, a_mid_hi; |
| 287 | Int lo, mid, hi, retVal; |
| 288 | // VG_(printf)("find chunk for %p = ", ptr); |
| 289 | retVal = -1; |
| 290 | lo = 0; |
| 291 | hi = n_chunks-1; |
| 292 | while (True) { |
| 293 | // Invariant: current unsearched space is from lo to hi, inclusive. |
| 294 | if (lo > hi) break; // not found |
| 295 | |
| 296 | mid = (lo + hi) / 2; |
| 297 | a_mid_lo = chunks[mid]->data; |
| 298 | a_mid_hi = chunks[mid]->data + chunks[mid]->szB; |
| 299 | // Extent of block 'mid' is [a_mid_lo .. a_mid_hi). |
| 300 | // Special-case zero-sized blocks - treat them as if they had |
| 301 | // size 1. Not doing so causes them to not cover any address |
| 302 | // range at all and so will never be identified as the target of |
| 303 | // any pointer, which causes them to be incorrectly reported as |
| 304 | // definitely leaked. |
| 305 | if (chunks[mid]->szB == 0) |
| 306 | a_mid_hi++; |
| 307 | |
| 308 | if (ptr < a_mid_lo) { |
| 309 | hi = mid-1; |
| 310 | continue; |
| 311 | } |
| 312 | if (ptr >= a_mid_hi) { |
| 313 | lo = mid+1; |
| 314 | continue; |
| 315 | } |
| 316 | tl_assert(ptr >= a_mid_lo && ptr < a_mid_hi); |
| 317 | retVal = mid; |
| 318 | break; |
| 319 | } |
| 320 | |
| 321 | # if VG_DEBUG_LEAKCHECK |
| 322 | tl_assert(retVal == find_chunk_for_OLD ( ptr, chunks, n_chunks )); |
| 323 | # endif |
| 324 | // VG_(printf)("%d\n", retVal); |
| 325 | return retVal; |
| 326 | } |
| 327 | |
| 328 | |
| 329 | static MC_Chunk** |
| 330 | find_active_chunks(UInt* pn_chunks) |
| 331 | { |
| 332 | // Our goal is to construct a set of chunks that includes every |
| 333 | // mempool chunk, and every malloc region that *doesn't* contain a |
| 334 | // mempool chunk. |
| 335 | MC_Mempool *mp; |
| 336 | MC_Chunk **mallocs, **chunks, *mc; |
| 337 | UInt n_mallocs, n_chunks, m, s; |
| 338 | Bool *malloc_chunk_holds_a_pool_chunk; |
| 339 | |
| 340 | // First we collect all the malloc chunks into an array and sort it. |
| 341 | // We do this because we want to query the chunks by interior |
| 342 | // pointers, requiring binary search. |
| 343 | mallocs = (MC_Chunk**) VG_(HT_to_array)( MC_(malloc_list), &n_mallocs ); |
| 344 | if (n_mallocs == 0) { |
| 345 | tl_assert(mallocs == NULL); |
| 346 | *pn_chunks = 0; |
| 347 | return NULL; |
| 348 | } |
| 349 | VG_(ssort)(mallocs, n_mallocs, sizeof(VgHashNode*), compare_MC_Chunks); |
| 350 | |
| 351 | // Then we build an array containing a Bool for each malloc chunk, |
| 352 | // indicating whether it contains any mempools. |
| 353 | malloc_chunk_holds_a_pool_chunk = VG_(calloc)( "mc.fas.1", |
| 354 | n_mallocs, sizeof(Bool) ); |
| 355 | n_chunks = n_mallocs; |
| 356 | |
| 357 | // Then we loop over the mempool tables. For each chunk in each |
| 358 | // pool, we set the entry in the Bool array corresponding to the |
| 359 | // malloc chunk containing the mempool chunk. |
| 360 | VG_(HT_ResetIter)(MC_(mempool_list)); |
| 361 | while ( (mp = VG_(HT_Next)(MC_(mempool_list))) ) { |
| 362 | VG_(HT_ResetIter)(mp->chunks); |
| 363 | while ( (mc = VG_(HT_Next)(mp->chunks)) ) { |
| 364 | |
| 365 | // We'll need to record this chunk. |
| 366 | n_chunks++; |
| 367 | |
| 368 | // Possibly invalidate the malloc holding the beginning of this chunk. |
| 369 | m = find_chunk_for(mc->data, mallocs, n_mallocs); |
| 370 | if (m != -1 && malloc_chunk_holds_a_pool_chunk[m] == False) { |
| 371 | tl_assert(n_chunks > 0); |
| 372 | n_chunks--; |
| 373 | malloc_chunk_holds_a_pool_chunk[m] = True; |
| 374 | } |
| 375 | |
| 376 | // Possibly invalidate the malloc holding the end of this chunk. |
| 377 | if (mc->szB > 1) { |
| 378 | m = find_chunk_for(mc->data + (mc->szB - 1), mallocs, n_mallocs); |
| 379 | if (m != -1 && malloc_chunk_holds_a_pool_chunk[m] == False) { |
| 380 | tl_assert(n_chunks > 0); |
| 381 | n_chunks--; |
| 382 | malloc_chunk_holds_a_pool_chunk[m] = True; |
| 383 | } |
| 384 | } |
| 385 | } |
| 386 | } |
| 387 | tl_assert(n_chunks > 0); |
| 388 | |
| 389 | // Create final chunk array. |
| 390 | chunks = VG_(malloc)("mc.fas.2", sizeof(VgHashNode*) * (n_chunks)); |
| 391 | s = 0; |
| 392 | |
| 393 | // Copy the mempool chunks and the non-marked malloc chunks into a |
| 394 | // combined array of chunks. |
| 395 | VG_(HT_ResetIter)(MC_(mempool_list)); |
| 396 | while ( (mp = VG_(HT_Next)(MC_(mempool_list))) ) { |
| 397 | VG_(HT_ResetIter)(mp->chunks); |
| 398 | while ( (mc = VG_(HT_Next)(mp->chunks)) ) { |
| 399 | tl_assert(s < n_chunks); |
| 400 | chunks[s++] = mc; |
| 401 | } |
| 402 | } |
| 403 | for (m = 0; m < n_mallocs; ++m) { |
| 404 | if (!malloc_chunk_holds_a_pool_chunk[m]) { |
| 405 | tl_assert(s < n_chunks); |
| 406 | chunks[s++] = mallocs[m]; |
| 407 | } |
| 408 | } |
| 409 | tl_assert(s == n_chunks); |
| 410 | |
| 411 | // Free temporaries. |
| 412 | VG_(free)(mallocs); |
| 413 | VG_(free)(malloc_chunk_holds_a_pool_chunk); |
| 414 | |
| 415 | *pn_chunks = n_chunks; |
| 416 | |
| 417 | return chunks; |
| 418 | } |
| 419 | |
| 420 | /*------------------------------------------------------------*/ |
| 421 | /*--- The leak detector proper. ---*/ |
| 422 | /*------------------------------------------------------------*/ |
| 423 | |
| 424 | // Holds extra info about each block during leak checking. |
| 425 | typedef |
| 426 | struct { |
| 427 | UInt state:2; // Reachedness. |
tom | 1d0f3f6 | 2010-10-04 20:55:21 +0000 | [diff] [blame] | 428 | UInt pending:1; // Scan pending. |
| 429 | SizeT indirect_szB : (sizeof(SizeT)*8)-3; // If Unreached, how many bytes |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 430 | // are unreachable from here. |
| 431 | } |
| 432 | LC_Extra; |
| 433 | |
| 434 | // An array holding pointers to every chunk we're checking. Sorted by address. |
| 435 | static MC_Chunk** lc_chunks; |
| 436 | // How many chunks we're dealing with. |
| 437 | static Int lc_n_chunks; |
| 438 | |
| 439 | // This has the same number of entries as lc_chunks, and each entry |
| 440 | // in lc_chunks corresponds with the entry here (ie. lc_chunks[i] and |
| 441 | // lc_extras[i] describe the same block). |
| 442 | static LC_Extra* lc_extras; |
| 443 | |
| 444 | // Records chunks that are currently being processed. Each element in the |
| 445 | // stack is an index into lc_chunks and lc_extras. Its size is |
| 446 | // 'lc_n_chunks' because in the worst case that's how many chunks could be |
| 447 | // pushed onto it (actually I think the maximum is lc_n_chunks-1 but let's |
| 448 | // be conservative). |
| 449 | static Int* lc_markstack; |
| 450 | // The index of the top element of the stack; -1 if the stack is empty, 0 if |
| 451 | // the stack has one element, 1 if it has two, etc. |
| 452 | static Int lc_markstack_top; |
| 453 | |
| 454 | // Keeps track of how many bytes of memory we've scanned, for printing. |
| 455 | // (Nb: We don't keep track of how many register bytes we've scanned.) |
| 456 | static SizeT lc_scanned_szB; |
| 457 | |
| 458 | |
| 459 | SizeT MC_(bytes_leaked) = 0; |
| 460 | SizeT MC_(bytes_indirect) = 0; |
| 461 | SizeT MC_(bytes_dubious) = 0; |
| 462 | SizeT MC_(bytes_reachable) = 0; |
| 463 | SizeT MC_(bytes_suppressed) = 0; |
| 464 | |
| 465 | SizeT MC_(blocks_leaked) = 0; |
| 466 | SizeT MC_(blocks_indirect) = 0; |
| 467 | SizeT MC_(blocks_dubious) = 0; |
| 468 | SizeT MC_(blocks_reachable) = 0; |
| 469 | SizeT MC_(blocks_suppressed) = 0; |
| 470 | |
sewardj | 45f4e7c | 2005-09-27 19:20:21 +0000 | [diff] [blame] | 471 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 472 | // Determines if a pointer is to a chunk. Returns the chunk number et al |
| 473 | // via call-by-reference. |
| 474 | static Bool |
| 475 | lc_is_a_chunk_ptr(Addr ptr, Int* pch_no, MC_Chunk** pch, LC_Extra** pex) |
njn | 43c799e | 2003-04-08 00:08:52 +0000 | [diff] [blame] | 476 | { |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 477 | Int ch_no; |
| 478 | MC_Chunk* ch; |
| 479 | LC_Extra* ex; |
njn | 43c799e | 2003-04-08 00:08:52 +0000 | [diff] [blame] | 480 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 481 | // Quick filter. |
| 482 | if (!VG_(am_is_valid_for_client)(ptr, 1, VKI_PROT_READ)) { |
| 483 | return False; |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 484 | } else { |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 485 | ch_no = find_chunk_for(ptr, lc_chunks, lc_n_chunks); |
| 486 | tl_assert(ch_no >= -1 && ch_no < lc_n_chunks); |
| 487 | |
| 488 | if (ch_no == -1) { |
| 489 | return False; |
| 490 | } else { |
| 491 | // Ok, we've found a pointer to a chunk. Get the MC_Chunk and its |
| 492 | // LC_Extra. |
| 493 | ch = lc_chunks[ch_no]; |
| 494 | ex = &(lc_extras[ch_no]); |
| 495 | |
| 496 | tl_assert(ptr >= ch->data); |
| 497 | tl_assert(ptr < ch->data + ch->szB + (ch->szB==0 ? 1 : 0)); |
| 498 | |
| 499 | if (VG_DEBUG_LEAKCHECK) |
| 500 | VG_(printf)("ptr=%#lx -> block %d\n", ptr, ch_no); |
| 501 | |
| 502 | *pch_no = ch_no; |
| 503 | *pch = ch; |
| 504 | *pex = ex; |
| 505 | |
| 506 | return True; |
| 507 | } |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 508 | } |
| 509 | } |
| 510 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 511 | // Push a chunk (well, just its index) onto the mark stack. |
| 512 | static void lc_push(Int ch_no, MC_Chunk* ch) |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 513 | { |
tom | 1d0f3f6 | 2010-10-04 20:55:21 +0000 | [diff] [blame] | 514 | if (!lc_extras[ch_no].pending) { |
| 515 | if (0) { |
| 516 | VG_(printf)("pushing %#lx-%#lx\n", ch->data, ch->data + ch->szB); |
| 517 | } |
| 518 | lc_markstack_top++; |
| 519 | tl_assert(lc_markstack_top < lc_n_chunks); |
| 520 | lc_markstack[lc_markstack_top] = ch_no; |
| 521 | tl_assert(!lc_extras[ch_no].pending); |
| 522 | lc_extras[ch_no].pending = True; |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 523 | } |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 524 | } |
| 525 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 526 | // Return the index of the chunk on the top of the mark stack, or -1 if |
| 527 | // there isn't one. |
| 528 | static Bool lc_pop(Int* ret) |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 529 | { |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 530 | if (-1 == lc_markstack_top) { |
| 531 | return False; |
| 532 | } else { |
| 533 | tl_assert(0 <= lc_markstack_top && lc_markstack_top < lc_n_chunks); |
| 534 | *ret = lc_markstack[lc_markstack_top]; |
| 535 | lc_markstack_top--; |
tom | 1d0f3f6 | 2010-10-04 20:55:21 +0000 | [diff] [blame] | 536 | tl_assert(lc_extras[*ret].pending); |
| 537 | lc_extras[*ret].pending = False; |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 538 | return True; |
| 539 | } |
| 540 | } |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 541 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 542 | |
| 543 | // If 'ptr' is pointing to a heap-allocated block which hasn't been seen |
| 544 | // before, push it onto the mark stack. |
| 545 | static void |
| 546 | lc_push_without_clique_if_a_chunk_ptr(Addr ptr, Bool is_prior_definite) |
| 547 | { |
| 548 | Int ch_no; |
| 549 | MC_Chunk* ch; |
| 550 | LC_Extra* ex; |
| 551 | |
| 552 | if ( ! lc_is_a_chunk_ptr(ptr, &ch_no, &ch, &ex) ) |
| 553 | return; |
tom | 1d0f3f6 | 2010-10-04 20:55:21 +0000 | [diff] [blame] | 554 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 555 | // Possibly upgrade the state, ie. one of: |
| 556 | // - Unreached --> Possible |
| 557 | // - Unreached --> Reachable |
| 558 | // - Possible --> Reachable |
tom | 1d0f3f6 | 2010-10-04 20:55:21 +0000 | [diff] [blame] | 559 | if (ptr == ch->data && is_prior_definite && ex->state != Reachable) { |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 560 | // 'ptr' points to the start of the block, and the prior node is |
| 561 | // definite, which means that this block is definitely reachable. |
| 562 | ex->state = Reachable; |
| 563 | |
tom | 1d0f3f6 | 2010-10-04 20:55:21 +0000 | [diff] [blame] | 564 | // State has changed to Reachable so (re)scan the block to make |
| 565 | // sure any blocks it points to are correctly marked. |
| 566 | lc_push(ch_no, ch); |
| 567 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 568 | } else if (ex->state == Unreached) { |
| 569 | // Either 'ptr' is a interior-pointer, or the prior node isn't definite, |
| 570 | // which means that we can only mark this block as possibly reachable. |
| 571 | ex->state = Possible; |
tom | 1d0f3f6 | 2010-10-04 20:55:21 +0000 | [diff] [blame] | 572 | |
| 573 | // State has changed to Possible so (re)scan the block to make |
| 574 | // sure any blocks it points to are correctly marked. |
| 575 | lc_push(ch_no, ch); |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 576 | } |
| 577 | } |
| 578 | |
| 579 | static void |
| 580 | lc_push_if_a_chunk_ptr_register(Addr ptr) |
| 581 | { |
| 582 | lc_push_without_clique_if_a_chunk_ptr(ptr, /*is_prior_definite*/True); |
| 583 | } |
| 584 | |
| 585 | // If ptr is pointing to a heap-allocated block which hasn't been seen |
| 586 | // before, push it onto the mark stack. Clique is the index of the |
| 587 | // clique leader. |
| 588 | static void |
| 589 | lc_push_with_clique_if_a_chunk_ptr(Addr ptr, Int clique) |
| 590 | { |
| 591 | Int ch_no; |
| 592 | MC_Chunk* ch; |
| 593 | LC_Extra* ex; |
| 594 | |
| 595 | tl_assert(0 <= clique && clique < lc_n_chunks); |
| 596 | |
| 597 | if ( ! lc_is_a_chunk_ptr(ptr, &ch_no, &ch, &ex) ) |
| 598 | return; |
| 599 | |
| 600 | // If it's not Unreached, it's already been handled so ignore it. |
| 601 | // If ch_no==clique, it's the clique leader, which means this is a cyclic |
| 602 | // structure; again ignore it because it's already been handled. |
| 603 | if (ex->state == Unreached && ch_no != clique) { |
| 604 | // Note that, unlike reachable blocks, we currently don't distinguish |
| 605 | // between start-pointers and interior-pointers here. We probably |
| 606 | // should, though. |
| 607 | ex->state = IndirectLeak; |
| 608 | lc_push(ch_no, ch); |
| 609 | |
| 610 | // Add the block to the clique, and add its size to the |
| 611 | // clique-leader's indirect size. Also, if the new block was |
| 612 | // itself a clique leader, it isn't any more, so add its |
| 613 | // indirect_szB to the new clique leader. |
| 614 | if (VG_DEBUG_CLIQUE) { |
| 615 | if (ex->indirect_szB > 0) |
| 616 | VG_(printf)(" clique %d joining clique %d adding %lu+%lu\n", |
| 617 | ch_no, clique, (SizeT)ch->szB, (SizeT)ex->indirect_szB); |
| 618 | else |
| 619 | VG_(printf)(" block %d joining clique %d adding %lu\n", |
| 620 | ch_no, clique, (SizeT)ch->szB); |
| 621 | } |
| 622 | |
| 623 | lc_extras[clique].indirect_szB += ch->szB; |
| 624 | lc_extras[clique].indirect_szB += ex->indirect_szB; |
| 625 | ex->indirect_szB = 0; // Shouldn't matter. |
| 626 | } |
| 627 | } |
| 628 | |
| 629 | static void |
| 630 | lc_push_if_a_chunk_ptr(Addr ptr, Int clique, Bool is_prior_definite) |
| 631 | { |
| 632 | if (-1 == clique) |
| 633 | lc_push_without_clique_if_a_chunk_ptr(ptr, is_prior_definite); |
| 634 | else |
| 635 | lc_push_with_clique_if_a_chunk_ptr(ptr, clique); |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 636 | } |
| 637 | |
sewardj | 45d94cc | 2005-04-20 14:44:11 +0000 | [diff] [blame] | 638 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 639 | static jmp_buf memscan_jmpbuf; |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 640 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 641 | static |
| 642 | void scan_all_valid_memory_catcher ( Int sigNo, Addr addr ) |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 643 | { |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 644 | if (0) |
| 645 | VG_(printf)("OUCH! sig=%d addr=%#lx\n", sigNo, addr); |
| 646 | if (sigNo == VKI_SIGSEGV || sigNo == VKI_SIGBUS) |
| 647 | __builtin_longjmp(memscan_jmpbuf, 1); |
| 648 | } |
| 649 | |
| 650 | // Scan a block of memory between [start, start+len). This range may |
| 651 | // be bogus, inaccessable, or otherwise strange; we deal with it. For each |
| 652 | // valid aligned word we assume it's a pointer to a chunk a push the chunk |
| 653 | // onto the mark stack if so. |
| 654 | static void |
| 655 | lc_scan_memory(Addr start, SizeT len, Bool is_prior_definite, Int clique) |
| 656 | { |
| 657 | Addr ptr = VG_ROUNDUP(start, sizeof(Addr)); |
njn | 13bfd85 | 2005-06-02 03:52:53 +0000 | [diff] [blame] | 658 | Addr end = VG_ROUNDDN(start+len, sizeof(Addr)); |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 659 | vki_sigset_t sigmask; |
| 660 | |
| 661 | if (VG_DEBUG_LEAKCHECK) |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 662 | VG_(printf)("scan %#lx-%#lx (%lu)\n", start, end, len); |
| 663 | |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 664 | VG_(sigprocmask)(VKI_SIG_SETMASK, NULL, &sigmask); |
njn | 695c16e | 2005-03-27 03:40:28 +0000 | [diff] [blame] | 665 | VG_(set_fault_catcher)(scan_all_valid_memory_catcher); |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 666 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 667 | // We might be in the middle of a page. Do a cheap check to see if |
| 668 | // it's valid; if not, skip onto the next page. |
sewardj | 45f4e7c | 2005-09-27 19:20:21 +0000 | [diff] [blame] | 669 | if (!VG_(am_is_valid_for_client)(ptr, sizeof(Addr), VKI_PROT_READ)) |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 670 | ptr = VG_PGROUNDUP(ptr+1); // First page is bad - skip it. |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 671 | |
sewardj | 05fe85e | 2005-04-27 22:46:36 +0000 | [diff] [blame] | 672 | while (ptr < end) { |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 673 | Addr addr; |
| 674 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 675 | // Skip invalid chunks. |
| 676 | if ( ! MC_(is_within_valid_secondary)(ptr) ) { |
| 677 | ptr = VG_ROUNDUP(ptr+1, SM_SIZE); |
| 678 | continue; |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 679 | } |
| 680 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 681 | // Look to see if this page seems reasonable. |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 682 | if ((ptr % VKI_PAGE_SIZE) == 0) { |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 683 | if (!VG_(am_is_valid_for_client)(ptr, sizeof(Addr), VKI_PROT_READ)) { |
| 684 | ptr += VKI_PAGE_SIZE; // Bad page - skip it. |
| 685 | continue; |
| 686 | } |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 687 | } |
| 688 | |
| 689 | if (__builtin_setjmp(memscan_jmpbuf) == 0) { |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 690 | if ( MC_(is_valid_aligned_word)(ptr) ) { |
| 691 | lc_scanned_szB += sizeof(Addr); |
| 692 | addr = *(Addr *)ptr; |
| 693 | // If we get here, the scanned word is in valid memory. Now |
| 694 | // let's see if its contents point to a chunk. |
| 695 | lc_push_if_a_chunk_ptr(addr, clique, is_prior_definite); |
| 696 | } else if (0 && VG_DEBUG_LEAKCHECK) { |
| 697 | VG_(printf)("%#lx not valid\n", ptr); |
| 698 | } |
| 699 | ptr += sizeof(Addr); |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 700 | } else { |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 701 | // We need to restore the signal mask, because we were |
| 702 | // longjmped out of a signal handler. |
| 703 | VG_(sigprocmask)(VKI_SIG_SETMASK, &sigmask, NULL); |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 704 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 705 | ptr = VG_PGROUNDUP(ptr+1); // Bad page - skip it. |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 706 | } |
| 707 | } |
| 708 | |
| 709 | VG_(sigprocmask)(VKI_SIG_SETMASK, &sigmask, NULL); |
| 710 | VG_(set_fault_catcher)(NULL); |
| 711 | } |
| 712 | |
sewardj | 45d94cc | 2005-04-20 14:44:11 +0000 | [diff] [blame] | 713 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 714 | // Process the mark stack until empty. |
| 715 | static void lc_process_markstack(Int clique) |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 716 | { |
njn | e3675d6 | 2009-05-19 02:08:25 +0000 | [diff] [blame] | 717 | Int top = -1; // shut gcc up |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 718 | Bool is_prior_definite; |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 719 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 720 | while (lc_pop(&top)) { |
tom | 1d0f3f6 | 2010-10-04 20:55:21 +0000 | [diff] [blame] | 721 | tl_assert(top >= 0 && top < lc_n_chunks); |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 722 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 723 | // See comment about 'is_prior_definite' at the top to understand this. |
| 724 | is_prior_definite = ( Possible != lc_extras[top].state ); |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 725 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 726 | lc_scan_memory(lc_chunks[top]->data, lc_chunks[top]->szB, |
| 727 | is_prior_definite, clique); |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 728 | } |
| 729 | } |
| 730 | |
njn | 29a5c01 | 2009-05-06 06:15:55 +0000 | [diff] [blame] | 731 | static Word cmp_LossRecordKey_LossRecord(const void* key, const void* elem) |
| 732 | { |
| 733 | LossRecordKey* a = (LossRecordKey*)key; |
| 734 | LossRecordKey* b = &(((LossRecord*)elem)->key); |
| 735 | |
| 736 | // Compare on states first because that's fast. |
| 737 | if (a->state < b->state) return -1; |
| 738 | if (a->state > b->state) return 1; |
| 739 | // Ok, the states are equal. Now compare the locations, which is slower. |
| 740 | if (VG_(eq_ExeContext)( |
| 741 | MC_(clo_leak_resolution), a->allocated_at, b->allocated_at)) |
| 742 | return 0; |
| 743 | // Different locations. Ordering is arbitrary, just use the ec pointer. |
| 744 | if (a->allocated_at < b->allocated_at) return -1; |
| 745 | if (a->allocated_at > b->allocated_at) return 1; |
| 746 | VG_(tool_panic)("bad LossRecord comparison"); |
| 747 | } |
| 748 | |
| 749 | static Int cmp_LossRecords(void* va, void* vb) |
| 750 | { |
| 751 | LossRecord* lr_a = *(LossRecord**)va; |
| 752 | LossRecord* lr_b = *(LossRecord**)vb; |
| 753 | SizeT total_szB_a = lr_a->szB + lr_a->indirect_szB; |
| 754 | SizeT total_szB_b = lr_b->szB + lr_b->indirect_szB; |
| 755 | |
| 756 | // First compare by sizes. |
| 757 | if (total_szB_a < total_szB_b) return -1; |
| 758 | if (total_szB_a > total_szB_b) return 1; |
| 759 | // If size are equal, compare by states. |
| 760 | if (lr_a->key.state < lr_b->key.state) return -1; |
| 761 | if (lr_a->key.state > lr_b->key.state) return 1; |
njn | e10c7f8 | 2009-05-06 06:52:47 +0000 | [diff] [blame] | 762 | // If they're still equal here, it doesn't matter that much, but we keep |
| 763 | // comparing other things so that regtests are as deterministic as |
| 764 | // possible. So: compare num_blocks. |
| 765 | if (lr_a->num_blocks < lr_b->num_blocks) return -1; |
| 766 | if (lr_a->num_blocks > lr_b->num_blocks) return 1; |
| 767 | // Finally, compare ExeContext addresses... older ones are likely to have |
| 768 | // lower addresses. |
| 769 | if (lr_a->key.allocated_at < lr_b->key.allocated_at) return -1; |
| 770 | if (lr_a->key.allocated_at > lr_b->key.allocated_at) return 1; |
njn | 29a5c01 | 2009-05-06 06:15:55 +0000 | [diff] [blame] | 771 | return 0; |
| 772 | } |
| 773 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 774 | static void print_results(ThreadId tid, Bool is_full_check) |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 775 | { |
njn | 29a5c01 | 2009-05-06 06:15:55 +0000 | [diff] [blame] | 776 | Int i, n_lossrecords; |
| 777 | OSet* lr_table; |
| 778 | LossRecord** lr_array; |
| 779 | LossRecord* lr; |
| 780 | Bool is_suppressed; |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 781 | |
njn | 29a5c01 | 2009-05-06 06:15:55 +0000 | [diff] [blame] | 782 | // Create the lr_table, which holds the loss records. |
| 783 | lr_table = |
| 784 | VG_(OSetGen_Create)(offsetof(LossRecord, key), |
| 785 | cmp_LossRecordKey_LossRecord, |
| 786 | VG_(malloc), "mc.pr.1", |
| 787 | VG_(free)); |
| 788 | |
| 789 | // Convert the chunks into loss records, merging them where appropriate. |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 790 | for (i = 0; i < lc_n_chunks; i++) { |
njn | 29a5c01 | 2009-05-06 06:15:55 +0000 | [diff] [blame] | 791 | MC_Chunk* ch = lc_chunks[i]; |
| 792 | LC_Extra* ex = &(lc_extras)[i]; |
| 793 | LossRecord* old_lr; |
| 794 | LossRecordKey lrkey; |
| 795 | lrkey.state = ex->state; |
| 796 | lrkey.allocated_at = ch->where; |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 797 | |
njn | 29a5c01 | 2009-05-06 06:15:55 +0000 | [diff] [blame] | 798 | old_lr = VG_(OSetGen_Lookup)(lr_table, &lrkey); |
| 799 | if (old_lr) { |
| 800 | // We found an existing loss record matching this chunk. Update the |
| 801 | // loss record's details in-situ. This is safe because we don't |
| 802 | // change the elements used as the OSet key. |
| 803 | old_lr->szB += ch->szB; |
| 804 | old_lr->indirect_szB += ex->indirect_szB; |
| 805 | old_lr->num_blocks++; |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 806 | } else { |
njn | 29a5c01 | 2009-05-06 06:15:55 +0000 | [diff] [blame] | 807 | // No existing loss record matches this chunk. Create a new loss |
| 808 | // record, initialise it from the chunk, and insert it into lr_table. |
| 809 | lr = VG_(OSetGen_AllocNode)(lr_table, sizeof(LossRecord)); |
| 810 | lr->key = lrkey; |
| 811 | lr->szB = ch->szB; |
| 812 | lr->indirect_szB = ex->indirect_szB; |
| 813 | lr->num_blocks = 1; |
| 814 | VG_(OSetGen_Insert)(lr_table, lr); |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 815 | } |
| 816 | } |
njn | 29a5c01 | 2009-05-06 06:15:55 +0000 | [diff] [blame] | 817 | n_lossrecords = VG_(OSetGen_Size)(lr_table); |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 818 | |
njn | 29a5c01 | 2009-05-06 06:15:55 +0000 | [diff] [blame] | 819 | // Create an array of pointers to the loss records. |
| 820 | lr_array = VG_(malloc)("mc.pr.2", n_lossrecords * sizeof(LossRecord*)); |
| 821 | i = 0; |
| 822 | VG_(OSetGen_ResetIter)(lr_table); |
| 823 | while ( (lr = VG_(OSetGen_Next)(lr_table)) ) { |
| 824 | lr_array[i++] = lr; |
| 825 | } |
| 826 | tl_assert(i == n_lossrecords); |
| 827 | |
| 828 | // Sort the array by loss record sizes. |
| 829 | VG_(ssort)(lr_array, n_lossrecords, sizeof(LossRecord*), |
| 830 | cmp_LossRecords); |
| 831 | |
| 832 | // Zero totals. |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 833 | MC_(blocks_leaked) = MC_(bytes_leaked) = 0; |
| 834 | MC_(blocks_indirect) = MC_(bytes_indirect) = 0; |
| 835 | MC_(blocks_dubious) = MC_(bytes_dubious) = 0; |
| 836 | MC_(blocks_reachable) = MC_(bytes_reachable) = 0; |
| 837 | MC_(blocks_suppressed) = MC_(bytes_suppressed) = 0; |
| 838 | |
njn | 29a5c01 | 2009-05-06 06:15:55 +0000 | [diff] [blame] | 839 | // Print the loss records (in size order) and collect summary stats. |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 840 | for (i = 0; i < n_lossrecords; i++) { |
njn | 18afe5d | 2009-08-10 08:25:39 +0000 | [diff] [blame] | 841 | Bool count_as_error, print_record; |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 842 | // Rules for printing: |
| 843 | // - We don't show suppressed loss records ever (and that's controlled |
| 844 | // within the error manager). |
| 845 | // - We show non-suppressed loss records that are not "reachable" if |
| 846 | // --leak-check=yes. |
| 847 | // - We show all non-suppressed loss records if --leak-check=yes and |
| 848 | // --show-reachable=yes. |
| 849 | // |
| 850 | // Nb: here "reachable" means Reachable *or* IndirectLeak; note that |
| 851 | // this is different to "still reachable" used elsewhere because it |
| 852 | // includes indirectly lost blocks! |
| 853 | // |
njn | 29a5c01 | 2009-05-06 06:15:55 +0000 | [diff] [blame] | 854 | lr = lr_array[i]; |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 855 | print_record = is_full_check && |
njn | 2667055 | 2009-08-13 00:02:30 +0000 | [diff] [blame] | 856 | ( MC_(clo_show_reachable) || |
| 857 | Unreached == lr->key.state || |
bart | 3cedf57 | 2010-08-26 10:56:27 +0000 | [diff] [blame] | 858 | ( MC_(clo_show_possibly_lost) && |
| 859 | Possible == lr->key.state ) ); |
njn | 2667055 | 2009-08-13 00:02:30 +0000 | [diff] [blame] | 860 | // We don't count a leaks as errors with --leak-check=summary. |
| 861 | // Otherwise you can get high error counts with few or no error |
| 862 | // messages, which can be confusing. Also, you could argue that |
| 863 | // indirect leaks should be counted as errors, but it seems better to |
| 864 | // make the counting criteria similar to the printing criteria. So we |
| 865 | // don't count them. |
| 866 | count_as_error = is_full_check && |
| 867 | ( Unreached == lr->key.state || |
| 868 | Possible == lr->key.state ); |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 869 | is_suppressed = |
njn | 18afe5d | 2009-08-10 08:25:39 +0000 | [diff] [blame] | 870 | MC_(record_leak_error) ( tid, i+1, n_lossrecords, lr, print_record, |
| 871 | count_as_error ); |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 872 | |
| 873 | if (is_suppressed) { |
njn | 29a5c01 | 2009-05-06 06:15:55 +0000 | [diff] [blame] | 874 | MC_(blocks_suppressed) += lr->num_blocks; |
| 875 | MC_(bytes_suppressed) += lr->szB; |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 876 | |
njn | 29a5c01 | 2009-05-06 06:15:55 +0000 | [diff] [blame] | 877 | } else if (Unreached == lr->key.state) { |
| 878 | MC_(blocks_leaked) += lr->num_blocks; |
| 879 | MC_(bytes_leaked) += lr->szB; |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 880 | |
njn | 29a5c01 | 2009-05-06 06:15:55 +0000 | [diff] [blame] | 881 | } else if (IndirectLeak == lr->key.state) { |
| 882 | MC_(blocks_indirect) += lr->num_blocks; |
| 883 | MC_(bytes_indirect) += lr->szB; |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 884 | |
njn | 29a5c01 | 2009-05-06 06:15:55 +0000 | [diff] [blame] | 885 | } else if (Possible == lr->key.state) { |
| 886 | MC_(blocks_dubious) += lr->num_blocks; |
| 887 | MC_(bytes_dubious) += lr->szB; |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 888 | |
njn | 29a5c01 | 2009-05-06 06:15:55 +0000 | [diff] [blame] | 889 | } else if (Reachable == lr->key.state) { |
| 890 | MC_(blocks_reachable) += lr->num_blocks; |
| 891 | MC_(bytes_reachable) += lr->szB; |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 892 | |
| 893 | } else { |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 894 | VG_(tool_panic)("unknown loss mode"); |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 895 | } |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 896 | } |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 897 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 898 | if (VG_(clo_verbosity) > 0 && !VG_(clo_xml)) { |
sewardj | 6b523cd | 2009-07-15 14:49:40 +0000 | [diff] [blame] | 899 | VG_(umsg)("LEAK SUMMARY:\n"); |
njn | b6267bd | 2009-08-12 00:14:16 +0000 | [diff] [blame] | 900 | VG_(umsg)(" definitely lost: %'lu bytes in %'lu blocks\n", |
sewardj | 6b523cd | 2009-07-15 14:49:40 +0000 | [diff] [blame] | 901 | MC_(bytes_leaked), MC_(blocks_leaked) ); |
njn | b6267bd | 2009-08-12 00:14:16 +0000 | [diff] [blame] | 902 | VG_(umsg)(" indirectly lost: %'lu bytes in %'lu blocks\n", |
sewardj | 6b523cd | 2009-07-15 14:49:40 +0000 | [diff] [blame] | 903 | MC_(bytes_indirect), MC_(blocks_indirect) ); |
njn | b6267bd | 2009-08-12 00:14:16 +0000 | [diff] [blame] | 904 | VG_(umsg)(" possibly lost: %'lu bytes in %'lu blocks\n", |
sewardj | 6b523cd | 2009-07-15 14:49:40 +0000 | [diff] [blame] | 905 | MC_(bytes_dubious), MC_(blocks_dubious) ); |
njn | b6267bd | 2009-08-12 00:14:16 +0000 | [diff] [blame] | 906 | VG_(umsg)(" still reachable: %'lu bytes in %'lu blocks\n", |
sewardj | 6b523cd | 2009-07-15 14:49:40 +0000 | [diff] [blame] | 907 | MC_(bytes_reachable), MC_(blocks_reachable) ); |
njn | b6267bd | 2009-08-12 00:14:16 +0000 | [diff] [blame] | 908 | VG_(umsg)(" suppressed: %'lu bytes in %'lu blocks\n", |
sewardj | 6b523cd | 2009-07-15 14:49:40 +0000 | [diff] [blame] | 909 | MC_(bytes_suppressed), MC_(blocks_suppressed) ); |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 910 | if (!is_full_check && |
| 911 | (MC_(blocks_leaked) + MC_(blocks_indirect) + |
| 912 | MC_(blocks_dubious) + MC_(blocks_reachable)) > 0) { |
sewardj | 6b523cd | 2009-07-15 14:49:40 +0000 | [diff] [blame] | 913 | VG_(umsg)("Rerun with --leak-check=full to see details " |
njn | b6267bd | 2009-08-12 00:14:16 +0000 | [diff] [blame] | 914 | "of leaked memory\n"); |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 915 | } |
| 916 | if (is_full_check && |
| 917 | MC_(blocks_reachable) > 0 && !MC_(clo_show_reachable)) |
| 918 | { |
sewardj | 6b523cd | 2009-07-15 14:49:40 +0000 | [diff] [blame] | 919 | VG_(umsg)("Reachable blocks (those to which a pointer " |
| 920 | "was found) are not shown.\n"); |
| 921 | VG_(umsg)("To see them, rerun with: --leak-check=full " |
| 922 | "--show-reachable=yes\n"); |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 923 | } |
njn | b6267bd | 2009-08-12 00:14:16 +0000 | [diff] [blame] | 924 | VG_(umsg)("\n"); |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 925 | } |
| 926 | } |
| 927 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 928 | /*------------------------------------------------------------*/ |
| 929 | /*--- Top-level entry point. ---*/ |
| 930 | /*------------------------------------------------------------*/ |
sewardj | 3cf26a5 | 2006-07-27 23:48:53 +0000 | [diff] [blame] | 931 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 932 | void MC_(detect_memory_leaks) ( ThreadId tid, LeakCheckMode mode ) |
njn | 43c799e | 2003-04-08 00:08:52 +0000 | [diff] [blame] | 933 | { |
njn | b965efb | 2009-08-10 07:36:54 +0000 | [diff] [blame] | 934 | Int i, j; |
njn | 43c799e | 2003-04-08 00:08:52 +0000 | [diff] [blame] | 935 | |
sewardj | 76754cf | 2005-03-14 00:14:04 +0000 | [diff] [blame] | 936 | tl_assert(mode != LC_Off); |
njn | 43c799e | 2003-04-08 00:08:52 +0000 | [diff] [blame] | 937 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 938 | // Get the chunks, stop if there were none. |
| 939 | lc_chunks = find_active_chunks(&lc_n_chunks); |
| 940 | if (lc_n_chunks == 0) { |
| 941 | tl_assert(lc_chunks == NULL); |
sewardj | 71bc3cb | 2005-05-19 00:25:45 +0000 | [diff] [blame] | 942 | if (VG_(clo_verbosity) >= 1 && !VG_(clo_xml)) { |
njn | b6267bd | 2009-08-12 00:14:16 +0000 | [diff] [blame] | 943 | VG_(umsg)("All heap blocks were freed -- no leaks are possible\n"); |
sewardj | 2d9e874 | 2009-08-07 15:46:56 +0000 | [diff] [blame] | 944 | VG_(umsg)("\n"); |
sewardj | 37d06f2 | 2003-09-17 21:48:26 +0000 | [diff] [blame] | 945 | } |
njn | 43c799e | 2003-04-08 00:08:52 +0000 | [diff] [blame] | 946 | return; |
| 947 | } |
| 948 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 949 | // Sort the array so blocks are in ascending order in memory. |
| 950 | VG_(ssort)(lc_chunks, lc_n_chunks, sizeof(VgHashNode*), compare_MC_Chunks); |
njn | 43c799e | 2003-04-08 00:08:52 +0000 | [diff] [blame] | 951 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 952 | // Sanity check -- make sure they're in order. |
| 953 | for (i = 0; i < lc_n_chunks-1; i++) { |
| 954 | tl_assert( lc_chunks[i]->data <= lc_chunks[i+1]->data); |
| 955 | } |
njn | 43c799e | 2003-04-08 00:08:52 +0000 | [diff] [blame] | 956 | |
njn | b965efb | 2009-08-10 07:36:54 +0000 | [diff] [blame] | 957 | // Sanity check -- make sure they don't overlap. The one exception is that |
| 958 | // we allow a MALLOCLIKE block to sit entirely within a malloc() block. |
| 959 | // This is for bug 100628. If this occurs, we ignore the malloc() block |
| 960 | // for leak-checking purposes. This is a hack and probably should be done |
| 961 | // better, but at least it's consistent with mempools (which are treated |
| 962 | // like this in find_active_chunks). Mempools have a separate VgHashTable |
| 963 | // for mempool chunks, but if custom-allocated blocks are put in a separate |
| 964 | // table from normal heap blocks it makes free-mismatch checking more |
| 965 | // difficult. |
| 966 | // |
| 967 | // If this check fails, it probably means that the application |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 968 | // has done something stupid with VALGRIND_MALLOCLIKE_BLOCK client |
njn | b965efb | 2009-08-10 07:36:54 +0000 | [diff] [blame] | 969 | // requests, eg. has made overlapping requests (which are |
| 970 | // nonsensical), or used VALGRIND_MALLOCLIKE_BLOCK for stack locations; |
| 971 | // again nonsensical. |
| 972 | // |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 973 | for (i = 0; i < lc_n_chunks-1; i++) { |
| 974 | MC_Chunk* ch1 = lc_chunks[i]; |
| 975 | MC_Chunk* ch2 = lc_chunks[i+1]; |
njn | b965efb | 2009-08-10 07:36:54 +0000 | [diff] [blame] | 976 | |
| 977 | Addr start1 = ch1->data; |
| 978 | Addr start2 = ch2->data; |
| 979 | Addr end1 = ch1->data + ch1->szB - 1; |
| 980 | Addr end2 = ch2->data + ch2->szB - 1; |
| 981 | Bool isCustom1 = ch1->allockind == MC_AllocCustom; |
| 982 | Bool isCustom2 = ch2->allockind == MC_AllocCustom; |
| 983 | |
| 984 | if (end1 < start2) { |
| 985 | // Normal case - no overlap. |
| 986 | |
| 987 | // We used to allow exact duplicates, I'm not sure why. --njn |
| 988 | //} else if (start1 == start2 && end1 == end2) { |
| 989 | // Degenerate case: exact duplicates. |
| 990 | |
| 991 | } else if (start1 >= start2 && end1 <= end2 && isCustom1 && !isCustom2) { |
| 992 | // Block i is MALLOCLIKE and entirely within block i+1. |
| 993 | // Remove block i+1. |
| 994 | for (j = i+1; j < lc_n_chunks-1; j++) { |
| 995 | lc_chunks[j] = lc_chunks[j+1]; |
| 996 | } |
| 997 | lc_n_chunks--; |
| 998 | |
| 999 | } else if (start2 >= start1 && end2 <= end1 && isCustom2 && !isCustom1) { |
| 1000 | // Block i+1 is MALLOCLIKE and entirely within block i. |
| 1001 | // Remove block i. |
| 1002 | for (j = i; j < lc_n_chunks-1; j++) { |
| 1003 | lc_chunks[j] = lc_chunks[j+1]; |
| 1004 | } |
| 1005 | lc_n_chunks--; |
| 1006 | |
| 1007 | } else { |
| 1008 | VG_(umsg)("Block 0x%lx..0x%lx overlaps with block 0x%lx..0x%lx", |
| 1009 | start1, end1, start1, end2); |
| 1010 | VG_(umsg)("This is usually caused by using VALGRIND_MALLOCLIKE_BLOCK"); |
| 1011 | VG_(umsg)("in an inappropriate way."); |
| 1012 | tl_assert (0); |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 1013 | } |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 1014 | } |
| 1015 | |
| 1016 | // Initialise lc_extras. |
| 1017 | lc_extras = VG_(malloc)( "mc.dml.2", lc_n_chunks * sizeof(LC_Extra) ); |
| 1018 | for (i = 0; i < lc_n_chunks; i++) { |
| 1019 | lc_extras[i].state = Unreached; |
tom | 1d0f3f6 | 2010-10-04 20:55:21 +0000 | [diff] [blame] | 1020 | lc_extras[i].pending = False; |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 1021 | lc_extras[i].indirect_szB = 0; |
| 1022 | } |
| 1023 | |
| 1024 | // Initialise lc_markstack. |
| 1025 | lc_markstack = VG_(malloc)( "mc.dml.2", lc_n_chunks * sizeof(Int) ); |
| 1026 | for (i = 0; i < lc_n_chunks; i++) { |
| 1027 | lc_markstack[i] = -1; |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 1028 | } |
| 1029 | lc_markstack_top = -1; |
njn | 43c799e | 2003-04-08 00:08:52 +0000 | [diff] [blame] | 1030 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 1031 | // Verbosity. |
sewardj | 2d9e874 | 2009-08-07 15:46:56 +0000 | [diff] [blame] | 1032 | if (VG_(clo_verbosity) > 1 && !VG_(clo_xml)) { |
njn | b6267bd | 2009-08-12 00:14:16 +0000 | [diff] [blame] | 1033 | VG_(umsg)( "Searching for pointers to %'d not-freed blocks\n", |
sewardj | 6b523cd | 2009-07-15 14:49:40 +0000 | [diff] [blame] | 1034 | lc_n_chunks ); |
sewardj | 2d9e874 | 2009-08-07 15:46:56 +0000 | [diff] [blame] | 1035 | } |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 1036 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 1037 | // Scan the memory root-set, pushing onto the mark stack any blocks |
| 1038 | // pointed to. |
| 1039 | { |
| 1040 | Int n_seg_starts; |
njn | ac1e033 | 2009-05-08 00:39:31 +0000 | [diff] [blame] | 1041 | Addr* seg_starts = VG_(get_segment_starts)( &n_seg_starts ); |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 1042 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 1043 | tl_assert(seg_starts && n_seg_starts > 0); |
sewardj | de3ad73 | 2006-07-27 23:12:17 +0000 | [diff] [blame] | 1044 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 1045 | lc_scanned_szB = 0; |
sewardj | de3ad73 | 2006-07-27 23:12:17 +0000 | [diff] [blame] | 1046 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 1047 | // VG_(am_show_nsegments)( 0, "leakcheck"); |
| 1048 | for (i = 0; i < n_seg_starts; i++) { |
| 1049 | SizeT seg_size; |
| 1050 | NSegment const* seg = VG_(am_find_nsegment)( seg_starts[i] ); |
| 1051 | tl_assert(seg); |
| 1052 | |
| 1053 | if (seg->kind != SkFileC && seg->kind != SkAnonC) continue; |
| 1054 | if (!(seg->hasR && seg->hasW)) continue; |
| 1055 | if (seg->isCH) continue; |
| 1056 | |
| 1057 | // Don't poke around in device segments as this may cause |
| 1058 | // hangs. Exclude /dev/zero just in case someone allocated |
| 1059 | // memory by explicitly mapping /dev/zero. |
| 1060 | if (seg->kind == SkFileC |
| 1061 | && (VKI_S_ISCHR(seg->mode) || VKI_S_ISBLK(seg->mode))) { |
| 1062 | HChar* dev_name = VG_(am_get_filename)( (NSegment*)seg ); |
| 1063 | if (dev_name && 0 == VG_(strcmp)(dev_name, "/dev/zero")) { |
| 1064 | // Don't skip /dev/zero. |
| 1065 | } else { |
| 1066 | // Skip this device mapping. |
| 1067 | continue; |
| 1068 | } |
| 1069 | } |
| 1070 | |
| 1071 | if (0) |
| 1072 | VG_(printf)("ACCEPT %2d %#lx %#lx\n", i, seg->start, seg->end); |
| 1073 | |
| 1074 | // Scan the segment. We use -1 for the clique number, because this |
| 1075 | // is a root-set. |
| 1076 | seg_size = seg->end - seg->start + 1; |
| 1077 | if (VG_(clo_verbosity) > 2) { |
| 1078 | VG_(message)(Vg_DebugMsg, |
sewardj | 6b523cd | 2009-07-15 14:49:40 +0000 | [diff] [blame] | 1079 | " Scanning root segment: %#lx..%#lx (%lu)\n", |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 1080 | seg->start, seg->end, seg_size); |
| 1081 | } |
| 1082 | lc_scan_memory(seg->start, seg_size, /*is_prior_definite*/True, -1); |
| 1083 | } |
sewardj | 45f4e7c | 2005-09-27 19:20:21 +0000 | [diff] [blame] | 1084 | } |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 1085 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 1086 | // Scan GP registers for chunk pointers. |
| 1087 | VG_(apply_to_GP_regs)(lc_push_if_a_chunk_ptr_register); |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 1088 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 1089 | // Process the pushed blocks. After this, every block that is reachable |
| 1090 | // from the root-set has been traced. |
| 1091 | lc_process_markstack(/*clique*/-1); |
njn | 43c799e | 2003-04-08 00:08:52 +0000 | [diff] [blame] | 1092 | |
njn | b6267bd | 2009-08-12 00:14:16 +0000 | [diff] [blame] | 1093 | if (VG_(clo_verbosity) > 1 && !VG_(clo_xml)) { |
| 1094 | VG_(umsg)("Checked %'lu bytes\n", lc_scanned_szB); |
| 1095 | VG_(umsg)( "\n" ); |
| 1096 | } |
njn | 43c799e | 2003-04-08 00:08:52 +0000 | [diff] [blame] | 1097 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 1098 | // Trace all the leaked blocks to determine which are directly leaked and |
| 1099 | // which are indirectly leaked. For each Unreached block, push it onto |
| 1100 | // the mark stack, and find all the as-yet-Unreached blocks reachable |
| 1101 | // from it. These form a clique and are marked IndirectLeak, and their |
| 1102 | // size is added to the clique leader's indirect size. If one of the |
| 1103 | // found blocks was itself a clique leader (from a previous clique), then |
| 1104 | // the cliques are merged. |
| 1105 | for (i = 0; i < lc_n_chunks; i++) { |
| 1106 | MC_Chunk* ch = lc_chunks[i]; |
| 1107 | LC_Extra* ex = &(lc_extras[i]); |
njn | 43c799e | 2003-04-08 00:08:52 +0000 | [diff] [blame] | 1108 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 1109 | if (VG_DEBUG_CLIQUE) |
| 1110 | VG_(printf)("cliques: %d at %#lx -> Loss state %d\n", |
| 1111 | i, ch->data, ex->state); |
njn | 43c799e | 2003-04-08 00:08:52 +0000 | [diff] [blame] | 1112 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 1113 | tl_assert(lc_markstack_top == -1); |
| 1114 | |
| 1115 | if (ex->state == Unreached) { |
| 1116 | if (VG_DEBUG_CLIQUE) |
| 1117 | VG_(printf)("%d: gathering clique %#lx\n", i, ch->data); |
| 1118 | |
| 1119 | // Push this Unreached block onto the stack and process it. |
| 1120 | lc_push(i, ch); |
| 1121 | lc_process_markstack(i); |
| 1122 | |
| 1123 | tl_assert(lc_markstack_top == -1); |
| 1124 | tl_assert(ex->state == Unreached); |
nethercote | 0f19bce | 2003-12-02 10:17:44 +0000 | [diff] [blame] | 1125 | } |
njn | 43c799e | 2003-04-08 00:08:52 +0000 | [diff] [blame] | 1126 | } |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 1127 | |
| 1128 | print_results( tid, ( mode == LC_Full ? True : False ) ); |
njn | 43c799e | 2003-04-08 00:08:52 +0000 | [diff] [blame] | 1129 | |
njn | 8225cc0 | 2009-03-09 22:52:24 +0000 | [diff] [blame] | 1130 | VG_(free) ( lc_chunks ); |
| 1131 | VG_(free) ( lc_extras ); |
sewardj | b5f6f51 | 2005-03-10 23:59:00 +0000 | [diff] [blame] | 1132 | VG_(free) ( lc_markstack ); |
njn | 43c799e | 2003-04-08 00:08:52 +0000 | [diff] [blame] | 1133 | } |
| 1134 | |
| 1135 | /*--------------------------------------------------------------------*/ |
njn | 1d0825f | 2006-03-27 11:37:07 +0000 | [diff] [blame] | 1136 | /*--- end ---*/ |
njn | 43c799e | 2003-04-08 00:08:52 +0000 | [diff] [blame] | 1137 | /*--------------------------------------------------------------------*/ |
| 1138 | |