TheCloud/fuse-overlayfs
1
0
Fork 0
mirror of https://github.com/containers/fuse-overlayfs.git synced 2025-08-05 10:55:58 -04:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #443 from giuseppe/update-hash-map-module

Browse Source 
main: use hash_remove instead of hash_delete
This commit is contained in:
Giuseppe Scrivano 2025-04-30 08:52:47 +02:00 committed by GitHub
commit 28ba1fd247
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
6 changed files with 1643 additions and 165 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

26
lib/hash.c
View File

@ -1,6 +1,6 @@
/* hash - hashing table processing. /* hash - hashing table processing.
Copyright (C) 1998-2004, 2006-2007, 2009-2023 Free Software Foundation, Inc. Copyright (C) 1998-2004, 2006-2007, 2009-2025 Free Software Foundation, Inc.
Written by Jim Meyering, 1992. Written by Jim Meyering, 1992.
@ -29,6 +29,7 @@
#include "bitrotate.h" #include "bitrotate.h"
#include "xalloc-oversized.h" #include "xalloc-oversized.h"
#include <errno.h>
#include <stdint.h> #include <stdint.h>
#include <stdio.h> #include <stdio.h>
#include <stdlib.h> #include <stdlib.h>
@ -499,13 +500,17 @@ compute_bucket_size (size_t candidate, const Hash_tuning *tuning)
{ {
float new_candidate = candidate / tuning->growth_threshold; float new_candidate = candidate / tuning->growth_threshold;
if ((float) SIZE_MAX <= new_candidate) if ((float) SIZE_MAX <= new_candidate)
return 0; goto nomem;
candidate = new_candidate; candidate = new_candidate;
} }
candidate = next_prime (candidate); candidate = next_prime (candidate);
if (xalloc_oversized (candidate, sizeof (struct hash_entry *))) if (xalloc_oversized (candidate, sizeof (struct hash_entry *)))
return 0; goto nomem;
return candidate; return candidate;
nomem:
errno = ENOMEM;
return 0;
} }
Hash_table * Hash_table *
@ -534,6 +539,7 @@ hash_initialize (size_t candidate, const Hash_tuning *tuning,
if the user provides invalid tuning options, we silently revert to if the user provides invalid tuning options, we silently revert to
using the defaults, and ignore further request to change the tuning using the defaults, and ignore further request to change the tuning
options. */ options. */
errno = EINVAL;
goto fail; goto fail;
} }
@ -607,6 +613,7 @@ hash_free (Hash_table *table)
struct hash_entry *bucket; struct hash_entry *bucket;
struct hash_entry *cursor; struct hash_entry *cursor;
struct hash_entry *next; struct hash_entry *next;
int err = errno;
/* Call the user data_freer function. */ /* Call the user data_freer function. */
if (table->data_freer && table->n_entries) if (table->data_freer && table->n_entries)
@ -649,6 +656,8 @@ hash_free (Hash_table *table)
/* Free the remainder of the hash table structure. */ /* Free the remainder of the hash table structure. */
free (table->bucket); free (table->bucket);
free (table); free (table);
errno = err;
} }
/* Insertion and deletion. */ /* Insertion and deletion. */
@ -762,8 +771,8 @@ hash_find_entry (Hash_table *table, const void *entry,
/* Internal helper, to move entries from SRC to DST. Both tables must /* Internal helper, to move entries from SRC to DST. Both tables must
share the same free entry list. If SAFE, only move overflow share the same free entry list. If SAFE, only move overflow
entries, saving bucket heads for later, so that no allocations will entries, saving bucket heads for later, so that no allocations will
occur. Return false if the free entry list is exhausted and an occur. Return false (setting errno) if the free entry list is
allocation fails. */ exhausted and an allocation fails. */
static bool static bool
transfer_entries (Hash_table *dst, Hash_table *src, bool safe) transfer_entries (Hash_table *dst, Hash_table *src, bool safe)
@ -910,12 +919,14 @@ hash_rehash (Hash_table *table, size_t candidate)
passes. Two passes give worse cache performance and takes passes. Two passes give worse cache performance and takes
longer, but at this point, we're already out of memory, so slow longer, but at this point, we're already out of memory, so slow
and safe is better than failure. */ and safe is better than failure. */
int err = errno;
table->free_entry_list = new_table->free_entry_list; table->free_entry_list = new_table->free_entry_list;
if (! (transfer_entries (table, new_table, true) if (! (transfer_entries (table, new_table, true)
&& transfer_entries (table, new_table, false))) && transfer_entries (table, new_table, false)))
abort (); abort ();
/* table->n_entries already holds its value. */ /* table->n_entries already holds its value. */
free (new_table->bucket); free (new_table->bucket);
errno = err;
return false; return false;
} }
@ -962,7 +973,10 @@ hash_insert_if_absent (Hash_table *table, void const *entry,
* tuning->growth_threshold)); * tuning->growth_threshold));
if ((float) SIZE_MAX <= candidate) if ((float) SIZE_MAX <= candidate)
return -1; {
errno = ENOMEM;
return -1;
}
/* If the rehash fails, arrange to return NULL. */ /* If the rehash fails, arrange to return NULL. */
if (!hash_rehash (table, candidate)) if (!hash_rehash (table, candidate))

