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