Mercurial > libavcodec.hg
comparison dsputil.c @ 6053:f4607985f888 libavcodec
indent
author | michael |
---|---|
date | Fri, 21 Dec 2007 10:17:25 +0000 |
parents | c90798ac28ee |
children | de71ee8112f4 |
comparison
equal
deleted
inserted
replaced
6052:c90798ac28ee | 6053:f4607985f888 |
---|---|
1439 int i;\ | 1439 int i;\ |
1440 \ | 1440 \ |
1441 assert(x<8 && y<8 && x>=0 && y>=0);\ | 1441 assert(x<8 && y<8 && x>=0 && y>=0);\ |
1442 \ | 1442 \ |
1443 if(D){\ | 1443 if(D){\ |
1444 for(i=0; i<h; i++)\ | 1444 for(i=0; i<h; i++)\ |
1445 {\ | 1445 {\ |
1446 OP(dst[0], (A*src[0] + B*src[1] + C*src[stride+0] + D*src[stride+1]));\ | 1446 OP(dst[0], (A*src[0] + B*src[1] + C*src[stride+0] + D*src[stride+1]));\ |
1447 OP(dst[1], (A*src[1] + B*src[2] + C*src[stride+1] + D*src[stride+2]));\ | 1447 OP(dst[1], (A*src[1] + B*src[2] + C*src[stride+1] + D*src[stride+2]));\ |
1448 dst+= stride;\ | 1448 dst+= stride;\ |
1449 src+= stride;\ | 1449 src+= stride;\ |
1450 }\ | 1450 }\ |
1451 }else{\ | 1451 }else{\ |
1452 const int E= B+C;\ | 1452 const int E= B+C;\ |
1453 const int step= C ? stride : 1;\ | 1453 const int step= C ? stride : 1;\ |
1454 for(i=0; i<h; i++)\ | 1454 for(i=0; i<h; i++)\ |
1455 {\ | 1455 {\ |
1469 int i;\ | 1469 int i;\ |
1470 \ | 1470 \ |
1471 assert(x<8 && y<8 && x>=0 && y>=0);\ | 1471 assert(x<8 && y<8 && x>=0 && y>=0);\ |
1472 \ | 1472 \ |
1473 if(D){\ | 1473 if(D){\ |
1474 for(i=0; i<h; i++)\ | 1474 for(i=0; i<h; i++)\ |
1475 {\ | 1475 {\ |
1476 OP(dst[0], (A*src[0] + B*src[1] + C*src[stride+0] + D*src[stride+1]));\ | 1476 OP(dst[0], (A*src[0] + B*src[1] + C*src[stride+0] + D*src[stride+1]));\ |
1477 OP(dst[1], (A*src[1] + B*src[2] + C*src[stride+1] + D*src[stride+2]));\ | 1477 OP(dst[1], (A*src[1] + B*src[2] + C*src[stride+1] + D*src[stride+2]));\ |
1478 OP(dst[2], (A*src[2] + B*src[3] + C*src[stride+2] + D*src[stride+3]));\ | 1478 OP(dst[2], (A*src[2] + B*src[3] + C*src[stride+2] + D*src[stride+3]));\ |
1479 OP(dst[3], (A*src[3] + B*src[4] + C*src[stride+3] + D*src[stride+4]));\ | 1479 OP(dst[3], (A*src[3] + B*src[4] + C*src[stride+3] + D*src[stride+4]));\ |
1480 dst+= stride;\ | 1480 dst+= stride;\ |
1481 src+= stride;\ | 1481 src+= stride;\ |
1482 }\ | 1482 }\ |
1483 }else{\ | 1483 }else{\ |
1484 const int E= B+C;\ | 1484 const int E= B+C;\ |
1485 const int step= C ? stride : 1;\ | 1485 const int step= C ? stride : 1;\ |
1486 for(i=0; i<h; i++)\ | 1486 for(i=0; i<h; i++)\ |
1487 {\ | 1487 {\ |
1503 int i;\ | 1503 int i;\ |
1504 \ | 1504 \ |
1505 assert(x<8 && y<8 && x>=0 && y>=0);\ | 1505 assert(x<8 && y<8 && x>=0 && y>=0);\ |
1506 \ | 1506 \ |
1507 if(D){\ | 1507 if(D){\ |
1508 for(i=0; i<h; i++)\ | 1508 for(i=0; i<h; i++)\ |
1509 {\ | 1509 {\ |
1510 OP(dst[0], (A*src[0] + B*src[1] + C*src[stride+0] + D*src[stride+1]));\ | 1510 OP(dst[0], (A*src[0] + B*src[1] + C*src[stride+0] + D*src[stride+1]));\ |
1511 OP(dst[1], (A*src[1] + B*src[2] + C*src[stride+1] + D*src[stride+2]));\ | 1511 OP(dst[1], (A*src[1] + B*src[2] + C*src[stride+1] + D*src[stride+2]));\ |
1512 OP(dst[2], (A*src[2] + B*src[3] + C*src[stride+2] + D*src[stride+3]));\ | 1512 OP(dst[2], (A*src[2] + B*src[3] + C*src[stride+2] + D*src[stride+3]));\ |
1513 OP(dst[3], (A*src[3] + B*src[4] + C*src[stride+3] + D*src[stride+4]));\ | 1513 OP(dst[3], (A*src[3] + B*src[4] + C*src[stride+3] + D*src[stride+4]));\ |
1514 OP(dst[4], (A*src[4] + B*src[5] + C*src[stride+4] + D*src[stride+5]));\ | 1514 OP(dst[4], (A*src[4] + B*src[5] + C*src[stride+4] + D*src[stride+5]));\ |
1515 OP(dst[5], (A*src[5] + B*src[6] + C*src[stride+5] + D*src[stride+6]));\ | 1515 OP(dst[5], (A*src[5] + B*src[6] + C*src[stride+5] + D*src[stride+6]));\ |
1516 OP(dst[6], (A*src[6] + B*src[7] + C*src[stride+6] + D*src[stride+7]));\ | 1516 OP(dst[6], (A*src[6] + B*src[7] + C*src[stride+6] + D*src[stride+7]));\ |
1517 OP(dst[7], (A*src[7] + B*src[8] + C*src[stride+7] + D*src[stride+8]));\ | 1517 OP(dst[7], (A*src[7] + B*src[8] + C*src[stride+7] + D*src[stride+8]));\ |
1518 dst+= stride;\ | 1518 dst+= stride;\ |
1519 src+= stride;\ | 1519 src+= stride;\ |
1520 }\ | 1520 }\ |
1521 }else{\ | 1521 }else{\ |
1522 const int E= B+C;\ | 1522 const int E= B+C;\ |
1523 const int step= C ? stride : 1;\ | 1523 const int step= C ? stride : 1;\ |
1524 for(i=0; i<h; i++)\ | 1524 for(i=0; i<h; i++)\ |
1525 {\ | 1525 {\ |