| njn | 8df80b2 | 2009-03-02 05:11:06 +0000 | [diff] [blame] | 1 | // These counters are used to get a delta between leak counts at startup |
| 2 | // (eg. due to libc) and later on. Necessary to get reliable leak tests |
| 3 | // across different platforms. |
| 4 | #define DECLARE_LEAK_COUNTERS \ |
| 5 | long L0_bytes = 0, L_bytes = 0, L0_blocks = 0, L_blocks = 0; \ |
| 6 | long D0_bytes = 0, D_bytes = 0, D0_blocks = 0, D_blocks = 0; \ |
| 7 | long R0_bytes = 0, R_bytes = 0, R0_blocks = 0, R_blocks = 0; \ |
| 8 | long S0_bytes = 0, S_bytes = 0, S0_blocks = 0, S_blocks = 0 |
| 9 | |
| 10 | // Set a baseline, in case allocations have already happened. |
| 11 | #define GET_INITIAL_LEAK_COUNTS \ |
| 12 | do { \ |
| 13 | VALGRIND_DO_QUICK_LEAK_CHECK; \ |
| 14 | VALGRIND_COUNT_LEAKS( L0_bytes, D0_bytes, R0_bytes, S0_bytes );\ |
| 15 | VALGRIND_COUNT_LEAK_BLOCKS(L0_blocks, D0_blocks, R0_blocks, S0_blocks); \ |
| 16 | } while (0) |
| 17 | |
| 18 | // Set a baseline, in case allocations have already happened. |
| 19 | #define GET_FINAL_LEAK_COUNTS \ |
| 20 | do { \ |
| 21 | VALGRIND_DO_QUICK_LEAK_CHECK; \ |
| 22 | VALGRIND_COUNT_LEAKS( L_bytes, D_bytes, R_bytes, S_bytes ); \ |
| 23 | VALGRIND_COUNT_LEAK_BLOCKS(L_blocks, D_blocks, R_blocks, S_blocks); \ |
| 24 | L_bytes -= L0_bytes; L_blocks -= L0_blocks; \ |
| 25 | D_bytes -= D0_bytes; D_blocks -= D0_blocks; \ |
| 26 | R_bytes -= R0_bytes; R_blocks -= R0_blocks; \ |
| 27 | S_bytes -= S0_bytes; S_blocks -= S0_blocks; \ |
| 28 | } while (0) |
| 29 | |
| 30 | // Print leak counts. When used in conjunction with -q the normal counts |
| 31 | // aren't shown, which is what we want. |
| 32 | #define PRINT_LEAK_COUNTS(where) \ |
| 33 | do { \ |
| 34 | fprintf(where,"leaked: %3ld bytes in %2ld blocks\n", \ |
| 35 | L_bytes,L_blocks); \ |
| 36 | fprintf(where,"dubious: %3ld bytes in %2ld blocks\n", \ |
| 37 | D_bytes,D_blocks); \ |
| 38 | fprintf(where,"reachable: %3ld bytes in %2ld blocks\n", \ |
| 39 | R_bytes,R_blocks); \ |
| 40 | fprintf(where,"suppressed: %3ld bytes in %2ld blocks\n", \ |
| 41 | S_bytes,S_blocks); \ |
| 42 | } while (0) |
| 43 | |
| sewardj | a5dda3e | 2010-09-03 15:14:41 +0000 | [diff] [blame] | 44 | /* Upon a call to a function, some architectures store pointers into |
| 45 | * into registers. Valgrind may consider these registers when determining |
| 46 | * whether an address is reachable, so we need to zero-out these registers |
| 47 | * as needed. |
| 48 | */ |
| 49 | #if defined __powerpc__ |
| 50 | #define CLEAR_CALLER_SAVED_REGS \ |
| 51 | do { \ |
| 52 | __asm__ __volatile__( "li 3, 0" : : :/*trash*/"r3" ); \ |
| 53 | __asm__ __volatile__( "li 4, 0" : : :/*trash*/"r4" ); \ |
| 54 | __asm__ __volatile__( "li 5, 0" : : :/*trash*/"r5" ); \ |
| 55 | __asm__ __volatile__( "li 6, 0" : : :/*trash*/"r6" ); \ |
| 56 | __asm__ __volatile__( "li 7, 0" : : :/*trash*/"r7" ); \ |
| 57 | __asm__ __volatile__( "li 8, 0" : : :/*trash*/"r8" ); \ |
| 58 | __asm__ __volatile__( "li 9, 0" : : :/*trash*/"r9" ); \ |
| 59 | __asm__ __volatile__( "li 10, 0" : : :/*trash*/"r10" ); \ |
| 60 | __asm__ __volatile__( "li 11, 0" : : :/*trash*/"r11" ); \ |
| 61 | __asm__ __volatile__( "li 12, 0" : : :/*trash*/"r12" ); \ |
| 62 | } while (0) |
| Elliott Hughes | ed39800 | 2017-06-21 14:41:24 -0700 | [diff] [blame^] | 63 | #elif (__mips == 32) |
| 64 | #define CLEAR_CALLER_SAVED_REGS \ |
| 65 | do { \ |
| 66 | __asm__ __volatile__ (".set push \n\t" \ |
| 67 | ".set noat \n\t" \ |
| 68 | "move $1, $0 \n\t" /* at = 0 */ \ |
| 69 | "move $2, $0 \n\t" /* v0 = 0 */ \ |
| 70 | "move $3, $0 \n\t" /* v1 = 0 */ \ |
| 71 | "move $4, $0 \n\t" /* a0 = 0 */ \ |
| 72 | "move $5, $0 \n\t" /* a1 = 0 */ \ |
| 73 | "move $6, $0 \n\t" /* a2 = 0 */ \ |
| 74 | "move $7, $0 \n\t" /* a3 = 0 */ \ |
| 75 | "move $8, $0 \n\t" /* t0 = 0 */ \ |
| 76 | "move $9, $0 \n\t" /* t1 = 0 */ \ |
| 77 | "move $10, $0 \n\t" /* t2 = 0 */ \ |
| 78 | "move $11, $0 \n\t" /* t3 = 0 */ \ |
| 79 | "move $12, $0 \n\t" /* t4 = 0 */ \ |
| 80 | "move $13, $0 \n\t" /* t5 = 0 */ \ |
| 81 | "move $14, $0 \n\t" /* t6 = 0 */ \ |
| 82 | "move $15, $0 \n\t" /* t7 = 0 */ \ |
| 83 | "move $24, $0 \n\t" /* t8 = 0 */ \ |
| 84 | "move $25, $0 \n\t" /* t9 = 0 */ \ |
| 85 | ".set pop \n\t" \ |
| 86 | : : : "$1", "$2", "$3", "$4", "$5", "$6", "$7", \ |
| 87 | "$8", "$9", "$10", "$11", "$12", "$13", \ |
| 88 | "$14", "$15", "$24", "$25"); \ |
| 89 | } while (0) |
| 90 | #elif (__mips == 64) |
| 91 | #define CLEAR_CALLER_SAVED_REGS \ |
| 92 | do { \ |
| 93 | __asm__ __volatile__ (".set push \n\t" \ |
| 94 | ".set noat \n\t" \ |
| 95 | "move $1, $0 \n\t" /* at = 0 */ \ |
| 96 | "move $2, $0 \n\t" /* v0 = 0 */ \ |
| 97 | "move $3, $0 \n\t" /* v1 = 0 */ \ |
| 98 | "move $4, $0 \n\t" /* a0 = 0 */ \ |
| 99 | "move $5, $0 \n\t" /* a1 = 0 */ \ |
| 100 | "move $6, $0 \n\t" /* a2 = 0 */ \ |
| 101 | "move $7, $0 \n\t" /* a3 = 0 */ \ |
| 102 | "move $8, $0 \n\t" /* a4 = 0 */ \ |
| 103 | "move $9, $0 \n\t" /* a5 = 0 */ \ |
| 104 | "move $10, $0 \n\t" /* a6 = 0 */ \ |
| 105 | "move $11, $0 \n\t" /* a7 = 0 */ \ |
| 106 | "move $12, $0 \n\t" /* t0 = 0 */ \ |
| 107 | "move $13, $0 \n\t" /* t1 = 0 */ \ |
| 108 | "move $14, $0 \n\t" /* t2 = 0 */ \ |
| 109 | "move $15, $0 \n\t" /* t3 = 0 */ \ |
| 110 | "move $24, $0 \n\t" /* t8 = 0 */ \ |
| 111 | "move $25, $0 \n\t" /* t9 = 0 */ \ |
| 112 | ".set pop \n\t" \ |
| 113 | : : : "$1", "$2", "$3", "$4", "$5", "$6", "$7", \ |
| 114 | "$8", "$9", "$10", "$11", "$12", "$13", \ |
| 115 | "$14", "$15", "$24", "$25"); \ |
| 116 | } while (0) |
| sewardj | a5dda3e | 2010-09-03 15:14:41 +0000 | [diff] [blame] | 117 | #else |
| 118 | #define CLEAR_CALLER_SAVED_REGS /*nothing*/ |
| 119 | #endif |
| 120 | |
| 121 | |