2012-01-27 05:58:52 -05:00
|
|
|
/*
|
2013-02-24 12:40:43 -05:00
|
|
|
Minetest
|
2013-02-24 13:38:45 -05:00
|
|
|
Copyright (C) 2010-2013 celeron55, Perttu Ahola <celeron55@gmail.com>
|
2012-01-27 05:58:52 -05:00
|
|
|
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
2012-06-05 10:56:56 -04:00
|
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
|
|
the Free Software Foundation; either version 2.1 of the License, or
|
2012-01-27 05:58:52 -05:00
|
|
|
(at your option) any later version.
|
|
|
|
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
2012-06-05 10:56:56 -04:00
|
|
|
GNU Lesser General Public License for more details.
|
2012-01-27 05:58:52 -05:00
|
|
|
|
2012-06-05 10:56:56 -04:00
|
|
|
You should have received a copy of the GNU Lesser General Public License along
|
2012-01-27 05:58:52 -05:00
|
|
|
with this program; if not, write to the Free Software Foundation, Inc.,
|
|
|
|
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "voxelalgorithms.h"
|
|
|
|
#include "nodedef.h"
|
|
|
|
|
|
|
|
namespace voxalgo
|
|
|
|
{
|
|
|
|
|
|
|
|
void setLight(VoxelManipulator &v, VoxelArea a, u8 light,
|
|
|
|
INodeDefManager *ndef)
|
|
|
|
{
|
|
|
|
for(s32 x=a.MinEdge.X; x<=a.MaxEdge.X; x++)
|
|
|
|
for(s32 z=a.MinEdge.Z; z<=a.MaxEdge.Z; z++)
|
|
|
|
for(s32 y=a.MinEdge.Y; y<=a.MaxEdge.Y; y++)
|
|
|
|
{
|
|
|
|
v3s16 p(x,y,z);
|
|
|
|
MapNode &n = v.getNodeRefUnsafe(p);
|
|
|
|
n.setLight(LIGHTBANK_DAY, light, ndef);
|
|
|
|
n.setLight(LIGHTBANK_NIGHT, light, ndef);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-01-27 06:24:06 -05:00
|
|
|
void clearLightAndCollectSources(VoxelManipulator &v, VoxelArea a,
|
|
|
|
enum LightBank bank, INodeDefManager *ndef,
|
2012-12-20 12:19:49 -05:00
|
|
|
std::set<v3s16> & light_sources,
|
|
|
|
std::map<v3s16, u8> & unlight_from)
|
2012-01-27 06:24:06 -05:00
|
|
|
{
|
|
|
|
// The full area we shall touch
|
|
|
|
VoxelArea required_a = a;
|
|
|
|
required_a.pad(v3s16(0,0,0));
|
|
|
|
// Make sure we have access to it
|
2014-06-09 07:29:22 -04:00
|
|
|
v.addArea(a);
|
2012-01-27 06:24:06 -05:00
|
|
|
|
|
|
|
for(s32 x=a.MinEdge.X; x<=a.MaxEdge.X; x++)
|
|
|
|
for(s32 z=a.MinEdge.Z; z<=a.MaxEdge.Z; z++)
|
|
|
|
for(s32 y=a.MinEdge.Y; y<=a.MaxEdge.Y; y++)
|
|
|
|
{
|
|
|
|
v3s16 p(x,y,z);
|
|
|
|
MapNode &n = v.getNodeRefUnsafe(p);
|
|
|
|
u8 oldlight = n.getLight(bank, ndef);
|
|
|
|
n.setLight(bank, 0, ndef);
|
|
|
|
|
|
|
|
// If node sources light, add to list
|
|
|
|
u8 source = ndef->get(n).light_source;
|
|
|
|
if(source != 0)
|
2012-12-20 12:19:49 -05:00
|
|
|
light_sources.insert(p);
|
2012-01-27 06:24:06 -05:00
|
|
|
|
|
|
|
// Collect borders for unlighting
|
|
|
|
if((x==a.MinEdge.X || x == a.MaxEdge.X
|
|
|
|
|| y==a.MinEdge.Y || y == a.MaxEdge.Y
|
|
|
|
|| z==a.MinEdge.Z || z == a.MaxEdge.Z)
|
|
|
|
&& oldlight != 0)
|
|
|
|
{
|
2012-12-20 12:19:49 -05:00
|
|
|
unlight_from[p] = oldlight;
|
2012-01-27 06:24:06 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-01-27 05:58:52 -05:00
|
|
|
SunlightPropagateResult propagateSunlight(VoxelManipulator &v, VoxelArea a,
|
|
|
|
bool inexistent_top_provides_sunlight,
|
2012-12-20 12:19:49 -05:00
|
|
|
std::set<v3s16> & light_sources,
|
2012-01-27 05:58:52 -05:00
|
|
|
INodeDefManager *ndef)
|
|
|
|
{
|
|
|
|
// Return values
|
|
|
|
bool bottom_sunlight_valid = true;
|
|
|
|
|
|
|
|
// The full area we shall touch extends one extra at top and bottom
|
|
|
|
VoxelArea required_a = a;
|
|
|
|
required_a.pad(v3s16(0,1,0));
|
|
|
|
// Make sure we have access to it
|
2014-06-09 07:29:22 -04:00
|
|
|
v.addArea(a);
|
2012-11-25 21:16:48 -05:00
|
|
|
|
2012-01-27 05:58:52 -05:00
|
|
|
s16 max_y = a.MaxEdge.Y;
|
|
|
|
s16 min_y = a.MinEdge.Y;
|
2012-11-25 21:16:48 -05:00
|
|
|
|
2012-01-27 05:58:52 -05:00
|
|
|
for(s32 x=a.MinEdge.X; x<=a.MaxEdge.X; x++)
|
|
|
|
for(s32 z=a.MinEdge.Z; z<=a.MaxEdge.Z; z++)
|
|
|
|
{
|
|
|
|
v3s16 p_overtop(x, max_y+1, z);
|
|
|
|
bool overtop_has_sunlight = false;
|
|
|
|
// If overtop node does not exist, trust heuristics
|
|
|
|
if(!v.exists(p_overtop))
|
|
|
|
overtop_has_sunlight = inexistent_top_provides_sunlight;
|
|
|
|
else if(v.getNodeRefUnsafe(p_overtop).getContent() == CONTENT_IGNORE)
|
|
|
|
overtop_has_sunlight = inexistent_top_provides_sunlight;
|
|
|
|
// Otherwise refer to it's light value
|
|
|
|
else
|
|
|
|
overtop_has_sunlight = (v.getNodeRefUnsafe(p_overtop).getLight(
|
|
|
|
LIGHTBANK_DAY, ndef) == LIGHT_SUN);
|
|
|
|
|
|
|
|
// Copy overtop's sunlight all over the place
|
|
|
|
u8 incoming_light = overtop_has_sunlight ? LIGHT_SUN : 0;
|
|
|
|
for(s32 y=max_y; y>=min_y; y--)
|
|
|
|
{
|
|
|
|
v3s16 p(x,y,z);
|
|
|
|
MapNode &n = v.getNodeRefUnsafe(p);
|
|
|
|
if(incoming_light == 0){
|
|
|
|
// Do nothing
|
|
|
|
} else if(incoming_light == LIGHT_SUN &&
|
|
|
|
ndef->get(n).sunlight_propagates){
|
|
|
|
// Do nothing
|
|
|
|
} else if(ndef->get(n).sunlight_propagates == false){
|
|
|
|
incoming_light = 0;
|
|
|
|
} else {
|
|
|
|
incoming_light = diminish_light(incoming_light);
|
|
|
|
}
|
|
|
|
u8 old_light = n.getLight(LIGHTBANK_DAY, ndef);
|
|
|
|
|
|
|
|
if(incoming_light > old_light)
|
|
|
|
n.setLight(LIGHTBANK_DAY, incoming_light, ndef);
|
2012-11-25 21:16:48 -05:00
|
|
|
|
2012-01-27 05:58:52 -05:00
|
|
|
if(diminish_light(incoming_light) != 0)
|
2012-12-20 12:19:49 -05:00
|
|
|
light_sources.insert(p);
|
2012-01-27 05:58:52 -05:00
|
|
|
}
|
2012-11-25 21:16:48 -05:00
|
|
|
|
2012-01-27 05:58:52 -05:00
|
|
|
// Check validity of sunlight at top of block below if it
|
|
|
|
// hasn't already been proven invalid
|
|
|
|
if(bottom_sunlight_valid)
|
|
|
|
{
|
|
|
|
bool sunlight_should_continue_down = (incoming_light == LIGHT_SUN);
|
|
|
|
v3s16 p_overbottom(x, min_y-1, z);
|
|
|
|
if(!v.exists(p_overbottom) ||
|
|
|
|
v.getNodeRefUnsafe(p_overbottom
|
|
|
|
).getContent() == CONTENT_IGNORE){
|
|
|
|
// Is not known, cannot compare
|
|
|
|
} else {
|
|
|
|
bool overbottom_has_sunlight = (v.getNodeRefUnsafe(p_overbottom
|
|
|
|
).getLight(LIGHTBANK_DAY, ndef) == LIGHT_SUN);
|
|
|
|
if(sunlight_should_continue_down != overbottom_has_sunlight){
|
|
|
|
bottom_sunlight_valid = false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return SunlightPropagateResult(bottom_sunlight_valid);
|
|
|
|
}
|
|
|
|
|
|
|
|
} // namespace voxalgo
|
|
|
|
|