Searched defs:blk2 (Results 1 - 4 of 4) sorted by relevance

/external/clang/test/CodeGen/
H A Dinline-asm-mrv.c4 int sad16_sse2(void *v, unsigned char *blk2, unsigned char *blk1, argument
8 : "+r" (h), "+r" (blk1), "+r" (blk2)
/external/lzma/C/
H A DSha256.c33 #define blk2(i) (W[i&15] += s1(W[(i-2)&15]) + W[(i-7)&15] + s0(W[(i-15)&15])) macro
50 #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));\
65 #define R(i) h(i) += S1(e(i)) + Ch(e(i),f(i),g(i)) + K[i+j] + (j?blk2(i):blk0(i));\
/external/e2fsprogs/e2fsck/
H A Dproblem.h20 blk64_t blk, blk2; member in struct:problem_context
/external/mesa3d/src/gallium/drivers/radeon/
H A DAMDILCFGStructurizer.cpp2230 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 112 milliseconds