| 1 | /*************************************************************************** |
| 2 | * Copyright (C) 2006 by Gerd v. Egidy * |
| 3 | * gve@intra2net.com * |
| 4 | * * |
| 5 | * This library is free software; you can redistribute it and/or modify * |
| 6 | * it under the terms of the GNU Lesser General Public License version * |
| 7 | * 2.1 as published by the Free Software Foundation. * |
| 8 | * * |
| 9 | * This library is distributed in the hope that it will be useful, * |
| 10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of * |
| 11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * |
| 12 | * GNU Lesser General Public License for more details. * |
| 13 | * * |
| 14 | * You should have received a copy of the GNU Lesser General Public * |
| 15 | * License along with this program; if not, write to the * |
| 16 | * Free Software Foundation, Inc., * |
| 17 | * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. * |
| 18 | ***************************************************************************/ |
| 19 | |
| 20 | #include "server.hxx" |
| 21 | |
| 22 | namespace libt2n |
| 23 | { |
| 24 | |
| 25 | void connection::check_timeout() |
| 26 | { |
| 27 | if (timeout != -1 && last_action_time+timeout >= time(NULL)) |
| 28 | this->close(); |
| 29 | } |
| 30 | |
| 31 | void connection::reset_timeout() |
| 32 | { |
| 33 | last_action_time=time(NULL); |
| 34 | } |
| 35 | |
| 36 | bool connection::get_packet(std::string& data, unsigned int& conn_id) |
| 37 | { |
| 38 | // max packet size is unsigned int |
| 39 | |
| 40 | // no size information -> no packet |
| 41 | if (buffer.size() < sizeof(unsigned int)) |
| 42 | return false; |
| 43 | |
| 44 | unsigned int psize=*((unsigned int*)(buffer.data())); |
| 45 | |
| 46 | // enough data for one packet in buffer? |
| 47 | if (buffer.size() < sizeof(unsigned int)+psize) |
| 48 | return false; |
| 49 | |
| 50 | data.assign(buffer,sizeof(unsigned int),psize); |
| 51 | buffer.erase(0,sizeof(unsigned int)+psize); |
| 52 | |
| 53 | return true; |
| 54 | } |
| 55 | |
| 56 | server::~server() |
| 57 | { |
| 58 | std::map<unsigned int, connection*>::iterator ie=connections.end(); |
| 59 | for(std::map<unsigned int, connection*>::iterator i=connections.begin(); i != ie; i++) |
| 60 | delete i->second; |
| 61 | } |
| 62 | |
| 63 | /** |
| 64 | Gets a connection by id |
| 65 | |
| 66 | \param conn_id Connection ID |
| 67 | |
| 68 | \retval Pointer to connection object |
| 69 | */ |
| 70 | connection* server::get_connection(unsigned int conn_id) |
| 71 | { |
| 72 | std::map<unsigned int, connection*>::iterator p=connections.find(conn_id); |
| 73 | if (p==connections.end()) |
| 74 | return NULL; |
| 75 | else |
| 76 | return p->second; |
| 77 | } |
| 78 | |
| 79 | void server::check_timeout() |
| 80 | { |
| 81 | std::map<unsigned int, connection*>::iterator ie=connections.end(); |
| 82 | for(std::map<unsigned int, connection*>::iterator i=connections.begin(); i != ie; i++) |
| 83 | i->second->check_timeout(); |
| 84 | } |
| 85 | |
| 86 | void server::fill_connection_buffers(void) |
| 87 | { |
| 88 | std::map<unsigned int, connection*>::iterator ie=connections.end(); |
| 89 | for(std::map<unsigned int, connection*>::iterator i=connections.begin(); i != ie; i++) |
| 90 | if (!i->second->is_closed()) |
| 91 | i->second->fill_buffer(); |
| 92 | } |
| 93 | |
| 94 | bool server::get_packet(std::string& data, unsigned int& conn_id) |
| 95 | { |
| 96 | // todo: this is somehow unfair: the first connections in the map get checked more |
| 97 | // often than the others and can thus block them out |
| 98 | |
| 99 | std::map<unsigned int, connection*>::iterator ie=connections.end(); |
| 100 | for(std::map<unsigned int, connection*>::iterator i=connections.begin(); i != ie; i++) |
| 101 | if (i->second->get_packet(data,conn_id)) |
| 102 | return true; |
| 103 | } |
| 104 | |
| 105 | void server::log(log_level_values level, const char* message) |
| 106 | { |
| 107 | if (logstream && level >= log_level) |
| 108 | (*logstream) << message << std::endl; |
| 109 | } |
| 110 | |
| 111 | }; |