mirror of
https://github.com/CTCaer/hekate.git
synced 2024-11-26 11:42:09 +00:00
bdk: util: replace strtol/atoi w/ custom versions
To get rid of reentrancy baggage (which is not needed) and save binary space
This commit is contained in:
parent
d08fac5a08
commit
8bbe403e41
3 changed files with 97 additions and 0 deletions
|
@ -29,6 +29,7 @@ u8 btn_read()
|
||||||
res |= BTN_VOL_DOWN;
|
res |= BTN_VOL_DOWN;
|
||||||
if (!gpio_read(GPIO_PORT_X, GPIO_PIN_6))
|
if (!gpio_read(GPIO_PORT_X, GPIO_PIN_6))
|
||||||
res |= BTN_VOL_UP;
|
res |= BTN_VOL_UP;
|
||||||
|
// HOAG can use the GPIO. Icosa/Iowa/AULA cannot. Traces are there but they miss a resistor.
|
||||||
if (i2c_recv_byte(I2C_5, MAX77620_I2C_ADDR, MAX77620_REG_ONOFFSTAT) & MAX77620_ONOFFSTAT_EN0)
|
if (i2c_recv_byte(I2C_5, MAX77620_I2C_ADDR, MAX77620_REG_ONOFFSTAT) & MAX77620_ONOFFSTAT_EN0)
|
||||||
res |= BTN_POWER;
|
res |= BTN_POWER;
|
||||||
return res;
|
return res;
|
||||||
|
|
|
@ -102,6 +102,100 @@ u64 sqrt64(u64 num)
|
||||||
return square_root;
|
return square_root;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
#define TLONG_MAX ((long)(((unsigned long)(~0L)) >> 1))
|
||||||
|
#define TLONG_MIN ((long)(~TLONG_MAX))
|
||||||
|
#define ISSPACE(ch) ((ch >= '\t' && ch <= '\r') || (ch == ' '))
|
||||||
|
#define ISDIGIT(ch) ( ch >= '0' && ch <= '9' )
|
||||||
|
#define ISALPHA(ch) ((ch >= 'a' && ch <= 'z') || (ch >= 'A' && ch <= 'Z'))
|
||||||
|
#define ISUPPER(ch) ( ch >= 'A' && ch <= 'Z' )
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Avoid using reentrant newlib version of strol. It's only used for errno.
|
||||||
|
*
|
||||||
|
* strol/atoi:
|
||||||
|
* Copyright (c) 1990 The Regents of the University of California.
|
||||||
|
*/
|
||||||
|
long strtol(const char *nptr, char **endptr, register int base)
|
||||||
|
{
|
||||||
|
register const char *s = nptr;
|
||||||
|
register unsigned long acc;
|
||||||
|
register int c;
|
||||||
|
register unsigned long cutoff;
|
||||||
|
register int neg = 0, any, cutlim;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Skip white space and pick up leading +/- sign if any.
|
||||||
|
* If base is 0, allow 0x for hex and 0 for octal, else
|
||||||
|
* assume decimal; if base is already 16, allow 0x.
|
||||||
|
*/
|
||||||
|
do {
|
||||||
|
c = *s++;
|
||||||
|
} while (ISSPACE(c));
|
||||||
|
if (c == '-') {
|
||||||
|
neg = 1;
|
||||||
|
c = *s++;
|
||||||
|
} else if (c == '+')
|
||||||
|
c = *s++;
|
||||||
|
if ((base == 0 || base == 16) &&
|
||||||
|
c == '0' && (*s == 'x' || *s == 'X')) {
|
||||||
|
c = s[1];
|
||||||
|
s += 2;
|
||||||
|
base = 16;
|
||||||
|
}
|
||||||
|
if (base == 0)
|
||||||
|
base = c == '0' ? 8 : 10;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Compute the cutoff value between legal numbers and illegal
|
||||||
|
* numbers. That is the largest legal value, divided by the
|
||||||
|
* base. An input number that is greater than this value, if
|
||||||
|
* followed by a legal input character, is too big. One that
|
||||||
|
* is equal to this value may be valid or not; the limit
|
||||||
|
* between valid and invalid numbers is then based on the last
|
||||||
|
* digit. For instance, if the range for longs is
|
||||||
|
* [-2147483648..2147483647] and the input base is 10,
|
||||||
|
* cutoff will be set to 214748364 and cutlim to either
|
||||||
|
* 7 (neg==0) or 8 (neg==1), meaning that if we have accumulated
|
||||||
|
* a value > 214748364, or equal but the next digit is > 7 (or 8),
|
||||||
|
* the number is too big, and we will return a range error.
|
||||||
|
*
|
||||||
|
* Set any if any `digits' consumed; make it negative to indicate
|
||||||
|
* overflow.
|
||||||
|
*/
|
||||||
|
cutoff = neg ? -(unsigned long)TLONG_MIN : TLONG_MAX;
|
||||||
|
cutlim = cutoff % (unsigned long)base;
|
||||||
|
cutoff /= (unsigned long)base;
|
||||||
|
for (acc = 0, any = 0;; c = *s++) {
|
||||||
|
if (ISDIGIT(c))
|
||||||
|
c -= '0';
|
||||||
|
else if (ISALPHA(c))
|
||||||
|
c -= ISUPPER(c) ? 'A' - 10 : 'a' - 10;
|
||||||
|
else
|
||||||
|
break;
|
||||||
|
if (c >= base)
|
||||||
|
break;
|
||||||
|
if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
|
||||||
|
any = -1;
|
||||||
|
else {
|
||||||
|
any = 1;
|
||||||
|
acc *= base;
|
||||||
|
acc += c;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if (any < 0) {
|
||||||
|
acc = neg ? TLONG_MIN : TLONG_MAX;
|
||||||
|
} else if (neg)
|
||||||
|
acc = -acc;
|
||||||
|
if (endptr != 0)
|
||||||
|
*endptr = (char *) (any ? s - 1 : nptr);
|
||||||
|
return (acc);
|
||||||
|
}
|
||||||
|
|
||||||
|
int atoi(const char *nptr)
|
||||||
|
{
|
||||||
|
return (int)strtol(nptr, (char **)NULL, 10);
|
||||||
|
}
|
||||||
|
|
||||||
void exec_cfg(u32 *base, const cfg_op_t *ops, u32 num_ops)
|
void exec_cfg(u32 *base, const cfg_op_t *ops, u32 num_ops)
|
||||||
{
|
{
|
||||||
for(u32 i = 0; i < num_ops; i++)
|
for(u32 i = 0; i < num_ops; i++)
|
||||||
|
|
|
@ -85,6 +85,8 @@ u8 bit_count(u32 val);
|
||||||
u32 bit_count_mask(u8 bits);
|
u32 bit_count_mask(u8 bits);
|
||||||
char *strcpy_ns(char *dst, char *src);
|
char *strcpy_ns(char *dst, char *src);
|
||||||
u64 sqrt64(u64 num);
|
u64 sqrt64(u64 num);
|
||||||
|
long strtol(const char *nptr, char **endptr, register int base);
|
||||||
|
int atoi(const char *nptr);
|
||||||
|
|
||||||
void exec_cfg(u32 *base, const cfg_op_t *ops, u32 num_ops);
|
void exec_cfg(u32 *base, const cfg_op_t *ops, u32 num_ops);
|
||||||
u32 crc32_calc(u32 crc, const u8 *buf, u32 len);
|
u32 crc32_calc(u32 crc, const u8 *buf, u32 len);
|
||||||
|
|
Loading…
Reference in a new issue