X-Git-Url: https://git.liburcu.org/?a=blobdiff_plain;ds=sidebyside;f=doc%2Fexamples%2Frculfhash%2Fcds_lfht_add_unique.c;h=d6044c244492e17bab204c6b43b863971198e862;hb=HEAD;hp=68759713c44c608a19b8c5e48d3fd61c995e5595;hpb=b9050d917ab84db192b5609ba6dd9973a82d215a;p=urcu.git diff --git a/doc/examples/rculfhash/cds_lfht_add_unique.c b/doc/examples/rculfhash/cds_lfht_add_unique.c index 6875971..326e19b 100644 --- a/doc/examples/rculfhash/cds_lfht_add_unique.c +++ b/doc/examples/rculfhash/cds_lfht_add_unique.c @@ -1,15 +1,8 @@ +// SPDX-FileCopyrightText: 2013 Mathieu Desnoyers +// +// SPDX-License-Identifier: MIT + /* - * Copyright (C) 2013 Mathieu Desnoyers - * - * THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY EXPRESSED - * OR IMPLIED. ANY USE IS AT YOUR OWN RISK. - * - * Permission is hereby granted to use or copy this program for any - * purpose, provided the above notices are retained on all copies. - * Permission to modify the code and to distribute modified code is - * granted, provided the above notices are retained, and a notice that - * the code was modified is included with the above copyright notice. - * * This example shows how to add unique nodes into a RCU lock-free hash * table. We use a "seqnum" field to show which node is staying in the * hash table. This hash table requires using a RCU scheme. @@ -38,12 +31,12 @@ int match(struct cds_lfht_node *ht_node, const void *_key) { struct mynode *node = caa_container_of(ht_node, struct mynode, node); - const unsigned int *key = _key; + const int *key = _key; return *key == node->value; } -int main(int argc, char **argv) +int main(void) { int values[] = { -5, 42, 42, 36, 24, }; /* 42 is duplicated */ struct cds_lfht *ht; /* Hash table */