/lib/ |
H A D | kstrtox.h | 5 const char *_parse_integer_fixup_radix(const char *s, unsigned int *base); 6 unsigned int _parse_integer(const char *s, unsigned int base, unsigned long long *res);
|
H A D | kstrtox.c | 23 const char *_parse_integer_fixup_radix(const char *s, unsigned int *base) argument 25 if (*base == 0) { 28 *base = 16; 30 *base = 8; 32 *base = 10; 34 if (*base == 16 && s[0] == '0' && _tolower(s[1]) == 'x') 47 unsigned int _parse_integer(const char *s, unsigned int base, unsigned long long *p) argument 66 if (val >= base) 70 * it in the max base we support (16) 73 if (res > div_u64(ULLONG_MAX - val, base)) 86 _kstrtoull(const char *s, unsigned int base, unsigned long long *res) argument 122 kstrtoull(const char *s, unsigned int base, unsigned long long *res) argument 146 kstrtoll(const char *s, unsigned int base, long long *res) argument 171 _kstrtoul(const char *s, unsigned int base, unsigned long *res) argument 187 _kstrtol(const char *s, unsigned int base, long *res) argument 218 kstrtouint(const char *s, unsigned int base, unsigned int *res) argument 249 kstrtoint(const char *s, unsigned int base, int *res) argument 264 kstrtou16(const char *s, unsigned int base, u16 *res) argument 279 kstrtos16(const char *s, unsigned int base, s16 *res) argument 294 kstrtou8(const char *s, unsigned int base, u8 *res) argument 309 kstrtos8(const char *s, unsigned int base, s8 *res) argument [all...] |
H A D | sort.c | 32 * @base: pointer to data to sort 47 void sort(void *base, size_t num, size_t size, argument 62 cmp_func(base + c, base + c + size) < 0) 64 if (cmp_func(base + r, base + c) >= 0) 66 swap_func(base + r, base + c, size); 72 swap_func(base, base [all...] |
H A D | bsearch.c | 18 * @base: pointer to first element to search 33 void *bsearch(const void *key, const void *base, size_t num, size_t size, argument 42 result = cmp(key, base + mid * size); 48 return (void *)base + mid * size;
|
H A D | div64.c | 26 uint32_t __attribute__((weak)) __div64_32(uint64_t *n, uint32_t base) argument 29 uint64_t b = base; 35 if (high >= base) { 36 high /= base; 38 rem -= (uint64_t) (high*base) << 32;
|
H A D | locking-selftest.c | 951 I_WW(t); I_WW(t2); I_WW(o.base); I_WW(o2.base); I_WW(o3.base); 1182 mutex_lock(&o.base); 1183 mutex_unlock(&o.base); 1188 ret = mutex_lock_interruptible(&o.base); 1190 mutex_unlock(&o.base); 1197 ret = mutex_lock_killable(&o.base); 1199 mutex_unlock(&o.base); 1206 ret = mutex_trylock(&o.base); [all...] |
H A D | test-kstrtox.c | 10 unsigned int base; member in struct:test_fail 19 unsigned int base; \ 36 rv = fn(t->str, t->base, &tmp); \ 38 WARN(1, "str '%s', base %u, expected -E, got %d/" fmt "\n", \ 39 t->str, t->base, rv, tmp); \ 54 rv = fn(t->str, t->base, &res); \ 56 WARN(1, "str '%s', base %u, expected 0/" fmt ", got %d\n", \ 57 t->str, t->base, t->expected_res, rv); \ 61 WARN(1, "str '%s', base %u, expected " fmt ", got " fmt "\n", \ 62 t->str, t->base, [all...] |
H A D | vsprintf.c | 43 * @base: The number base to use 47 unsigned long long simple_strtoull(const char *cp, char **endp, unsigned int base) argument 52 cp = _parse_integer_fixup_radix(cp, &base); 53 rv = _parse_integer(cp, base, &result); 68 * @base: The number base to use 72 unsigned long simple_strtoul(const char *cp, char **endp, unsigned int base) argument 74 return simple_strtoull(cp, endp, base); 82 * @base 86 simple_strtol(const char *cp, char **endp, unsigned int base) argument 103 simple_strtoll(const char *cp, char **endp, unsigned int base) argument 375 u8 base; /* number base, 8, 10 or 16 only */ member in struct:printf_spec 2341 unsigned int base; local [all...] |
H A D | iovec.c | 99 u8 __user *base = iov->iov_base + offset; local 103 if (copy_from_user(kdata, base, copy))
|
H A D | decompress_bunzip2.c | 84 int base[MAX_HUFCODE_BITS]; member in struct:group_data 158 int *base = NULL; local 280 /* Calculate permute[], base[], and limit[] tables from 284 * Huffman coded symbols into decoded symbols. base[] 299 adjust the base and limit array pointers so we're 302 base = hufGroup->base-1; 318 *1)+symbols at this level), and base[] (number of 337 base[i+1] = pp-(t += temp[i]); 342 base[minLe [all...] |
H A D | parser.c | 119 * match_number: scan a number in the given base from a substring_t 122 * @base: base to use when converting string 124 * Description: Given a &substring_t and a base, attempts to parse the substring 125 * as a number in that base. On success, sets @result to the integer represented 128 static int match_number(substring_t *s, int *result, int base) argument 143 val = simple_strtol(buf, &endp, base);
|
/lib/lz4/ |
H A D | lz4hc_compress.c | 44 const u8 *base; member in struct:lz4hc_data 50 static inline int lz4hc_init(struct lz4hc_data *hc4, const u8 *base) argument 56 hc4->nexttoupdate = base + 1; 58 hc4->nexttoupdate = base; 60 hc4->base = base; 70 const BYTE * const base = hc4->base; local 72 const int base = 0; local 77 size_t delta = p - (hashtable[HASH_VALUE(p)] + base); 128 const BYTE * const base = hc4->base; local 130 const int base = 0; local 197 const BYTE * const base = hc4->base; local 199 const int base = 0; local [all...] |
H A D | lz4_compress.c | 61 const BYTE * const base = ip; local 63 const int base = 0; local 84 hashtable[LZ4_HASH_VALUE(ip)] = ip - base; 106 ref = base + hashtable[h]; 107 hashtable[h] = ip - base; 200 hashtable[LZ4_HASH_VALUE(ip-2)] = ip - 2 - base; 203 ref = base + hashtable[LZ4_HASH_VALUE(ip)]; 204 hashtable[LZ4_HASH_VALUE(ip)] = ip - base; 247 const u8 *const base = ip; local 287 ref = base [all...] |
/lib/zlib_inflate/ |
H A D | inftrees.c | 41 const unsigned short *base; /* base value table to use */ local 43 int end; /* use base and extra for symbol > end */ 46 static const unsigned short lbase[31] = { /* Length codes 257..285 base */ 52 static const unsigned short dbase[32] = { /* Distance codes 0..29 base */ 170 base = extra = work; /* dummy value--not used */ 174 base = lbase; 175 base -= 257; 181 base = dbase; 211 this.val = base[wor [all...] |
/lib/mpi/ |
H A D | mpi-pow.c | 36 int mpi_powm(MPI res, MPI base, MPI exp, MPI mod) argument 86 bsize = base->nlimbs; 87 bsign = base->sign; 88 if (bsize > msize) { /* The base is larger than the module. Reduce it. */ 94 MPN_COPY(bp, base->d, bsize); 99 /* Canonicalize the base, since we are going to multiply with it 103 bp = base->d; 168 negative_result = (ep[0] & 1) && base->sign;
|
/lib/zlib_deflate/ |
H A D | deftree.c | 117 int extra_base; /* base index for extra_bits */ 416 int base = desc->stat_desc->extra_base; local 443 if (n >= base) xbits = extra[n-base];
|