| /lib/ |
| A D | kstrtox.c | 28 if (*base == 0) { in _parse_integer_fixup_radix() 31 *base = 16; in _parse_integer_fixup_radix() 33 *base = 8; in _parse_integer_fixup_radix() 35 *base = 10; in _parse_integer_fixup_radix() 72 if (val >= base) in _parse_integer_limit() 82 res = res * base + val; in _parse_integer_limit() 186 rv = kstrtoull(s, base, &tmp); in _kstrtoul() 202 rv = kstrtoll(s, base, &tmp); in _kstrtol() 264 rv = kstrtoll(s, base, &tmp); in kstrtoint() 296 rv = kstrtoll(s, base, &tmp); in kstrtos16() [all …]
|
| A D | sort.c | 35 (void)base; in is_aligned() 210 if (is_aligned(base, size, 8)) in __sort_r() 232 do_swap(base, base + n, size, swap_func, priv); in __sort_r() 233 shift = do_cmp(base + size, base + 2 * size, cmp_func, priv) <= 0; in __sort_r() 236 do_swap(base + a, base + n, size, swap_func, priv); in __sort_r() 254 b = do_cmp(base + c, base + d, cmp_func, priv) > 0 ? c : d; in __sort_r() 259 while (b != a && do_cmp(base + a, base + b, cmp_func, priv) >= 0) in __sort_r() 264 do_swap(base + b, base + c, size, swap_func, priv); in __sort_r() 272 do_swap(base, base + n, size, swap_func, priv); in __sort_r() 273 if (n == size * 2 && do_cmp(base, base + size, cmp_func, priv) > 0) in __sort_r() [all …]
|
| A D | kstrtox.h | 6 const char *_parse_integer_fixup_radix(const char *s, unsigned int *base); 7 unsigned int _parse_integer_limit(const char *s, unsigned int base, unsigned long long *res, 9 unsigned int _parse_integer(const char *s, unsigned int base, unsigned long long *res);
|
| A D | test-kstrtox.c | 10 unsigned int base; member 19 unsigned int base; \ 36 rv = fn(t->str, t->base, &tmp); \ 39 t->str, t->base, rv, tmp); \ 54 rv = fn(t->str, t->base, &res); \ 57 t->str, t->base, t->expected_res, rv); \ 62 t->str, t->base, t->expected_res, res); \
|
| A D | test_ida.c | 57 static void ida_check_destroy_1(struct ida *ida, unsigned int base) in ida_check_destroy_1() argument 59 IDA_BUG_ON(ida, ida_alloc_min(ida, base, GFP_KERNEL) != base); in ida_check_destroy_1() 84 static void ida_check_leaf(struct ida *ida, unsigned int base) in ida_check_leaf() argument 89 IDA_BUG_ON(ida, ida_alloc_min(ida, base, GFP_KERNEL) != in ida_check_leaf() 90 base + i); in ida_check_leaf() 112 unsigned long base = (1UL << 31) - j; in ida_check_max() local 114 IDA_BUG_ON(ida, ida_alloc_min(ida, base, GFP_KERNEL) != in ida_check_max() 115 base + i); in ida_check_max() 117 IDA_BUG_ON(ida, ida_alloc_min(ida, base, GFP_KERNEL) != in ida_check_max()
|
| A D | locking-selftest.c | 1404 I_WW(t); I_WW(t2); I_WW(o.base); I_WW(o2.base); I_WW(o3.base); 1731 ww_mutex_base_lock(&o.base); in ww_test_normal() 1765 ww_mutex_base_lock(&o.base); in ww_test_normal() 1853 ww_mutex_base_lock(&o2.base); in ww_test_edeadlk_normal() 1879 ww_mutex_base_lock(&o2.base); in ww_test_edeadlk_normal_slow() 1905 ww_mutex_base_lock(&o2.base); in ww_test_edeadlk_no_unlock() 1930 ww_mutex_base_lock(&o2.base); in ww_test_edeadlk_no_unlock_slow() 1955 ww_mutex_base_lock(&o2.base); in ww_test_edeadlk_acquire_more() 1976 ww_mutex_base_lock(&o2.base); in ww_test_edeadlk_acquire_more_slow() 1997 ww_mutex_base_lock(&o2.base); in ww_test_edeadlk_acquire_more_edeadlk() [all …]
|
| A D | idr.c | 38 unsigned int base = idr->idr_base; in idr_alloc_u32() local 44 id = (id < base) ? 0 : id - base; in idr_alloc_u32() 46 slot = idr_get_free(&idr->idr_rt, &iter, gfp, max - base); in idr_alloc_u32() 50 *nextid = iter.index + base; in idr_alloc_u32() 200 int base = idr->idr_base; in idr_for_each() local 204 unsigned long id = iter.index + base; in idr_for_each() 232 unsigned long base = idr->idr_base; in idr_get_next_ul() local 235 id = (id < base) ? 0 : id - base; in idr_get_next_ul() 249 *nextid = iter.index + base; in idr_get_next_ul()
|
| A D | vsprintf.c | 1025 .base = 16, 1031 .base = 10, 1036 .base = 10, 1043 .base = 10, 1075 .base = 16, in resource_string() 1081 .base = 16, in resource_string() 1087 .base = 16, in resource_string() 1170 .base = 16, in range_string() 2769 spec->base = p->base; in format_decode() 3520 base = 10; in vsscanf() [all …]
|
| A D | test_xarray.c | 920 xa_erase_index(xa, base); in check_xa_alloc_1() 941 xa_erase_index(xa, base + 1); in check_xa_alloc_1() 948 xa_erase_index(xa, base); in check_xa_alloc_1() 994 XA_BUG_ON(xa, id != base); in check_xa_alloc_2() 1002 XA_BUG_ON(xa, id != base); in check_xa_alloc_2() 1007 for (i = base; i < base + 10; i++) { in check_xa_alloc_2() 1024 for (i = base; i < base + 9; i++) { in check_xa_alloc_2() 1068 if (base != 0) in check_xa_alloc_3() 1069 xa_erase_index(xa, base); in check_xa_alloc_3() 1077 XA_BUG_ON(xa, id != base); in check_xa_alloc_3() [all …]
|
| A D | bsearch.c | 31 void *bsearch(const void *key, const void *base, size_t num, size_t size, cmp_func_t cmp) in bsearch() argument 33 return __inline_bsearch(key, base, num, size, cmp); in bsearch()
|
| A D | decompress_bunzip2.c | 85 int base[MAX_HUFCODE_BITS]; member 159 int *base = NULL; in get_next_block() local 304 base = hufGroup->base-1; in get_next_block() 339 base[i+1] = pp-(t += temp[i]); in get_next_block() 344 base[minLen] = 0; in get_next_block() 366 base = hufGroup->base-1; in get_next_block() 402 || (((unsigned)(j = (j>>(hufGroup->maxLen-i))-base[i])) in get_next_block()
|
| A D | parser.c | 138 static int match_number(substring_t *s, int *result, int base) in match_number() argument 148 val = simple_strtol(buf, &endp, base); in match_number() 170 static int match_u64int(substring_t *s, u64 *result, int base) in match_u64int() argument 178 ret = kstrtoull(buf, base, &val); in match_u64int()
|
| /lib/zstd/compress/ |
| A D | zstd_fast.c | 25 const BYTE* const base = ms->window.base; in ZSTD_fillHashTableForCDict() local 38 U32 const curr = (U32)(ip - base); in ZSTD_fillHashTableForCDict() 62 const BYTE* const base = ms->window.base; in ZSTD_fillHashTableForCCtx() local 200 const BYTE* const base = ms->window.base; in ZSTD_compressBlock_fast_noDict_generic() local 270 current0 = (U32)(ip0 - base); in ZSTD_compressBlock_fast_noDict_generic() 313 current0 = (U32)(ip0 - base); in ZSTD_compressBlock_fast_noDict_generic() 379 match0 = base + matchIdx; in ZSTD_compressBlock_fast_noDict_generic() 491 const BYTE* const base = ms->window.base; in ZSTD_compressBlock_fast_dictMatchState_generic() local 550 U32 curr = (U32)(ip0 - base); in ZSTD_compressBlock_fast_dictMatchState_generic() 628 curr = (U32)(ip0 - base); in ZSTD_compressBlock_fast_dictMatchState_generic() [all …]
|
| A D | zstd_double_fast.c | 28 const BYTE* const base = ms->window.base; in ZSTD_fillDoubleHashTableForCDict() local 38 U32 const curr = (U32)(ip - base); in ZSTD_fillDoubleHashTableForCDict() 66 const BYTE* const base = ms->window.base; in ZSTD_fillDoubleHashTableForCCtx() local 76 U32 const curr = (U32)(ip - base); in ZSTD_fillDoubleHashTableForCCtx() 115 const BYTE* const base = ms->window.base; in ZSTD_compressBlock_doubleFast_noDict_generic() local 179 matchl0 = base + idxl0; in ZSTD_compressBlock_doubleFast_noDict_generic() 185 curr = (U32)(ip-base); in ZSTD_compressBlock_doubleFast_noDict_generic() 186 matchs0 = base + idxs0; in ZSTD_compressBlock_doubleFast_noDict_generic() 215 matchl1 = base + idxl1; in ZSTD_compressBlock_doubleFast_noDict_generic() 339 const BYTE* const base = ms->window.base; in ZSTD_compressBlock_doubleFast_dictMatchState_generic() local [all …]
|
| A D | zstd_lazy.c | 42 const BYTE* const base = ms->window.base; in ZSTD_updateDUBT() local 85 const BYTE* const base = ms->window.base; in ZSTD_insertDUBT1() local 181 const BYTE* const base = ms->window.base; in ZSTD_DUBT_findBetterDictMatch() local 256 const BYTE* const base = ms->window.base; in ZSTD_DUBT_findBestMatch() local 414 const BYTE* const base = ms->window.base; in ZSTD_dedicatedDictSearch_lazy_loadDictionary() local 642 const BYTE* const base = ms->window.base; in ZSTD_insertAndFindFirstIndex_internal() local 678 const BYTE* const base = ms->window.base; in ZSTD_HcFindBestMatch() local 894 const BYTE* const base = ms->window.base; in ZSTD_row_update_internalImpl() local 922 const BYTE* const base = ms->window.base; in ZSTD_row_update_internal() local 1154 const BYTE* const base = ms->window.base; in ZSTD_RowFindBestMatch() local [all …]
|
| A D | zstd_opt.c | 418 const BYTE* const base = ms->window.base; in ZSTD_insertAndFindFirstIndexHash3() local 420 U32 const target = (U32)(ip - base); in ZSTD_insertAndFindFirstIndexHash3() 458 const BYTE* const base = ms->window.base; in ZSTD_insertBt1() local 464 const U32 curr = (U32)(ip-base); in ZSTD_insertBt1() 518 match = base + matchIndex; in ZSTD_insertBt1() 568 const BYTE* const base = ms->window.base; in ZSTD_updateTree_internal() local 604 const BYTE* const base = ms->window.base; in ZSTD_insertBtAndGetAllMatches() local 605 U32 const curr = (U32)(ip-base); in ZSTD_insertBtAndGetAllMatches() 733 match = base + matchIndex; in ZSTD_insertBtAndGetAllMatches() 1091 const BYTE* const base = ms->window.base; in ZSTD_compressBlock_opt_generic() local [all …]
|
| A D | zstd_compress_internal.h | 960 static U64 ZSTD_ipow(U64 base, U64 exponent) in ZSTD_ipow() argument 964 if (exponent & 1) power *= base; in ZSTD_ipow() 966 base *= base; in ZSTD_ipow() 1096 U32 const curr = (U32)((BYTE const*)src - window.base); in ZSTD_window_canOverflowCorrect() 1131 U32 const curr = (U32)((BYTE const*)srcEnd - window.base); in ZSTD_window_needOverflowCorrection() 1175 U32 const curr = (U32)((BYTE const*)src - window->base); in ZSTD_window_correctOverflow() 1197 window->base += correction; in ZSTD_window_correctOverflow() 1328 window->base = (BYTE const*)" "; in ZSTD_window_init() 1355 assert(window->base != NULL); in ZSTD_window_update() 1365 window->dictBase = window->base; in ZSTD_window_update() [all …]
|
| A D | zstd_ldm.c | 293 BYTE const* const base = ldmState->window.base; in ZSTD_ldm_fillHashTable() local 316 entry.offset = (U32)(split - base); in ZSTD_ldm_fillHashTable() 334 U32 const curr = (U32)(anchor - ms->window.base); in ZSTD_ldm_limitTableUpdate() 355 BYTE const* const base = ldmState->window.base; in ZSTD_ldm_generateSequences_internal() local 359 BYTE const* const lowPrefixPtr = base + dictLimit; in ZSTD_ldm_generateSequences_internal() 414 newEntry.offset = (U32)(split - base); in ZSTD_ldm_generateSequences_internal() 433 cur->offset < dictLimit ? dictBase : base; in ZSTD_ldm_generateSequences_internal() 447 BYTE const* const pMatch = base + cur->offset; in ZSTD_ldm_generateSequences_internal() 473 offset = (U32)(split - base) - bestEntry->offset; in ZSTD_ldm_generateSequences_internal()
|
| /lib/lz4/ |
| A D | lz4hc_compress.c | 65 hc4->base = start - 64 * KB; in LZ4HC_init() 78 const BYTE * const base = hc4->base; in LZ4HC_Insert() local 79 U32 const target = (U32)(ip - base); in LZ4HC_Insert() 107 const BYTE * const base = hc4->base; in LZ4HC_InsertAndFindBestMatch() local 112 : (U32)(ip - base) - (64 * KB - 1); in LZ4HC_InsertAndFindBestMatch() 152 base + dictLimit, in LZ4HC_InsertAndFindBestMatch() 157 *matchpos = base + matchIndex; in LZ4HC_InsertAndFindBestMatch() 179 const BYTE * const base = hc4->base; in LZ4HC_InsertAndGetWiderMatch() local 184 : (U32)(ip - base) - (64 * KB - 1); in LZ4HC_InsertAndGetWiderMatch() 660 ctxPtr->dictBase = ctxPtr->base; in LZ4HC_setExternalDict() [all …]
|
| A D | lz4_compress.c | 188 const BYTE *base; in LZ4_compress_generic() local 214 base = (const BYTE *)source; in LZ4_compress_generic() 266 tableType, base); in LZ4_compress_generic() 281 tableType, base); in LZ4_compress_generic() 401 tableType, base); in LZ4_compress_generic() 530 const BYTE *base = (const BYTE *) src; in LZ4_compress_destSize_generic() local 588 tableType, base); in LZ4_compress_destSize_generic() 593 base); in LZ4_compress_destSize_generic() 780 const BYTE *base; in LZ4_loadDict() local 797 base = p - dict->currentOffset; in LZ4_loadDict() [all …]
|
| /lib/math/ |
| A D | int_pow.c | 19 u64 int_pow(u64 base, unsigned int exp) in int_pow() argument 25 result *= base; in int_pow() 27 base *= base; in int_pow()
|
| A D | div64.c | 32 uint32_t __attribute__((weak)) __div64_32(uint64_t *n, uint32_t base) in __div64_32() argument 35 uint64_t b = base; in __div64_32() 41 if (high >= base) { in __div64_32() 42 high /= base; in __div64_32() 44 rem -= (uint64_t) (high*base) << 32; in __div64_32()
|
| /lib/zlib_inflate/ |
| A D | inftrees.c | 41 const unsigned short *base; /* base value table to use */ in zlib_inflate_table() local 170 base = extra = work; /* dummy value--not used */ in zlib_inflate_table() 174 base = lbase; in zlib_inflate_table() 175 base -= 257; in zlib_inflate_table() 181 base = dbase; in zlib_inflate_table() 211 this.val = base[work[sym]]; in zlib_inflate_table()
|
| /lib/crypto/mpi/ |
| A D | mpi-pow.c | 26 int mpi_powm(MPI res, MPI base, MPI exp, MPI mod) in mpi_powm() argument 81 bsize = base->nlimbs; in mpi_powm() 82 bsign = base->sign; in mpi_powm() 89 MPN_COPY(bp, base->d, bsize); in mpi_powm() 98 bp = base->d; in mpi_powm() 161 negative_result = (ep[0] & 1) && base->sign; in mpi_powm()
|
| /lib/math/tests/ |
| A D | int_pow_kunit.c | 7 u64 base; member 36 KUNIT_EXPECT_EQ(test, tc->expected_result, int_pow(tc->base, tc->exponent)); in int_pow_test()
|