| 1581 | } |
| 1582 | |
| 1583 | static void DRLG_L2TransFix() |
| 1584 | { |
| 1585 | int i, j, xx, yy; |
| 1586 | |
| 1587 | yy = 16; |
| 1588 | for (j = 0; j < DMAXY; j++) { |
| 1589 | xx = 16; |
| 1590 | for (i = 0; i < DMAXX; i++) { |
| 1591 | if (dungeon[i][j] == 14 && dungeon[i][j - 1] == 10) { |
| 1592 | dTransVal[xx + 1][yy] = dTransVal[xx][yy]; |
| 1593 | dTransVal[xx + 1][yy + 1] = dTransVal[xx][yy]; |
| 1594 | } |
| 1595 | if (dungeon[i][j] == 15 && dungeon[i + 1][j] == 11) { |
| 1596 | dTransVal[xx][yy + 1] = dTransVal[xx][yy]; |
| 1597 | dTransVal[xx + 1][yy + 1] = dTransVal[xx][yy]; |
| 1598 | } |
| 1599 | if (dungeon[i][j] == 10) { |
| 1600 | dTransVal[xx + 1][yy] = dTransVal[xx][yy]; |
| 1601 | dTransVal[xx + 1][yy + 1] = dTransVal[xx][yy]; |
| 1602 | } |
| 1603 | if (dungeon[i][j] == 11) { |
| 1604 | dTransVal[xx][yy + 1] = dTransVal[xx][yy]; |
| 1605 | dTransVal[xx + 1][yy + 1] = dTransVal[xx][yy]; |
| 1606 | } |
| 1607 | if (dungeon[i][j] == 16) { |
| 1608 | dTransVal[xx + 1][yy] = dTransVal[xx][yy]; |
| 1609 | dTransVal[xx][yy + 1] = dTransVal[xx][yy]; |
| 1610 | dTransVal[xx + 1][yy + 1] = dTransVal[xx][yy]; |
| 1611 | } |
| 1612 | xx += 2; |
| 1613 | } |
| 1614 | yy += 2; |
| 1615 | } |
| 1616 | } |
| 1617 | |
| 1618 | static void L2DirtFix() |
| 1619 | { |