libowfat/scan/scan_ulonglong.c

40 lines
1.0 KiB
C
Raw Normal View History

2003-05-04 16:19:48 +00:00
#include "scan.h"
2006-11-07 17:56:05 +00:00
size_t scan_ulonglong(const char *src,unsigned long long *dest) {
2003-05-04 16:19:48 +00:00
register const char *tmp=src;
register unsigned long long l=0;
register unsigned char c;
2014-03-14 02:15:38 +00:00
while ((c=(unsigned char)(*tmp-'0'))<10) {
2003-05-27 20:31:25 +00:00
unsigned long long n;
#if defined(__GNUC__) && (__GNUC__ >= 5)
if (__builtin_mul_overflow(l,10,&n) || __builtin_add_overflow(n,c,&n))
break;
l=n;
#else
2003-05-27 20:31:25 +00:00
/* division is very slow on most architectures */
n=l<<3; if ((n>>3)!=l) break;
if (n+(l<<1) < n) break;
n+=l<<1;
if (n+c < n) break;
l=n+c;
#endif
2003-05-04 16:19:48 +00:00
++tmp;
}
if (tmp-src) *dest=l;
2014-03-14 01:53:08 +00:00
return (size_t)(tmp-src);
2003-05-04 16:19:48 +00:00
}
#ifdef UNITTEST
#include <assert.h>
int main() {
unsigned long long l;
assert(scan_ulonglong("0",&l)==1 && l==0);
assert(scan_ulonglong("1",&l)==1 && l==1);
assert(scan_ulonglong("4294967295",&l) == 10 && l==4294967295ull);
assert(scan_ulonglong("18446744073709551615",&l) == 20 && l==18446744073709551615ull);
assert(scan_ulonglong("18446744073709551616",&l) == 19 && l==1844674407370955161ull);
return 0;
}
#endif