mirror of
https://github.com/Zenithsiz/ftmemsim-valgrind.git
synced 2026-02-03 18:13:01 +00:00
461cc5c003
Sync VEX/LICENSE.GPL with top-level COPYING file. We used 3 different addresses for writing to the FSF to receive a copy of the GPL. Replace all different variants with an URL <http://www.gnu.org/licenses/>. The following files might still have some slightly different (L)GPL copyright notice because they were derived from other programs: - files under coregrind/m_demangle which come from libiberty: cplus-dem.c, d-demangle.c, demangle.h, rust-demangle.c, safe-ctype.c and safe-ctype.h - coregrind/m_demangle/dyn-string.[hc] derived from GCC. - coregrind/m_demangle/ansidecl.h derived from glibc. - VEX files for FMA detived from glibc: host_generic_maddf.h and host_generic_maddf.c - files under coregrin/m_debuginfo derived from LZO: lzoconf.h, lzodefs.h, minilzo-inl.c and minilzo.h - files under coregrind/m_gdbserver detived from GDB: gdb/signals.h, inferiors.c, regcache.c, regcache.h, regdef.h, remote-utils.c, server.c, server.h, signals.c, target.c, target.h and utils.c Plus the following test files: - none/tests/ppc32/testVMX.c derived from testVMX. - ppc tests derived from QEMU: jm-insns.c, ppc64_helpers.h and test_isa_3_0.c - tests derived from bzip2 (with embedded GPL text in code): hackedbz2.c, origin5-bz2.c, varinfo6.c - tests detived from glibc: str_tester.c, pth_atfork1.c - test detived from GCC libgomp: tc17_sembar.c - performance tests derived from bzip2 or tinycc (with embedded GPL text in code): bz2.c, test_input_for_tinycc.c and tinycc.c
83 lines
3.5 KiB
C
83 lines
3.5 KiB
C
|
|
/*--------------------------------------------------------------------*/
|
|
/*--- A mapping where the keys exactly cover the address space. ---*/
|
|
/*--- pub_tool_rangemap.h ---*/
|
|
/*--------------------------------------------------------------------*/
|
|
|
|
/*
|
|
This file is part of Valgrind, a dynamic binary instrumentation
|
|
framework.
|
|
|
|
Copyright (C) 2014-2017 Mozilla Foundation
|
|
|
|
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 <http://www.gnu.org/licenses/>.
|
|
|
|
The GNU General Public License is contained in the file COPYING.
|
|
*/
|
|
|
|
/* Contributed by Julian Seward <jseward@acm.org> */
|
|
|
|
#ifndef __PUB_TOOL_RANGEMAP_H
|
|
#define __PUB_TOOL_RANGEMAP_H
|
|
|
|
//--------------------------------------------------------------------
|
|
// PURPOSE: a mapping from the host machine word (UWord) ranges to
|
|
// arbitrary other UWord values. The set of ranges exactly covers all
|
|
// possible UWord values.
|
|
// --------------------------------------------------------------------
|
|
|
|
/* It's an abstract type. */
|
|
typedef struct _RangeMap RangeMap;
|
|
|
|
/* Create a new RangeMap, using given allocation and free functions.
|
|
alloc_fn must not return NULL (that is, if it returns it must have
|
|
succeeded.) The new array will contain a single range covering the
|
|
entire key space, which will be bound to the value |initialVal|.
|
|
This function never returns NULL. */
|
|
RangeMap* VG_(newRangeMap) ( Alloc_Fn_t alloc_fn,
|
|
const HChar* cc,
|
|
Free_Fn_t free_fn,
|
|
UWord initialVal );
|
|
|
|
/* Free all memory associated with a RangeMap. */
|
|
void VG_(deleteRangeMap) ( RangeMap* );
|
|
|
|
/* Bind the range [key_min, key_max] to val, overwriting any other
|
|
bindings existing in the range. Asserts if key_min > key_max. If
|
|
as a result of this addition, there come to be multiple adjacent
|
|
ranges with the same value, these ranges are merged together. Note
|
|
that this is slow: O(N) in the number of existing ranges. */
|
|
void VG_(bindRangeMap) ( RangeMap* rm,
|
|
UWord key_min, UWord key_max, UWord val );
|
|
|
|
/* Looks up |key| in the array and returns the associated value and
|
|
the key bounds. Can never fail since the RangeMap covers the
|
|
entire key space. This is fast: O(log N) in the number of
|
|
ranges. */
|
|
void VG_(lookupRangeMap) ( /*OUT*/UWord* key_min, /*OUT*/UWord* key_max,
|
|
/*OUT*/UWord* val, const RangeMap* rm, UWord key );
|
|
|
|
/* How many elements are there in the map? */
|
|
UInt VG_(sizeRangeMap) ( const RangeMap* rm );
|
|
|
|
/* Get the i'th component */
|
|
void VG_(indexRangeMap) ( /*OUT*/UWord* key_min, /*OUT*/UWord* key_max,
|
|
/*OUT*/UWord* val, const RangeMap* rm, Word ix );
|
|
|
|
#endif // __PUB_TOOL_RANGEMAP_H
|
|
|
|
/*--------------------------------------------------------------------*/
|
|
/*--- end pub_tool_rangemap.h ---*/
|
|
/*--------------------------------------------------------------------*/
|