| /third_party/node/deps/npm/node_modules/jsbn/ |
| D | README.md | 5 …on to this one have not even come close in performance. I am aware of the `bi` module on npm, howe…
17 ### bi.toString()
21 ### bi.negate()
23 returns a new BigInteger equal to the negation of `bi`
25 ### bi.abs
29 ### bi.compareTo
33 ### bi.bitLength
37 ### bi.mod
41 ### bi.modPowInt
45 ### bi.clone
[all …]
|
| /third_party/boost/libs/geometry/index/test/rtree/interprocess/ |
| D | test_interprocess.hpp | 21 namespace bi = boost::interprocess; in test_rtree_interprocess()
24 shm_remove() { bi::shared_memory_object::remove("shmem"); } in test_rtree_interprocess()
25 ~shm_remove(){ bi::shared_memory_object::remove("shmem"); } in test_rtree_interprocess()
28 bi::managed_shared_memory segment(bi::create_only, "shmem", 65535); in test_rtree_interprocess()
29 typedef bi::allocator<Point, bi::managed_shared_memory::segment_manager> shmem_alloc; in test_rtree_interprocess()
39 namespace bi = boost::interprocess; in modifiers()
42 shm_remove() { bi::shared_memory_object::remove("shmem"); } in modifiers()
43 ~shm_remove(){ bi::shared_memory_object::remove("shmem"); } in modifiers()
46 bi::managed_shared_memory segment(bi::create_only, "shmem", 65535); in modifiers()
47 typedef bi::allocator<Indexable, bi::managed_shared_memory::segment_manager> shmem_alloc; in modifiers()
[all …]
|
| /third_party/openssl/crypto/ec/asm/ |
| D | x25519-ppc64.pl | 46 my ($bi,$a0,$a1,$a2,$a3,$t0,$t1, $t2,$t3,
71 ld $bi,0($bp)
78 mulld $acc0,$a0,$bi # a[0]*b[0]
79 mulhdu $t0,$a0,$bi
80 mulld $acc1,$a1,$bi # a[1]*b[0]
81 mulhdu $t1,$a1,$bi
82 mulld $acc2,$a2,$bi # a[2]*b[0]
83 mulhdu $t2,$a2,$bi
84 mulld $acc3,$a3,$bi # a[3]*b[0]
85 mulhdu $t3,$a3,$bi
[all …]
|
| /third_party/libsnd/src/ |
| D | test_broadcast_var.c | 34 fill_coding_history (SF_BROADCAST_INFO_512 * bi) in fill_coding_history() argument
52 bi->coding_history [0] = 0 ; in fill_coding_history()
54 for (k = 0 ; strlen (bi->coding_history) < bi->coding_history_size - 1 ; k ++) in fill_coding_history()
55 …append_snprintf (bi->coding_history, bi->coding_history_size, "%s\n", lines [k % ARRAY_LEN (lines)… in fill_coding_history()
72 SF_BROADCAST_INFO_512 bi ; in test_broadcast_var_set() local
74 memset (&bi, 0, sizeof (bi)) ; in test_broadcast_var_set()
76 bi.coding_history_size = k ; in test_broadcast_var_set()
77 fill_coding_history (&bi) ; in test_broadcast_var_set()
78 bi.coding_history_size -- ; in test_broadcast_var_set()
80 broadcast_var_set (psf, (SF_BROADCAST_INFO*) &bi, sizeof (bi)) ; in test_broadcast_var_set()
[all …]
|
| /third_party/node/deps/icu-small/source/common/ |
| D | ubrk.cpp | 149 const UBreakIterator *bi, in ubrk_safeClone() argument
157 if (bi == NULL) { in ubrk_safeClone()
168 BreakIterator *newBI = ((BreakIterator *)bi)->clone(); in ubrk_safeClone()
178 ubrk_clone(const UBreakIterator *bi, UErrorCode *status) { in ubrk_clone() argument
182 BreakIterator *newBI = ((BreakIterator *)bi)->clone(); in ubrk_clone()
192 ubrk_close(UBreakIterator *bi) in ubrk_close() argument
194 delete (BreakIterator *)bi; in ubrk_close()
198 ubrk_setText(UBreakIterator* bi, in ubrk_setText() argument
205 ((BreakIterator*)bi)->setText(&ut, *status); in ubrk_setText()
213 ubrk_setUText(UBreakIterator *bi, in ubrk_setUText() argument
[all …]
|
| /third_party/skia/third_party/externals/icu/source/common/ |
| D | ubrk.cpp | 149 const UBreakIterator *bi, in ubrk_safeClone() argument
157 if (bi == NULL) { in ubrk_safeClone()
168 BreakIterator *newBI = ((BreakIterator *)bi)->clone(); in ubrk_safeClone()
178 ubrk_clone(const UBreakIterator *bi, UErrorCode *status) { in ubrk_clone() argument
182 BreakIterator *newBI = ((BreakIterator *)bi)->clone(); in ubrk_clone()
192 ubrk_close(UBreakIterator *bi) in ubrk_close() argument
194 delete (BreakIterator *)bi; in ubrk_close()
198 ubrk_setText(UBreakIterator* bi, in ubrk_setText() argument
205 ((BreakIterator*)bi)->setText(&ut, *status); in ubrk_setText()
213 ubrk_setUText(UBreakIterator *bi, in ubrk_setUText() argument
[all …]
|
| /third_party/icu/icu4c/source/common/ |
| D | ubrk.cpp | 149 const UBreakIterator *bi, in ubrk_safeClone() argument
157 if (bi == NULL) { in ubrk_safeClone()
168 BreakIterator *newBI = ((BreakIterator *)bi)->clone(); in ubrk_safeClone()
178 ubrk_clone(const UBreakIterator *bi, UErrorCode *status) { in ubrk_clone() argument
182 BreakIterator *newBI = ((BreakIterator *)bi)->clone(); in ubrk_clone()
192 ubrk_close(UBreakIterator *bi) in ubrk_close() argument
194 delete (BreakIterator *)bi; in ubrk_close()
198 ubrk_setText(UBreakIterator* bi, in ubrk_setText() argument
205 ((BreakIterator*)bi)->setText(&ut, *status); in ubrk_setText()
213 ubrk_setUText(UBreakIterator *bi, in ubrk_setUText() argument
[all …]
|
| /third_party/flutter/skia/third_party/externals/icu/source/common/ |
| D | ubrk.cpp | 149 const UBreakIterator *bi, in ubrk_safeClone() argument
157 if (bi == NULL) { in ubrk_safeClone()
168 BreakIterator *newBI = ((BreakIterator *)bi)->clone(); in ubrk_safeClone()
180 ubrk_close(UBreakIterator *bi) in ubrk_close() argument
182 delete (BreakIterator *)bi; in ubrk_close()
186 ubrk_setText(UBreakIterator* bi, in ubrk_setText() argument
193 ((BreakIterator*)bi)->setText(&ut, *status); in ubrk_setText()
201 ubrk_setUText(UBreakIterator *bi, in ubrk_setUText() argument
205 ((BreakIterator*)bi)->setText(text, *status); in ubrk_setUText()
213 ubrk_current(const UBreakIterator *bi) in ubrk_current() argument
[all …]
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/base/internal/ |
| D | fast_type_id_test.cc | 24 namespace bi = absl::base_internal;
42 bi::FastTypeIdType type_ids[] = { in TEST()
43 #define A(T) bi::FastTypeId<T>(), in TEST()
46 #define A(T) bi::FastTypeId<const T>(), in TEST()
49 #define A(T) bi::FastTypeId<volatile T>(), in TEST()
52 #define A(T) bi::FastTypeId<const volatile T>(), in TEST()
56 size_t total_type_ids = sizeof(type_ids) / sizeof(bi::FastTypeIdType); in TEST()
77 bi::FastTypeIdType type_ids[] = { in TEST()
78 #define A(T) bi::FastTypeId<T>(), in TEST()
81 #define A(T) bi::FastTypeId<const T>(), in TEST()
[all …]
|
| /third_party/abseil-cpp/absl/base/internal/ |
| D | fast_type_id_test.cc | 24 namespace bi = absl::base_internal;
42 bi::FastTypeIdType type_ids[] = { in TEST()
43 #define A(T) bi::FastTypeId<T>(), in TEST()
46 #define A(T) bi::FastTypeId<const T>(), in TEST()
49 #define A(T) bi::FastTypeId<volatile T>(), in TEST()
52 #define A(T) bi::FastTypeId<const volatile T>(), in TEST()
56 size_t total_type_ids = sizeof(type_ids) / sizeof(bi::FastTypeIdType); in TEST()
77 bi::FastTypeIdType type_ids[] = { in TEST()
78 #define A(T) bi::FastTypeId<T>(), in TEST()
81 #define A(T) bi::FastTypeId<const T>(), in TEST()
[all …]
|
| /third_party/ffmpeg/libavcodec/ |
| D | rpzaenc.c | 115 static int get_block_info(BlockInfo *bi, int block) in get_block_info() argument
117 bi->row = block / bi->blocks_per_row; in get_block_info()
118 bi->col = block % bi->blocks_per_row; in get_block_info()
121 if (bi->col == bi->blocks_per_row - 1 && (bi->image_width % 4) != 0) { in get_block_info()
122 bi->block_width = bi->image_width % 4; in get_block_info()
124 bi->block_width = 4; in get_block_info()
128 if (bi->row == (bi->image_height / 4) && (bi->image_height % 4) != 0) { in get_block_info()
129 bi->block_height = bi->image_height % 4; in get_block_info()
131 bi->block_height = 4; in get_block_info()
134 return block ? (bi->col * 4) + (bi->row * bi->rowstride * 4) : 0; in get_block_info()
[all …]
|
| D | dvenc.c | 167 static av_always_inline PutBitContext *dv_encode_ac(EncBlockInfo *bi, in dv_encode_ac() argument
173 int size = bi->partial_bit_count; in dv_encode_ac()
174 uint32_t vlc = bi->partial_bit_buffer; in dv_encode_ac()
176 bi->partial_bit_count = in dv_encode_ac()
177 bi->partial_bit_buffer = 0; in dv_encode_ac()
187 bi->partial_bit_count = size; in dv_encode_ac()
188 bi->partial_bit_buffer = vlc; in dv_encode_ac()
196 if (bi->cur_ac >= 64) in dv_encode_ac()
200 prev = bi->cur_ac; in dv_encode_ac()
201 bi->cur_ac = bi->next[prev]; in dv_encode_ac()
[all …]
|
| /third_party/icu/icu4c/source/test/intltest/ |
| D | rbbiapts.cpp | 388 …RuleBasedBreakIterator* bi = (RuleBasedBreakIterator*)RuleBasedBreakIterator::createCharacterInst… in TestIteration() local
389 if (U_FAILURE(status) || bi == NULL) { in TestIteration()
392 delete bi; in TestIteration()
395 …bi = (RuleBasedBreakIterator*)RuleBasedBreakIterator::createWordInstance(Locale::getDefault(), st… in TestIteration()
396 if (U_FAILURE(status) || bi == NULL) { in TestIteration()
399 delete bi; in TestIteration()
402 …bi = (RuleBasedBreakIterator*)RuleBasedBreakIterator::createLineInstance(Locale::getDefault(), st… in TestIteration()
403 if (U_FAILURE(status) || bi == NULL) { in TestIteration()
406 delete bi; in TestIteration()
409 …bi = (RuleBasedBreakIterator*)RuleBasedBreakIterator::createSentenceInstance(Locale::getDefault()… in TestIteration()
[all …]
|
| /third_party/skia/third_party/externals/harfbuzz/util/ |
| D | ansi-print.hh | 224 block_best (const biimage_t &bi, bool *inverse) in block_best() argument
226 assert (bi.width <= CELL_W); in block_best()
227 assert (bi.height <= CELL_H); in block_best()
238 for (unsigned int y = 0; y < bi.height; y++) in block_best()
239 for (unsigned int x = 0; x < bi.width; x++) { in block_best()
240 unsigned int c = bi (x, y); in block_best()
246 quad[2 * y / bi.height][2 * x / bi.width] += c; in block_best()
247 quad_i[2 * y / bi.height][2 * x / bi.width] += c_i; in block_best()
253 for (unsigned int i = 1; i < bi.height; i++) { in block_best()
257 for (unsigned int i = 1; i < bi.width; i++) { in block_best()
[all …]
|
| /third_party/harfbuzz/util/ |
| D | ansi-print.cc | 227 block_best (const biimage_t &bi, bool *inverse) in block_best() argument
229 assert (bi.width <= CELL_W); in block_best()
230 assert (bi.height <= CELL_H); in block_best()
241 for (unsigned int y = 0; y < bi.height; y++) in block_best()
242 for (unsigned int x = 0; x < bi.width; x++) { in block_best()
243 unsigned int c = bi (x, y); in block_best()
249 quad[2 * y / bi.height][2 * x / bi.width] += c; in block_best()
250 quad_i[2 * y / bi.height][2 * x / bi.width] += c_i; in block_best()
256 for (unsigned int i = 1; i < bi.height; i++) { in block_best()
260 for (unsigned int i = 1; i < bi.width; i++) { in block_best()
[all …]
|
| /third_party/flutter/skia/third_party/externals/harfbuzz/util/ |
| D | ansi-print.cc | 227 block_best (const biimage_t &bi, bool *inverse) in block_best() argument
229 assert (bi.width <= CELL_W); in block_best()
230 assert (bi.height <= CELL_H); in block_best()
241 for (unsigned int y = 0; y < bi.height; y++) in block_best()
242 for (unsigned int x = 0; x < bi.width; x++) { in block_best()
243 unsigned int c = bi (x, y); in block_best()
249 quad[2 * y / bi.height][2 * x / bi.width] += c; in block_best()
250 quad_i[2 * y / bi.height][2 * x / bi.width] += c_i; in block_best()
256 for (unsigned int i = 1; i < bi.height; i++) { in block_best()
260 for (unsigned int i = 1; i < bi.width; i++) { in block_best()
[all …]
|
| /third_party/icu/icu4j/perf-tests/src/com/ibm/icu/dev/test/perf/ |
| D | RBBIPerf.java | 28 RuleBasedBreakIterator bi; field in RBBIPerf
63 … bi = (RuleBasedBreakIterator)com.ibm.icu.text.BreakIterator.getCharacterInstance(); in setup()
65 bi = (RuleBasedBreakIterator)com.ibm.icu.text.BreakIterator.getWordInstance(); in setup()
67 bi = (RuleBasedBreakIterator)com.ibm.icu.text.BreakIterator.getLineInstance(); in setup()
72 if (bi!=null ) { in setup()
73 bi.setText(testString); in setup()
88 if (bi != null) { in testRBBINext()
89 n = bi.first(); in testRBBINext()
90 for (; n != BreakIterator.DONE; n=bi.next()) { in testRBBINext()
103 if (bi != null) { in testRBBINext()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/reduce/ |
| D | remove_block_reduction_opportunity_finder.cpp | 33 for (auto bi = function->begin(); bi != function->end(); ++bi) { in GetAvailableOpportunities() local
34 if (IsBlockValidOpportunity(context, function, &bi)) { in GetAvailableOpportunities()
36 context, function, &*bi)); in GetAvailableOpportunities()
45 opt::Function::iterator* bi) { in IsBlockValidOpportunity() argument
46 assert(*bi != function->end() && "Block iterator was out of bounds"); in IsBlockValidOpportunity()
49 if (*bi == function->begin()) { in IsBlockValidOpportunity()
54 if (context->get_def_use_mgr()->NumUsers((*bi)->id()) > 0) { in IsBlockValidOpportunity()
59 if (!BlockInstructionsHaveNoOutsideReferences(context, *bi)) { in IsBlockValidOpportunity()
68 opt::IRContext* context, const opt::Function::iterator& bi) { in BlockInstructionsHaveNoOutsideReferences() argument
71 for (const opt::Instruction& instruction : *bi) { in BlockInstructionsHaveNoOutsideReferences()
[all …]
|
| /third_party/spirv-tools/source/reduce/ |
| D | remove_block_reduction_opportunity_finder.cpp | 33 for (auto bi = function->begin(); bi != function->end(); ++bi) { in GetAvailableOpportunities() local
34 if (IsBlockValidOpportunity(context, function, &bi)) { in GetAvailableOpportunities()
36 MakeUnique<RemoveBlockReductionOpportunity>(function, &*bi)); in GetAvailableOpportunities()
45 opt::Function::iterator* bi) { in IsBlockValidOpportunity() argument
46 assert(*bi != function->end() && "Block iterator was out of bounds"); in IsBlockValidOpportunity()
49 if (*bi == function->begin()) { in IsBlockValidOpportunity()
54 if (context->get_def_use_mgr()->NumUsers((*bi)->id()) > 0) { in IsBlockValidOpportunity()
59 if (!BlockInstructionsHaveNoOutsideReferences(context, *bi)) { in IsBlockValidOpportunity()
68 opt::IRContext* context, const opt::Function::iterator& bi) { in BlockInstructionsHaveNoOutsideReferences() argument
71 for (const opt::Instruction& instruction : *bi) { in BlockInstructionsHaveNoOutsideReferences()
[all …]
|
| /third_party/skia/third_party/externals/spirv-tools/source/reduce/ |
| D | remove_block_reduction_opportunity_finder.cpp | 33 for (auto bi = function->begin(); bi != function->end(); ++bi) { in GetAvailableOpportunities() local
34 if (IsBlockValidOpportunity(context, function, &bi)) { in GetAvailableOpportunities()
36 context, function, &*bi)); in GetAvailableOpportunities()
45 opt::Function::iterator* bi) { in IsBlockValidOpportunity() argument
46 assert(*bi != function->end() && "Block iterator was out of bounds"); in IsBlockValidOpportunity()
49 if (*bi == function->begin()) { in IsBlockValidOpportunity()
54 if (context->get_def_use_mgr()->NumUsers((*bi)->id()) > 0) { in IsBlockValidOpportunity()
59 if (!BlockInstructionsHaveNoOutsideReferences(context, *bi)) { in IsBlockValidOpportunity()
68 opt::IRContext* context, const opt::Function::iterator& bi) { in BlockInstructionsHaveNoOutsideReferences() argument
71 for (const opt::Instruction& instruction : *bi) { in BlockInstructionsHaveNoOutsideReferences()
[all …]
|
| /third_party/node/deps/icu-small/source/common/unicode/ |
| D | ubrk.h | 321 const UBreakIterator *bi,
338 ubrk_clone(const UBreakIterator *bi,
360 ubrk_close(UBreakIterator *bi);
394 ubrk_setText(UBreakIterator* bi,
418 ubrk_setUText(UBreakIterator* bi,
433 ubrk_current(const UBreakIterator *bi);
445 ubrk_next(UBreakIterator *bi);
457 ubrk_previous(UBreakIterator *bi);
467 ubrk_first(UBreakIterator *bi);
479 ubrk_last(UBreakIterator *bi);
[all …]
|
| /third_party/skia/third_party/externals/icu/source/common/unicode/ |
| D | ubrk.h | 321 const UBreakIterator *bi,
338 ubrk_clone(const UBreakIterator *bi,
360 ubrk_close(UBreakIterator *bi);
394 ubrk_setText(UBreakIterator* bi,
418 ubrk_setUText(UBreakIterator* bi,
433 ubrk_current(const UBreakIterator *bi);
445 ubrk_next(UBreakIterator *bi);
457 ubrk_previous(UBreakIterator *bi);
467 ubrk_first(UBreakIterator *bi);
479 ubrk_last(UBreakIterator *bi);
[all …]
|
| /third_party/icu/icu4c/source/common/unicode/ |
| D | ubrk.h | 321 const UBreakIterator *bi,
338 ubrk_clone(const UBreakIterator *bi,
360 ubrk_close(UBreakIterator *bi);
394 ubrk_setText(UBreakIterator* bi,
418 ubrk_setUText(UBreakIterator* bi,
433 ubrk_current(const UBreakIterator *bi);
445 ubrk_next(UBreakIterator *bi);
457 ubrk_previous(UBreakIterator *bi);
467 ubrk_first(UBreakIterator *bi);
479 ubrk_last(UBreakIterator *bi);
[all …]
|
| /third_party/mindspore/mindspore/lite/java/java/fl_client/src/main/java/com/mindspore/flclient/cipher/ |
| D | BaseUtil.java | 90 BigInteger bi = new BigInteger(String.valueOf(intI)); in byteArray2BigInteger() local
91 bigInteger = bigInteger.multiply(BigInteger.valueOf(256)).add(bi); in byteArray2BigInteger()
108 BigInteger bi = new BigInteger(String.valueOf(bytes[i])); in string2BigInteger() local
109 bigInteger = bigInteger.multiply(BigInteger.valueOf(256)).add(bi); in string2BigInteger()
123 BigInteger bi = bigInteger; in bigInteger2String() local
125 while (bi.compareTo(BigInteger.ZERO) > 0) { in bigInteger2String()
126 lists.add(bi.mod(div).intValue()); in bigInteger2String()
127 bi = bi.divide(div); in bigInteger2String()
143 BigInteger bi = bigInteger; in bigInteger2byteArray() local
145 while (bi.compareTo(BigInteger.ZERO) > 0) { in bigInteger2byteArray()
[all …]
|
| /third_party/flutter/skia/third_party/externals/icu/source/common/unicode/ |
| D | ubrk.h | 316 const UBreakIterator *bi,
338 ubrk_close(UBreakIterator *bi);
372 ubrk_setText(UBreakIterator* bi,
396 ubrk_setUText(UBreakIterator* bi,
411 ubrk_current(const UBreakIterator *bi);
423 ubrk_next(UBreakIterator *bi);
435 ubrk_previous(UBreakIterator *bi);
445 ubrk_first(UBreakIterator *bi);
457 ubrk_last(UBreakIterator *bi);
469 ubrk_preceding(UBreakIterator *bi,
[all …]
|