Home
last modified time | relevance | path

Searched refs:modulo (Results 1 – 25 of 231) sorted by relevance

12345678910

/external/boringssl/src/util/fipstools/acvp/acvptool/test/vectors/
DRSA.bz2 ... 010001", 19 "hashAlg": "SHA2-224", 20 "modulo": 1024, 21 "n": "A261BF8EE2DED518DF1E6685A3CBBF96485B23443D692E99D18698204133BB03ADE324362494A5605BBC4BBE43030D82D4FC0415A1BF51D42FE8F33CEAE551008A43F3A8D57F635D5C9059856DEFA503E6AC1957ADC0ED174356B20E4575D0369422D89DE3D190BF31DDF1EEAEDD3A3B054E224A46C4C7BCA85C728F791C5F05", 22 "saltLen ...
/external/rust/crates/itertools/tests/
Dquick.rs1081 fn correct_group_map_modulo_key(a: Vec<u8>, modulo: u8) -> () {
1082 let modulo = if modulo == 0 { 1 } else { modulo }; // Avoid `% 0` localVariable
1084 let lookup = a.into_iter().map(|i| (i % modulo, i)).into_group_map();
1089 assert!(vals.iter().all(|&val| val % modulo == key));
1201 fn consistent_grouping_map_with_by(a: Vec<u8>, modulo: u8) -> () {
1202 let modulo = if modulo == 0 { 1 } else { modulo }; // Avoid `% 0` localVariable
1204 …let lookup_grouping_map = a.iter().copied().map(|i| (i % modulo, i)).into_grouping_map().collect::…
1205 …let lookup_grouping_map_by = a.iter().copied().into_grouping_map_by(|i| i % modulo).collect::<Vec<…
1210 fn correct_grouping_map_by_aggregate_modulo_key(a: Vec<u8>, modulo: u8) -> () {
1211 let modulo = if modulo < 2 { 2 } else { modulo } as u64; // Avoid `% 0` localVariable
[all …]
/external/icu/android_icu4j/src/main/java/android/icu/impl/coll/
DBOCSU.java242 int modulo = number % factor; in getNegDivMod() local
244 if (modulo < 0) { in getNegDivMod()
246 modulo += factor; in getNegDivMod()
248 return (result << 32) | modulo; in getNegDivMod()
296 int modulo = (int)division; in writeDiff() local
300 buffer[offset ++] = (byte)(SLOPE_MIN_ + modulo); in writeDiff()
303 buffer[offset + 2] = (byte)(SLOPE_MIN_ + modulo); in writeDiff()
306 modulo = (int)division; in writeDiff()
308 buffer[offset + 1] = (byte)(SLOPE_MIN_ + modulo); in writeDiff()
313 buffer[offset + 3] = (byte)(SLOPE_MIN_ + modulo); in writeDiff()
[all …]
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/
DBOCSU.java241 int modulo = number % factor; in getNegDivMod() local
243 if (modulo < 0) { in getNegDivMod()
245 modulo += factor; in getNegDivMod()
247 return (result << 32) | modulo; in getNegDivMod()
295 int modulo = (int)division; in writeDiff() local
299 buffer[offset ++] = (byte)(SLOPE_MIN_ + modulo); in writeDiff()
302 buffer[offset + 2] = (byte)(SLOPE_MIN_ + modulo); in writeDiff()
305 modulo = (int)division; in writeDiff()
307 buffer[offset + 1] = (byte)(SLOPE_MIN_ + modulo); in writeDiff()
312 buffer[offset + 3] = (byte)(SLOPE_MIN_ + modulo); in writeDiff()
[all …]
/external/ruy/ruy/
Dsize_util_test.cc58 for (std::uint8_t modulo : {1, 2, 8, 32, 128}) { in SizeUtilTestValue()
59 EXPECT_GE(value, round_down_pot(value, modulo)); in SizeUtilTestValue()
60 EXPECT_EQ(round_down_pot(value, modulo) % modulo, 0); in SizeUtilTestValue()
62 if (value <= std::numeric_limits<Integer>::max() - modulo) { in SizeUtilTestValue()
63 EXPECT_LE(value, round_up_pot(value, modulo)); in SizeUtilTestValue()
64 EXPECT_EQ(round_up_pot(value, modulo) % modulo, 0); in SizeUtilTestValue()
Dsize_util.h93 Integer round_down_pot(Integer value, Modulo modulo) { in round_down_pot() argument
94 RUY_DCHECK_EQ(modulo & (modulo - 1), 0); in round_down_pot()
95 return value & ~(modulo - 1); in round_down_pot()
99 Integer round_up_pot(Integer value, Modulo modulo) { in round_up_pot() argument
100 return round_down_pot(value + modulo - 1, modulo); in round_up_pot()
/external/llvm-project/polly/lib/External/isl/
Disl_equalities.c735 int pos, isl_int *modulo, isl_int *residue) in isl_basic_set_dim_residue_class() argument
743 if (!bset || !modulo || !residue) in isl_basic_set_dim_residue_class()
750 isl_int_set_si(*modulo, 0); in isl_basic_set_dim_residue_class()
765 total-bset->n_eq, modulo); in isl_basic_set_dim_residue_class()
766 if (isl_int_is_zero(*modulo)) in isl_basic_set_dim_residue_class()
767 isl_int_set_si(*modulo, 1); in isl_basic_set_dim_residue_class()
768 if (isl_int_is_one(*modulo)) { in isl_basic_set_dim_residue_class()
794 isl_int_set_si(*modulo, 1); in isl_basic_set_dim_residue_class()
799 isl_int_fdiv_r(*residue, *residue, *modulo); in isl_basic_set_dim_residue_class()
818 int pos, isl_int *modulo, isl_int *residue) in isl_set_dim_residue_class() argument
[all …]
/external/antlr/runtime/JavaScript/tests/functional/
Dt058rewriteAST70.g4 modulo
5 : 'modulo' ID ('(' parms+ ')')? -> ^('modulo' ID ^(PARMS parms+)?)
/external/llvm-project/llvm/utils/
Dunicode-case-fold.py79 modulo = first % stride(b)
89 if stride(b) == 2 and shift(b[0]) == 1 and modulo == 0:
99 body += pattern.format(last, stride(b), modulo, shift(b[0]))
/external/python/cpython3/Modules/_decimal/libmpdec/literature/
Dbignum.txt40 c1 = fnt_convolute(u, v, P1) # convolute modulo prime1
41 c2 = fnt_convolute(u, v, P2) # convolute modulo prime2
42 c3 = fnt_convolute(u, v, P3) # convolute modulo prime3
79 transforms modulo three different primes to get the
/external/rust/crates/num-integer/benches/
Daverage.rs250 fn modulo(b: &mut Bencher) {
279 fn modulo(b: &mut Bencher) {
308 fn modulo(b: &mut Bencher) {
343 fn modulo(b: &mut Bencher) {
372 fn modulo(b: &mut Bencher) {
401 fn modulo(b: &mut Bencher) {
/external/swiftshader/src/Pipeline/
DComputeProgram.cpp254 auto modulo = groupIndex; in run() local
255 auto groupOffsetZ = modulo / (groupCountX * groupCountY); in run()
256 modulo -= groupOffsetZ * (groupCountX * groupCountY); in run()
257 auto groupOffsetY = modulo / groupCountX; in run()
258 modulo -= groupOffsetY * groupCountX; in run()
259 auto groupOffsetX = modulo; in run()
/external/python/rsa/rsa/
Dcommon.py170 for modulo in modulo_values:
171 m *= modulo
/external/kotlinx.coroutines/kotlinx-coroutines-core/jvm/test/channels/
DChannelUndeliveredElementStressTest.kt53 private val modulo = 1 shl 25 in <lambda>() constant in kotlinx.coroutines.channels.ChannelUndeliveredElementStressTest
54 private val mask = (modulo - 1).toLong() in <lambda>()
233 private val a = ByteArray(modulo) in <lambda>()
/external/llvm-project/polly/test/ScopInfo/NonAffine/
Dmodulo_domain.ll3 ; TODO: The new domain generation cannot handle modulo domain constraints,
4 ; hence modulo handling has been disabled completely. Once this is
/external/boringssl/src/util/fipstools/acvp/modulewrapper/
Dmodulewrapper.cc508 "modulo": 2048, in GetConfig()
513 "modulo": 3072, in GetConfig()
518 "modulo": 4096, in GetConfig()
532 "modulo": 2048, in GetConfig()
546 "modulo": 3072, in GetConfig()
560 "modulo": 4096, in GetConfig()
574 "modulo": 2048, in GetConfig()
592 "modulo": 3072, in GetConfig()
610 "modulo": 4096, in GetConfig()
636 "modulo": 1024, in GetConfig()
[all …]
/external/llvm-project/polly/lib/External/isl/test_inputs/codegen/
Dmod.in1 # check that modulo constraint is generated correctly
/external/llvm-project/llvm/test/CodeGen/PowerPC/
Dp10-vector-modulo.ll9 ; This test case aims to test the vector modulo instructions on Power10.
10 ; The vector modulo instructions operate on signed and unsigned words
13 ; The vector modulo instructions operate on signed and unsigned words,
/external/mesa3d/src/compiler/nir/
Dnir_lower_idiv.c139 emit_udiv(nir_builder *bld, nir_ssa_def *numer, nir_ssa_def *denom, bool modulo) in emit_udiv() argument
156 if (!modulo) { in emit_udiv()
165 if (modulo) { in emit_udiv()
/external/antlr/runtime/C/src/
Dantlr3collections.c155 table->modulo = sizeHint; in antlr3HashTableNew()
208 for (bucket = 0; bucket < table->modulo; bucket++) in antlr3HashFree()
283 hash = (ANTLR3_UINT32)(key % (ANTLR3_INTKEY)(table->modulo)); in antlr3HashRemoveI()
344 bucket = table->buckets + (hash % table->modulo); in antlr3HashRemove()
452 hash = (ANTLR3_UINT32)(key % (ANTLR3_INTKEY)(table->modulo)); in antlr3HashGetI()
496 bucket = table->buckets + (hash % table->modulo); in antlr3HashGet()
532 hash = (ANTLR3_UINT32)(key % (ANTLR3_INTKEY)(table->modulo)); in antlr3HashPutI()
607 bucket = table->buckets + (hash % table->modulo); in antlr3HashPut()
733 if (en->bucket >= en->table->modulo) in antlr3EnumNext()
791 while (en->bucket < en->table->modulo) in antlr3EnumNextEntry()
/external/kernel-headers/original/uapi/linux/hdlc/
Dioctl.h84 unsigned int modulo; /* modulo (8 = basic / 128 = extended) */ member
/external/llvm-project/lld/test/ELF/
Dnobits-offset.s8 ## sh_offset to sh_addr modulo max-page-size, so that p_vaddr=p_offset (mod
/external/python/cpython3/Lib/
D_pydecimal.py1966 def _power_modulo(self, other, modulo, context=None): argument
1972 modulo = _convert_other(modulo)
1973 if modulo is NotImplemented:
1974 return modulo
1983 modulo_is_nan = modulo._isnan()
1993 modulo)
1998 return modulo._fix_nan(context)
2003 modulo._isinteger()):
2011 if not modulo:
2017 if modulo.adjusted() >= context.prec:
[all …]
/external/llvm-project/lld/test/ELF/linkerscript/
Dnobits-offset.s12 ## sh_offset to sh_addr modulo max-page-size, so that p_vaddr=p_offset (mod
/external/python/cpython2/Lib/
Ddecimal.py1851 def _power_modulo(self, other, modulo, context=None): argument
1858 modulo = _convert_other(modulo, raiseit=True)
1867 modulo_is_nan = modulo._isnan()
1877 modulo)
1882 return modulo._fix_nan(context)
1887 modulo._isinteger()):
1895 if not modulo:
1901 if modulo.adjusted() >= context.prec:
1923 modulo = abs(int(modulo))
1928 base = (base.int % modulo * pow(10, base.exp, modulo)) % modulo
[all …]

12345678910