Commit | Line | Data |
---|---|---|
3ce9d0d4 LL |
1 | /* uint64_t-like operations that work even on hosts lacking uint64_t |
2 | ||
caf8a9b2 | 3 | Copyright (C) 2006, 2009-2012 Free Software Foundation, Inc. |
3ce9d0d4 LL |
4 | |
5 | This program is free software: you can redistribute it and/or modify | |
6 | it under the terms of the GNU General Public License as published by | |
7 | the Free Software Foundation, either version 3 of the License, or | |
8 | (at your option) any later version. | |
9 | ||
10 | This program is distributed in the hope that it will be useful, | |
11 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
13 | GNU General Public License for more details. | |
14 | ||
15 | You should have received a copy of the GNU General Public License | |
16 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ | |
17 | ||
18 | /* Written by Paul Eggert. */ | |
19 | ||
20 | #include <stdint.h> | |
21 | ||
22 | /* Return X rotated left by N bits, where 0 < N < 64. */ | |
23 | #define u64rol(x, n) u64or (u64shl (x, n), u64shr (x, 64 - n)) | |
24 | ||
25 | #ifdef UINT64_MAX | |
26 | ||
27 | /* Native implementations are trivial. See below for comments on what | |
28 | these operations do. */ | |
29 | typedef uint64_t u64; | |
30 | # define u64hilo(hi, lo) ((u64) (((u64) (hi) << 32) + (lo))) | |
31 | # define u64init(hi, lo) u64hilo (hi, lo) | |
32 | # define u64lo(x) ((u64) (x)) | |
caf8a9b2 | 33 | # define u64size(x) u64lo (x) |
3ce9d0d4 LL |
34 | # define u64lt(x, y) ((x) < (y)) |
35 | # define u64and(x, y) ((x) & (y)) | |
36 | # define u64or(x, y) ((x) | (y)) | |
37 | # define u64xor(x, y) ((x) ^ (y)) | |
38 | # define u64plus(x, y) ((x) + (y)) | |
39 | # define u64shl(x, n) ((x) << (n)) | |
40 | # define u64shr(x, n) ((x) >> (n)) | |
41 | ||
42 | #else | |
43 | ||
44 | /* u64 is a 64-bit unsigned integer value. | |
45 | u64init (HI, LO), is like u64hilo (HI, LO), but for use in | |
46 | initializer contexts. */ | |
47 | # ifdef WORDS_BIGENDIAN | |
48 | typedef struct { uint32_t hi, lo; } u64; | |
49 | # define u64init(hi, lo) { hi, lo } | |
50 | # else | |
51 | typedef struct { uint32_t lo, hi; } u64; | |
52 | # define u64init(hi, lo) { lo, hi } | |
53 | # endif | |
54 | ||
55 | /* Given the high and low-order 32-bit quantities HI and LO, return a u64 | |
56 | value representing (HI << 32) + LO. */ | |
57 | static inline u64 | |
58 | u64hilo (uint32_t hi, uint32_t lo) | |
59 | { | |
60 | u64 r; | |
61 | r.hi = hi; | |
62 | r.lo = lo; | |
63 | return r; | |
64 | } | |
65 | ||
66 | /* Return a u64 value representing LO. */ | |
67 | static inline u64 | |
68 | u64lo (uint32_t lo) | |
69 | { | |
70 | u64 r; | |
71 | r.hi = 0; | |
72 | r.lo = lo; | |
73 | return r; | |
74 | } | |
75 | ||
caf8a9b2 PE |
76 | /* Return a u64 value representing SIZE. */ |
77 | static inline u64 | |
78 | u64size (size_t size) | |
79 | { | |
80 | u64 r; | |
81 | r.hi = size >> 31 >> 1; | |
82 | r.lo = size; | |
83 | return r; | |
84 | } | |
85 | ||
3ce9d0d4 LL |
86 | /* Return X < Y. */ |
87 | static inline int | |
88 | u64lt (u64 x, u64 y) | |
89 | { | |
90 | return x.hi < y.hi || (x.hi == y.hi && x.lo < y.lo); | |
91 | } | |
92 | ||
93 | /* Return X & Y. */ | |
94 | static inline u64 | |
95 | u64and (u64 x, u64 y) | |
96 | { | |
97 | u64 r; | |
98 | r.hi = x.hi & y.hi; | |
99 | r.lo = x.lo & y.lo; | |
100 | return r; | |
101 | } | |
102 | ||
103 | /* Return X | Y. */ | |
104 | static inline u64 | |
105 | u64or (u64 x, u64 y) | |
106 | { | |
107 | u64 r; | |
108 | r.hi = x.hi | y.hi; | |
109 | r.lo = x.lo | y.lo; | |
110 | return r; | |
111 | } | |
112 | ||
113 | /* Return X ^ Y. */ | |
114 | static inline u64 | |
115 | u64xor (u64 x, u64 y) | |
116 | { | |
117 | u64 r; | |
118 | r.hi = x.hi ^ y.hi; | |
119 | r.lo = x.lo ^ y.lo; | |
120 | return r; | |
121 | } | |
122 | ||
123 | /* Return X + Y. */ | |
124 | static inline u64 | |
125 | u64plus (u64 x, u64 y) | |
126 | { | |
127 | u64 r; | |
128 | r.lo = x.lo + y.lo; | |
129 | r.hi = x.hi + y.hi + (r.lo < x.lo); | |
130 | return r; | |
131 | } | |
132 | ||
133 | /* Return X << N. */ | |
134 | static inline u64 | |
135 | u64shl (u64 x, int n) | |
136 | { | |
137 | u64 r; | |
138 | if (n < 32) | |
139 | { | |
140 | r.hi = (x.hi << n) | (x.lo >> (32 - n)); | |
141 | r.lo = x.lo << n; | |
142 | } | |
143 | else | |
144 | { | |
145 | r.hi = x.lo << (n - 32); | |
146 | r.lo = 0; | |
147 | } | |
148 | return r; | |
149 | } | |
150 | ||
151 | /* Return X >> N. */ | |
152 | static inline u64 | |
153 | u64shr (u64 x, int n) | |
154 | { | |
155 | u64 r; | |
156 | if (n < 32) | |
157 | { | |
158 | r.hi = x.hi >> n; | |
159 | r.lo = (x.hi << (32 - n)) | (x.lo >> n); | |
160 | } | |
161 | else | |
162 | { | |
163 | r.hi = 0; | |
164 | r.lo = x.hi >> (n - 32); | |
165 | } | |
166 | return r; | |
167 | } | |
168 | ||
169 | #endif |