Coverage Report

Created: 2026-02-26 06:38

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/freeradius-server/src/lib/util/sha1.c
Line
Count
Source
1
/** Local implementation of the SHA1 hashing scheme
2
 *
3
 * SHA-1 in C 100% Public Domain
4
 *
5
 * @file src/lib/util/sha1.c
6
 *
7
 * @author Steve Reid (steve@edmweb.com)
8
 */
9
RCSID("$Id: b5f509fb5eb8394674245c81ba412ce93bcbca91 $")
10
11
#include <freeradius-devel/util/sha1.h>
12
13
14
#ifndef WITH_OPENSSL_SHA1
15
0
#  define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
16
17
/* blk0() and blk() perform the initial expand. */
18
/* I got the idea of expanding during the round function from SSLeay */
19
20
0
#  define blk0(i) (block->l[i] = htonl(block->l[i]))
21
22
0
#  define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
23
0
    ^block->l[(i+2)&15]^block->l[i&15],1))
24
25
/* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
26
0
#  define R0(v,w,x,y,z,i) do { z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30); } while (0)
27
0
#  define R1(v,w,x,y,z,i) do { z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30); } while (0)
28
0
#  define R2(v,w,x,y,z,i) do { z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30); } while (0)
29
0
#  define R3(v,w,x,y,z,i) do { z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30); } while (0)
30
0
#  define R4(v,w,x,y,z,i) do { z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30); } while (0)
31
32
33
/* Hash a single 512-bit block. This is the core of the algorithm. */
34
35
void fr_sha1_transform(uint32_t state[static 5], uint8_t const buffer[static 64])
36
0
{
37
0
  uint32_t a, b, c, d, e;
38
0
  typedef union {
39
0
    uint8_t c[64];
40
0
    uint32_t l[16];
41
0
  } CHAR64LONG16;
42
0
  CHAR64LONG16 *block;
43
0
  uint64_t workspace[8];
44
45
0
  block = (CHAR64LONG16*)workspace;
46
0
  memcpy(block, buffer, 64);
47
48
  /* Copy context->state[] to working vars */
49
0
  a = state[0];
50
0
  b = state[1];
51
0
  c = state[2];
52
0
  d = state[3];
53
0
  e = state[4];
54
55
  /* 4 rounds of 20 operations each. Loop unrolled. */
56
0
  R0(a,b,c,d,e, 0); R0(e,a,b,c,d, 1); R0(d,e,a,b,c, 2); R0(c,d,e,a,b, 3);
57
0
  R0(b,c,d,e,a, 4); R0(a,b,c,d,e, 5); R0(e,a,b,c,d, 6); R0(d,e,a,b,c, 7);
58
0
  R0(c,d,e,a,b, 8); R0(b,c,d,e,a, 9); R0(a,b,c,d,e,10); R0(e,a,b,c,d,11);
59
0
  R0(d,e,a,b,c,12); R0(c,d,e,a,b,13); R0(b,c,d,e,a,14); R0(a,b,c,d,e,15);
60
0
  R1(e,a,b,c,d,16); R1(d,e,a,b,c,17); R1(c,d,e,a,b,18); R1(b,c,d,e,a,19);
61
0
  R2(a,b,c,d,e,20); R2(e,a,b,c,d,21); R2(d,e,a,b,c,22); R2(c,d,e,a,b,23);
62
0
  R2(b,c,d,e,a,24); R2(a,b,c,d,e,25); R2(e,a,b,c,d,26); R2(d,e,a,b,c,27);
63
0
  R2(c,d,e,a,b,28); R2(b,c,d,e,a,29); R2(a,b,c,d,e,30); R2(e,a,b,c,d,31);
64
0
  R2(d,e,a,b,c,32); R2(c,d,e,a,b,33); R2(b,c,d,e,a,34); R2(a,b,c,d,e,35);
65
0
  R2(e,a,b,c,d,36); R2(d,e,a,b,c,37); R2(c,d,e,a,b,38); R2(b,c,d,e,a,39);
66
0
  R3(a,b,c,d,e,40); R3(e,a,b,c,d,41); R3(d,e,a,b,c,42); R3(c,d,e,a,b,43);
67
0
  R3(b,c,d,e,a,44); R3(a,b,c,d,e,45); R3(e,a,b,c,d,46); R3(d,e,a,b,c,47);
68
0
  R3(c,d,e,a,b,48); R3(b,c,d,e,a,49); R3(a,b,c,d,e,50); R3(e,a,b,c,d,51);
69
0
  R3(d,e,a,b,c,52); R3(c,d,e,a,b,53); R3(b,c,d,e,a,54); R3(a,b,c,d,e,55);
70
0
  R3(e,a,b,c,d,56); R3(d,e,a,b,c,57); R3(c,d,e,a,b,58); R3(b,c,d,e,a,59);
71
0
  R4(a,b,c,d,e,60); R4(e,a,b,c,d,61); R4(d,e,a,b,c,62); R4(c,d,e,a,b,63);
72
0
  R4(b,c,d,e,a,64); R4(a,b,c,d,e,65); R4(e,a,b,c,d,66); R4(d,e,a,b,c,67);
73
0
  R4(c,d,e,a,b,68); R4(b,c,d,e,a,69); R4(a,b,c,d,e,70); R4(e,a,b,c,d,71);
74
0
  R4(d,e,a,b,c,72); R4(c,d,e,a,b,73); R4(b,c,d,e,a,74); R4(a,b,c,d,e,75);
75
0
  R4(e,a,b,c,d,76); R4(d,e,a,b,c,77); R4(c,d,e,a,b,78); R4(b,c,d,e,a,79);
76
77
  /* Add the working vars back into context.state[] */
78
0
  state[0] += a;
79
0
  state[1] += b;
80
0
  state[2] += c;
81
0
  state[3] += d;
82
0
  state[4] += e;
83
84
0
#  ifndef STATIC_ANALYZER
85
  /* Wipe variables */
86
0
  a = b = c = d = e = 0;
87
0
#  endif
88
0
}
89
90
91
/* fr_sha1_init - Initialize new context */
92
93
void fr_sha1_init(fr_sha1_ctx* context)
94
0
{
95
  /* SHA1 initialization constants */
96
0
  context->state[0] = 0x67452301;
97
0
  context->state[1] = 0xEFCDAB89;
98
0
  context->state[2] = 0x98BADCFE;
99
0
  context->state[3] = 0x10325476;
100
0
  context->state[4] = 0xC3D2E1F0;
101
0
  context->count[0] = context->count[1] = 0;
102
0
}
103
104
/* Run your data through this. */
105
void fr_sha1_update(fr_sha1_ctx *context, uint8_t const *in, size_t len)
106
0
{
107
0
  unsigned int i, j;
108
109
  /*
110
   *  If len == 0, there's nothing to do:
111
   *  First, len == 0 impolies len * 8 == 0, so the contents of
112
   *  context->count wouldn't change.
113
   *  j by construction is <= 63, so if len == 0, j + len == j <= 63, and
114
   *  i would be set to 0 and the final memcpy() would "copy" 0
115
   *  bytes, so the contents of context->buffer wouldn't change either.
116
   */
117
0
  if (len == 0) return;
118
119
0
  j = (context->count[0] >> 3) & 63;
120
0
  if ((context->count[0] += len << 3) < (len << 3)) {
121
0
    context->count[1]++;
122
0
  }
123
124
0
  context->count[1] += (len >> 29);
125
0
  if ((j + len) > 63) {
126
0
    memcpy(&context->buffer[j], in, (i = 64-j));
127
0
    fr_sha1_transform(context->state, context->buffer);
128
0
    for ( ; i + 63 < len; i += 64) {
129
0
      fr_sha1_transform(context->state, &in[i]);
130
0
    }
131
0
    j = 0;
132
0
  } else {
133
0
    i = 0;
134
0
  }
135
0
  memcpy(&context->buffer[j], &in[i], len - i);
136
0
}
137
138
139
/* Add padding and return the message digest. */
140
141
void fr_sha1_final(uint8_t digest[static SHA1_DIGEST_LENGTH], fr_sha1_ctx *context)
142
0
{
143
0
  uint32_t i, j;
144
0
  uint8_t finalcount[8];
145
146
0
  for (i = 0; i < 8; i++) {
147
0
    finalcount[i] = (uint8_t)((context->count[(i >= 4 ? 0 : 1)] >> ((3-(i & 3)) * 8) ) & 255);  /* Endian independent */
148
0
  }
149
150
0
  fr_sha1_update(context, (unsigned char const *) "\200", 1);
151
152
0
  while ((context->count[0] & 504) != 448) {
153
0
    fr_sha1_update(context, (unsigned char const *) "\0", 1);
154
0
  }
155
0
  fr_sha1_update(context, finalcount, 8);  /* Should cause a fr_sha1_transform() */
156
0
  for (i = 0; i < 20; i++) {
157
0
    digest[i] = (uint8_t)((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
158
0
  }
159
160
0
#  ifndef STATIC_ANALYZER
161
  /* Wipe variables */
162
0
  i = j = 0;
163
0
  memset(context->buffer, 0, 64);
164
0
  memset(context->state, 0, 20);
165
0
  memset(context->count, 0, 8);
166
0
  memset(&finalcount, 0, 8);
167
0
#  endif
168
169
#  ifdef SHA1HANDSOFF  /* make fr_sha1_transform overwrite it's own static vars */
170
  fr_sha1_transform(context->state, context->buffer);
171
#  endif
172
0
}
173
174
void fr_sha1_final_no_len(uint8_t digest[static SHA1_DIGEST_LENGTH], fr_sha1_ctx *context)
175
0
{
176
0
  uint32_t i, j;
177
178
0
  for (i = 0; i < 20; i++) {
179
0
    digest[i] = (uint8_t)((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
180
0
  }
181
182
0
#  ifndef STATIC_ANALYZER
183
  /* Wipe variables */
184
0
  i = j = 0;
185
0
  memset(context->buffer, 0, 64);
186
0
  memset(context->state, 0, 20);
187
0
  memset(context->count, 0, 8);
188
0
#  endif
189
190
#  ifdef SHA1HANDSOFF  /* make fr_sha1_transform overwrite it's own static vars */
191
  fr_sha1_transform(context->state, context->buffer);
192
#  endif
193
0
}
194
#endif