X-Git-Url: https://git.liburcu.org/?a=blobdiff_plain;f=src%2Frculfhash-mm-chunk.c;h=cf3a9ffdc86bbbd1d8a07dbaf3ba25b7db73bfca;hb=601922a81d884e16ff404cee7534ede56fb87d0a;hp=a7a9b765b4c2c734389b869fc8c4f0ceb7e46281;hpb=6893800a4d1cc14dff0395ddcd660a5138db183d;p=userspace-rcu.git

diff --git a/src/rculfhash-mm-chunk.c b/src/rculfhash-mm-chunk.c
index a7a9b76..cf3a9ff 100644
--- a/src/rculfhash-mm-chunk.c
+++ b/src/rculfhash-mm-chunk.c
@@ -1,27 +1,14 @@
+// SPDX-FileCopyrightText: 2011 Lai Jiangshan <laijs@cn.fujitsu.com>
+//
+// SPDX-License-Identifier: LGPL-2.1-or-later
+
 /*
- * rculfhash-mm-chunk.c
- *
  * Chunk based memory management for Lock-Free RCU Hash Table
- *
- * Copyright 2011 - Lai Jiangshan <laijs@cn.fujitsu.com>
- *
- * This library is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public
- * License as published by the Free Software Foundation; either
- * version 2.1 of the License, or (at your option) any later version.
- *
- * This library 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
- * Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public
- * License along with this library; if not, write to the Free Software
- * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  */
 
 #include <stddef.h>
-#include <rculfhash-internal.h>
+#include <urcu/assert.h>
+#include "rculfhash-internal.h"
 
 static
 void cds_lfht_alloc_bucket_table(struct cds_lfht *ht, unsigned long order)
@@ -29,14 +16,14 @@ void cds_lfht_alloc_bucket_table(struct cds_lfht *ht, unsigned long order)
 	if (order == 0) {
 		ht->tbl_chunk[0] = calloc(ht->min_nr_alloc_buckets,
 			sizeof(struct cds_lfht_node));
-		assert(ht->tbl_chunk[0]);
+		urcu_posix_assert(ht->tbl_chunk[0]);
 	} else if (order > ht->min_alloc_buckets_order) {
 		unsigned long i, len = 1UL << (order - 1 - ht->min_alloc_buckets_order);
 
 		for (i = len; i < 2 * len; i++) {
 			ht->tbl_chunk[i] = calloc(ht->min_nr_alloc_buckets,
 				sizeof(struct cds_lfht_node));
-			assert(ht->tbl_chunk[i]);
+			urcu_posix_assert(ht->tbl_chunk[i]);
 		}
 	}
 	/* Nothing to do for 0 < order && order <= ht->min_alloc_buckets_order */