82
lib/hash.h
View File

@ -1,5 +1,5 @@
/* hash - hashing table processing. /* hash - hashing table processing.
Copyright (C) 1998-1999, 2001, 2003, 2009-2023 Free Software Foundation, Copyright (C) 1998-1999, 2001, 2003, 2009-2025 Free Software Foundation,
Inc. Inc.
Written by Jim Meyering <meyering@ascend.com>, 1998. Written by Jim Meyering <meyering@ascend.com>, 1998.
@ -61,24 +61,24 @@ typedef struct hash_table Hash_table;
number of buckets (used plus unused), or the maximum number of slots, are number of buckets (used plus unused), or the maximum number of slots, are
the same quantity. */ the same quantity. */
extern size_t hash_get_n_buckets (const Hash_table *table) extern size_t hash_get_n_buckets (const Hash_table *table)
; _GL_ATTRIBUTE_PURE;
/* Return the number of slots in use (non-empty buckets). */ /* Return the number of slots in use (non-empty buckets). */
extern size_t hash_get_n_buckets_used (const Hash_table *table) extern size_t hash_get_n_buckets_used (const Hash_table *table)
; _GL_ATTRIBUTE_PURE;
/* Return the number of active entries. */ /* Return the number of active entries. */
extern size_t hash_get_n_entries (const Hash_table *table) extern size_t hash_get_n_entries (const Hash_table *table)
; _GL_ATTRIBUTE_PURE;
/* Return the length of the longest chain (bucket). */ /* Return the length of the longest chain (bucket). */
extern size_t hash_get_max_bucket_length (const Hash_table *table) extern size_t hash_get_max_bucket_length (const Hash_table *table)
; _GL_ATTRIBUTE_PURE;
/* Do a mild validation of a hash table, by traversing it and checking two /* Do a mild validation of a hash table, by traversing it and checking two
statistics. */ statistics. */
extern bool hash_table_ok (const Hash_table *table) extern bool hash_table_ok (const Hash_table *table)
; _GL_ATTRIBUTE_PURE;
extern void hash_print_statistics (const Hash_table *table, FILE *stream); extern void hash_print_statistics (const Hash_table *table, FILE *stream);
@ -99,7 +99,7 @@ extern void *hash_lookup (const Hash_table *table, const void *entry);
/* Return the first data in the table, or NULL if the table is empty. */ /* Return the first data in the table, or NULL if the table is empty. */
extern void *hash_get_first (const Hash_table *table) extern void *hash_get_first (const Hash_table *table)
; _GL_ATTRIBUTE_PURE;
/* Return the user data for the entry following ENTRY, where ENTRY has been /* Return the user data for the entry following ENTRY, where ENTRY has been
returned by a previous call to either 'hash_get_first' or 'hash_get_next'. returned by a previous call to either 'hash_get_first' or 'hash_get_next'.
@ -124,25 +124,40 @@ typedef bool (*Hash_processor) (void *entry, void *processor_data);
extern size_t hash_do_for_each (const Hash_table *table, extern size_t hash_do_for_each (const Hash_table *table,
Hash_processor processor, void *processor_data); Hash_processor processor, void *processor_data);
/* Return a hash index for a NUL-terminated STRING between 0 and N_BUCKETS-1.
This is a convenience routine for constructing other hashing functions. */
extern size_t hash_string (const char *string, size_t n_buckets)
_GL_ATTRIBUTE_PURE;
/* Return a hash code of ENTRY, in the range 0..TABLE_SIZE-1.
This hash code function must have the property that if the comparator of
ENTRY1 and ENTRY2 returns true, the hasher returns the same value for ENTRY1
and for ENTRY2.
The hash code function typically computes an unsigned integer and at the end
performs a % TABLE_SIZE modulo operation. This modulo operation is performed
as part of this hash code function, not by the caller, because in some cases
the unsigned integer will be a 'size_t', in other cases an 'uintmax_t' or
even larger. */
typedef size_t (*Hash_hasher) (const void *entry, size_t table_size);
/* Compare two entries, ENTRY1 (being looked up or being inserted) and
ENTRY2 (already in the table) for equality. Return true for equal,
false otherwise. */
typedef bool (*Hash_comparator) (const void *entry1, const void *entry2);
/* This function is invoked when an ENTRY is removed from the hash table. */
typedef void (*Hash_data_freer) (void *entry);
/* /*
* Allocation and clean-up. * Allocation and clean-up.
*/ */
/* Return a hash index for a NUL-terminated STRING between 0 and N_BUCKETS-1.
This is a convenience routine for constructing other hashing functions. */
extern size_t hash_string (const char *string, size_t n_buckets)
;
extern void hash_reset_tuning (Hash_tuning *tuning); extern void hash_reset_tuning (Hash_tuning *tuning);
typedef size_t (*Hash_hasher) (const void *entry, size_t table_size);
typedef bool (*Hash_comparator) (const void *entry1, const void *entry2);
typedef void (*Hash_data_freer) (void *entry);
/* Reclaim all storage associated with a hash table. If a data_freer /* Reclaim all storage associated with a hash table. If a data_freer
function has been supplied by the user when the hash table was created, function has been supplied by the user when the hash table was created,
this function applies it to the data of each entry before freeing that this function applies it to the data of each entry before freeing that
entry. */ entry. This function preserves errno, like 'free'. */
extern void hash_free (Hash_table *table); extern void hash_free (Hash_table *table);
/* Allocate and return a new hash table, or NULL upon failure. The initial /* Allocate and return a new hash table, or NULL upon failure. The initial
@ -177,23 +192,30 @@ extern void hash_free (Hash_table *table);
You should specify this function only if you want these functions to free You should specify this function only if you want these functions to free
all of your 'data' data. This is typically the case when your data is all of your 'data' data. This is typically the case when your data is
simply an auxiliary struct that you have malloc'd to aggregate several simply an auxiliary struct that you have malloc'd to aggregate several
values. */ values.
Set errno on failure; otherwise errno is unspecified. */
_GL_ATTRIBUTE_NODISCARD
extern Hash_table *hash_initialize (size_t candidate, extern Hash_table *hash_initialize (size_t candidate,
const Hash_tuning *tuning, const Hash_tuning *tuning,
Hash_hasher hasher, Hash_hasher hasher,
Hash_comparator comparator, Hash_comparator comparator,
Hash_data_freer data_freer); Hash_data_freer data_freer)
_GL_ATTRIBUTE_MALLOC _GL_ATTRIBUTE_DEALLOC (hash_free, 1);
/* Same as hash_initialize, but invokes xalloc_die on memory exhaustion. */ /* Like hash_initialize, but invokes xalloc_die instead of returning NULL. */
/* This function is defined by module 'xhash'. */ /* This function is defined by module 'xhash'. */
_GL_ATTRIBUTE_NODISCARD
extern Hash_table *hash_xinitialize (size_t candidate, extern Hash_table *hash_xinitialize (size_t candidate,
const Hash_tuning *tuning, const Hash_tuning *tuning,
Hash_hasher hasher, Hash_hasher hasher,
Hash_comparator comparator, Hash_comparator comparator,
Hash_data_freer data_freer); Hash_data_freer data_freer)
_GL_ATTRIBUTE_MALLOC _GL_ATTRIBUTE_DEALLOC (hash_free, 1)
_GL_ATTRIBUTE_RETURNS_NONNULL;
/* Make all buckets empty, placing any chained entries on the free list. /* Make all buckets empty, placing any chained entries on the free list.
Apply the user-specified function data_freer (if any) to the datas of any Apply the user-specified function data_freer (if any) to the data of any
affected entries. */ affected entries. */
extern void hash_clear (Hash_table *table); extern void hash_clear (Hash_table *table);
@ -207,23 +229,26 @@ extern void hash_clear (Hash_table *table);
the table may receive at least CANDIDATE different user entries, including the table may receive at least CANDIDATE different user entries, including
those already in the table, before any other growth of the hash table size those already in the table, before any other growth of the hash table size
occurs. If TUNING->IS_N_BUCKETS is true, then CANDIDATE specifies the occurs. If TUNING->IS_N_BUCKETS is true, then CANDIDATE specifies the
exact number of buckets desired. Return true iff the rehash succeeded. */ exact number of buckets desired. Return true iff the rehash succeeded,
false (setting errno) otherwise. */
_GL_ATTRIBUTE_NODISCARD
extern bool hash_rehash (Hash_table *table, size_t candidate); extern bool hash_rehash (Hash_table *table, size_t candidate);
/* If ENTRY matches an entry already in the hash table, return the pointer /* If ENTRY matches an entry already in the hash table, return the pointer
to the entry from the table. Otherwise, insert ENTRY and return ENTRY. to the entry from the table. Otherwise, insert ENTRY and return ENTRY.
Return NULL if the storage required for insertion cannot be allocated. Return NULL (setting errno) if the storage required for insertion
This implementation does not support duplicate entries or insertion of cannot be allocated. This implementation does not support
NULL. */ duplicate entries or insertion of NULL. */
_GL_ATTRIBUTE_NODISCARD
extern void *hash_insert (Hash_table *table, const void *entry); extern void *hash_insert (Hash_table *table, const void *entry);
/* Same as hash_insert, but invokes xalloc_die on memory exhaustion. */ /* Same as hash_insert, but invokes xalloc_die instead of returning NULL. */
/* This function is defined by module 'xhash'. */ /* This function is defined by module 'xhash'. */
extern void *hash_xinsert (Hash_table *table, const void *entry); extern void *hash_xinsert (Hash_table *table, const void *entry);
/* Insert ENTRY into hash TABLE if there is not already a matching entry. /* Insert ENTRY into hash TABLE if there is not already a matching entry.
Return -1 upon memory allocation failure. Return -1 (setting errno) upon memory allocation failure.
Return 1 if insertion succeeded. Return 1 if insertion succeeded.
Return 0 if there is already a matching entry in the table, Return 0 if there is already a matching entry in the table,
and in that case, if MATCHED_ENT is non-NULL, set *MATCHED_ENT and in that case, if MATCHED_ENT is non-NULL, set *MATCHED_ENT
@ -247,6 +272,7 @@ extern void *hash_remove (Hash_table *table, const void *entry);
/* Same as hash_remove. This interface is deprecated. /* Same as hash_remove. This interface is deprecated.
FIXME: Remove in 2022. */ FIXME: Remove in 2022. */
_GL_ATTRIBUTE_DEPRECATED
extern void *hash_delete (Hash_table *table, const void *entry); extern void *hash_delete (Hash_table *table, const void *entry);
# ifdef __cplusplus # ifdef __cplusplus

