src/nodetimer.cpp

   1 /*
   2 Minetest
   3 Copyright (C) 2010-2013 celeron55, Perttu Ahola <celeron55@gmail.com>
   4
   5 This program is free software; you can redistribute it and/or modify
   6 it under the terms of the GNU Lesser General Public License as published by
   7 the Free Software Foundation; either version 2.1 of the License, or
   8 (at your option) any later version.
   9
  10 This program is distributed in the hope that it will be useful,
  11 but WITHOUT ANY WARRANTY; without even the implied warranty of
  12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  13 GNU Lesser General Public License for more details.
  14
  15 You should have received a copy of the GNU Lesser General Public License along
  16 with this program; if not, write to the Free Software Foundation, Inc.,
  17 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
  18 */
  19
  20 #include "nodetimer.h"
  21 #include "log.h"
  22 #include "serialization.h"
  23 #include "util/serialize.h"
  24 #include "constants.h" // MAP_BLOCKSIZE
  25
  26 /*
  27         NodeTimer
  28 */
  29
  30 void NodeTimer::serialize(std::ostream &os) const
  31 {
  32         writeF1000(os, timeout);
  33         writeF1000(os, elapsed);
  34 }
  35
  36 void NodeTimer::deSerialize(std::istream &is)
  37 {
  38         timeout = readF1000(is);
  39         elapsed = readF1000(is);
  40 }
  41
  42 /*
  43         NodeTimerList
  44 */
  45
  46 void NodeTimerList::serialize(std::ostream &os, u8 map_format_version) const
  47 {
  48         if(map_format_version == 24){
  49                 // Version 0 is a placeholder for "nothing to see here; go away."
  50                 if(m_data.empty()){
  51                         writeU8(os, 0); // version
  52                         return;
  53                 }
  54                 writeU8(os, 1); // version
  55                 writeU16(os, m_data.size());
  56         }
  57
  58         if(map_format_version >= 25){
  59                 writeU8(os, 2+4+4);
  60                 writeU16(os, m_data.size());
  61         }
  62
  63         for(std::map<v3s16, NodeTimer>::const_iterator
  64                         i = m_data.begin();
  65                         i != m_data.end(); i++){
  66                 v3s16 p = i->first;
  67                 NodeTimer t = i->second;
  68
  69                 u16 p16 = p.Z*MAP_BLOCKSIZE*MAP_BLOCKSIZE + p.Y*MAP_BLOCKSIZE + p.X;
  70                 writeU16(os, p16);
  71                 t.serialize(os);
  72         }
  73 }
  74
  75 void NodeTimerList::deSerialize(std::istream &is, u8 map_format_version)
  76 {
  77         m_data.clear();
  78
  79         if(map_format_version == 24){
  80                 u8 timer_version = readU8(is);
  81                 if(timer_version == 0)
  82                         return;
  83                 if(timer_version != 1)
  84                         throw SerializationError("unsupported NodeTimerList version");
  85         }
  86
  87         if(map_format_version >= 25){
  88                 u8 timer_data_len = readU8(is);
  89                 if(timer_data_len != 2+4+4)
  90                         throw SerializationError("unsupported NodeTimer data length");
  91         }
  92
  93         u16 count = readU16(is);
  94
  95         for(u16 i=0; i<count; i++)
  96         {
  97                 u16 p16 = readU16(is);
  98
  99                 v3s16 p;
 100                 p.Z = p16 / MAP_BLOCKSIZE / MAP_BLOCKSIZE;
 101                 p16 &= MAP_BLOCKSIZE * MAP_BLOCKSIZE - 1;
 102                 p.Y = p16 / MAP_BLOCKSIZE;
 103                 p16 &= MAP_BLOCKSIZE - 1;
 104                 p.X = p16;
 105
 106                 NodeTimer t;
 107                 t.deSerialize(is);
 108
 109                 if(t.timeout <= 0)
 110                 {
 111                         infostream<<"WARNING: NodeTimerList::deSerialize(): "
 112                                         <<"invalid data at position"
 113                                         <<"("<<p.X<<","<<p.Y<<","<<p.Z<<"): Ignoring."
 114                                         <<std::endl;
 115                         continue;
 116                 }
 117
 118                 if(m_data.find(p) != m_data.end())
 119                 {
 120                         infostream<<"WARNING: NodeTimerList::deSerialize(): "
 121                                         <<"already set data at position"
 122                                         <<"("<<p.X<<","<<p.Y<<","<<p.Z<<"): Ignoring."
 123                                         <<std::endl;
 124                         continue;
 125                 }
 126
 127                 m_data.insert(std::make_pair(p, t));
 128         }
 129 }
 130
 131 std::map<v3s16, NodeTimer> NodeTimerList::step(float dtime)
 132 {
 133         std::map<v3s16, NodeTimer> elapsed_timers;
 134         // Increment timers
 135         for(std::map<v3s16, NodeTimer>::iterator
 136                         i = m_data.begin();
 137                         i != m_data.end(); i++){
 138                 v3s16 p = i->first;
 139                 NodeTimer t = i->second;
 140                 t.elapsed += dtime;
 141                 if(t.elapsed >= t.timeout)
 142                         elapsed_timers.insert(std::make_pair(p, t));
 143                 else
 144                         i->second = t;
 145         }
 146         // Delete elapsed timers
 147         for(std::map<v3s16, NodeTimer>::const_iterator
 148                         i = elapsed_timers.begin();
 149                         i != elapsed_timers.end(); i++){
 150                 v3s16 p = i->first;
 151                 m_data.erase(p);
 152         }
 153         return elapsed_timers;
 154 }