Searched refs:blk2 (Results 1 – 22 of 22) sorted by relevance
| /external/e2fsprogs/e2fsck/ |
| D | pass5.c | 74 if (pctx->blk == pctx->blk2) in print_bitmap_problem()
75 pctx->blk2 = 0; in print_bitmap_problem()
80 if (pctx->blk == pctx->blk2) in print_bitmap_problem()
81 pctx->blk2 = 0; in print_bitmap_problem()
99 pctx->blk = pctx->blk2 = NO_BLK; in print_bitmap_problem()
129 pctx.blk2 = fs->super->s_blocks_count -1; in check_block_bitmaps()
144 pctx.blk2 = fs->super->s_blocks_count -1; in check_block_bitmaps()
158 pctx.blk = pctx.blk2 = NO_BLK; in check_block_bitmaps()
229 pctx.blk = pctx.blk2 = i; in check_block_bitmaps()
233 (pctx.blk2 == i-1)) in check_block_bitmaps()
[all …]
|
| D | message.c | 444 printf("%u", (unsigned long) ctx->blk2); in expand_percent_expression()
446 printf("%llu", (unsigned long long) ctx->blk2); in expand_percent_expression()
|
| D | super.c | 537 pctx.blk2 = ctx->num_blocks; in check_super_block()
546 pctx.blk2 = EXT2_FRAG_SIZE(sb); in check_super_block()
556 pctx.blk2 = should_be; in check_super_block()
565 pctx.blk2 = should_be; in check_super_block()
|
| D | problem.h | 19 blk64_t blk, blk2; member
|
| D | pass2.c | 205 pctx.blk2 = dx_db->node_min_hash; in e2fsck_pass2()
226 pctx.blk2 = dx_db->node_max_hash; in e2fsck_pass2()
|
| D | pass1.c | 1711 pctx->blk2 = extent.e_lblk; in scan_extent_node()
2492 pctx.blk2 = *new_block; in new_table_block()
2495 pctx.blk2 = 0; in new_table_block()
|
| /external/clang/test/CodeGen/ |
| D | inline-asm-mrv.c | 4 int sad16_sse2(void *v, unsigned char *blk2, unsigned char *blk1, in sad16_sse2() argument
8 : "+r" (h), "+r" (blk1), "+r" (blk2) in sad16_sse2()
|
| /external/llvm/test/CodeGen/X86/ |
| D | inline-asm-mrv.ll | 10 define i32 @test1(i8* %v, i8* %blk2, i8* %blk1, i32 %stride, i32 %h) nounwind {
13 "=r,=r,=r,r,r,r,r"( i64 %tmp12, i32 %h, i8* %blk1, i8* %blk2 ) nounwind
|
| /external/llvm/lib/Target/R600/ |
| D | AMDILCFGStructurizer.cpp | 2059 BlockT *blk2 = *(++srcBlk->succ_begin()); in removeRedundantConditionalBranch() local
2061 if (blk1 == blk2) { in removeRedundantConditionalBranch()
2388 CFGStructurizer<PassT>::findNearestCommonPostDom(BlockT *blk1, BlockT *blk2) { in findNearestCommonPostDom() argument
2390 if (postDomTree->dominates(blk1, blk2)) { in findNearestCommonPostDom()
2393 if (postDomTree->dominates(blk2, blk1)) { in findNearestCommonPostDom()
2394 return blk2; in findNearestCommonPostDom()
2398 DomTreeNodeT *node2 = postDomTree->getNode(blk2); in findNearestCommonPostDom()
2402 return findNearestCommonPostDom(*blk1->succ_begin(), blk2); in findNearestCommonPostDom()
2404 if (node2 == NULL && blk2->succ_size() == 1) { in findNearestCommonPostDom()
2405 return findNearestCommonPostDom(blk1, *blk2->succ_begin()); in findNearestCommonPostDom()
|
| /external/e2fsprogs/po/ |
| D | e2fsprogs.pot | 31 #. %c <blk2> block number
|
| D | zh_CN.po | 29 #. %c <blk2> block number
|
| D | ca.po | 30 #. %c <blk2> block number
|
| D | nl.po | 32 #. %c <blk2> block number
|
| D | id.po | 34 #. %c <blk2> block number
|
| D | it.po | 31 #. %c <blk2> block number
|
| D | de.po | 32 #. %c <blk2> block number
|
| D | sv.po | 32 #. %c <blk2> block number
|
| D | pl.po | 30 #. %c <blk2> block number
|
| D | es.po | 33 #. %c <blk2> block number
|
| D | cs.po | 31 #. %c <blk2> block number
|
| D | tr.po | 29 #. %c <blk2> block number
|
| D | vi.po | 30 #. %c <blk2> block number
|