| line |
stmt |
bran |
cond |
sub |
pod |
time |
code |
|
1
|
|
|
|
|
|
|
/* |
|
2
|
|
|
|
|
|
|
* Copyright (c) 2017 Thomas Pornin |
|
3
|
|
|
|
|
|
|
* |
|
4
|
|
|
|
|
|
|
* Permission is hereby granted, free of charge, to any person obtaining |
|
5
|
|
|
|
|
|
|
* a copy of this software and associated documentation files (the |
|
6
|
|
|
|
|
|
|
* "Software"), to deal in the Software without restriction, including |
|
7
|
|
|
|
|
|
|
* without limitation the rights to use, copy, modify, merge, publish, |
|
8
|
|
|
|
|
|
|
* distribute, sublicense, and/or sell copies of the Software, and to |
|
9
|
|
|
|
|
|
|
* permit persons to whom the Software is furnished to do so, subject to |
|
10
|
|
|
|
|
|
|
* the following conditions: |
|
11
|
|
|
|
|
|
|
* |
|
12
|
|
|
|
|
|
|
* The above copyright notice and this permission notice shall be |
|
13
|
|
|
|
|
|
|
* included in all copies or substantial portions of the Software. |
|
14
|
|
|
|
|
|
|
* |
|
15
|
|
|
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, |
|
16
|
|
|
|
|
|
|
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF |
|
17
|
|
|
|
|
|
|
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND |
|
18
|
|
|
|
|
|
|
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS |
|
19
|
|
|
|
|
|
|
* BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN |
|
20
|
|
|
|
|
|
|
* ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN |
|
21
|
|
|
|
|
|
|
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE |
|
22
|
|
|
|
|
|
|
* SOFTWARE. |
|
23
|
|
|
|
|
|
|
*/ |
|
24
|
|
|
|
|
|
|
|
|
25
|
|
|
|
|
|
|
#include "inner.h" |
|
26
|
|
|
|
|
|
|
|
|
27
|
|
|
|
|
|
|
/* see inner.h */ |
|
28
|
|
|
|
|
|
|
void |
|
29
|
0
|
|
|
|
|
|
br_i15_rshift(uint16_t *x, int count) |
|
30
|
|
|
|
|
|
|
{ |
|
31
|
|
|
|
|
|
|
size_t u, len; |
|
32
|
|
|
|
|
|
|
unsigned r; |
|
33
|
|
|
|
|
|
|
|
|
34
|
0
|
|
|
|
|
|
len = (x[0] + 15) >> 4; |
|
35
|
0
|
0
|
|
|
|
|
if (len == 0) { |
|
36
|
0
|
|
|
|
|
|
return; |
|
37
|
|
|
|
|
|
|
} |
|
38
|
0
|
|
|
|
|
|
r = x[1] >> count; |
|
39
|
0
|
0
|
|
|
|
|
for (u = 2; u <= len; u ++) { |
|
40
|
|
|
|
|
|
|
unsigned w; |
|
41
|
|
|
|
|
|
|
|
|
42
|
0
|
|
|
|
|
|
w = x[u]; |
|
43
|
0
|
|
|
|
|
|
x[u - 1] = ((w << (15 - count)) | r) & 0x7FFF; |
|
44
|
0
|
|
|
|
|
|
r = w >> count; |
|
45
|
|
|
|
|
|
|
} |
|
46
|
0
|
|
|
|
|
|
x[len] = r; |
|
47
|
|
|
|
|
|
|
} |