Searched refs:blk2 (Results 1 - 11 of 11) sorted by relevance
/external/clang/test/CodeGen/ |
H A D | inline-asm-mrv.c | 4 int sad16_sse2(void *v, unsigned char *blk2, unsigned char *blk1, argument 8 : "+r" (h), "+r" (blk1), "+r" (blk2)
|
/external/e2fsprogs/e2fsck/ |
H A D | pass5.c | 158 if (pctx->blk == pctx->blk2) 159 pctx->blk2 = 0; 164 if (pctx->blk == pctx->blk2) 165 pctx->blk2 = 0; 183 pctx->blk = pctx->blk2 = NO_BLK; 232 pctx.blk2 = B2C(ext2fs_blocks_count(fs->super) - 1); 247 pctx.blk2 = B2C(ext2fs_blocks_count(fs->super) - 1); 261 pctx.blk = pctx.blk2 = NO_BLK; 409 pctx.blk = pctx.blk2 = i; 413 (pctx.blk2 [all...] |
H A D | message.c | 18 * %c <blk2> block number 443 fprintf(f, "%*u", width, (unsigned long) ctx->blk2); 445 fprintf(f, "%*llu", width, (unsigned long long) ctx->blk2);
|
H A D | problem.h | 20 blk64_t blk, blk2; member in struct:problem_context
|
H A D | super.c | 555 pctx.blk2 = ctx->num_blocks; 566 pctx.blk2 = should_be;
|
H A D | pass1.c | 1810 pctx->blk2 = extent.e_lblk; 1853 pctx->blk2 = extent.e_lblk; 2630 pctx.blk2 = *new_block; 2633 pctx.blk2 = 0;
|
H A D | pass2.c | 210 pctx.blk2 = dx_db->node_min_hash; 231 pctx.blk2 = dx_db->node_max_hash;
|
H A D | unix.c | 418 pctx.blk2 = ctx->free_blocks; 419 if ((pctx.blk != pctx.blk2) &&
|
/external/lzma/C/ |
H A D | Sha256.c | 31 #define blk2(i) (W[i&15] += s1(W[(i-2)&15]) + W[(i-7)&15] + s0(W[(i-15)&15]))
macro 48 #define R(a,b,c,d,e,f,g,h, i) h += S1(e) + Ch(e,f,g) + K[i+j] + (j?blk2(i):blk0(i));\
63 #define R(i) h(i) += S1(e(i)) + Ch(e(i),f(i),g(i)) + K[i+j] + (j?blk2(i):blk0(i));\
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/radeon/ |
H A D | AMDILCFGStructurizer.cpp | 2230 BlockT *blk2 = *(++srcBlk->succ_begin()); local 2232 if (blk1 == blk2) { 2573 CFGStructurizer<PassT>::findNearestCommonPostDom(BlockT *blk1, BlockT *blk2) { argument 2575 if (postDomTree->dominates(blk1, blk2)) { 2578 if (postDomTree->dominates(blk2, blk1)) { 2579 return blk2; 2583 DomTreeNodeT *node2 = postDomTree->getNode(blk2); 2587 return findNearestCommonPostDom(*blk1->succ_begin(), blk2); 2589 if (node2 == NULL && blk2->succ_size() == 1) { 2590 return findNearestCommonPostDom(blk1, *blk2 [all...] |
/external/mesa3d/src/gallium/drivers/radeon/ |
H A D | AMDILCFGStructurizer.cpp | 2230 BlockT *blk2 = *(++srcBlk->succ_begin()); local 2232 if (blk1 == blk2) { 2573 CFGStructurizer<PassT>::findNearestCommonPostDom(BlockT *blk1, BlockT *blk2) { argument 2575 if (postDomTree->dominates(blk1, blk2)) { 2578 if (postDomTree->dominates(blk2, blk1)) { 2579 return blk2; 2583 DomTreeNodeT *node2 = postDomTree->getNode(blk2); 2587 return findNearestCommonPostDom(*blk1->succ_begin(), blk2); 2589 if (node2 == NULL && blk2->succ_size() == 1) { 2590 return findNearestCommonPostDom(blk1, *blk2 [all...] |
Completed in 216 milliseconds