-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathhtonlll.cpp
137 lines (119 loc) · 3.18 KB
/
htonlll.cpp
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
/*
Copyright (c) 2011, Charles Smith
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this
list of conditions and the following disclaimer in the documentation
and/or
other materials provided with the distribution.
* Neither the name of Vallona Networks nor the names of its contributors
may be used to endorse or promote products derived from this software
without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED.
IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY
DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
ADVISED
OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "saratoga.h"
#ifdef UINT128_T
/*
* Convert host to unsigned long long long
*/
uint128_t
htonll(uint128_t x)
{
union htonll_type
{
uint128_t ull;
char c[16];
};
union htonlll_type tmp, y;
static int i = 1;
/*
* We are Bigendian just return the same
*/
if ((*(char*)&i) == 0)
return ((uint128_t)x);
/*
* We are Little Endian swap the bytes
*/
tmp.ulll = x;
/*
* Yes I could of used a for loop but this is faster
*/
y.c[0] = tmp.c[15];
y.c[1] = tmp.c[14];
y.c[2] = tmp.c[13];
y.c[3] = tmp.c[12];
y.c[4] = tmp.c[11];
y.c[5] = tmp.c[10];
y.c[6] = tmp.c[9];
y.c[7] = tmp.c[8];
y.c[8] = tmp.c[7];
y.c[9] = tmp.c[6];
y.c[10] = tmp.c[5];
y.c[11] = tmp.c[4];
y.c[12] = tmp.c[3];
y.c[13] = tmp.c[2];
y.c[14] = tmp.c[1];
y.c[15] = tmp.c[0];
return ((uint128_t)y.ulll);
}
/*
* Convert network to host unsigned long long long
*/
uint128_t
ntohll(uint128_t x)
{
union htonlll_type
{
uint128_t ulll;
char c[16];
};
union htonlll_type tmp, y;
static int i = 1;
/*
* We are Bigendian just return the same
*/
if ((*(char*)&i) == 0)
return ((uint128_t)x);
/*
* We are Little Endian swap the bytes
*/
tmp.ulll = x;
// Yes same as above direct assignment is faster than a loop
y.c[0] = tmp.c[15];
y.c[1] = tmp.c[14];
y.c[2] = tmp.c[13];
y.c[3] = tmp.c[12];
y.c[4] = tmp.c[11];
y.c[5] = tmp.c[10];
y.c[6] = tmp.c[9];
y.c[7] = tmp.c[8];
y.c[8] = tmp.c[7];
y.c[9] = tmp.c[6];
y.c[10] = tmp.c[5];
y.c[11] = tmp.c[4];
y.c[12] = tmp.c[3];
y.c[13] = tmp.c[2];
y.c[14] = tmp.c[1];
y.c[15] = tmp.c[0];
return ((uint64_t)y.ull);
}
#endif // UINT128_T