summaryrefslogtreecommitdiff
path: root/lib/gnutls_num.c
blob: e9a7487917656b70c5e35673663bc26a2da7106b (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
/*
 * Copyright (C) 2000-2012 Free Software Foundation, Inc.
 *
 * Author: Nikos Mavrogiannopoulos
 *
 * This file is part of GnuTLS.
 *
 * The GnuTLS is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public License
 * as published by the Free Software Foundation; either version 2.1 of
 * the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful, but
 * WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>
 *
 */

/* This file contains the functions needed for 64 bit integer support in
 * TLS, and functions which ease the access to TLS vectors (data of given size).
 */

#include <gnutls_int.h>
#include <gnutls_num.h>
#include <gnutls_errors.h>

/* This function will add one to uint64 x.
 * Returns 0 on success, or -1 if the uint64 max limit
 * has been reached.
 */
int _gnutls_uint64pp(uint64 * x)
{
	register int i, y = 0;

	for (i = 7; i >= 0; i--) {
		y = 0;
		if (x->i[i] == 0xff) {
			x->i[i] = 0;
			y = 1;
		} else
			x->i[i]++;

		if (y == 0)
			break;
	}
	if (y != 0)
		return -1;	/* over 64 bits! WOW */

	return 0;
}

/* This function will add one to uint48 x.
 * Returns 0 on success, or -1 if the uint48 max limit
 * has been reached.
 */
int _gnutls_uint48pp(uint64 * x)
{
	register int i, y = 0;

	for (i = 7; i >= 3; i--) {
		y = 0;
		if (x->i[i] == 0xff) {
			x->i[i] = 0;
			y = 1;
		} else
			x->i[i]++;

		if (y == 0)
			break;
	}
	if (y != 0)
		return -1;	/* over 48 bits */

	return 0;
}