| /external/boringssl/src/crypto/evp/ |
| D | scrypt.c | 31 typedef struct { uint32_t words[16]; } block_t; member
45 x.words[4] ^= R(x.words[0] + x.words[12], 7); in salsa208_word_specification()
46 x.words[8] ^= R(x.words[4] + x.words[0], 9); in salsa208_word_specification()
47 x.words[12] ^= R(x.words[8] + x.words[4], 13); in salsa208_word_specification()
48 x.words[0] ^= R(x.words[12] + x.words[8], 18); in salsa208_word_specification()
49 x.words[9] ^= R(x.words[5] + x.words[1], 7); in salsa208_word_specification()
50 x.words[13] ^= R(x.words[9] + x.words[5], 9); in salsa208_word_specification()
51 x.words[1] ^= R(x.words[13] + x.words[9], 13); in salsa208_word_specification()
52 x.words[5] ^= R(x.words[1] + x.words[13], 18); in salsa208_word_specification()
53 x.words[14] ^= R(x.words[10] + x.words[6], 7); in salsa208_word_specification()
[all …]
|
| /external/boringssl/src/crypto/fipsmodule/bn/ |
| D | random.c | 149 int words = (bits + BN_BITS2 - 1) / BN_BITS2; in BN_rand() local
154 if (!bn_wexpand(rnd, words)) { in BN_rand()
158 RAND_bytes((uint8_t *)rnd->d, words * sizeof(BN_ULONG)); in BN_rand()
159 rnd->d[words - 1] &= mask; in BN_rand()
163 rnd->d[words - 1] |= 1; in BN_rand()
164 rnd->d[words - 2] |= kOne << (BN_BITS2 - 1); in BN_rand()
166 rnd->d[words - 1] |= kThree << (bit - 1); in BN_rand()
169 rnd->d[words - 1] |= kOne << bit; in BN_rand()
177 rnd->width = words; in BN_rand()
220 size_t words = len; in bn_range_to_mask() local
[all …]
|
| /external/deqp-deps/SPIRV-Tools/test/ |
| D | binary_parse_test.cpp | 55 : words(inst.words, inst.words + inst.num_words), in ParsedInstruction()
62 std::vector<uint32_t> words; member
70 return words == b.words && opcode == b.opcode && in operator ==()
80 spvtest::PrintTo(spvtest::WordVector(inst.words), &os); in operator <<()
200 void Parse(const SpirvVector& words, spv_result_t expected_result, in Parse() argument
202 SpirvVector flipped_words(words); in Parse()
236 const auto words = CompileSuccessfully(""); in TEST_F() local
239 Parse(words, SPV_SUCCESS, endian_swap); in TEST_F()
245 const auto words = CompileSuccessfully(""); in TEST_F() local
250 spvBinaryParse(ScopedContext().context, &client_, words.data(), in TEST_F()
[all …]
|
| /external/swiftshader/third_party/SPIRV-Tools/test/ |
| D | binary_parse_test.cpp | 55 : words(inst.words, inst.words + inst.num_words), in ParsedInstruction()
62 std::vector<uint32_t> words; member
70 return words == b.words && opcode == b.opcode && in operator ==()
80 spvtest::PrintTo(spvtest::WordVector(inst.words), &os); in operator <<()
202 void Parse(const SpirvVector& words, spv_result_t expected_result, in Parse() argument
204 SpirvVector flipped_words(words); in Parse()
238 const auto words = CompileSuccessfully(""); in TEST_F() local
241 Parse(words, SPV_SUCCESS, endian_swap); in TEST_F()
247 const auto words = CompileSuccessfully(""); in TEST_F() local
252 spvBinaryParse(ScopedContext().context, &client_, words.data(), in TEST_F()
[all …]
|
| /external/boringssl/src/crypto/fipsmodule/ec/ |
| D | felem.c | 41 bn_sub_words(out->words, group->field.d, a->words, group->field.width); in ec_felem_neg()
45 out->words[i] &= mask; in ec_felem_neg()
52 bn_mod_add_words(out->words, a->words, b->words, group->field.d, tmp.words, in ec_felem_add()
59 bn_mod_sub_words(out->words, a->words, b->words, group->field.d, tmp.words, in ec_felem_sub()
66 mask |= a->words[i]; in ec_felem_non_zero_mask()
73 bn_select_words(out->words, mask, a->words, b->words, group->field.width); in ec_felem_select()
80 return OPENSSL_memcmp(a->words, b->words, in ec_felem_equal()
|
| D | scalar.c | 26 if (!bn_copy_words(out->words, group->order.width, in) || in ec_bignum_to_scalar()
27 !bn_less_than_words(out->words, group->order.d, group->order.width)) { in ec_bignum_to_scalar()
36 return OPENSSL_memcmp(a->words, b->words, in ec_scalar_equal_vartime()
43 mask |= a->words[i]; in ec_scalar_is_zero()
50 return bn_rand_range_words(out->words, 1, group->order.d, group->order.width, in ec_random_nonzero_scalar()
58 bn_mod_add_words(r->words, a->words, b->words, order->d, tmp, order->width); in ec_scalar_add()
65 bn_to_montgomery_small(r->words, a->words, order->width, group->order_mont); in ec_scalar_to_montgomery()
71 bn_from_montgomery_small(r->words, a->words, order->width, group->order_mont); in ec_scalar_from_montgomery()
77 bn_mod_mul_montgomery_small(r->words, a->words, b->words, order->width, in ec_scalar_mul_montgomery()
84 bn_mod_inverse_prime_mont_small(r->words, a->words, order->width, in ec_simple_scalar_inv_montgomery()
|
| D | p256-x86_64.c | 225 OPENSSL_memcpy(row[1 - 1].X, p->X.words, P256_LIMBS * sizeof(BN_ULONG)); in ecp_nistz256_windowed_mul()
226 OPENSSL_memcpy(row[1 - 1].Y, p->Y.words, P256_LIMBS * sizeof(BN_ULONG)); in ecp_nistz256_windowed_mul()
227 OPENSSL_memcpy(row[1 - 1].Z, p->Z.words, P256_LIMBS * sizeof(BN_ULONG)); in ecp_nistz256_windowed_mul()
338 OPENSSL_memcpy(r->X.words, p->p.X, P256_LIMBS * sizeof(BN_ULONG)); in mul_p_add_and_store()
339 OPENSSL_memcpy(r->Y.words, p->p.Y, P256_LIMBS * sizeof(BN_ULONG)); in mul_p_add_and_store()
340 OPENSSL_memcpy(r->Z.words, p->p.Z, P256_LIMBS * sizeof(BN_ULONG)); in mul_p_add_and_store()
455 ecp_nistz256_mod_inverse_mont(z_inv3, point->Z.words); in ecp_nistz256_get_affine()
465 ecp_nistz256_mul_mont(x->words, z_inv2, point->X.words); in ecp_nistz256_get_affine()
470 ecp_nistz256_mul_mont(y->words, z_inv3, point->Y.words); in ecp_nistz256_get_affine()
479 OPENSSL_memcpy(a.X, a_->X.words, P256_LIMBS * sizeof(BN_ULONG)); in ecp_nistz256_add()
[all …]
|
| /external/u-boot/arch/x86/lib/ |
| D | div64.c | 16 } words; member
25 output.words.higher = output.words.lower << (shift - 32); in __ashldi3()
26 output.words.lower = 0; in __ashldi3()
30 output.words.higher = (output.words.higher << shift) | in __ashldi3()
31 (output.words.lower >> (32 - shift)); in __ashldi3()
32 output.words.lower = output.words.lower << shift; in __ashldi3()
43 output.words.lower = output.words.higher >> (shift - 32); in __lshrdi3()
44 output.words.higher = 0; in __lshrdi3()
48 output.words.lower = output.words.lower >> shift | in __lshrdi3()
49 (output.words.higher << (32 - shift)); in __lshrdi3()
[all …]
|
| /external/toolchain-utils/android_bench_suite/ |
| D | parse_result.py | 30 words = line.split()
31 if 'elapsed' in words:
33 result_dict['total_time_s'] = float(words[3])
45 words = line.split()
46 if 'normalized' in words:
48 accum += float(words[-1])
63 words = line.split()
64 for word in words:
81 words = line.split()
82 if 'elapsed' in words:
[all …]
|
| /external/python/cpython2/Modules/ |
| D | cgen.py | 450 words = string.split(line) variable
457 if words == ['%%']:
466 if words and words[0][0] == '%':
467 func = words[0][1:]
468 if (not func) and words[1:]:
469 func = words[1]
475 if not words:
477 elif words[0] == 'if':
480 if words[1][0] == '!':
481 if words[1][1:] in defined_archs:
[all …]
|
| /external/deqp-deps/SPIRV-Tools/source/opt/ |
| D | types.cpp | 178 void Type::GetHashWords(std::vector<uint32_t>* words, in GetHashWords() argument
184 words->push_back(kind_); in GetHashWords()
187 words->push_back(w); in GetHashWords()
194 As##type()->GetExtraHashWords(words, seen); \ in GetHashWords()
231 std::vector<uint32_t> words; in HashValue() local
232 GetHashWords(&words); in HashValue()
233 for (auto w : words) { in HashValue()
252 void Integer::GetExtraHashWords(std::vector<uint32_t>* words, in GetExtraHashWords() argument
254 words->push_back(width_); in GetExtraHashWords()
255 words->push_back(signed_); in GetExtraHashWords()
[all …]
|
| /external/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| D | types.cpp | 178 void Type::GetHashWords(std::vector<uint32_t>* words, in GetHashWords() argument
184 words->push_back(kind_); in GetHashWords()
187 words->push_back(w); in GetHashWords()
194 As##type()->GetExtraHashWords(words, seen); \ in GetHashWords()
231 std::vector<uint32_t> words; in HashValue() local
232 GetHashWords(&words); in HashValue()
233 for (auto w : words) { in HashValue()
252 void Integer::GetExtraHashWords(std::vector<uint32_t>* words, in GetExtraHashWords() argument
254 words->push_back(width_); in GetExtraHashWords()
255 words->push_back(signed_); in GetExtraHashWords()
[all …]
|
| /external/perfetto/src/traced/probes/sys_stats/ |
| D | sys_stats_data_source.cc | 189 base::StringSplitter words(&lines, ' '); in ReadMeminfo() local
190 if (!words.Next()) in ReadMeminfo()
193 words.cur_token()[words.cur_token_size() - 1] = '\0'; in ReadMeminfo()
194 auto it = meminfo_counters_.find(words.cur_token()); in ReadMeminfo()
198 if (!words.Next()) in ReadMeminfo()
200 auto value = static_cast<uint64_t>(strtoll(words.cur_token(), nullptr, 10)); in ReadMeminfo()
213 base::StringSplitter words(&lines, ' '); in ReadVmstat() local
214 if (!words.Next()) in ReadVmstat()
216 auto it = vmstat_counters_.find(words.cur_token()); in ReadVmstat()
220 if (!words.Next()) in ReadVmstat()
[all …]
|
| /external/iproute2/bash-completion/ |
| D | tc | 11 # Takes a list of words in argument; each one of them is added to COMPREPLY if
18 for (( subcword=3; subcword < ${#words[@]}-1; subcword++ )); do
19 if [[ $w == ${words[subcword]} ]]; then
29 # Takes a list of words in argument; each one of them is added to COMPREPLY if
38 for (( subcword=$from; subcword < ${#words[@]}-1; subcword++ )); do
39 if [[ $w == ${words[subcword]} ]]; then
49 # Takes a list of words in argument; adds them all to COMPREPLY if none of them
55 for (( subcword=3; subcword < ${#words[@]}-1; subcword++ )); do
56 [[ $w == ${words[subcword]} ]] && return 1
62 # Takes a list of words in argument; adds them all to COMPREPLY if none of them
[all …]
|
| /external/v8/tools/ |
| D | trace-maps-processor.py | 90 words = line.split(" ") variable
91 event = words[1]
93 assert words[2] == "map="
94 assert words[4] == "SFI="
95 new_map = AddMap(words[3], "SFI#%s" % words[5])
98 if words[2] == "from=" and words[4] == "to=":
99 from_map = words[3]
100 to_map = words[5]
109 assert words[6] == "name=", line
110 reason = "%s: %s" % (event, words[7])
[all …]
|
| /external/icu/icu4c/source/common/ |
| D | dictbe.cpp | 238 PossibleWord words[THAI_LOOKAHEAD]; in divideUpDictionaryRange() local
247 … int32_t candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); in divideUpDictionaryRange()
251 cuWordLength = words[wordsFound % THAI_LOOKAHEAD].acceptMarked(text); in divideUpDictionaryRange()
252 cpWordLength = words[wordsFound % THAI_LOOKAHEAD].markedCPLength(); in divideUpDictionaryRange()
263 … if (words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
266 words[wordsFound%THAI_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
278 … if (words[(wordsFound + 2) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd)) { in divideUpDictionaryRange()
279 words[wordsFound % THAI_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
283 while (words[(wordsFound + 1) % THAI_LOOKAHEAD].backUp(text)); in divideUpDictionaryRange()
286 while (words[wordsFound % THAI_LOOKAHEAD].backUp(text)); in divideUpDictionaryRange()
[all …]
|
| /external/toolchain-utils/ |
| D | update_telemetry_defaults.py | 145 words = inp.split(' ')
146 option = words[0]
151 if len(words) == 1:
154 self.ListCurrentDefaults(benchmark=words[1])
156 if len(words) < 3:
159 benchmark = words[1]
160 resultList = words[2:]
164 if len(words) != 3:
167 benchmark = words[1]
168 result = words[2]
[all …]
|
| /external/python/cpython3/Lib/idlelib/ |
| D | autoexpand.py | 32 words = self.getwords()
35 words, index, insert, line = self.state
37 words = self.getwords()
39 if not words:
44 newword = words[index]
45 index = (index + 1) % len(words)
51 self.state = words, index, curinsert, curline
67 words = []
74 words.append(w)
80 words.append(w)
[all …]
|
| /external/python/cpython2/Lib/idlelib/ |
| D | AutoExpand.py | 41 words = self.getwords()
44 words, index, insert, line = self.state
46 words = self.getwords()
48 if not words:
53 newword = words[index]
54 index = (index + 1) % len(words)
60 self.state = words, index, curinsert, curline
76 words = []
83 words.append(w)
89 words.append(w)
[all …]
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| D | BurmeseBreakEngine.java | 98 PossibleWord words[] = new PossibleWord[BURMESE_LOOKAHEAD]; in divideUpDictionaryRange() local
100 words[i] = new PossibleWord(); in divideUpDictionaryRange()
109 … int candidates = words[wordsFound%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
113 wordLength = words[wordsFound%BURMESE_LOOKAHEAD].acceptMarked(fIter); in divideUpDictionaryRange()
124 … if (words[(wordsFound+1)%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
127 words[wordsFound%BURMESE_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
139 … if (words[(wordsFound+2)%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
140 words[wordsFound%BURMESE_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
144 } while (words[(wordsFound+1)%BURMESE_LOOKAHEAD].backUp(fIter)); in divideUpDictionaryRange()
146 } while (words[wordsFound%BURMESE_LOOKAHEAD].backUp(fIter) && !foundBest); in divideUpDictionaryRange()
[all …]
|
| D | LaoBreakEngine.java | 101 PossibleWord words[] = new PossibleWord[LAO_LOOKAHEAD]; in divideUpDictionaryRange() local
103 words[i] = new PossibleWord(); in divideUpDictionaryRange()
112 … int candidates = words[wordsFound%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
116 wordLength = words[wordsFound%LAO_LOOKAHEAD].acceptMarked(fIter); in divideUpDictionaryRange()
127 … if (words[(wordsFound+1)%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
130 words[wordsFound%LAO_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
142 … if (words[(wordsFound+2)%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
143 words[wordsFound%LAO_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
147 } while (words[(wordsFound+1)%LAO_LOOKAHEAD].backUp(fIter)); in divideUpDictionaryRange()
149 } while (words[wordsFound%LAO_LOOKAHEAD].backUp(fIter) && !foundBest); in divideUpDictionaryRange()
[all …]
|
| D | KhmerBreakEngine.java | 101 PossibleWord words[] = new PossibleWord[KHMER_LOOKAHEAD]; in divideUpDictionaryRange() local
103 words[i] = new PossibleWord(); in divideUpDictionaryRange()
113 … int candidates = words[wordsFound % KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
117 wordLength = words[wordsFound % KHMER_LOOKAHEAD].acceptMarked(fIter); in divideUpDictionaryRange()
128 … if (words[(wordsFound+1)%KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
131 words[wordsFound%KHMER_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
143 … if (words[(wordsFound+2)%KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
144 words[wordsFound%KHMER_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
148 } while (words[(wordsFound+1)%KHMER_LOOKAHEAD].backUp(fIter)); in divideUpDictionaryRange()
150 } while (words[wordsFound%KHMER_LOOKAHEAD].backUp(fIter) && !foundBest); in divideUpDictionaryRange()
[all …]
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| D | BurmeseBreakEngine.java | 99 PossibleWord words[] = new PossibleWord[BURMESE_LOOKAHEAD]; in divideUpDictionaryRange() local
101 words[i] = new PossibleWord(); in divideUpDictionaryRange()
110 … int candidates = words[wordsFound%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
114 wordLength = words[wordsFound%BURMESE_LOOKAHEAD].acceptMarked(fIter); in divideUpDictionaryRange()
125 … if (words[(wordsFound+1)%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
128 words[wordsFound%BURMESE_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
140 … if (words[(wordsFound+2)%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
141 words[wordsFound%BURMESE_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
145 } while (words[(wordsFound+1)%BURMESE_LOOKAHEAD].backUp(fIter)); in divideUpDictionaryRange()
147 } while (words[wordsFound%BURMESE_LOOKAHEAD].backUp(fIter) && !foundBest); in divideUpDictionaryRange()
[all …]
|
| D | LaoBreakEngine.java | 102 PossibleWord words[] = new PossibleWord[LAO_LOOKAHEAD]; in divideUpDictionaryRange() local
104 words[i] = new PossibleWord(); in divideUpDictionaryRange()
113 … int candidates = words[wordsFound%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
117 wordLength = words[wordsFound%LAO_LOOKAHEAD].acceptMarked(fIter); in divideUpDictionaryRange()
128 … if (words[(wordsFound+1)%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
131 words[wordsFound%LAO_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
143 … if (words[(wordsFound+2)%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
144 words[wordsFound%LAO_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
148 } while (words[(wordsFound+1)%LAO_LOOKAHEAD].backUp(fIter)); in divideUpDictionaryRange()
150 } while (words[wordsFound%LAO_LOOKAHEAD].backUp(fIter) && !foundBest); in divideUpDictionaryRange()
[all …]
|
| D | KhmerBreakEngine.java | 102 PossibleWord words[] = new PossibleWord[KHMER_LOOKAHEAD]; in divideUpDictionaryRange() local
104 words[i] = new PossibleWord(); in divideUpDictionaryRange()
114 … int candidates = words[wordsFound % KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
118 wordLength = words[wordsFound % KHMER_LOOKAHEAD].acceptMarked(fIter); in divideUpDictionaryRange()
129 … if (words[(wordsFound+1)%KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
132 words[wordsFound%KHMER_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
144 … if (words[(wordsFound+2)%KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
145 words[wordsFound%KHMER_LOOKAHEAD].markCurrent(); in divideUpDictionaryRange()
149 } while (words[(wordsFound+1)%KHMER_LOOKAHEAD].backUp(fIter)); in divideUpDictionaryRange()
151 } while (words[wordsFound%KHMER_LOOKAHEAD].backUp(fIter) && !foundBest); in divideUpDictionaryRange()
[all …]
|