mirror of
https://github.com/Zenithsiz/ftmemsim-valgrind.git
synced 2026-02-03 10:05:29 +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
97 lines
3.8 KiB
C
97 lines
3.8 KiB
C
|
|
/*--------------------------------------------------------------------*/
|
|
/*--- An sparse array (of words) implementation. ---*/
|
|
/*--- pub_tool_sparsewa.h ---*/
|
|
/*--------------------------------------------------------------------*/
|
|
|
|
/*
|
|
This file is part of Valgrind, a dynamic binary instrumentation
|
|
framework.
|
|
|
|
Copyright (C) 2008-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 <http://www.gnu.org/licenses/>.
|
|
|
|
The GNU General Public License is contained in the file COPYING.
|
|
*/
|
|
|
|
#ifndef __PUB_TOOL_SPARSEWA_H
|
|
#define __PUB_TOOL_SPARSEWA_H
|
|
|
|
#include "pub_tool_basics.h" // UWord
|
|
|
|
//--------------------------------------------------------------------
|
|
// PURPOSE: (see coregrind/pub_core_sparsewa.h for details)
|
|
//--------------------------------------------------------------------
|
|
|
|
/////////////////////////////////////////////////////////
|
|
// //
|
|
// SparseWA: Interface //
|
|
// //
|
|
/////////////////////////////////////////////////////////
|
|
|
|
// This interface is a very cut-down version of WordFM.
|
|
// If you understand how to use WordFM then it should be
|
|
// trivial to use SparseWA.
|
|
|
|
typedef struct _SparseWA SparseWA; /* opaque */
|
|
|
|
// Create a new one, using the specified allocator/deallocator.
|
|
// Never returns NULL.
|
|
SparseWA* VG_(newSWA) ( void*(*alloc_nofail)(const HChar* cc, SizeT),
|
|
const HChar* cc,
|
|
void(*dealloc)(void*) );
|
|
|
|
// Delete one, and free all associated storage
|
|
void VG_(deleteSWA) ( SparseWA* swa );
|
|
|
|
// Add the binding key -> val to this swa. Any existing binding is
|
|
// overwritten. Returned Bool is True iff a previous binding existed.
|
|
Bool VG_(addToSWA) ( SparseWA* swa, UWord key, UWord val );
|
|
|
|
// Delete key from swa, returning val if found.
|
|
// Returned Bool is True iff the key was actually bound in the mapping.
|
|
Bool VG_(delFromSWA) ( SparseWA* swa,
|
|
/*OUT*/UWord* oldV,
|
|
UWord key );
|
|
|
|
// Indexes swa at 'key' (or, if you like, looks up 'key' in the
|
|
// mapping), and returns the associated value, if any, in *valP.
|
|
// Returned Bool is True iff a binding for 'key' actually existed.
|
|
Bool VG_(lookupSWA) ( const SparseWA* swa,
|
|
/*OUT*/UWord* valP,
|
|
UWord key );
|
|
|
|
// Set up 'swa' for iteration.
|
|
void VG_(initIterSWA) ( SparseWA* swa );
|
|
|
|
// Get the next key/val pair. Behaviour undefined (highly likely
|
|
// to segfault) if 'swa' has been modified since initIterSWA was
|
|
// called. Returned Bool is False iff there are no more pairs
|
|
// that can be extracted.
|
|
Bool VG_(nextIterSWA)( SparseWA* swa,
|
|
/*OUT*/UWord* keyP, /*OUT*/UWord* valP );
|
|
|
|
// How many elements are there in 'swa'? NOTE: dangerous in the
|
|
// sense that this is not an O(1) operation but rather O(N),
|
|
// since it involves walking the whole tree.
|
|
UWord VG_(sizeSWA) ( const SparseWA* swa );
|
|
|
|
#endif // __PUB_TOOL_SPARSEWA_H
|
|
|
|
/*--------------------------------------------------------------------*/
|
|
/*--- end pub_tool_sparsewa.h ---*/
|
|
/*--------------------------------------------------------------------*/
|