109
m4/00gnulib.m4
View File

@ -1,43 +1,84 @@
# 00gnulib.m4 serial 3 # 00gnulib.m4
dnl Copyright (C) 2009-2019 Free Software Foundation, Inc. # serial 9
dnl Copyright (C) 2009-2025 Free Software Foundation, Inc.
dnl This file is free software; the Free Software Foundation dnl This file is free software; the Free Software Foundation
dnl gives unlimited permission to copy and/or distribute it, dnl gives unlimited permission to copy and/or distribute it,
dnl with or without modifications, as long as this notice is preserved. dnl with or without modifications, as long as this notice is preserved.
dnl This file is offered as-is, without any warranty.
dnl This file must be named something that sorts before all other dnl This file must be named something that sorts before all other
dnl gnulib-provided .m4 files. It is needed until such time as we can dnl gnulib-provided .m4 files. It is needed until the clang fix has
dnl assume Autoconf 2.64, with its improved AC_DEFUN_ONCE and dnl been included in Autoconf.
dnl m4_divert semantics.
# Until autoconf 2.63, handling of the diversion stack required m4_init # The following definitions arrange to use a compiler option
# to be called first; but this does not happen with aclocal. Wrapping # -Werror=implicit-function-declaration in AC_CHECK_DECL, when the
# the entire execution in another layer of the diversion stack fixes this. # compiler is clang. Without it, clang implicitly declares "known"
# Worse, prior to autoconf 2.62, m4_wrap depended on the underlying m4 # library functions in C mode, but not in C++ mode, which would cause
# for whether it was FIFO or LIFO; in order to properly balance with # Gnulib to omit a declaration and thus later produce an error in C++
# m4_init, we need to undo our push just before anything wrapped within # mode. As of clang 9.0, these "known" functions are identified through
# the m4_init body. The way to ensure this is to wrap both sides of # LIBBUILTIN invocations in the LLVM source file
# m4_init with a one-shot macro that does the pop at the right time. # llvm/tools/clang/include/clang/Basic/Builtins.def.
m4_ifndef([_m4_divert_diversion], # It's not possible to AC_REQUIRE the extra tests from AC_CHECK_DECL,
[m4_divert_push([KILL]) # because AC_CHECK_DECL, like other Autoconf built-ins, is not supposed
m4_define([gl_divert_fixup], [m4_divert_pop()m4_define([$0])]) # to AC_REQUIRE anything: some configure.ac files have their first
m4_define([m4_init], # AC_CHECK_DECL executed conditionally. Therefore append the extra tests
[gl_divert_fixup()]m4_defn([m4_init])[gl_divert_fixup()])]) # to AC_PROG_CC.
AC_DEFUN([gl_COMPILER_CLANG],
[
# AC_DEFUN_ONCE([NAME], VALUE) dnl AC_REQUIRE([AC_PROG_CC])
# ---------------------------- AC_CACHE_CHECK([whether the compiler is clang],
# Define NAME to expand to VALUE on the first use (whether by direct [gl_cv_compiler_clang],
# expansion, or by AC_REQUIRE), and to nothing on all subsequent uses. [dnl Use _AC_COMPILE_IFELSE instead of AC_EGREP_CPP, to avoid error
# Avoid bugs in AC_REQUIRE in Autoconf 2.63 and earlier. This dnl "circular dependency of AC_LANG_COMPILER(C)" if AC_PROG_CC has
# definition is slower than the version in Autoconf 2.64, because it dnl not yet been invoked.
# can only use interfaces that existed since 2.59; but it achieves the _AC_COMPILE_IFELSE(
# same effect. Quoting is necessary to avoid confusing Automake. [AC_LANG_PROGRAM([[
m4_version_prereq([2.63.263], [], #ifdef __clang__
[m4_define([AC][_DEFUN_ONCE], barfbarf
[AC][_DEFUN([$1], #endif
[AC_REQUIRE([_gl_DEFUN_ONCE([$1])], ]],[[]])
[m4_indir([_gl_DEFUN_ONCE([$1])])])])]dnl ],
[AC][_DEFUN([_gl_DEFUN_ONCE([$1])], [$2])])]) [gl_cv_compiler_clang=no],
[gl_cv_compiler_clang=yes])
])
])
AC_DEFUN([gl_COMPILER_PREPARE_CHECK_DECL],
[
dnl AC_REQUIRE([AC_PROG_CC])
dnl AC_REQUIRE([gl_COMPILER_CLANG])
AC_CACHE_CHECK([for compiler option needed when checking for declarations],
[gl_cv_compiler_check_decl_option],
[if test $gl_cv_compiler_clang = yes; then
dnl Test whether the compiler supports the option
dnl '-Werror=implicit-function-declaration'.
saved_ac_compile="$ac_compile"
ac_compile="$ac_compile -Werror=implicit-function-declaration"
dnl Use _AC_COMPILE_IFELSE instead of AC_COMPILE_IFELSE, to avoid a
dnl warning "AC_COMPILE_IFELSE was called before AC_USE_SYSTEM_EXTENSIONS".
_AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[]],[[]])],
[gl_cv_compiler_check_decl_option='-Werror=implicit-function-declaration'],
[gl_cv_compiler_check_decl_option=none])
ac_compile="$saved_ac_compile"
else
gl_cv_compiler_check_decl_option=none
fi
])
if test "x$gl_cv_compiler_check_decl_option" != xnone; then
ac_compile_for_check_decl="$ac_compile $gl_cv_compiler_check_decl_option"
else
ac_compile_for_check_decl="$ac_compile"
fi
])
dnl Redefine _AC_CHECK_DECL_BODY so that it references ac_compile_for_check_decl
dnl instead of ac_compile. If, for whatever reason, the override of AC_PROG_CC
dnl in zzgnulib.m4 is inactive, use the original ac_compile.
m4_define([_AC_CHECK_DECL_BODY],
[ ac_saved_ac_compile="$ac_compile"
if test -n "$ac_compile_for_check_decl"; then
ac_compile="$ac_compile_for_check_decl"
fi]
m4_defn([_AC_CHECK_DECL_BODY])[ ac_compile="$ac_saved_ac_compile"
])
# gl_00GNULIB # gl_00GNULIB
# ----------- # -----------

