* - The user data we found.
* - NULL if we couldn't find any matching data.
*/
+CC_NO_UBSAN(function) /* UBSAN: false positive - htrie call with first argument of void * trips --fsanitize=function */
void *fr_hash_table_find(fr_hash_table_t *ht, void const *data)
{
fr_hash_entry_t *node;
* - true if data was inserted.
* - false if data already existed and was not inserted.
*/
+CC_NO_UBSAN(function) /* UBSAN: false positive - htrie call with first argument of void * trips --fsanitize=function */
bool fr_hash_table_insert(fr_hash_table_t *ht, void const *data)
{
uint32_t key;
* - 0 if data was inserted.
* - -1 if we failed to replace data
*/
+CC_NO_UBSAN(function) /* UBSAN: false positive - htrie call with first argument of void * trips --fsanitize=function */
int fr_hash_table_replace(void **old, fr_hash_table_t *ht, void const *data)
{
fr_hash_entry_t *node;
* - The user data we removed.
* - NULL if we couldn't find any matching data.
*/
+CC_NO_UBSAN(function) /* UBSAN: false positive - htrie call with first argument of void * trips --fsanitize=function */
void *fr_hash_table_remove(fr_hash_table_t *ht, void const *data)
{
uint32_t key;
* - true if we removed data.
* - false if we couldn't find any matching data.
*/
+CC_NO_UBSAN(function) /* UBSAN: false positive - htrie call with first argument of void * trips --fsanitize=function */
bool fr_hash_table_delete(fr_hash_table_t *ht, void const *data)
{
void *old;
/*
* Count number of elements
*/
+CC_NO_UBSAN(function) /* UBSAN: false positive - htrie call with first argument of void * trips --fsanitize=function */
uint32_t fr_hash_table_num_elements(fr_hash_table_t *ht)
{
return ht->num_elements;
*
* @hidecallergraph
*/
+CC_NO_UBSAN(function) /* UBSAN: false positive - htrie call with first argument of void * trips --fsanitize=function */
void *fr_rb_find(fr_rb_tree_t const *tree, void const *data)
{
fr_rb_node_t *x;
* - true if data was inserted.
* - false if data already existed and was not inserted.
*/
+CC_NO_UBSAN(function) /* UBSAN: false positive - htrie call with first argument of void * trips --fsanitize=function */
bool fr_rb_insert(fr_rb_tree_t *tree, void const *data)
{
if (insert_node(NULL, tree, UNCONST(void *, data)) == 0) return true;
* - 0 if data was inserted.
* - -1 if we failed to replace data
*/
+CC_NO_UBSAN(function) /* UBSAN: false positive - htrie call with first argument of void * trips --fsanitize=function */
int fr_rb_replace(void **old, fr_rb_tree_t *tree, void const *data)
{
fr_rb_node_t *node;
* - The user data we removed.
* - NULL if we couldn't find any matching data.
*/
+CC_NO_UBSAN(function) /* UBSAN: false positive - htrie call with first argument of void * trips --fsanitize=function */
void *fr_rb_remove(fr_rb_tree_t *tree, void const *data)
{
fr_rb_node_t *node;
* - true if we removed data.
* - false if we couldn't find any matching data.
*/
+CC_NO_UBSAN(function) /* UBSAN: false positive - htrie call with first argument of void * trips --fsanitize=function */
bool fr_rb_delete(fr_rb_tree_t *tree, void const *data)
{
fr_rb_node_t *node;
*
* @param[in] tree to return node count for.
*/
+CC_NO_UBSAN(function) /* UBSAN: false positive - htrie call with first argument of void * trips --fsanitize=function */
uint32_t fr_rb_num_elements(fr_rb_tree_t *tree)
{
return tree->num_elements;
* - User data matching the data passed in.
* - NULL if nothing matched passed data.
*/
+CC_NO_UBSAN(function) /* UBSAN: false positive - htrie call with first argument of void * trips --fsanitize=function */
void *fr_trie_find(fr_trie_t *ft, void const *data)
{
fr_trie_user_t *user = (fr_trie_user_t *) ft;
* - User data matching the data passed in.
* - NULL if nothing matched passed data.
*/
+CC_NO_UBSAN(function) /* UBSAN: false positive - htrie call with first argument of void * trips --fsanitize=function */
void *fr_trie_match(fr_trie_t *ft, void const *data)
{
fr_trie_user_t *user = (fr_trie_user_t *) ft;
* - true if data was inserted.
* - false if data already existed and was not inserted.
*/
+CC_NO_UBSAN(function) /* UBSAN: false positive - htrie call with first argument of void * trips --fsanitize=function */
bool fr_trie_insert(fr_trie_t *ft, void const *data)
{
fr_trie_user_t *user = (fr_trie_user_t *) ft;
* - 0 if data was inserted.
* - -1 if we failed to replace data
*/
+CC_NO_UBSAN(function) /* UBSAN: false positive - htrie call with first argument of void * trips --fsanitize=function */
int fr_trie_replace(void **old, fr_trie_t *ft, void const *data)
{
fr_trie_user_t *user = (fr_trie_user_t *) ft;
* - The user data we removed.
* - NULL if we couldn't find any matching data.
*/
+CC_NO_UBSAN(function) /* UBSAN: false positive - htrie call with first argument of void * trips --fsanitize=function */
void *fr_trie_remove(fr_trie_t *ft, void const *data)
{
fr_trie_user_t *user = (fr_trie_user_t *) ft;
* - true if we removed data.
* - false if we couldn't find any matching data.
*/
+CC_NO_UBSAN(function) /* UBSAN: false positive - htrie call with first argument of void * trips --fsanitize=function */
bool fr_trie_delete(fr_trie_t *ft, void const *data)
{
fr_trie_user_t *user = (fr_trie_user_t *) ft;
*
* @param[in] ft to return node count for.
*/
+CC_NO_UBSAN(function) /* UBSAN: false positive - htrie call with first argument of void * trips --fsanitize=function */
unsigned int fr_trie_num_elements(UNUSED fr_trie_t *ft)
{
return 0;