X-Git-Url: https://git.liburcu.org/?a=blobdiff_plain;ds=sidebyside;f=doc%2Fexamples%2Frculfhash%2Fjhash.h;h=f50a0dac64216601a1c75a8bebc5ef411e085b01;hb=HEAD;hp=fc3928e5d3deae77110bc89479f81fa94345e149;hpb=8eefcfaf31a34a3301619bbb99d080bfcf1a972f;p=urcu.git diff --git a/doc/examples/rculfhash/jhash.h b/doc/examples/rculfhash/jhash.h index fc3928e..23812ce 100644 --- a/doc/examples/rculfhash/jhash.h +++ b/doc/examples/rculfhash/jhash.h @@ -1,3 +1,7 @@ +// SPDX-FileCopyrightText: 2009-2012 Mathieu Desnoyers +// +// SPDX-License-Identifier: MIT + #ifndef _JHASH_H #define _JHASH_H @@ -6,20 +10,7 @@ #endif /* - * jhash.h - * * Example hash function. - * - * Copyright 2009-2012 - 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. */ /* @@ -116,7 +107,7 @@ uint32_t hashlittle(const void *key, size_t length, uint32_t initval) * rest of the string. Every machine with memory protection I've seen * does it on word boundaries, so is OK with this. But VALGRIND will * still catch it and complain. The masking trick does make the hash - * noticably faster for short strings (like English words). + * noticeably faster for short strings (like English words). */ #ifndef VALGRIND