/*--------------------------------------------------------------------*/ /*--- Basic definitions for all of Helgrind. ---*/ /*--- hg_basics.h ---*/ /*--------------------------------------------------------------------*/ /* This file is part of Helgrind, a Valgrind tool for detecting errors in threaded programs. Copyright (C) 2007-2017 OpenWorks Ltd info@open-works.co.uk This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, see . The GNU General Public License is contained in the file COPYING. */ #ifndef __HG_BASICS_H #define __HG_BASICS_H /*----------------------------------------------------------------*/ /*--- Very basic stuff ---*/ /*----------------------------------------------------------------*/ #define HG_(str) VGAPPEND(vgHelgrind_,str) void* HG_(zalloc) ( const HChar* cc, SizeT n ); void HG_(free) ( void* p ); HChar* HG_(strdup) ( const HChar* cc, const HChar* s ); static inline Bool HG_(is_sane_ThreadId) ( ThreadId coretid ) { return coretid >= 0 && coretid < VG_N_THREADS; } /*----------------------------------------------------------------*/ /*--- Command line options ---*/ /*----------------------------------------------------------------*/ /* Flags for controlling for which events sanity checking is done */ #define SCE_THREADS (1<<0) // Sanity check at thread create/join #define SCE_LOCKS (1<<1) // Sanity check at lock events #define SCE_BIGRANGE (1<<2) // Sanity check at big mem range events #define SCE_ACCESS (1<<3) // Sanity check at mem accesses #define SCE_LAOG (1<<4) // Sanity check at significant LAOG events #define SCE_BIGRANGE_T 256 // big mem range minimum size /* Enable/disable lock order checking. Sometimes it produces a lot of errors, possibly genuine, which nevertheless can be very annoying. */ extern Bool HG_(clo_track_lockorders); /* When comparing race errors for equality, should the race address be taken into account? For users, no, but for verification purposes (regtesting) this is sometimes important. */ extern Bool HG_(clo_cmp_race_err_addrs); /* Controls how much history to collect, in order to show conflicting accesses. There are three levels: 0: "none": don't collect any history. Fastest, but means we can only show one of the two stacks in a race. 1: "approx": collect one stack trace per (notional) segment, that is, collect a stack trace for a thread every time its vector clock changes. This facilitates showing the bounds of the conflicting segment(s), with relatively small overhead. 2: "full": collect a stack trace every time the constraints for a location change. This facilitates showing both stack traces in a race, although can be very expensive in time and space (depends on the rate that threads "drag" locations across vector-clock-change boundaries ("dragovers"). This involves collecting and storing large numbers of call stacks just in case we might need to show them later, and so is expensive (although very useful). */ extern UWord HG_(clo_history_level); /* For full history level, determines how the stack trace is computed. no : a stacktrace is always computed from scratch, typically using the unwind information. yes : a stacktrace might be derived from a previous captured stacktrace, by applying a delta to the inner frame. This can significantly speed up --history-level=full. Typically, a delta can be applied if there was no 'flow call control' instruction (call, return, ...) executed since the previous captured stacktrace. */ extern Bool HG_(clo_delta_stacktrace); /* When doing "full" history collection, this determines the size of the conflicting-access cache, measured in terms of maximum possible number of elements in the previous-access map. Must be between 10k amd 10 million. Default is 1 million. */ extern UWord HG_(clo_conflict_cache_size); /* Sanity check level. This is an or-ing of SCE_{THREADS,LOCKS,BIGRANGE,ACCESS,LAOG}. */ extern UWord HG_(clo_sanity_flags); /* Treat heap frees as if the memory was written immediately prior to the free. This shakes out races in which memory is referenced by one thread, and freed by another, and there's no observable synchronisation event to guarantee that the reference happens before the free. */ extern Bool HG_(clo_free_is_write); /* Controls the application of VTS pruning. There are three levels: 0: "never": VTS pruning is never done 1: "auto": (the default): VTS pruning is sometimes done after VTS GCs, just frequently enough to keep space use under control, as determined by heuristics in libhb_core.c. 2: "always": VTS pruning is done after every VTS GC. This is mostly a big time waster, but minimises space use. */ extern UWord HG_(clo_vts_pruning); /* When False, race checking ignores memory references which are to the stack, which speeds things up a bit. Default: True. */ extern Bool HG_(clo_check_stack_refs); #endif /* ! __HG_BASICS_H */ /*--------------------------------------------------------------------*/ /*--- end hg_basics.h ---*/ /*--------------------------------------------------------------------*/