1546
m4/gnulib-common.m4
View File

File diff suppressed because it is too large Load Diff

25
m4/zzgnulib.m4 Normal file
View File

@ -0,0 +1,25 @@
# zzgnulib.m4
# serial 1
dnl Copyright (C) 2020-2025 Free Software Foundation, Inc.
dnl This file is free software; the Free Software Foundation
dnl gives unlimited permission to copy and/or distribute it,
dnl with or without modifications, as long as this notice is preserved.
dnl This file is offered as-is, without any warranty.
dnl This file must be named something that sorts after all other
dnl package- or gnulib-provided .m4 files - at least for those packages
dnl that redefine AC_PROG_CC.
dnl Redefine AC_PROG_CC so that it ends with invocations of gl_COMPILER_CLANG
dnl and gl_COMPILER_PREPARE_CHECK_DECL.
m4_define([AC_PROG_CC],
m4_defn([AC_PROG_CC])[
gl_COMPILER_CLANG
gl_COMPILER_PREPARE_CHECK_DECL
])
# gl_ZZGNULIB
# -----------
# Witness macro that this file has been included. Needed to force
# Automake to include this file after all other gnulib .m4 files.
AC_DEFUN([gl_ZZGNULIB])

20
main.c
View File

@ -1018,7 +1018,7 @@ node_free (void *p)
if (n->parent) if (n->parent)
{ {
if (n->parent->children && hash_lookup (n->parent->children, n) == n) if (n->parent->children && hash_lookup (n->parent->children, n) == n)
hash_delete (n->parent->children, n); hash_remove (n->parent->children, n);
n->parent->loaded = 0; n->parent->loaded = 0;
n->parent = NULL; n->parent = NULL;
} }
@ -1078,7 +1078,7 @@ drop_node_from_ino (Hash_table *inodes, struct ovl_node *node)
if (ino->lookups == 0) if (ino->lookups == 0)
{ {
hash_delete (inodes, ino); hash_remove (inodes, ino);
inode_free (ino); inode_free (ino);
return; return;
} }
@ -1308,7 +1308,7 @@ do_forget (struct ovl_data *lo, fuse_ino_t ino, uint64_t nlookup)
i->lookups -= nlookup; i->lookups -= nlookup;
if (i->lookups <= 0) if (i->lookups <= 0)
{ {
hash_delete (lo->inodes, i); hash_remove (lo->inodes, i);
inode_free (i); inode_free (i);
} }
return true; return true;
@ -1659,12 +1659,12 @@ insert_node (struct ovl_node *parent, struct ovl_node *item, bool replace)
if (prev_parent) if (prev_parent)
{ {
if (hash_lookup (prev_parent->children, item) == item) if (hash_lookup (prev_parent->children, item) == item)
hash_delete (prev_parent->children, item); hash_remove (prev_parent->children, item);
} }
if (replace) if (replace)
{ {
old = hash_delete (parent->children, item); old = hash_remove (parent->children, item);
if (old) if (old)
node_free (old); node_free (old);
} }
@ -1787,7 +1787,7 @@ load_dir (struct ovl_data *lo, struct ovl_node *n, struct ovl_layer *layer, char
continue; continue;
else else
{ {
hash_delete (n->children, child); hash_remove (n->children, child);
node_free (child); node_free (child);
child = NULL; child = NULL;
} }
@ -3496,7 +3496,7 @@ do_rm (fuse_req_t req, fuse_ino_t parent, const char *name, bool dirp)
node_set_name (&key, (char *) name); node_set_name (&key, (char *) name);
rm = hash_delete (pnode->children, &key); rm = hash_remove (pnode->children, &key);
fuse_lowlevel_notify_inval_inode (lo->se, node_to_inode (node), -1, 0); fuse_lowlevel_notify_inval_inode (lo->se, node_to_inode (node), -1, 0);
if (rm) if (rm)
{ {
@ -4623,8 +4623,8 @@ ovl_rename_exchange (fuse_req_t req, fuse_ino_t parent, const char *name,
if (ret < 0) if (ret < 0)
goto error; goto error;
rm1 = hash_delete (destpnode->children, destnode); rm1 = hash_remove (destpnode->children, destnode);
rm2 = hash_delete (pnode->children, node); rm2 = hash_remove (pnode->children, node);
tmp = node->path; tmp = node->path;
node->path = destnode->path; node->path = destnode->path;
@ -4854,7 +4854,7 @@ ovl_rename_direct (fuse_req_t req, fuse_ino_t parent, const char *name,
if (delete_whiteout (lo, destfd, NULL, newname) < 0) if (delete_whiteout (lo, destfd, NULL, newname) < 0)
goto error; goto error;
hash_delete (pnode->children, node); hash_remove (pnode->children, node);
free (node->name); free (node->name);
node_set_name (node, strdup (newname)); node_set_name (node, strdup (newname));