Coverage Report

Created: 2026-11-12 07:13

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/openiked-portable/compat/timingsafe_memcmp.c
Line
Count
Source
1
/*  $OpenBSD: timingsafe_memcmp.c,v 1.2 2015/08/31 02:53:57 guenther Exp $  */
2
/*
3
 * Copyright (c) 2014 Google Inc.
4
 *
5
 * Permission to use, copy, modify, and distribute this software for any
6
 * purpose with or without fee is hereby granted, provided that the above
7
 * copyright notice and this permission notice appear in all copies.
8
 *
9
 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
10
 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
11
 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
12
 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
13
 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
14
 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
15
 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
16
 */
17
18
/* OPENBSD ORIGINAL: lib/libc/string/timingsafe_memcmp.c */
19
20
#include <limits.h>
21
#include <string.h>
22
23
int
24
timingsafe_memcmp(const void *b1, const void *b2, size_t len)
25
0
{
26
0
        const unsigned char *p1 = b1, *p2 = b2;
27
0
        size_t i;
28
0
        int res = 0, done = 0;
29
30
0
        for (i = 0; i < len; i++) {
31
                /* lt is -1 if p1[i] < p2[i]; else 0. */
32
0
                int lt = (p1[i] - p2[i]) >> CHAR_BIT;
33
34
                /* gt is -1 if p1[i] > p2[i]; else 0. */
35
0
                int gt = (p2[i] - p1[i]) >> CHAR_BIT;
36
37
                /* cmp is 1 if p1[i] > p2[i]; -1 if p1[i] < p2[i]; else 0. */
38
0
                int cmp = lt - gt;
39
40
                /* set res = cmp if !done. */
41
0
                res |= cmp & ~done;
42
43
                /* set done if p1[i] != p2[i]. */
44
0
                done |= lt | gt;
45
0
        }
46
47
0
        return (res);
48
0
}