mirror of
https://bitbucket.org/s_l_teichmann/mtsatellite
synced 2024-12-24 01:00:18 +01:00
Cache the min y value of an 16x16 area in tilemapper instead of calculating it over and over again.
This commit is contained in:
parent
9fdf06d671
commit
09b321de02
@ -18,22 +18,32 @@ type Renderer struct {
|
|||||||
xOfs int16
|
xOfs int16
|
||||||
zOfs int16
|
zOfs int16
|
||||||
yBuffer []int32
|
yBuffer []int32
|
||||||
|
yMin []int32
|
||||||
cBuffer []int32
|
cBuffer []int32
|
||||||
filled int
|
filled int
|
||||||
Rejected int
|
Rejected int
|
||||||
}
|
}
|
||||||
|
|
||||||
|
const (
|
||||||
|
invalid = math.MinInt32 + 1
|
||||||
|
)
|
||||||
|
|
||||||
func NewRenderer(xOfs, zOfs int16, width, height int) (renderer *Renderer) {
|
func NewRenderer(xOfs, zOfs int16, width, height int) (renderer *Renderer) {
|
||||||
dim := width * height
|
dim := width * height
|
||||||
pixSize := dim * 16 * 16
|
pixSize := dim * 16 * 16
|
||||||
yBuffer := make([]int32, pixSize)
|
yBuffer := make([]int32, pixSize)
|
||||||
cBuffer := make([]int32, pixSize)
|
cBuffer := make([]int32, pixSize)
|
||||||
|
yMin := make([]int32, dim)
|
||||||
|
|
||||||
for i := 0; i < pixSize; i++ {
|
for i := 0; i < pixSize; i++ {
|
||||||
yBuffer[i] = math.MinInt32
|
yBuffer[i] = math.MinInt32
|
||||||
cBuffer[i] = -1
|
cBuffer[i] = -1
|
||||||
}
|
}
|
||||||
|
|
||||||
|
for i := 0; i < dim; i++ {
|
||||||
|
yMin[i] = math.MinInt32
|
||||||
|
}
|
||||||
|
|
||||||
renderer = &Renderer{
|
renderer = &Renderer{
|
||||||
width: width,
|
width: width,
|
||||||
height: height,
|
height: height,
|
||||||
@ -44,24 +54,6 @@ func NewRenderer(xOfs, zOfs int16, width, height int) (renderer *Renderer) {
|
|||||||
return
|
return
|
||||||
}
|
}
|
||||||
|
|
||||||
func (r *Renderer) minY(ofs, w int) (minY int32, filled bool) {
|
|
||||||
minY = int32(math.MaxInt32)
|
|
||||||
for yEnd := ofs + w<<4; ofs < yEnd; {
|
|
||||||
for xEnd := ofs + 16; ofs < xEnd; ofs++ {
|
|
||||||
y := r.yBuffer[ofs]
|
|
||||||
switch {
|
|
||||||
case y == math.MaxInt32:
|
|
||||||
return
|
|
||||||
case y < minY:
|
|
||||||
minY = y
|
|
||||||
}
|
|
||||||
}
|
|
||||||
ofs += w - 16
|
|
||||||
}
|
|
||||||
filled = true
|
|
||||||
return
|
|
||||||
}
|
|
||||||
|
|
||||||
func (r *Renderer) IsFilled() bool {
|
func (r *Renderer) IsFilled() bool {
|
||||||
return r.filled == r.width<<4*r.height<<4
|
return r.filled == r.width<<4*r.height<<4
|
||||||
}
|
}
|
||||||
@ -70,40 +62,50 @@ func (r *Renderer) RenderBlock(block *common.Block, nameIndex map[string]int32)
|
|||||||
|
|
||||||
bx := block.Coord.X - r.xOfs
|
bx := block.Coord.X - r.xOfs
|
||||||
bz := block.Coord.Z - r.zOfs
|
bz := block.Coord.Z - r.zOfs
|
||||||
|
|
||||||
// We do not need to render the block if the whole 16x16 area
|
// We do not need to render the block if the whole 16x16 area
|
||||||
// is already filled and the block is strictly below.
|
// is already filled and the block is strictly below.
|
||||||
w := r.width << 4
|
w := r.width << 4
|
||||||
ofs := int(bz)*w<<4 + int(bx)<<4
|
ofs := int(bz)*w<<4 + int(bx)<<4
|
||||||
|
|
||||||
blockY := int32(block.Coord.Y) << 4
|
blockY := int32(block.Coord.Y) << 4
|
||||||
if minY, filled := r.minY(ofs, w); filled && blockY < minY {
|
pos := int(bz)*r.width + int(bx)
|
||||||
|
if blockY < r.yMin[pos] {
|
||||||
r.Rejected++
|
r.Rejected++
|
||||||
return
|
return
|
||||||
}
|
}
|
||||||
|
|
||||||
// Decoding is pretty expensive so it that late.
|
// Decoding is pretty expensive so do it that late.
|
||||||
var db *DecodedBlock
|
var db *DecodedBlock
|
||||||
if db, err = NewDecodedBlock(block.Data, nameIndex); err != nil {
|
if db, err = NewDecodedBlock(block.Data, nameIndex); err != nil {
|
||||||
return
|
return
|
||||||
}
|
}
|
||||||
|
|
||||||
|
yMin := int32(math.MaxInt32)
|
||||||
for z := 0; z < 16; z++ {
|
for z := 0; z < 16; z++ {
|
||||||
for x := 0; x < 16; x++ {
|
for x := 0; x < 16; x++ {
|
||||||
if currentY := r.yBuffer[ofs]; currentY < blockY {
|
currentY := r.yBuffer[ofs]
|
||||||
|
if currentY < blockY {
|
||||||
for y := 15; y >= 0; y-- {
|
for y := 15; y >= 0; y-- {
|
||||||
if c, ok := db.Content(x, y, z); ok {
|
if c, ok := db.Content(x, y, z); ok {
|
||||||
if r.cBuffer[ofs] == -1 {
|
if r.cBuffer[ofs] == -1 {
|
||||||
r.filled++
|
r.filled++
|
||||||
}
|
}
|
||||||
r.cBuffer[ofs] = c
|
r.cBuffer[ofs] = c
|
||||||
r.yBuffer[ofs] = blockY + int32(y)
|
currentY = blockY + int32(y)
|
||||||
|
r.yBuffer[ofs] = currentY
|
||||||
break
|
break
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
if currentY < yMin {
|
||||||
|
yMin = currentY
|
||||||
|
}
|
||||||
ofs++
|
ofs++
|
||||||
}
|
}
|
||||||
ofs += w - 16
|
ofs += w - 16
|
||||||
}
|
}
|
||||||
|
r.yMin[pos] = yMin
|
||||||
|
|
||||||
return
|
return
|
||||||
}
|
}
|
||||||
|
Loading…
Reference in New Issue
Block a user