nils/gluon
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

gluon-ebtables-limit-arp: fix c indentation

Browse Source
This commit is contained in:
Jan-Niklas Burfeind 2023-01-03 15:55:58 +01:00
parent d7f869ad6d
commit 6ff3217903
5 changed files with 720 additions and 722 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
package/gluon-ebtables-limit-arp/src/lookup3.c
View File

@ -442,7 +442,6 @@ uint32_t hashlittle( const void *key, size_t length, uint32_t initval)
case 0 : return c; case 0 : return c;
} }
} }
final(a,b,c); final(a,b,c);
return c; return c;
} }
@ -671,7 +670,7 @@ uint32_t hashbig( const void *key, size_t length, uint32_t initval)
* does it on word boundaries, so is OK with this. But VALGRIND will * 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 * still catch it and complain. The masking trick does make the hash
* noticeably faster for short strings (like English words). * noticeably faster for short strings (like English words).
*/ * */
#ifndef VALGRIND #ifndef VALGRIND
switch(length) switch(length)
@ -802,11 +801,10 @@ void driver2()
{ {
for (j=0; j<8; ++j) /*------------------------ for each input bit, */ for (j=0; j<8; ++j) /*------------------------ for each input bit, */
{ {
for (m=1; m<8; ++m) /*------------ for several possible initvals, */ for (m=1; m<8; ++m) /*------------ for serveral possible initvals, */
{ {
for (l=0; l<HASHSTATE; ++l) for (l=0; l<HASHSTATE; ++l)
e[l]=f[l]=g[l]=h[l]=x[l]=y[l]=~((uint32_t)0); e[l]=f[l]=g[l]=h[l]=x[l]=y[l]=~((uint32_t)0);
/*---- check that every output bit is affected by that input bit */ /*---- check that every output bit is affected by that input bit */
for (k=0; k<MAXPAIR; k+=2) for (k=0; k<MAXPAIR; k+=2)
{ {