| /external/u-boot/fs/ubifs/ |
| D | budget.c | 102 liab = c->bi.idx_growth + c->bi.data_growth + c->bi.dd_growth; in get_liability()
177 idx_size = c->bi.old_idx_sz + c->bi.idx_growth + c->bi.uncommitted_idx; in ubifs_calc_min_idx_lebs()
341 min_idx_lebs, c->bi.min_idx_lebs, rsvd_idx_lebs); in do_budget_space()
346 outstanding = c->bi.data_growth + c->bi.dd_growth; in do_budget_space()
357 c->bi.min_idx_lebs = min_idx_lebs; in do_budget_space()
390 data_growth = req->new_ino ? c->bi.inode_budget : 0; in calc_data_growth()
392 data_growth += c->bi.page_budget; in calc_data_growth()
394 data_growth += c->bi.dent_budget; in calc_data_growth()
410 dd_growth = req->dirtied_page ? c->bi.page_budget : 0; in calc_dd_growth()
413 dd_growth += c->bi.inode_budget << (req->dirtied_ino - 1); in calc_dd_growth()
[all …]
|
| /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()
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 …]
|
| /external/icu/icu4c/source/test/intltest/ |
| D | rbbiapts.cpp | 382 …RuleBasedBreakIterator* bi = (RuleBasedBreakIterator*)RuleBasedBreakIterator::createCharacterInst… in TestIteration() local
383 if (U_FAILURE(status) || bi == NULL) { in TestIteration()
386 delete bi; in TestIteration()
389 …bi = (RuleBasedBreakIterator*)RuleBasedBreakIterator::createWordInstance(Locale::getDefault(), st… in TestIteration()
390 if (U_FAILURE(status) || bi == NULL) { in TestIteration()
393 delete bi; in TestIteration()
396 …bi = (RuleBasedBreakIterator*)RuleBasedBreakIterator::createLineInstance(Locale::getDefault(), st… in TestIteration()
397 if (U_FAILURE(status) || bi == NULL) { in TestIteration()
400 delete bi; in TestIteration()
403 …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 | 26 RuleBasedBreakIterator bi; field in RBBIPerf
61 … bi = (RuleBasedBreakIterator)com.ibm.icu.text.BreakIterator.getCharacterInstance(); in setup()
63 bi = (RuleBasedBreakIterator)com.ibm.icu.text.BreakIterator.getWordInstance(); in setup()
65 bi = (RuleBasedBreakIterator)com.ibm.icu.text.BreakIterator.getLineInstance(); in setup()
70 if (bi!=null ) { in setup()
71 bi.setText(testString); in setup()
86 if (bi != null) { in testRBBINext()
87 n = bi.first(); in testRBBINext()
88 for (; n != BreakIterator.DONE; n=bi.next()) { in testRBBINext()
101 if (bi != null) { in testRBBINext()
[all …]
|
| /external/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| D | block_merge_pass.cpp | 29 for (auto bi = func->begin(); bi != func->end();) { in MergeBlocks() local
31 auto ii = bi->end(); in MergeBlocks()
35 ++bi; in MergeBlocks()
41 ++bi; in MergeBlocks()
45 bool pred_is_merge = IsMerge(&*bi); in MergeBlocks()
49 ++bi; in MergeBlocks()
53 Instruction* merge_inst = bi->GetMergeInst(); in MergeBlocks()
54 bool pred_is_header = IsHeader(&*bi); in MergeBlocks()
60 ++bi; in MergeBlocks()
74 ++bi; in MergeBlocks()
[all …]
|
| 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()
46 bi = bi.Erase(); in InlineExhaustive()
51 bi = bi.InsertBefore(&newBlocks); in InlineExhaustive()
56 ii = bi->begin(); in InlineExhaustive()
|
| D | inline_opaque_pass.cpp | 69 for (auto bi = func->begin(); bi != func->end(); ++bi) { in InlineOpaque() local
70 for (auto ii = bi->begin(); ii != bi->end();) { in InlineOpaque()
75 if (!GenInlineCode(&newBlocks, &newVars, ii, bi)) { in InlineOpaque()
83 bi = bi.Erase(); in InlineOpaque()
84 bi = bi.InsertBefore(&newBlocks); in InlineOpaque()
89 ii = bi->begin(); in InlineOpaque()
|
| /external/deqp-deps/SPIRV-Tools/source/opt/ |
| D | block_merge_pass.cpp | 29 for (auto bi = func->begin(); bi != func->end();) { in MergeBlocks() local
31 auto ii = bi->end(); in MergeBlocks()
35 ++bi; in MergeBlocks()
41 ++bi; in MergeBlocks()
45 bool pred_is_merge = IsMerge(&*bi); in MergeBlocks()
49 ++bi; in MergeBlocks()
53 Instruction* merge_inst = bi->GetMergeInst(); in MergeBlocks()
54 bool pred_is_header = IsHeader(&*bi); in MergeBlocks()
60 ++bi; in MergeBlocks()
74 ++bi; in MergeBlocks()
[all …]
|
| 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 GenInlineCode(&newBlocks, &newVars, ii, bi); in InlineExhaustive()
44 bi = bi.Erase(); in InlineExhaustive()
49 bi = bi.InsertBefore(&newBlocks); in InlineExhaustive()
54 ii = bi->begin(); in InlineExhaustive()
|
| D | inline_opaque_pass.cpp | 69 for (auto bi = func->begin(); bi != func->end(); ++bi) { in InlineOpaque() local
70 for (auto ii = bi->begin(); ii != bi->end();) { in InlineOpaque()
75 GenInlineCode(&newBlocks, &newVars, ii, bi); in InlineOpaque()
80 bi = bi.Erase(); in InlineOpaque()
81 bi = bi.InsertBefore(&newBlocks); in InlineOpaque()
86 ii = bi->begin(); in InlineOpaque()
|
| /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/icu4c/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 …]
|
| /external/icu/libandroidicu/include/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 …]
|
| /external/icu/icu4c/source/test/cintltst/ |
| D | cbiapts.c | 524 UBreakIterator *bi; in testOpenRules() local
528 bi = ubrk_openRules(ruleSourceU, -1, /* The rules */ in testOpenRules()
534 bi = 0; in testOpenRules()
537 return bi; in testOpenRules()
563 UBreakIterator *bi = testOpenRules(rules); in TestBreakIteratorRules() local
564 if (bi == NULL) {return;} in TestBreakIteratorRules()
566 ubrk_setText(bi, uData, -1, &status); in TestBreakIteratorRules()
568 pos = ubrk_first(bi); in TestBreakIteratorRules()
580 tag = ubrk_getRuleStatus(bi); in TestBreakIteratorRules()
587 pos = ubrk_next(bi); in TestBreakIteratorRules()
[all …]
|
| /external/boringssl/src/crypto/fipsmodule/bn/asm/ |
| D | co-586.pl | 29 local($a,$ai,$b,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_;
34 &comment("mul a[$ai]*b[$bi]");
57 local($r,$a,$ai,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_;
62 &comment("sqr a[$ai]*a[$bi]");
68 if ($ai == $bi)
86 local($r,$a,$ai,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_;
91 &comment("sqr a[$ai]*a[$bi]");
97 if ($ai == $bi)
120 local($i,$as,$ae,$bs,$be,$ai,$bi);
152 $bi=$bs;
[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()
|
| /external/u-boot/fs/yaffs2/ |
| D | yaffs_verify.c | 49 void yaffs_verify_blk(struct yaffs_dev *dev, struct yaffs_block_info *bi, int n) in yaffs_verify_blk() argument
58 if (bi->block_state >= YAFFS_NUMBER_OF_BLOCK_STATES) in yaffs_verify_blk()
61 n, bi->block_state); in yaffs_verify_blk()
63 switch (bi->block_state) { in yaffs_verify_blk()
69 n, block_state_name[bi->block_state]); in yaffs_verify_blk()
74 actually_used = bi->pages_in_use - bi->soft_del_pages; in yaffs_verify_blk()
76 if (bi->pages_in_use < 0 || in yaffs_verify_blk()
77 bi->pages_in_use > dev->param.chunks_per_block || in yaffs_verify_blk()
78 bi->soft_del_pages < 0 || in yaffs_verify_blk()
79 bi->soft_del_pages > dev->param.chunks_per_block || in yaffs_verify_blk()
[all …]
|
| D | yaffs_yaffs2.c | 88 struct yaffs_block_info *bi) in yaffs2_clear_oldest_dirty_seq() argument
94 if (!bi || bi->seq_number == dev->oldest_dirty_seq) { in yaffs2_clear_oldest_dirty_seq()
106 struct yaffs_block_info *bi) in yaffs2_update_oldest_dirty_seq() argument
112 if (dev->oldest_dirty_seq > bi->seq_number) { in yaffs2_update_oldest_dirty_seq()
113 dev->oldest_dirty_seq = bi->seq_number; in yaffs2_update_oldest_dirty_seq()
119 int yaffs_block_ok_for_gc(struct yaffs_dev *dev, struct yaffs_block_info *bi) in yaffs_block_ok_for_gc() argument
125 if (!bi->has_shrink_hdr) in yaffs_block_ok_for_gc()
133 return (bi->seq_number <= dev->oldest_dirty_seq); in yaffs_block_ok_for_gc()
146 struct yaffs_block_info *bi; in yaffs2_find_refresh_block() local
173 bi = dev->block_info; in yaffs2_find_refresh_block()
[all …]
|
| /external/libaom/libaom/av1/common/ |
| D | cdef_block.c | 182 int bi; in cdef_filter_fb() local
200 for (bi = 0; bi < cdef_count; bi++) { in cdef_filter_fb()
201 by = dlist[bi].by; in cdef_filter_fb()
202 bx = dlist[bi].bx; in cdef_filter_fb()
207 dst16[(bi << (bsizex + bsizey)) + (iy << bsizex) + ix] = in cdef_filter_fb()
215 for (bi = 0; bi < cdef_count; bi++) { in cdef_filter_fb()
216 by = dlist[bi].by; in cdef_filter_fb()
217 bx = dlist[bi].bx; in cdef_filter_fb()
225 for (bi = 0; bi < cdef_count; bi++) { in cdef_filter_fb()
228 by = dlist[bi].by; in cdef_filter_fb()
[all …]
|
| /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/rbbi/ |
| D | RBBITest.java | 366 RuleBasedBreakIterator bi = new RuleBasedBreakIterator(rules); in TestBug12797() local
368 bi.setText("abc"); in TestBug12797()
369 bi.first(); in TestBug12797()
370 assertEquals("Rule chaining test", 3, bi.next()); in TestBug12797()
386 final RuleBasedBreakIterator bi = (RuleBasedBreakIterator)BreakIterator.getLineInstance(); in TestBug12873() local
393 RuleBasedBreakIterator localBI = (RuleBasedBreakIterator)bi.clone(); in TestBug12873()
447 RuleBasedBreakIterator bi = in TestBreakAllChars() local
449 bi.setText(s); in TestBreakAllChars()
451 for (int b = bi.first(); b != BreakIterator.DONE; b = bi.next()) { in TestBreakAllChars()
515 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 | 369 RuleBasedBreakIterator bi = new RuleBasedBreakIterator(rules); in TestBug12797() local
371 bi.setText("abc"); in TestBug12797()
372 bi.first(); in TestBug12797()
373 assertEquals("Rule chaining test", 3, bi.next()); in TestBug12797()
389 final RuleBasedBreakIterator bi = (RuleBasedBreakIterator)BreakIterator.getLineInstance(); in TestBug12873() local
396 RuleBasedBreakIterator localBI = (RuleBasedBreakIterator)bi.clone(); in TestBug12873()
450 RuleBasedBreakIterator bi = in TestBreakAllChars() local
452 bi.setText(s); in TestBreakAllChars()
454 for (int b = bi.first(); b != BreakIterator.DONE; b = bi.next()) { in TestBreakAllChars()
518 BreakIterator bi = (BreakIterator) BREAK_ITERATOR_CACHE.clone(); in getBoundary() local
[all …]
|
| /external/iptables/extensions/ |
| D | libxt_bpf.c | 124 static void bpf_parse_obj_pinned(struct xt_bpf_info_v1 *bi, in bpf_parse_obj_pinned() argument
127 bi->fd = bpf_obj_get(filepath); in bpf_parse_obj_pinned()
128 if (bi->fd < 0) in bpf_parse_obj_pinned()
133 if (fcntl(bi->fd, F_SETFD, FD_CLOEXEC) == -1) { in bpf_parse_obj_pinned()
142 struct xt_bpf_info *bi = (void *) cb->data; in bpf_parse() local
147 bpf_parse_string(bi->bpf_program, &bi->bpf_program_num_elem, in bpf_parse()
148 ARRAY_SIZE(bi->bpf_program), cb->arg); in bpf_parse()
157 struct xt_bpf_info_v1 *bi = (void *) cb->data; in bpf_parse_v1() local
162 bpf_parse_string(bi->bpf_program, &bi->bpf_program_num_elem, in bpf_parse_v1()
163 ARRAY_SIZE(bi->bpf_program), cb->arg); in bpf_parse_v1()
[all …]
|
| /external/tensorflow/tensorflow/core/lib/gtl/ |
| D | flatrep.h | 149 uint32 bi = index & (kWidth - 1); in Find() local
151 const uint32 x = b->marker[bi]; in Find()
152 if (x == marker && equal_(b->key(bi), k)) { in Find()
153 return {true, b, bi}; in Find()
176 uint32 bi = index & (kWidth - 1); in FindOrInsert() local
178 const uint32 x = b->marker[bi]; in FindOrInsert()
179 if (x == marker && equal_(b->key(bi), k)) { in FindOrInsert()
180 return {true, b, bi}; in FindOrInsert()
184 di = bi; in FindOrInsert()
189 bi = di; in FindOrInsert()
[all …]
|