Valgrind - Revision history

VHorvathova: /* When NOT to use Valgrind - what can it NOT find? */

2023-01-28T13:46:55Z

When NOT to use Valgrind - what can it NOT find?

← Older revision		Revision as of 13:46, 28 January 2023
Line 165:		Line 165:

	* Valgrind checks programs dynamically during execution		* Valgrind checks programs dynamically during execution
	* Does not report errors if no runtime error occurs for certain input values		* Does not report errors if no runtime error occurs for certain input values (even if the program contains errors)
	** Faulty memory accesses or memory leaks		** Faulty memory accesses or memory leaks
	* Even if the program contains errors
	* No bounds checking on static arrays (allocated on the stack)		* No bounds checking on static arrays (allocated on the stack)
	* No static stack/buffer/integer overflows/underflows		* No static stack/buffer/integer overflows/underflows
	* if you declare an array in a method, Valgrind does not warn about it		* if you declare an array in a method, Valgrind does not warn about it


	== References ==		== References ==

2023-01-28T13:46:11Z

@@ Line 161: / Line 161: @@
 * When bugs are suspected
 * Before a release
 == References ==

2023-01-28T13:45:08Z

← Older revision		Revision as of 13:45, 28 January 2023
Line 155:		Line 155:
	*Works with programs written in any language		*Works with programs written in any language

			== When to use Valgrind?==
			* Automatic Testing
			* After major code changes
			* When errors occur
			* When bugs are suspected
			* Before a release

	== References ==		== References ==

2023-01-28T13:44:13Z

@@ Line 142: / Line 142: @@
 * is a tool to examine how programs use their heap allocations
 * keeps track of the allocated blocks and examines each memory access to find out which block it refers to
 == References ==

2023-01-28T13:42:39Z

DHAT

← Older revision		Revision as of 13:42, 28 January 2023
Line 140:		Line 140:

	=== DHAT ===		=== DHAT ===
			* is a tool to examine how programs use their heap allocations
			* keeps track of the allocated blocks and examines each memory access to find out which block it refers to

	== References ==		== References ==

2023-01-28T13:42:14Z

DRD

← Older revision		Revision as of 13:42, 28 January 2023
Line 134:		Line 134:

	=== DRD ===		=== DRD ===
			* for detecting errors in multithreaded C and C++ programs
			* works for any program that uses the POSIX threading primitives
			* uses threading concepts based on the POSIX threading primitives
			* requires less memory than Helgrind to perform its analysis for most programs

	=== DHAT ===		=== DHAT ===

2023-01-28T13:41:40Z

Helgrind

← Older revision		Revision as of 13:41, 28 January 2023
Line 131:		Line 131:
	* is a thread debugger that detects data races (race conditions vulnerability) in multithreaded programs		* is a thread debugger that detects data races (race conditions vulnerability) in multithreaded programs
	* searches for memory locations that are accessed by more than one (POSIX p-)thread but for which no consistently used (pthread_mutex_) lock can be found		* searches for memory locations that are accessed by more than one (POSIX p-)thread but for which no consistently used (pthread_mutex_) lock can be found
	* is useful for any program that uses `pthreads`		* is useful for any program that uses pthreads

	=== DRD ===		=== DRD ===

2023-01-28T13:41:16Z

Helgrind

← Older revision		Revision as of 13:41, 28 January 2023
Line 129:		Line 129:

	=== Helgrind ===		=== Helgrind ===
			* is a thread debugger that detects data races (race conditions vulnerability) in multithreaded programs
			* searches for memory locations that are accessed by more than one (POSIX p-)thread but for which no consistently used (pthread_mutex_) lock can be found
			* is useful for any program that uses `pthreads`

	=== DRD ===		=== DRD ===

2023-01-28T13:40:19Z

Massif

← Older revision		Revision as of 13:40, 28 January 2023
Line 122:		Line 122:

	=== Massif ===		=== Massif ===
			* is a heap profiler
			* performs detailed heap profiling by taking snapshots of a program's heap on a regular basis
			* creates a graph showing heap usage over time, including information about which parts of the program are responsible for the most memory allocations
			* the graph is supplemented by a text or HTML file containing more information to determine where most memory is allocated
			* runs programs about 20 times slower than normal

	=== Helgrind ===		=== Helgrind ===

2023-01-28T13:39:18Z

Callgrind

← Older revision		Revision as of 13:39, 28 January 2023
Line 119:		Line 119:
	<li style="display: inline-block;"> [[File:4 valgrind jkdcvhj.jpg\|thumb\|none\|800px\|KCachegrind User Interface]] </li>		<li style="display: inline-block;"> [[File:4 valgrind jkdcvhj.jpg\|thumb\|none\|800px\|KCachegrind User Interface]] </li>
	</ul></div>		</ul></div>
			Here you can see the simulations of the I1, D1 and L2 caches in your CPU in a visualized, user-friendly format, to identify cache misses in your code faster.

	=== Massif ===		=== Massif ===