FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
jruby/core/src/main/java/org/jruby/util/SipHashInline.java at master · jruby/jruby · GitHub
Uh oh!
There was an error while loading.
Please reload this page
.
jruby
/
jruby
Public
Uh oh!
There was an error while loading.
Please reload this page
.
Notifications
You must be signed in to change notification settings
Fork
946
Star
3.9k
Code
Issues
840
Pull requests
109
Discussions
Actions
Projects
Wiki
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Discussions
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
jruby
/
core
/
src
/
main
/
java
/
org
/
jruby
/
util
/
SipHashInline.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
147 lines (136 loc) · 5.28 KB
Breadcrumbs
jruby
/
core
/
src
/
main
/
java
/
org
/
jruby
/
util
/
SipHashInline.java
Copy path
File metadata and controls
147 lines (136 loc) · 5.28 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
package
org
.
jruby
.
util
;
import
java
.
lang
.
invoke
.
MethodHandles
;
import
java
.
lang
.
invoke
.
VarHandle
;
import
java
.
nio
.
ByteOrder
;
/**
* SipHash implementation with hand inlining the SIPROUND.
*
* To know details about SipHash, see;
* "a fast short-input PRF" https://www.131002.net/siphash/
*
* @author nahi@ruby-lang.org
*/
public
class
SipHashInline
{
public
static
long
hash24
(
long
k0
,
long
k1
,
byte
[]
data
) {
return
hash24
(
k0
,
k1
,
data
,
0
,
data
.
length
);
}
public
static
long
hash24
(
long
k0
,
long
k1
,
byte
[]
src
,
int
offset
,
int
length
) {
long
v0
=
0x736f6d6570736575L
^
k0
;
long
v1
=
0x646f72616e646f6dL
^
k1
;
long
v2
=
0x6c7967656e657261L
^
k0
;
long
v3
=
0x7465646279746573L
^
k1
;
long
m
;
int
last
=
offset
+
length
/
8
*
8
;
int
i
=
offset
;
if
(
offset
<
0
) {
throw
new
ArrayIndexOutOfBoundsException
(
offset
);
}
else
if
(
offset
+
length
>
src
.
length
) {
throw
new
ArrayIndexOutOfBoundsException
(
src
.
length
);
}
// processing 8 bytes blocks in data
while
(
i
<
last
) {
m
= (
long
)
BYTE_ARRAY_HANDLE
.
get
(
src
,
i
);
i
+=
8
;
// MSGROUND {
v3
^=
m
;
/* SIPROUND with hand reordering
*
* SIPROUND in siphash24.c:
* A: v0 += v1;
* B: v1=ROTL(v1,13);
* C: v1 ^= v0;
* D: v0=ROTL(v0,32);
* E: v2 += v3;
* F: v3=ROTL(v3,16);
* G: v3 ^= v2;
* H: v0 += v3;
* I: v3=ROTL(v3,21);
* J: v3 ^= v0;
* K: v2 += v1;
* L: v1=ROTL(v1,17);
* M: v1 ^= v2;
* N: v2=ROTL(v2,32);
*
* Each dependency:
* B$ -> A
* C$ -> A, B
* D$ -> C
* F$ -> E
* G$ -> E, F
* H$ -> D, G
* I$ -> H
* J$ -> H, I
* K$ -> C, G
* L$ -> K
* M$ -> K, L
* N$ -> M
*
* Dependency graph:
* D$ -> C -> B -> A
* G$ -> F -> E
* J$ -> I -> H -> D, G
* N$ -> M -> L -> K -> C, G
*
* Resulting parallel friendly execution order:
* $ -> ABCDHIJ
* $ -> EFGKLMN
*/
// SIPROUND {
v0
+=
v1
;
v2
+=
v3
;
v1
= (
v1
<<
13
) |
v1
>>>
51
;
v3
= (
v3
<<
16
) |
v3
>>>
48
;
v1
^=
v0
;
v3
^=
v2
;
v0
= (
v0
<<
32
) |
v0
>>>
32
;
v2
+=
v1
;
v0
+=
v3
;
v1
= (
v1
<<
17
) |
v1
>>>
47
;
v3
= (
v3
<<
21
) |
v3
>>>
43
;
v1
^=
v2
;
v3
^=
v0
;
v2
= (
v2
<<
32
) |
v2
>>>
32
;
// }
// SIPROUND {
v0
+=
v1
;
v2
+=
v3
;
v1
= (
v1
<<
13
) |
v1
>>>
51
;
v3
= (
v3
<<
16
) |
v3
>>>
48
;
v1
^=
v0
;
v3
^=
v2
;
v0
= (
v0
<<
32
) |
v0
>>>
32
;
v2
+=
v1
;
v0
+=
v3
;
v1
= (
v1
<<
17
) |
v1
>>>
47
;
v3
= (
v3
<<
21
) |
v3
>>>
43
;
v1
^=
v2
;
v3
^=
v0
;
v2
= (
v2
<<
32
) |
v2
>>>
32
;
// }
v0
^=
m
;
// }
}
// packing the last block to long, as LE 0-7 bytes + the length in the top byte
m
=
0
;
for
(
i
=
offset
+
length
-
1
;
i
>=
last
; --
i
) {
m
<<=
8
;
m
|= (
long
)
src
[
i
];
}
m
|= (
long
)
length
<<
56
;
// MSGROUND {
v3
^=
m
;
for
(
int
j
=
0
;
j
<
2
;
j
++) {
// SIPROUND {
v0
+=
v1
;
v2
+=
v3
;
v1
= (
v1
<<
13
) |
v1
>>>
51
;
v3
= (
v3
<<
16
) |
v3
>>>
48
;
v1
^=
v0
;
v3
^=
v2
;
v0
= (
v0
<<
32
) |
v0
>>>
32
;
v2
+=
v1
;
v0
+=
v3
;
v1
= (
v1
<<
17
) |
v1
>>>
47
;
v3
= (
v3
<<
21
) |
v3
>>>
43
;
v1
^=
v2
;
v3
^=
v0
;
v2
= (
v2
<<
32
) |
v2
>>>
32
;
// }
}
v0
^=
m
;
// }
// finishing...
v2
^=
0xff
;
for
(
int
j
=
0
;
j
<
4
;
j
++) {
// SIPROUND {
v0
+=
v1
;
v2
+=
v3
;
v1
= (
v1
<<
13
) |
v1
>>>
51
;
v3
= (
v3
<<
16
) |
v3
>>>
48
;
v1
^=
v0
;
v3
^=
v2
;
v0
= (
v0
<<
32
) |
v0
>>>
32
;
v2
+=
v1
;
v0
+=
v3
;
v1
= (
v1
<<
17
) |
v1
>>>
47
;
v3
= (
v3
<<
21
) |
v3
>>>
43
;
v1
^=
v2
;
v3
^=
v0
;
v2
= (
v2
<<
32
) |
v2
>>>
32
;
// }
}
return
v0
^
v1
^
v2
^
v3
;
}
static
final
VarHandle
BYTE_ARRAY_HANDLE
=
MethodHandles
.
byteArrayViewVarHandle
(
long
[].
class
,
ByteOrder
.
nativeOrder
());
}
Back
|
FazBrowse Home
|
New Git URL