Lines Matching defs:dn
89 void MoveNeighborSAD(Int dn[], Int new_loc);
90 Int FindMin(Int dn[]);
790 Int d, dmin, dn[9];
946 dn[0] = dmin;
950 MoveNeighborSAD(dn, last_loc);
966 dn[k] = d; /* keep it for half pel use */
1010 MoveNeighborSAD(dn, last_loc);
1012 *hp_guess = FindMin(dn);
1647 void MoveNeighborSAD(Int dn[], Int new_loc)
1650 tmp[0] = dn[0];
1651 tmp[1] = dn[1];
1652 tmp[2] = dn[2];
1653 tmp[3] = dn[3];
1654 tmp[4] = dn[4];
1655 tmp[5] = dn[5];
1656 tmp[6] = dn[6];
1657 tmp[7] = dn[7];
1658 tmp[8] = dn[8];
1659 dn[0] = dn[1] = dn[2] = dn[3] = dn[4] = dn[5] = dn[6] = dn[7] = dn[8] = 65536;
1666 dn[4] = tmp[2];
1667 dn[5] = tmp[0];
1668 dn[6] = tmp[8];
1671 dn[4] = tmp[3];
1672 dn[5] = tmp[4];
1673 dn[6] = tmp[0];
1674 dn[7] = tmp[8];
1675 dn[8] = tmp[1];
1678 dn[6] = tmp[4];
1679 dn[7] = tmp[0];
1680 dn[8] = tmp[2];
1683 dn[1] = tmp[2];
1684 dn[2] = tmp[3];
1685 dn[6] = tmp[5];
1686 dn[7] = tmp[6];
1687 dn[8] = tmp[0];
1690 dn[1] = tmp[0];
1691 dn[2] = tmp[4];
1692 dn[8] = tmp[6];
1695 dn[1] = tmp[8];
1696 dn[2] = tmp[0];
1697 dn[3] = tmp[4];
1698 dn[4] = tmp[5];
1699 dn[8] = tmp[7];
1702 dn[2] = tmp[8];
1703 dn[3] = tmp[0];
1704 dn[4] = tmp[6];
1707 dn[2] = tmp[1];
1708 dn[3] = tmp[2];
1709 dn[4] = tmp[0];
1710 dn[5] = tmp[6];
1711 dn[6] = tmp[7];
1714 dn[0] = tmp[new_loc];
1719 /* 3/28/01, find minimal of dn[9] */
1721 Int FindMin(Int dn[])
1726 dmin = dn[1];
1730 if (dn[i] < dmin)
1732 dmin = dn[i];