/external/libopus/src/ |
D | opus_compare.c | 115 int bi; in band_energy() local 121 for(bi=xj=0;bi<_nbands;bi++){ in band_energy() 123 for(;xj<_bands[bi+1];xj++){ in band_energy() 143 _out[(xi*_nbands+bi)*_nchannels]=p[0]/(_bands[bi+1]-_bands[bi]); in band_energy() 145 _out[(xi*_nbands+bi)*_nchannels+1]=p[1]/(_bands[bi+1]-_bands[bi]); in band_energy() 181 int bi; in main() local 262 for(bi=1;bi<NBANDS;bi++){ in main() 264 xb[(xi*NBANDS+bi)*nchannels+ci]+= in main() 265 0.1F*xb[(xi*NBANDS+bi-1)*nchannels+ci]; in main() 269 for(bi=NBANDS-1;bi-->0;){ in main() [all …]
|
/external/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 …]
|
/external/angle/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 …]
|
/external/openscreen/third_party/abseil/src/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 …]
|
/external/libtextclassifier/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 …]
|
/external/rust/crates/grpcio-sys/grpc/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 …]
|
/external/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 …]
|
/external/harfbuzz_ng/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 …]
|
/external/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 …]
|
/external/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 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 …]
|
/external/deqp-deps/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 …]
|
/external/angle/third_party/vulkan-deps/spirv-tools/src/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 …]
|
/external/icu/icu4c/source/common/unicode/ |
D | ubrk.h | 321 const UBreakIterator *bi, 337 ubrk_clone(const UBreakIterator *bi, 358 ubrk_close(UBreakIterator *bi); 392 ubrk_setText(UBreakIterator* bi, 416 ubrk_setUText(UBreakIterator* bi, 431 ubrk_current(const UBreakIterator *bi); 443 ubrk_next(UBreakIterator *bi); 455 ubrk_previous(UBreakIterator *bi); 465 ubrk_first(UBreakIterator *bi); 477 ubrk_last(UBreakIterator *bi); [all …]
|
/external/icu/libandroidicu/include/unicode/ |
D | ubrk.h | 321 const UBreakIterator *bi, 337 ubrk_clone(const UBreakIterator *bi, 358 ubrk_close(UBreakIterator *bi); 392 ubrk_setText(UBreakIterator* bi, 416 ubrk_setUText(UBreakIterator* bi, 431 ubrk_current(const UBreakIterator *bi); 443 ubrk_next(UBreakIterator *bi); 455 ubrk_previous(UBreakIterator *bi); 465 ubrk_first(UBreakIterator *bi); 477 ubrk_last(UBreakIterator *bi); [all …]
|
/external/icu/libicu/cts_headers/unicode/ |
D | ubrk.h | 321 const UBreakIterator *bi, 337 ubrk_clone(const UBreakIterator *bi, 358 ubrk_close(UBreakIterator *bi); 392 ubrk_setText(UBreakIterator* bi, 416 ubrk_setUText(UBreakIterator* bi, 431 ubrk_current(const UBreakIterator *bi); 443 ubrk_next(UBreakIterator *bi); 455 ubrk_previous(UBreakIterator *bi); 465 ubrk_first(UBreakIterator *bi); 477 ubrk_last(UBreakIterator *bi); [all …]
|
/external/llvm-project/clang/test/CodeGen/SystemZ/ |
D | zvector.c | 13 volatile vector bool int bi, bi2; variable 427 si = bi + si2; in test_add() 430 ui = bi + ui2; in test_add() 657 si = bi - si2; in test_sub() 660 ui = bi - ui2; in test_sub() 1135 bi = ~bi2; in test_not() 1276 si = bi & si2; in test_and() 1279 ui = bi & ui2; in test_and() 1280 bi = bi & bi2; in test_and() 1391 bi &= bi2; in test_and_assign() [all …]
|
/external/clang/test/CodeGen/ |
D | zvector.c | 14 volatile vector bool int bi, bi2; variable 332 si = bi + si2; in test_add() 344 ui = bi + ui2; in test_add() 520 si = bi - si2; in test_sub() 532 ui = bi - ui2; in test_sub() 941 bi = ~bi2; in test_not() 1027 si = bi & si2; in test_and() 1039 ui = bi & ui2; in test_and() 1043 bi = bi & bi2; in test_and() 1140 bi &= bi2; in test_and_assign() [all …]
|
/external/icu/libicu/ndk_headers/unicode/ |
D | ubrk.h | 271 ubrk_clone(const UBreakIterator *bi, 294 ubrk_close(UBreakIterator *bi) __INTRODUCED_IN(31); 330 ubrk_setText(UBreakIterator* bi, 356 ubrk_setUText(UBreakIterator* bi, 373 ubrk_current(const UBreakIterator *bi) __INTRODUCED_IN(31); 387 ubrk_next(UBreakIterator *bi) __INTRODUCED_IN(31); 401 ubrk_previous(UBreakIterator *bi) __INTRODUCED_IN(31); 413 ubrk_first(UBreakIterator *bi) __INTRODUCED_IN(31); 427 ubrk_last(UBreakIterator *bi) __INTRODUCED_IN(31); 441 ubrk_preceding(UBreakIterator *bi, [all …]
|
/external/angle/third_party/vulkan-deps/spirv-tools/src/source/opt/ |
D | inline_exhaustive_pass.cpp | 27 for (auto bi = func->begin(); bi != func->end(); ++bi) { in InlineExhaustive() local 28 for (auto ii = bi->begin(); ii != bi->end();) { in InlineExhaustive() 33 if (!GenInlineCode(&newBlocks, &newVars, ii, bi)) { in InlineExhaustive() 41 bi = bi.Erase(); in InlineExhaustive() 46 bi = bi.InsertBefore(&newBlocks); in InlineExhaustive() 51 ii = bi->begin(); in InlineExhaustive()
|
/external/deqp-deps/SPIRV-Tools/source/opt/ |
D | inline_exhaustive_pass.cpp | 27 for (auto bi = func->begin(); bi != func->end(); ++bi) { in InlineExhaustive() local 28 for (auto ii = bi->begin(); ii != bi->end();) { in InlineExhaustive() 33 if (!GenInlineCode(&newBlocks, &newVars, ii, bi)) { in InlineExhaustive() 41 bi = bi.Erase(); in InlineExhaustive() 46 bi = bi.InsertBefore(&newBlocks); in InlineExhaustive() 51 ii = bi->begin(); in InlineExhaustive()
|
/external/swiftshader/third_party/SPIRV-Tools/source/opt/ |
D | inline_exhaustive_pass.cpp | 27 for (auto bi = func->begin(); bi != func->end(); ++bi) { in InlineExhaustive() local 28 for (auto ii = bi->begin(); ii != bi->end();) { in InlineExhaustive() 33 if (!GenInlineCode(&newBlocks, &newVars, ii, bi)) { in InlineExhaustive() 41 bi = bi.Erase(); in InlineExhaustive() 46 bi = bi.InsertBefore(&newBlocks); in InlineExhaustive() 51 ii = bi->begin(); in InlineExhaustive()
|
/external/icu/icu4c/source/test/cintltst/ |
D | cbiapts.c | 614 UBreakIterator *bi; in testOpenRules() local 618 bi = ubrk_openRules(ruleSourceU, -1, /* The rules */ in testOpenRules() 624 bi = 0; in testOpenRules() 627 return bi; in testOpenRules() 653 UBreakIterator *bi = testOpenRules(rules); in TestBreakIteratorRules() local 654 if (bi == NULL) {return;} in TestBreakIteratorRules() 656 ubrk_setText(bi, uData, -1, &status); in TestBreakIteratorRules() 658 pos = ubrk_first(bi); in TestBreakIteratorRules() 670 tag = ubrk_getRuleStatus(bi); in TestBreakIteratorRules() 677 pos = ubrk_next(bi); in TestBreakIteratorRules() [all …]
|
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/rbbi/ |
D | RBBITest.java | 368 RuleBasedBreakIterator bi = new RuleBasedBreakIterator(rules); in TestBug12797() local 370 bi.setText("abc"); in TestBug12797() 371 bi.first(); in TestBug12797() 372 assertEquals("Rule chaining test", 3, bi.next()); in TestBug12797() 388 final RuleBasedBreakIterator bi = (RuleBasedBreakIterator)BreakIterator.getLineInstance(); in TestBug12873() local 395 RuleBasedBreakIterator localBI = (RuleBasedBreakIterator)bi.clone(); in TestBug12873() 449 RuleBasedBreakIterator bi = in TestBreakAllChars() local 451 bi.setText(s); in TestBreakAllChars() 453 for (int b = bi.first(); b != BreakIterator.DONE; b = bi.next()) { in TestBreakAllChars() 517 BreakIterator bi = (BreakIterator) BREAK_ITERATOR_CACHE.clone(); in getBoundary() local [all …]
|
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/rbbi/ |
D | RBBITest.java | 371 RuleBasedBreakIterator bi = new RuleBasedBreakIterator(rules); in TestBug12797() local 373 bi.setText("abc"); in TestBug12797() 374 bi.first(); in TestBug12797() 375 assertEquals("Rule chaining test", 3, bi.next()); in TestBug12797() 391 final RuleBasedBreakIterator bi = (RuleBasedBreakIterator)BreakIterator.getLineInstance(); in TestBug12873() local 398 RuleBasedBreakIterator localBI = (RuleBasedBreakIterator)bi.clone(); in TestBug12873() 452 RuleBasedBreakIterator bi = in TestBreakAllChars() local 454 bi.setText(s); in TestBreakAllChars() 456 for (int b = bi.first(); b != BreakIterator.DONE; b = bi.next()) { in TestBreakAllChars() 520 BreakIterator bi = (BreakIterator) BREAK_ITERATOR_CACHE.clone(); in getBoundary() local [all …]
|
/external/apache-commons-bcel/src/main/java/org/apache/bcel/generic/ |
D | BranchHandle.java | 35 private BranchInstruction bi; // An alias in fact, but saves lots of casts field in BranchHandle 40 bi = i; in BranchHandle() 74 return bi.getPosition(); in getPosition() 81 bi.setPosition(pos); in setPosition() 88 final int x = bi.updatePosition(offset, max_offset); in updatePosition() 89 super.setPosition(bi.getPosition()); in updatePosition() 98 bi.setTarget(ih); in setTarget() 106 bi.updateTarget(old_ih, new_ih); in updateTarget() 114 return bi.getTarget(); in getTarget() 128 bi = (BranchInstruction) i; in setInstruction()
|