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
|
/*
* MIT License
*
* Copyright (c) 2019 Jakob Kaivo <jakob@kaivo.net>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
#include <stdint.h>
#include <string.h>
#include "binary.h"
uintmax_t binary(const char *s)
{
char array[BINSTRLEN];
memset(array, '0', sizeof(array));
strcpy(array + (sizeof(array) - strlen(s)) - 1, s);
return BIN_FROM_ARRAY(array);
}
char *binstr(size_t n, char s[n], uintmax_t b)
{
memset(s, '0', n);
s[n - 1] = '\0';
for (size_t i = 0; i < n - 2 && i < BIN_UINTMAXBITS; i++) {
if (b & ((uintmax_t)1 << i)) {
s[n - (i + 2)] = '1';
}
}
return s;
}
|
