| 1860 | } |
| 1861 | |
| 1862 | void ObjL1Special(int x1, int y1, int x2, int y2) |
| 1863 | { |
| 1864 | int i, j; |
| 1865 | |
| 1866 | for (i = y1; i <= y2; ++i) { |
| 1867 | for (j = x1; j <= x2; ++j) { |
| 1868 | dArch[j][i] = 0; |
| 1869 | if (dPiece[j][i] == 12) |
| 1870 | dArch[j][i] = 1; |
| 1871 | if (dPiece[j][i] == 11) |
| 1872 | dArch[j][i] = 2; |
| 1873 | if (dPiece[j][i] == 71) |
| 1874 | dArch[j][i] = 1; |
| 1875 | if (dPiece[j][i] == 259) |
| 1876 | dArch[j][i] = 5; |
| 1877 | if (dPiece[j][i] == 249) |
| 1878 | dArch[j][i] = 2; |
| 1879 | if (dPiece[j][i] == 325) |
| 1880 | dArch[j][i] = 2; |
| 1881 | if (dPiece[j][i] == 321) |
| 1882 | dArch[j][i] = 1; |
| 1883 | if (dPiece[j][i] == 255) |
| 1884 | dArch[j][i] = 4; |
| 1885 | if (dPiece[j][i] == 211) |
| 1886 | dArch[j][i] = 1; |
| 1887 | if (dPiece[j][i] == 344) |
| 1888 | dArch[j][i] = 2; |
| 1889 | if (dPiece[j][i] == 341) |
| 1890 | dArch[j][i] = 1; |
| 1891 | if (dPiece[j][i] == 331) |
| 1892 | dArch[j][i] = 2; |
| 1893 | if (dPiece[j][i] == 418) |
| 1894 | dArch[j][i] = 1; |
| 1895 | if (dPiece[j][i] == 421) |
| 1896 | dArch[j][i] = 2; |
| 1897 | } |
| 1898 | } |
| 1899 | } |
| 1900 | |
| 1901 | void ObjL2Special(int x1, int y1, int x2, int y2) |
| 1902 | { |
no outgoing calls
no test coverage detected