projects
/
urcu.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
fix: shadowed local variable (-Wshadow)
[urcu.git]
/
tests
/
benchmark
/
test_urcu_hash.h
diff --git
a/tests/benchmark/test_urcu_hash.h
b/tests/benchmark/test_urcu_hash.h
index a72248511c6b42d844df9d58f3b3ef3f63287dc2..dfb8116a1fd2651ebcc6f565d3d9826beb86ce62 100644
(file)
--- a/
tests/benchmark/test_urcu_hash.h
+++ b/
tests/benchmark/test_urcu_hash.h
@@
-23,7
+23,6
@@
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
-#include "config.h"
#include <stdio.h>
#include <pthread.h>
#include <stdlib.h>
#include <stdio.h>
#include <pthread.h>
#include <stdlib.h>
@@
-37,8
+36,7
@@
#include <signal.h>
#include <urcu/tls-compat.h>
#include <signal.h>
#include <urcu/tls-compat.h>
-#include <urcu/rand-compat.h>
-#include "cpuset.h"
+#include <compat-rand.h>
#include "thread-id.h"
#include "../common/debug-yield.h"
#include "thread-id.h"
#include "../common/debug-yield.h"
@@
-250,10
+248,11
@@
uint32_t hash_u32(
/*----------------------------------- handle the last 3 uint32_t's */
switch (length) { /* all the case statements fall through */
/*----------------------------------- handle the last 3 uint32_t's */
switch (length) { /* all the case statements fall through */
- case 3: c += k[2];
- case 2: b += k[1];
+ case 3: c += k[2];
/* fall through */
+ case 2: b += k[1];
/* fall through */
case 1: a += k[0];
final(a, b, c);
case 1: a += k[0];
final(a, b, c);
+ /* fall through */
case 0: /* case 0: nothing left to add */
break;
}
case 0: /* case 0: nothing left to add */
break;
}
@@
-286,10
+285,11
@@
void hashword2(
/*----------------------------------- handle the last 3 uint32_t's */
switch (length) { /* all the case statements fall through */
/*----------------------------------- handle the last 3 uint32_t's */
switch (length) { /* all the case statements fall through */
- case 3: c += k[2];
- case 2: b += k[1];
+ case 3: c += k[2];
/* fall through */
+ case 2: b += k[1];
/* fall through */
case 1: a += k[0];
final(a, b, c);
case 1: a += k[0];
final(a, b, c);
+ /* fall through */
case 0: /* case 0: nothing left to add */
break;
}
case 0: /* case 0: nothing left to add */
break;
}
This page took
0.030563 seconds
and
4
git commands to generate.