LEFT | RIGHT |
1 /* This Source Code Form is subject to the terms of the Mozilla Public | 1 /* This Source Code Form is subject to the terms of the Mozilla Public |
2 * License, v. 2.0. If a copy of the MPL was not distributed with this | 2 * License, v. 2.0. If a copy of the MPL was not distributed with this |
3 * file, You can obtain one at http://mozilla.org/MPL/2.0/. */ | 3 * file, You can obtain one at http://mozilla.org/MPL/2.0/. */ |
4 | 4 |
5 /* This implementation of poly1305 is by Andrew Moon | 5 /* This implementation of poly1305 is by Andrew Moon |
6 * (https://github.com/floodyberry/poly1305-donna) and released as public | 6 * (https://github.com/floodyberry/poly1305-donna) and released as public |
7 * domain. */ | 7 * domain. */ |
8 | 8 |
9 #include <string.h> | 9 #include <string.h> |
10 #include <stdint.h> | 10 #include <stdint.h> |
11 #include "secport.h" | |
12 | 11 |
13 #include "poly1305.h" | 12 #include "poly1305.h" |
14 | 13 |
15 #if defined(NSS_X86) || defined(NSS_X64) | 14 #if defined(NSS_X86) || defined(NSS_X64) |
16 /* We can assume little-endian. */ | 15 /* We can assume little-endian. */ |
17 static uint32_t | 16 static uint32_t U8TO32_LE(const unsigned char *m) { |
18 U8TO32_LE(const unsigned char *m) | 17 » uint32_t r; |
19 { | 18 » memcpy(&r, m, sizeof(r)); |
20 uint32_t r; | 19 » return r; |
21 PORT_Memcpy(&r, m, sizeof(r)); | 20 } |
22 return r; | 21 |
23 } | 22 static void U32TO8_LE(unsigned char *m, uint32_t v) { |
24 | 23 » memcpy(m, &v, sizeof(v)); |
25 static void | |
26 U32TO8_LE(unsigned char *m, uint32_t v) | |
27 { | |
28 PORT_Memcpy(m, &v, sizeof(v)); | |
29 } | 24 } |
30 #else | 25 #else |
31 static void | 26 static uint32_t U8TO32_LE(const unsigned char *m) { |
32 U8TO32_LE(const unsigned char *m) | 27 » return (uint32_t)m[0] | |
33 { | 28 » (uint32_t)m[1] << 8 | |
34 return (uint32_t)m[0] | | 29 » (uint32_t)m[2] << 16 | |
35 (uint32_t)m[1] << 8 | | 30 » (uint32_t)m[3] << 24; |
36 (uint32_t)m[2] << 16 | | 31 } |
37 (uint32_t)m[3] << 24; | 32 |
38 } | 33 static void U32TO8_LE(unsigned char *m, uint32_t v) { |
39 | 34 » m[0] = v; |
40 static void | 35 » m[1] = v >> 8; |
41 U32TO8_LE(unsigned char *m, uint32_t v) | 36 » m[2] = v >> 16; |
42 { | 37 » m[3] = v >> 24; |
43 m[0] = v; | |
44 m[1] = v >> 8; | |
45 m[2] = v >> 16; | |
46 m[3] = v >> 24; | |
47 } | 38 } |
48 #endif | 39 #endif |
49 | 40 |
50 static uint64_t | 41 static uint64_t |
51 mul32x32_64(uint32_t a, uint32_t b) { | 42 mul32x32_64(uint32_t a, uint32_t b) { |
52 return (uint64_t)a * b; | 43 » return (uint64_t)a * b; |
53 } | 44 } |
54 | 45 |
55 struct poly1305_state_st { | 46 struct poly1305_state_st { |
56 uint32_t r0,r1,r2,r3,r4; | 47 » uint32_t r0,r1,r2,r3,r4; |
57 uint32_t s1,s2,s3,s4; | 48 » uint32_t s1,s2,s3,s4; |
58 uint32_t h0,h1,h2,h3,h4; | 49 » uint32_t h0,h1,h2,h3,h4; |
59 unsigned char buf[16]; | 50 » unsigned char buf[16]; |
60 unsigned int buf_used; | 51 » unsigned int buf_used; |
61 unsigned char key[16]; | 52 » unsigned char key[16]; |
62 }; | 53 }; |
63 | 54 |
64 /* update updates |state| given some amount of input data. This function may | 55 /* update updates |state| given some amount of input data. This function may |
65 * only be called with a |len| that is not a multiple of 16 at the end of the | 56 * only be called with a |len| that is not a multiple of 16 at the end of the |
66 * data. Otherwise the input must be buffered into 16 byte blocks. */ | 57 * data. Otherwise the input must be buffered into 16 byte blocks. */ |
67 static void | 58 static void update(struct poly1305_state_st *state, const unsigned char *in, |
68 update(struct poly1305_state_st *state, const unsigned char *in, size_t len) | 59 » » size_t len) { |
69 { | 60 » uint32_t t0,t1,t2,t3; |
70 uint32_t t0, t1, t2, t3; | 61 » uint64_t t[5]; |
71 uint64_t t[5]; | 62 » uint32_t b; |
72 uint32_t b; | 63 » uint64_t c; |
73 uint64_t c; | 64 » size_t j; |
74 size_t j; | 65 » unsigned char mp[16]; |
75 unsigned char mp[16]; | 66 |
76 | 67 » if (len < 16) |
77 if (len < 16) | 68 » » goto poly1305_donna_atmost15bytes; |
78 goto poly1305_donna_atmost15bytes; | |
79 | 69 |
80 poly1305_donna_16bytes: | 70 poly1305_donna_16bytes: |
81 t0 = U8TO32_LE(in); | 71 » t0 = U8TO32_LE(in); |
82 t1 = U8TO32_LE(in+4); | 72 » t1 = U8TO32_LE(in+4); |
83 t2 = U8TO32_LE(in+8); | 73 » t2 = U8TO32_LE(in+8); |
84 t3 = U8TO32_LE(in+12); | 74 » t3 = U8TO32_LE(in+12); |
85 | 75 |
86 in += 16; | 76 » in += 16; |
87 len -= 16; | 77 » len -= 16; |
88 | 78 |
89 state->h0 += t0 & 0x3ffffff; | 79 » state->h0 += t0 & 0x3ffffff; |
90 state->h1 += ((((uint64_t)t1 << 32) | t0) >> 26) & 0x3ffffff; | 80 » state->h1 += ((((uint64_t)t1 << 32) | t0) >> 26) & 0x3ffffff; |
91 state->h2 += ((((uint64_t)t2 << 32) | t1) >> 20) & 0x3ffffff; | 81 » state->h2 += ((((uint64_t)t2 << 32) | t1) >> 20) & 0x3ffffff; |
92 state->h3 += ((((uint64_t)t3 << 32) | t2) >> 14) & 0x3ffffff; | 82 » state->h3 += ((((uint64_t)t3 << 32) | t2) >> 14) & 0x3ffffff; |
93 state->h4 += (t3 >> 8) | (1 << 24); | 83 » state->h4 += (t3 >> 8) | (1 << 24); |
94 | 84 |
95 poly1305_donna_mul: | 85 poly1305_donna_mul: |
96 t[0] = mul32x32_64(state->h0,state->r0) + | 86 » t[0] = mul32x32_64(state->h0,state->r0) + |
97 mul32x32_64(state->h1,state->s4) + | 87 » mul32x32_64(state->h1,state->s4) + |
98 mul32x32_64(state->h2,state->s3) + | 88 » mul32x32_64(state->h2,state->s3) + |
99 mul32x32_64(state->h3,state->s2) + | 89 » mul32x32_64(state->h3,state->s2) + |
100 mul32x32_64(state->h4,state->s1); | 90 » mul32x32_64(state->h4,state->s1); |
101 t[1] = mul32x32_64(state->h0,state->r1) + | 91 » t[1] = mul32x32_64(state->h0,state->r1) + |
102 mul32x32_64(state->h1,state->r0) + | 92 » mul32x32_64(state->h1,state->r0) + |
103 mul32x32_64(state->h2,state->s4) + | 93 » mul32x32_64(state->h2,state->s4) + |
104 mul32x32_64(state->h3,state->s3) + | 94 » mul32x32_64(state->h3,state->s3) + |
105 mul32x32_64(state->h4,state->s2); | 95 » mul32x32_64(state->h4,state->s2); |
106 t[2] = mul32x32_64(state->h0,state->r2) + | 96 » t[2] = mul32x32_64(state->h0,state->r2) + |
107 mul32x32_64(state->h1,state->r1) + | 97 » mul32x32_64(state->h1,state->r1) + |
108 mul32x32_64(state->h2,state->r0) + | 98 » mul32x32_64(state->h2,state->r0) + |
109 mul32x32_64(state->h3,state->s4) + | 99 » mul32x32_64(state->h3,state->s4) + |
110 mul32x32_64(state->h4,state->s3); | 100 » mul32x32_64(state->h4,state->s3); |
111 t[3] = mul32x32_64(state->h0,state->r3) + | 101 » t[3] = mul32x32_64(state->h0,state->r3) + |
112 mul32x32_64(state->h1,state->r2) + | 102 » mul32x32_64(state->h1,state->r2) + |
113 mul32x32_64(state->h2,state->r1) + | 103 » mul32x32_64(state->h2,state->r1) + |
114 mul32x32_64(state->h3,state->r0) + | 104 » mul32x32_64(state->h3,state->r0) + |
115 mul32x32_64(state->h4,state->s4); | 105 » mul32x32_64(state->h4,state->s4); |
116 t[4] = mul32x32_64(state->h0,state->r4) + | 106 » t[4] = mul32x32_64(state->h0,state->r4) + |
117 mul32x32_64(state->h1,state->r3) + | 107 » mul32x32_64(state->h1,state->r3) + |
118 mul32x32_64(state->h2,state->r2) + | 108 » mul32x32_64(state->h2,state->r2) + |
119 mul32x32_64(state->h3,state->r1) + | 109 » mul32x32_64(state->h3,state->r1) + |
120 mul32x32_64(state->h4,state->r0); | 110 » mul32x32_64(state->h4,state->r0); |
121 | 111 |
122 state->h0 = (uint32_t)t[0] & 0x3ffffff; c = (t[0] >> 26
); | 112 » state->h0 = (uint32_t)t[0] & 0x3ffffff; c = (t[0] >
> 26); |
123 t[1] += c; state->h1 = (uint32_t)t[1] & 0x3ffffff; b = (uint32_t)(t[1] >> 26
); | 113 » t[1] += c; state->h1 = (uint32_t)t[1] & 0x3ffffff; b = (uint32_t)(t[1] >
> 26); |
124 t[2] += b; state->h2 = (uint32_t)t[2] & 0x3ffffff; b = (uint32_t)(t[2] >> 26
); | 114 » t[2] += b; state->h2 = (uint32_t)t[2] & 0x3ffffff; b = (uint32_t)(t[2] >
> 26); |
125 t[3] += b; state->h3 = (uint32_t)t[3] & 0x3ffffff; b = (uint32_t)(t[3] >> 26
); | 115 » t[3] += b; state->h3 = (uint32_t)t[3] & 0x3ffffff; b = (uint32_t)(t[3] >
> 26); |
126 t[4] += b; state->h4 = (uint32_t)t[4] & 0x3ffffff; b = (uint32_t)(t[4] >> 26
); | 116 » t[4] += b; state->h4 = (uint32_t)t[4] & 0x3ffffff; b = (uint32_t)(t[4] >
> 26); |
127 state->h0 += b * 5; | 117 » state->h0 += b * 5; |
128 | 118 |
129 if (len >= 16) | 119 » if (len >= 16) |
130 goto poly1305_donna_16bytes; | 120 » » goto poly1305_donna_16bytes; |
131 | 121 |
132 /* final bytes */ | 122 » /* final bytes */ |
133 poly1305_donna_atmost15bytes: | 123 poly1305_donna_atmost15bytes: |
134 if (!len) | 124 » if (!len) |
135 return; | 125 » » return; |
136 | 126 |
137 for (j = 0; j < len; j++) | 127 » for (j = 0; j < len; j++) |
138 mp[j] = in[j]; | 128 » » mp[j] = in[j]; |
139 mp[j++] = 1; | 129 » mp[j++] = 1; |
140 for (; j < 16; j++) | 130 » for (; j < 16; j++) |
141 mp[j] = 0; | 131 » » mp[j] = 0; |
142 len = 0; | 132 » len = 0; |
143 | 133 |
144 t0 = U8TO32_LE(mp+0); | 134 » t0 = U8TO32_LE(mp+0); |
145 t1 = U8TO32_LE(mp+4); | 135 » t1 = U8TO32_LE(mp+4); |
146 t2 = U8TO32_LE(mp+8); | 136 » t2 = U8TO32_LE(mp+8); |
147 t3 = U8TO32_LE(mp+12); | 137 » t3 = U8TO32_LE(mp+12); |
148 | 138 |
149 state->h0 += t0 & 0x3ffffff; | 139 » state->h0 += t0 & 0x3ffffff; |
150 state->h1 += ((((uint64_t)t1 << 32) | t0) >> 26) & 0x3ffffff; | 140 » state->h1 += ((((uint64_t)t1 << 32) | t0) >> 26) & 0x3ffffff; |
151 state->h2 += ((((uint64_t)t2 << 32) | t1) >> 20) & 0x3ffffff; | 141 » state->h2 += ((((uint64_t)t2 << 32) | t1) >> 20) & 0x3ffffff; |
152 state->h3 += ((((uint64_t)t3 << 32) | t2) >> 14) & 0x3ffffff; | 142 » state->h3 += ((((uint64_t)t3 << 32) | t2) >> 14) & 0x3ffffff; |
153 state->h4 += (t3 >> 8); | 143 » state->h4 += (t3 >> 8); |
154 | 144 |
155 goto poly1305_donna_mul; | 145 » goto poly1305_donna_mul; |
156 } | 146 } |
157 | 147 |
158 void | 148 void Poly1305Init(poly1305_state *statep, const unsigned char key[32]) { |
159 Poly1305Init(poly1305_state *statep, const unsigned char key[32]) | 149 » struct poly1305_state_st *state = (struct poly1305_state_st*) statep; |
160 { | 150 » uint32_t t0,t1,t2,t3; |
161 struct poly1305_state_st *state = (struct poly1305_state_st *)statep; | 151 |
162 uint32_t t0, t1, t2, t3; | 152 » t0 = U8TO32_LE(key+0); |
163 | 153 » t1 = U8TO32_LE(key+4); |
164 t0 = U8TO32_LE(key+0); | 154 » t2 = U8TO32_LE(key+8); |
165 t1 = U8TO32_LE(key+4); | 155 » t3 = U8TO32_LE(key+12); |
166 t2 = U8TO32_LE(key+8); | 156 |
167 t3 = U8TO32_LE(key+12); | 157 » /* precompute multipliers */ |
168 | 158 » state->r0 = t0 & 0x3ffffff; t0 >>= 26; t0 |= t1 << 6; |
169 /* precompute multipliers */ | 159 » state->r1 = t0 & 0x3ffff03; t1 >>= 20; t1 |= t2 << 12; |
170 state->r0 = t0 & 0x3ffffff; t0 >>= 26; t0 |= t1 << 6; | 160 » state->r2 = t1 & 0x3ffc0ff; t2 >>= 14; t2 |= t3 << 18; |
171 state->r1 = t0 & 0x3ffff03; t1 >>= 20; t1 |= t2 << 12; | 161 » state->r3 = t2 & 0x3f03fff; t3 >>= 8; |
172 state->r2 = t1 & 0x3ffc0ff; t2 >>= 14; t2 |= t3 << 18; | 162 » state->r4 = t3 & 0x00fffff; |
173 state->r3 = t2 & 0x3f03fff; t3 >>= 8; | 163 |
174 state->r4 = t3 & 0x00fffff; | 164 » state->s1 = state->r1 * 5; |
175 | 165 » state->s2 = state->r2 * 5; |
176 state->s1 = state->r1 * 5; | 166 » state->s3 = state->r3 * 5; |
177 state->s2 = state->r2 * 5; | 167 » state->s4 = state->r4 * 5; |
178 state->s3 = state->r3 * 5; | 168 |
179 state->s4 = state->r4 * 5; | 169 » /* init state */ |
180 | 170 » state->h0 = 0; |
181 /* init state */ | 171 » state->h1 = 0; |
182 state->h0 = 0; | 172 » state->h2 = 0; |
183 state->h1 = 0; | 173 » state->h3 = 0; |
184 state->h2 = 0; | 174 » state->h4 = 0; |
185 state->h3 = 0; | 175 |
186 state->h4 = 0; | 176 » state->buf_used = 0; |
187 | 177 » memcpy(state->key, key + 16, sizeof(state->key)); |
188 state->buf_used = 0; | 178 } |
189 PORT_Memcpy(state->key, key + 16, sizeof(state->key)); | 179 |
190 } | 180 void Poly1305Update(poly1305_state *statep, const unsigned char *in, |
191 | 181 » » size_t in_len) { |
192 void | 182 » unsigned int i; |
193 Poly1305Update(poly1305_state *statep, const unsigned char *in, size_t in_len) | 183 » struct poly1305_state_st *state = (struct poly1305_state_st*) statep; |
194 { | 184 |
195 unsigned int i; | 185 » if (state->buf_used) { |
196 struct poly1305_state_st *state = (struct poly1305_state_st *)statep; | 186 » » unsigned int todo = 16 - state->buf_used; |
197 | 187 » » if (todo > in_len) |
198 if (state->buf_used) { | 188 » » » todo = in_len; |
199 unsigned int todo = 16 - state->buf_used; | 189 » » for (i = 0; i < todo; i++) |
200 if (todo > in_len) | 190 » » » state->buf[state->buf_used + i] = in[i]; |
201 todo = in_len; | 191 » » state->buf_used += todo; |
202 for (i = 0; i < todo; i++) | 192 » » in_len -= todo; |
203 state->buf[state->buf_used + i] = in[i]; | 193 » » in += todo; |
204 state->buf_used += todo; | 194 |
205 in_len -= todo; | 195 » » if (state->buf_used == 16) { |
206 in += todo; | 196 » » » update(state, state->buf, 16); |
207 | 197 » » » state->buf_used = 0; |
208 if (state->buf_used == 16) { | 198 » » } |
209 update(state, state->buf, 16); | 199 » } |
210 state->buf_used = 0; | 200 |
211 } | 201 » if (in_len >= 16) { |
212 } | 202 » » size_t todo = in_len & ~0xf; |
213 | 203 » » update(state, in, todo); |
214 if (in_len >= 16) { | 204 » » in += todo; |
215 size_t todo = in_len & ~0xf; | 205 » » in_len &= 0xf; |
216 update(state, in, todo); | 206 » } |
217 in += todo; | 207 |
218 in_len &= 0xf; | 208 » if (in_len) { |
219 } | 209 » » for (i = 0; i < in_len; i++) |
220 | 210 » » » state->buf[i] = in[i]; |
221 if (in_len) { | 211 » » state->buf_used = in_len; |
222 for (i = 0; i < in_len; i++) | 212 » } |
223 state->buf[i] = in[i]; | 213 } |
224 state->buf_used = in_len; | 214 |
225 } | 215 void Poly1305Finish(poly1305_state *statep, unsigned char mac[16]) { |
226 } | 216 » struct poly1305_state_st *state = (struct poly1305_state_st*) statep; |
227 | 217 » uint64_t f0,f1,f2,f3; |
228 void | 218 » uint32_t g0,g1,g2,g3,g4; |
229 Poly1305Finish(poly1305_state *statep, unsigned char mac[16]) | 219 » uint32_t b, nb; |
230 { | 220 |
231 struct poly1305_state_st *state = (struct poly1305_state_st *)statep; | 221 » if (state->buf_used) |
232 uint64_t f0, f1, f2, f3; | 222 » » update(state, state->buf, state->buf_used); |
233 uint32_t g0, g1, g2, g3, g4; | 223 |
234 uint32_t b, nb; | 224 » b = state->h0 >> 26; state->h0 = state->h0 & 0x3ffff
ff; |
235 | 225 » state->h1 += b; b = state->h1 >> 26; state->h1 = state->h1 & 0x3ffff
ff; |
236 if (state->buf_used) | 226 » state->h2 += b; b = state->h2 >> 26; state->h2 = state->h2 & 0x3ffff
ff; |
237 update(state, state->buf, state->buf_used); | 227 » state->h3 += b; b = state->h3 >> 26; state->h3 = state->h3 & 0x3ffff
ff; |
238 | 228 » state->h4 += b; b = state->h4 >> 26; state->h4 = state->h4 & 0x3ffff
ff; |
239 b = state->h0 >> 26; state->h0 = state->h0 & 0x3ffffff; | 229 » state->h0 += b * 5; |
240 state->h1 += b; b = state->h1 >> 26; state->h1 = state->h1 & 0x3ffffff; | 230 |
241 state->h2 += b; b = state->h2 >> 26; state->h2 = state->h2 & 0x3ffffff; | 231 » g0 = state->h0 + 5; b = g0 >> 26; g0 &= 0x3ffffff; |
242 state->h3 += b; b = state->h3 >> 26; state->h3 = state->h3 & 0x3ffffff; | 232 » g1 = state->h1 + b; b = g1 >> 26; g1 &= 0x3ffffff; |
243 state->h4 += b; b = state->h4 >> 26; state->h4 = state->h4 & 0x3ffffff; | 233 » g2 = state->h2 + b; b = g2 >> 26; g2 &= 0x3ffffff; |
244 state->h0 += b * 5; | 234 » g3 = state->h3 + b; b = g3 >> 26; g3 &= 0x3ffffff; |
245 | 235 » g4 = state->h4 + b - (1 << 26); |
246 g0 = state->h0 + 5; b = g0 >> 26; g0 &= 0x3ffffff; | 236 |
247 g1 = state->h1 + b; b = g1 >> 26; g1 &= 0x3ffffff; | 237 » b = (g4 >> 31) - 1; |
248 g2 = state->h2 + b; b = g2 >> 26; g2 &= 0x3ffffff; | 238 » nb = ~b; |
249 g3 = state->h3 + b; b = g3 >> 26; g3 &= 0x3ffffff; | 239 » state->h0 = (state->h0 & nb) | (g0 & b); |
250 g4 = state->h4 + b - (1 << 26); | 240 » state->h1 = (state->h1 & nb) | (g1 & b); |
251 | 241 » state->h2 = (state->h2 & nb) | (g2 & b); |
252 b = (g4 >> 31) - 1; | 242 » state->h3 = (state->h3 & nb) | (g3 & b); |
253 nb = ~b; | 243 » state->h4 = (state->h4 & nb) | (g4 & b); |
254 state->h0 = (state->h0 & nb) | (g0 & b); | 244 |
255 state->h1 = (state->h1 & nb) | (g1 & b); | 245 » f0 = ((state->h0 ) | (state->h1 << 26)) + (uint64_t)U8TO32_LE(&stat
e->key[0]); |
256 state->h2 = (state->h2 & nb) | (g2 & b); | 246 » f1 = ((state->h1 >> 6) | (state->h2 << 20)) + (uint64_t)U8TO32_LE(&stat
e->key[4]); |
257 state->h3 = (state->h3 & nb) | (g3 & b); | 247 » f2 = ((state->h2 >> 12) | (state->h3 << 14)) + (uint64_t)U8TO32_LE(&stat
e->key[8]); |
258 state->h4 = (state->h4 & nb) | (g4 & b); | 248 » f3 = ((state->h3 >> 18) | (state->h4 << 8)) + (uint64_t)U8TO32_LE(&stat
e->key[12]); |
259 | 249 |
260 f0 = ((state->h0 ) | (state->h1 << 26)) + (uint64_t)U8TO32_LE(&state->k
ey[0]); | 250 » U32TO8_LE(&mac[ 0], (uint32_t)f0); f1 += (f0 >> 32); |
261 f1 = ((state->h1 >> 6) | (state->h2 << 20)) + (uint64_t)U8TO32_LE(&state->k
ey[4]); | 251 » U32TO8_LE(&mac[ 4], (uint32_t)f1); f2 += (f1 >> 32); |
262 f2 = ((state->h2 >> 12) | (state->h3 << 14)) + (uint64_t)U8TO32_LE(&state->k
ey[8]); | 252 » U32TO8_LE(&mac[ 8], (uint32_t)f2); f3 += (f2 >> 32); |
263 f3 = ((state->h3 >> 18) | (state->h4 << 8)) + (uint64_t)U8TO32_LE(&state->k
ey[12]); | 253 » U32TO8_LE(&mac[12], (uint32_t)f3); |
264 | 254 } |
265 U32TO8_LE(&mac[ 0], f0); f1 += (f0 >> 32); | |
266 U32TO8_LE(&mac[ 4], f1); f2 += (f1 >> 32); | |
267 U32TO8_LE(&mac[ 8], f2); f3 += (f2 >> 32); | |
268 U32TO8_LE(&mac[12], f3); | |
269 } | |
LEFT | RIGHT |