Planet
navi homePPSaboutscreenshotsdownloaddevelopmentforum

source: code/trunk/src/network/TrafficControl.cc @ 3162

Last change on this file since 3162 was 3084, checked in by landauf, 16 years ago

merged netp3 branch back to trunk

  • Property svn:eol-style set to native
File size: 10.9 KB
RevLine 
[2355]1/*
2 *   ORXONOX - the hottest 3D action shooter ever to exist
3 *                    > www.orxonox.net <
4 *
5 *
6 *   License notice:
7 *
8 *   This program is free software; you can redistribute it and/or
9 *   modify it under the terms of the GNU General Public License
10 *   as published by the Free Software Foundation; either version 2
11 *   of the License, or (at your option) any later version.
12 *
13 *   This program is distributed in the hope that it will be useful,
14 *   but WITHOUT ANY WARRANTY; without even the implied warranty of
15 *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
16 *   GNU General Public License for more details.
17 *
18 *   You should have received a copy of the GNU General Public License
19 *   along with this program; if not, write to the Free Software
20 *   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.
21 *
22 *   Author:
[3084]23 *      Oliver Scheuss <scheusso [at] ee.ethz.ch>
[2355]24 *   Co-authors:
25 *      ...
26 *
27 */
28
29#include "TrafficControl.h"
30
31#include "synchronisable/Synchronisable.h"
[2896]32#include "core/CoreIncludes.h"
[2382]33#include "core/ConfigValueIncludes.h"
[2355]34
35#include <cassert>
36#include <boost/bind.hpp>
37
38namespace orxonox {
39
[2485]40  static const unsigned int SCHED_PRIORITY_OFFSET = (unsigned int)-1;
41
[2355]42  objInfo::objInfo(uint32_t ID, uint32_t creatorID, int32_t curGsID, int32_t diffGsID, uint32_t size, unsigned int prioperm, unsigned int priosched)
[2485]43  {
44    objID = ID; objCreatorID = creatorID; objCurGS = curGsID; objDiffGS = diffGsID; objSize = size; objValuePerm = prioperm; objValueSched = priosched;
[2355]45  }
[2485]46
[2355]47  objInfo::objInfo()
[2485]48  {
49    objID = OBJECTID_UNKNOWN; objCreatorID = OBJECTID_UNKNOWN; objCurGS = GAMESTATEID_INITIAL; objDiffGS = objCurGS; objSize = 0; objValuePerm = 0; objValueSched = 0;
[2355]50  }
[2485]51
52
53
[2355]54  obj::obj()
[2485]55  {
56    objID = OBJECTID_UNKNOWN; objCreatorID = OBJECTID_UNKNOWN; objSize = 0; objDataOffset = 0;
[2355]57  }
58  obj::obj( uint32_t ID, uint32_t creatorID, uint32_t size, uint32_t offset )
59  {
60    objID = ID; objCreatorID = creatorID; objSize = size; objDataOffset = offset;
61  }
[2485]62
[2355]63/**
64*Initializing protected members
65*/
66        TrafficControl *TrafficControl::instance_=0;
[2485]67
[2355]68        /**
69        * @brief Constructor: assures that only one reference will be created and sets the pointer
70        */
71        TrafficControl::TrafficControl()
72        {
[2413]73    RegisterObject(TrafficControl);
[2355]74          assert(instance_==0);
75          instance_=this;
[2413]76    this->setConfigValues();
[2355]77        }
[2485]78
[2355]79        /**
80        * @brief Destructor: resets the instance pointer to 0
81        */
82        TrafficControl::~TrafficControl()
[2416]83        {
[2355]84          instance_=0;
85        }
86
87/**
88*Definition of public members
89*/
90
[2413]91  void TrafficControl::setConfigValues()
92  {
[3084]93    SetConfigValue ( bActive_, false );
94    SetConfigValue ( targetSize, 10000 );
[2413]95  }
[2485]96
[2355]97  /**
[2416]98  * sort-algorithm for sorting the objectlist after priorities
[2355]99  */
[2416]100  bool TrafficControl::prioritySort(uint32_t clientID, obj i, obj j)
[2355]101  {
102    assert(clientListPerm_.find(clientID) != clientListPerm_.end());  //make sure the client exists in our list
103    assert(clientListPerm_[clientID].find(i.objID) != clientListPerm_[clientID].end()); // make sure the object i is in the client list
104    assert(clientListPerm_[clientID].find(j.objID) != clientListPerm_[clientID].end()); // make sure the object j is in the client list
[2485]105
[2355]106    int prio1 = clientListPerm_[clientID][i.objID].objValuePerm + clientListPerm_[clientID][i.objID].objValueSched;
107    int prio2 = clientListPerm_[clientID][j.objID].objValuePerm + clientListPerm_[clientID][j.objID].objValueSched;
108    return prio1 < prio2;
109  }
110
[2416]111  /**
112  * sort-algorithm for sorting the objectList after position in original data stream
113  */
114  bool TrafficControl::dataSort(obj i, obj j)
115  {
116    int pos1 = i.objDataOffset;
117    int pos2 = j.objDataOffset;
118    return pos1 < pos2;
119  }
[2355]120
[2416]121
[2485]122
[3084]123        void TrafficControl::processObjectList(unsigned int clientID, unsigned int gamestateID, std::list<obj>& list)
[2355]124        {
125          currentClientID=clientID;
126          currentGamestateID=gamestateID;
127          evaluateList(clientID, list);
128          return;
129        }
[2485]130
[2382]131  TrafficControl *TrafficControl::getInstance()
132  {
133    assert(instance_);
134    return instance_;
135  }
[2485]136
[2381]137        void TrafficControl::ack(unsigned int clientID, unsigned int gamestateID)
[2355]138        {
139          std::list<obj>::iterator itvec;  // iterator to iterate through the acked objects
[2485]140
[2355]141    //assertions to make sure the maps already exist
142    assert(clientListTemp_.find(clientID) != clientListTemp_.end() );
143    assert(clientListPerm_.find(clientID) != clientListPerm_.end() );
[3084]144    assert( clientListTemp_[clientID].find(gamestateID) != clientListTemp_[clientID].end() );
145   
146    // shortcut for maps
147    std::map<unsigned int, objInfo >& objectListPerm = clientListPerm_[clientID];
148    std::map<unsigned int, std::list<obj> >& objectListTemp = clientListTemp_[clientID];
[2485]149
[3084]150    for(itvec = objectListTemp[gamestateID].begin(); itvec != objectListTemp[gamestateID].end(); itvec++)
[2355]151          {
[3084]152      if(objectListPerm.find((*itvec).objID) != objectListPerm.end()) // check whether the obj already exists in our lists
[2355]153      {
[3084]154        objectListPerm[(*itvec).objID].objCurGS = gamestateID;
155        objectListPerm[(*itvec).objID].objValueSched = 0; //set scheduling value back
[2355]156      }
157      else
158      {
[2381]159        assert(0);
[3084]160        objectListPerm[(*itvec).objID].objCurGS = gamestateID;
161        objectListPerm[(*itvec).objID].objID = (*itvec).objID;
162        objectListPerm[(*itvec).objID].objCreatorID = (*itvec).objCreatorID;
163        objectListPerm[(*itvec).objID].objSize = (*itvec).objSize;
[2355]164      }
165          }
166           // remove temporary list (with acked objects) from the map
[3084]167    objectListTemp.erase( objectListTemp.find(gamestateID) );
[2355]168        }
169
170/**
171*Definition of private members
172*/
[2418]173
[2355]174        /**
175        *updateClientListPerm
176        *returns void
177        */
178        void TrafficControl::insertinClientListPerm(unsigned int clientID, obj objinf)
[2485]179        {
[2355]180          std::map<unsigned int,std::map<unsigned int, objInfo> >::iterator itperm;//iterator clientListPerm over clientIDs
181    unsigned int gsid=GAMESTATEID_INITIAL, gsdiff=currentGamestateID, prioperm=Synchronisable::getSynchronisable(objinf.objID)->getPriority(), priomom=0;
182    clientListPerm_[clientID][objinf.objID] = objInfo(objinf.objID, objinf.objCreatorID,gsid,gsdiff, objinf.objSize,prioperm,priomom);
183        }
[2485]184
[2355]185  /**
186  * updateClientListTemp
187  * takes the shortened list which will be sent to the gsmanager and puts the *info into clientListTemp
[2485]188  */
[3084]189  void TrafficControl::updateClientListTemp(std::list<obj>& list)
[2355]190  {
[3084]191    clientListTemp_[currentClientID][currentGamestateID] = std::list<obj>(list);
[2355]192  }
193
194  /**
195  *cut
196  *takes the current list that has to be returned to the gsmanager and shortens it in criteria of bandwidth of clientID(XY)
197  */
[3084]198  void TrafficControl::cut(std::list<obj>& list, unsigned int targetsize)
[2355]199  {
200    unsigned int size=0;
[2381]201    std::list<obj>::iterator itvec, ittemp;
[3084]202    assert(!list.empty());
203    for(itvec = list.begin(); itvec != list.end();)
[2355]204    {
205      assert( (*itvec).objSize < 1000);
[2378]206      if ( ( size + (*itvec).objSize ) < targetsize )
[2355]207      {
208        size += (*itvec).objSize;//objSize is given in bytes
[2381]209        ++itvec;
[2355]210      }
211      else
212      {
[2381]213        clientListPerm_[currentClientID][(*itvec).objID].objValueSched += SCHED_PRIORITY_OFFSET; // NOTE: SCHED_PRIORITY_OFFSET is negative
[3084]214        list.erase(itvec, list.end());
215        break;
[2355]216      }
[2381]217//       printList(list, currentClientID);
[2355]218    }
[3084]219    assert(!list.empty());
[2355]220  }
221
222
223        /**
224        *evaluateList evaluates whether new obj are there, whether there are things to be updatet and manipulates all this.
225        */
[3084]226        void TrafficControl::evaluateList(unsigned int clientID, std::list<obj>& list)
[2355]227        {
[2485]228
[2355]229          //now the sorting
[2485]230
[2355]231          //compare listToProcess vs clientListPerm
232    //if listToProcess contains new Objects, add them to clientListPerm
233    std::list<obj>::iterator itvec;
[3084]234   
235    std::map<unsigned int, objInfo >& objectListPerm = clientListPerm_[clientID];
236   
237          for( itvec=list.begin(); itvec != list.end(); itvec++)
[2355]238          {
[3084]239            if ( objectListPerm.find( (*itvec).objID) != objectListPerm.end() )
[2355]240      {
241        // we already have the object in our map
242        //obj bleibt in liste und permanente prio wird berechnet
[3084]243        objectListPerm[(*itvec).objID].objDiffGS = currentGamestateID - objectListPerm[(*itvec).objID].objCurGS;
[2355]244        continue;//check next objId
245      }
246      else
247      {
248        // insert the object into clientListPerm
249        insertinClientListPerm(clientID,*itvec);
250        continue;//check next objId
251      }
252    }
253          //end compare listToProcess vs clientListPerm
[2485]254
[2418]255    if( bActive_ )
[2355]256    {
[2418]257      //sort copied list according to priorities
258      // use boost bind here because we need to pass a memberfunction to stl sort
[3084]259//       sort( list.begin(), list.end(), boost::bind(&TrafficControl::prioritySort, this, clientID, _1, _2) );
260      list.sort( boost::bind(&TrafficControl::prioritySort, this, clientID, _1, _2) );
261     
262//       list.sort(boost::bind(&TrafficControl::prioritySort, this, clientID, _1, _2) );
[2485]263
[2418]264      //now we check, that the creator of an object always exists on a client
265      std::list<obj>::iterator itcreator;
[3084]266      for(itvec = list.begin(); itvec != list.end(); itvec++)
[2485]267      {
[2418]268        fixCreatorDependencies(itvec, list, clientID);
[2355]269      }
[2418]270      //end of sorting
[2485]271      //now the cutting, work the same obj out in processobjectlist and copiedlist, compression rate muss noch festgelegt werden.
[2419]272//       printList(list, clientID);
[2418]273      cut(list, targetSize);
274      //now sort again after objDataOffset
[3084]275//       sort(list.begin(), list.end(), boost::bind(&TrafficControl::dataSort, this, _1, _2) );
276      list.sort( boost::bind(&TrafficControl::dataSort, this, _1, _2) );
[2355]277    }
278    //diese Funktion updateClientList muss noch gemacht werden
279    updateClientListTemp(list);
280    //end of sorting
281  }
282
[3084]283  void TrafficControl::printList(std::list<obj>& list, unsigned int clientID)
[2355]284  {
285    std::list<obj>::iterator it;
286    COUT(0) << "=========== Objectlist ===========" << endl;
[3084]287    for( it=list.begin(); it!=list.end(); it++)
[2381]288      COUT(0) << "ObjectID: " << (*it).objID << " creatorID: " << (*it).objCreatorID << " Priority: " << clientListPerm_[clientID][(*it).objID].objValuePerm + clientListPerm_[clientID][(*it).objID].objValueSched << " size: " << (*it).objSize << endl;
[2355]289  }
[2485]290
[3084]291  void TrafficControl::fixCreatorDependencies(std::list<obj>::iterator it1, std::list<obj>& list, unsigned int clientID)
[2355]292  {
293    if ( (*it1).objCreatorID == OBJECTID_UNKNOWN )
294      return;
295    if( clientListPerm_[clientID][(*it1).objCreatorID].objCurGS != GAMESTATEID_INITIAL )
296      return;
297    std::list<obj>::iterator it2, it3=it1;
[3084]298    for( it2 = ++it3; it2 != list.end(); it2++ )
[2355]299    {
300      if( (*it2).objID == (*it1).objCreatorID )
301      {
[3084]302        it3 = list.insert(it1, *it2); //insert creator before it1
303        list.erase(it2);
[2355]304//         printList(list, clientID);
305        fixCreatorDependencies( it3, list, clientID );
306        break;
307      }
308    }
309  }
[2485]310
[2413]311  void TrafficControl::clientDisconnected(unsigned int clientID)
[2387]312  {
313    assert(clientListTemp_.find(clientID) != clientListTemp_.end() );
314    assert(clientListPerm_.find(clientID) != clientListPerm_.end() );
315    clientListTemp_.erase(clientListTemp_.find(clientID));
316    clientListPerm_.erase(clientListPerm_.find(clientID));
317  }
[2355]318
319
320}//namespace network
Note: See TracBrowser for help on using the repository browser.