Home
last modified time | relevance | path

Searched refs:num (Results 1 – 16 of 16) sorted by relevance

/lib/crypto/mpi/
A Dmpi-div.c17 int mpi_tdiv_qr(MPI quot, MPI rem, MPI num, MPI den);
56 int mpi_tdiv_r(MPI rem, MPI num, MPI den) in mpi_tdiv_r() argument
58 return mpi_tdiv_qr(NULL, rem, num, den); in mpi_tdiv_r()
65 mpi_size_t nsize = num->nlimbs; in mpi_tdiv_qr()
68 mpi_size_t sign_remainder = num->sign; in mpi_tdiv_qr()
69 mpi_size_t sign_quotient = num->sign ^ den->sign; in mpi_tdiv_qr()
87 if (num != rem) { in mpi_tdiv_qr()
88 rem->nlimbs = num->nlimbs; in mpi_tdiv_qr()
89 rem->sign = num->sign; in mpi_tdiv_qr()
90 MPN_COPY(rem->d, num->d, nsize); in mpi_tdiv_qr()
[all …]
/lib/
A Dsort.c191 static void __sort_r(void *base, size_t num, size_t size, in __sort_r() argument
198 size_t n = num * size, a = (num/2) * size; in __sort_r()
303 void sort_r(void *base, size_t num, size_t size, in sort_r() argument
308 __sort_r(base, num, size, cmp_func, swap_func, priv, false); in sort_r()
324 void sort_r_nonatomic(void *base, size_t num, size_t size, in sort_r_nonatomic() argument
329 __sort_r(base, num, size, cmp_func, swap_func, priv, true); in sort_r_nonatomic()
333 void sort(void *base, size_t num, size_t size, in sort() argument
342 return __sort_r(base, num, size, _CMP_WRAPPER, SWAP_WRAPPER, &w, false); in sort()
346 void sort_nonatomic(void *base, size_t num, size_t size, in sort_nonatomic() argument
355 return __sort_r(base, num, size, _CMP_WRAPPER, SWAP_WRAPPER, &w, true); in sort_nonatomic()
A Doid_registry.c133 unsigned long num; in sprint_oid() local
151 num = n; in sprint_oid()
153 num = n & 0x7f; in sprint_oid()
158 num <<= 7; in sprint_oid()
159 num |= n & 0x7f; in sprint_oid()
162 ret += count = snprintf(buffer, bufsize, ".%lu", num); in sprint_oid()
A Dflex_proportions.c152 s64 num, den; in fprop_fraction_percpu() local
157 num = percpu_counter_read_positive(&pl->events); in fprop_fraction_percpu()
165 if (den <= num) { in fprop_fraction_percpu()
166 if (num) in fprop_fraction_percpu()
167 den = num; in fprop_fraction_percpu()
172 *numerator = num; in fprop_fraction_percpu()
A Dtest_memcat_p.c12 int num; member
48 in0[i]->num = r; in test_memcat_p_init()
49 in1[i]->num = -r; in test_memcat_p_init()
62 total += (*p)->num; in test_memcat_p_init()
A Dstring_helpers.c219 u8 num; in unescape_octal() local
224 num = (*q++) & 7; in unescape_octal()
225 while (num < 32 && isodigit(*q) && (q - *src < 3)) { in unescape_octal()
226 num <<= 3; in unescape_octal()
227 num += (*q++) & 7; in unescape_octal()
229 *p = num; in unescape_octal()
239 u8 num; in unescape_hex() local
244 num = digit = hex_to_bin(*q++); in unescape_hex()
251 num = (num << 4) | digit; in unescape_hex()
253 *p = num; in unescape_hex()
A Dbsearch.c31 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 Dvsprintf.c406 if (num <= 9) { in num_to_str()
487 num = -(signed long long)num; in number()
516 num >>= shift; in number()
517 } while (num); in number()
3435 int num = 0; in vsscanf() local
3532 num++; in vsscanf()
3547 num++; in vsscanf()
3600 ++num; in vsscanf()
3625 return num; in vsscanf()
3690 num++; in vsscanf()
[all …]
A Dparser.c80 goto num; in match_one()
83 goto num; in match_one()
86 goto num; in match_one()
89 num: in match_one()
A Dbitmap-str.c239 static const char *bitmap_getnum(const char *str, unsigned int *num, in bitmap_getnum() argument
246 *num = lastbit; in bitmap_getnum()
256 *num = n; in bitmap_getnum()
434 const char *end, u32 *num) in bitmap_get_x32_reverse() argument
453 *num = ret; in bitmap_get_x32_reverse()
A Dtest_meminit.c351 int num, bytes; in do_kmem_cache_size_bulk() local
357 num = kmem_cache_alloc_bulk(c, GFP_KERNEL, ARRAY_SIZE(objects), in do_kmem_cache_size_bulk()
359 for (i = 0; i < num; i++) { in do_kmem_cache_size_bulk()
366 if (num) in do_kmem_cache_size_bulk()
367 kmem_cache_free_bulk(c, num, objects); in do_kmem_cache_size_bulk()
A Dextable.c113 const size_t num, in search_extable() argument
116 return bsearch(&value, base, num, in search_extable()
A Dfind_bit.c72 #define FIND_NTH_BIT(FETCH, size, num) \ argument
74 unsigned long sz = (size), nr = (num), idx, w, tmp; \
/lib/crypto/arm64/
A Dsha2-armv8.pl100 ($ctx,$inp,$num,$Ktbl)=map("x$_",(0..2,30));
238 add $num,$inp,$num,lsl#`log(16*$SZ)/log(2)` // end of input
241 stp $ctx,$num,[x29,#96]
255 ldp $ctx,$num,[x29,#96]
274 cmp $inp,$num
392 sub $num,$num,#1
441 cbnz $num,.Loop_hw
652 add $num,$inp,$num,lsl#6 // len to point at the end of inp
699 cmp $inp,$num
/lib/math/tests/
A Drational_kunit.c8 unsigned long num, den; member
39 rational_best_approximation(param->num, param->den, param->max_num, param->max_den, &n, &d); in rational_test()
/lib/crc/x86/
A Dcrc32c-3way.S105 # Compute floor(len / 24) to get num qwords to process from each lane.
122 shl $3, chunk_bytes # num bytes to process from each lane

Completed in 26 milliseconds