/
niceSOFT
/
valgrind
Обзор
Документация
Войти
/
niceSOFT
/
valgrind
Код
Задачи
Вики
Пакеты
0
Релизы
0
Аналитика
Безопасность
master
include/pub_tool_xarray.h
180 строк
8 KB
Mark Wielaard
Upgrade to GNU General Public License version 3
18 окт 2025, 01:55
18 окт 2025, 01:55
3392155
Код
Авторство
О чём код?
/*--------------------------------------------------------------------*/ /*--- An expandable array implementation. pub_tool_xarray.h ---*/ /*--------------------------------------------------------------------*/ /* This file is part of Valgrind, a dynamic binary instrumentation framework. Copyright (C) 2007-2017 OpenWorks LLP 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 3 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_XARRAY_H #define __PUB_TOOL_XARRAY_H #include "pub_tool_basics.h" // Word //-------------------------------------------------------------------- // PURPOSE: Provides a simple but useful structure, which is an array // in which elements can be added at the end. The array is expanded // as needed by multiplying its size by a constant factor (usually 2). // This gives amortised O(1) insertion cost, and, following sorting, // the usual O(log N) binary search cost. Arbitrary element sizes // are allowed; the comparison function for sort/lookup can be changed // at any time, and duplicates (modulo the comparison function) are // allowed. //-------------------------------------------------------------------- /* It's an abstract type. Bwaha. */ typedef struct _XArray XArray; typedef Int (*XACmpFn_t)(const void *, const void *); /* Create new XArray, using given allocation and free function, and for elements of the specified size. alloc_fn must not return NULL (that is, if it returns it must have succeeded.) This function never returns NULL. */ extern XArray* VG_(newXA) ( Alloc_Fn_t alloc_fn, const HChar* cc, Free_Fn_t free_fn, Word elemSzB ); /* Free all memory associated with an XArray. */ extern void VG_(deleteXA) ( XArray* ); /* Set the comparison function for this XArray. This clears an internal 'array is sorted' flag, which means you must call sortXA before making further queries with lookupXA. */ extern void VG_(setCmpFnXA) ( XArray*, XACmpFn_t); /* Add an element to an XArray. Element is copied into the XArray. Index at which it was added is returned. Note this will be invalidated if the array is later sortXA'd. */ extern Word VG_(addToXA) ( XArray*, const void* elem ); /* Add a sequence of bytes to an XArray of bytes. Asserts if nbytes is negative or the array's element size is not 1. Returns the index at which the first byte was added. */ extern Word VG_(addBytesToXA) ( XArray* xao, const void* bytesV, Word nbytes ); /* Sort an XArray using its comparison function, if set; else bomb. Probably not a stable sort w.r.t. equal elements module cmpFn. */ extern void VG_(sortXA) ( XArray* ); /* Lookup (by binary search) 'key' in the array. Set *first to be the index of the first, and *last to be the index of the last matching value found. If any values are found, return True, else return False, and don't change *first or *last. first and/or last may be NULL. Bomb if the array is not sorted. */ extern Bool VG_(lookupXA) ( const XArray*, const void* key, /*OUT*/Word* first, /*OUT*/Word* last ); /* A version of VG_(lookupXA) in which you can specify your own comparison function. This is unsafe in the sense that if the array is not totally ordered as defined by your comparison function, then this function may loop indefinitely, so it is up to you to ensure that the array is suitably ordered. This is in comparison to VG_(lookupXA), which refuses to do anything (asserts) unless the array has first been sorted using the same comparison function as is being used for the lookup. */ extern Bool VG_(lookupXA_UNSAFE) ( const XArray* xao, const void* key, /*OUT*/Word* first, /*OUT*/Word* last, XACmpFn_t cmpFn ); /* How elements are there in this XArray now? */ extern Word VG_(sizeXA) ( const XArray* ); /* If you know how many elements an XArray will have, you can optimise memory usage and number of reallocation needed to insert these elements. The call to VG_(hintSizeXA) must be done just after the call to VG_(newXA), before any element has been inserted. */ extern void VG_(hintSizeXA) ( XArray*, Word); /* Index into the XArray. Checks bounds and bombs if the index is invalid. What this returns is the address of the specified element in the array, not (of course) the element itself. Note that the element may get moved by subsequent calls to addToXA / sortXA / insertIndexXA, so you should copy it out immediately and not regard its address as unchanging. Note also that indexXA will of course not return NULL if it succeeds. */ extern void* VG_(indexXA) ( const XArray*, Word ); /* Drop the last n elements of an XArray. Bombs if there are less than n elements in the array. This is an O(1) operation. */ extern void VG_(dropTailXA) ( XArray*, Word ); /* Drop the first n elements of an XArray. Bombs if there are less than n elements in the array. This is an O(N) operation, where N is the number of elements remaining in the XArray. */ extern void VG_(dropHeadXA) ( XArray*, Word ); /* Remove the specified element of an XArray, and slide all elements beyond it back one place. This is an O(N) operation, where N is the number of elements after the specified element, in the array. */ extern void VG_(removeIndexXA)( XArray*, Word ); /* Insert an element into an XArray at the given index. The existing element at the index and all above it are slid upwards one slot so as to make space. Element is copied into the XArray. This is an O(N) operation, when N is the number of elements after the specified element, in the array. */ extern void VG_(insertIndexXA)( XArray*, Word, const void* elem ); /* Replace the element of an XArray at the given index with a copy of the new element. This is an O(1) operation. Compared to the caller doing: *(T*)VG_(indexXA)(arr, index) = new_value; this function will also mark the array as unsorted. */ extern void VG_(replaceIndexXA)( XArray*, Word, const void* elem ); /* Make a new, completely independent copy of the given XArray, using the existing allocation function to allocate the new space. Space for the clone (and all additions to it) is billed to 'cc' unless that is NULL, in which case the parent's cost-center is used. Ths function never returns NULL. */ extern XArray* VG_(cloneXA)( const HChar* cc, const XArray* xa ); /* Get the raw array and size so callers can index it really fast. This is dangerous in the sense that there's no range or anything-else checking. It's also dangerous in that if VG_(addToXA) is used, the contents may be re-located without warning, hence making the contents address returned here invalid. */ extern void VG_(getContentsXA_UNSAFE)( XArray* sr, /*OUT*/void** ctsP, /*OUT*/Word* usedP ); /* Convenience function: printf into an XArray of HChar, adding stuff at the end. This is very convenient for concocting arbitrary length printf output in an XArray. Note that the resulting string is NOT zero-terminated. */ extern void VG_(xaprintf)( XArray* dst, const HChar* format, ... ) PRINTF_CHECK(2, 3); /* Convenience function: linear search in an XArray of HChar*. */ extern Bool VG_(strIsMemberXA)(const XArray* xa, const HChar* str ); #endif // __PUB_TOOL_XARRAY_H /*--------------------------------------------------------------------*/ /*--- end pub_tool_xarray.h ---*/ /*--------------------------------------------------------------------*/