2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2006, Dave Pare, Jeff Bailey, Thomas Ruschak,
4 * Ken Stevens, Steve McClure
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
22 * See files README, COPYING and CREDITS in the root of the source
23 * tree for related information and legal notices. It is expected
24 * that future projects/authors will amend these files as needed.
28 * accept.c: Keep track of people logged in
30 * Known contributors to this file:
32 * Markus Armbruster, 2005
42 #include <arpa/inet.h>
43 #include <sys/socket.h>
45 #include <netinet/in.h>
46 #include <sys/ioctl.h>
55 #include "empthread.h"
62 #include "prototypes.h"
64 static struct emp_qelem Players;
65 static int player_socket;
66 static size_t player_addrlen;
71 emp_initque(&Players);
72 init_player_commands();
74 player_socket = tcp_listen(*listen_addr ? listen_addr : NULL,
75 loginport, &player_addrlen);
83 lp = malloc(sizeof(struct player));
86 memset(lp, 0, sizeof(struct player));
88 /* real player, not dummy created by update and market update */
89 lp->iop = io_open(s, IO_READ | IO_WRITE | IO_NBLOCK, IO_BUFSIZE);
94 emp_insque(&lp->queue, &Players);
103 player_delete(struct player *lp)
107 back = (struct player *)lp->queue.q_back;
109 emp_remque(&lp->queue);
111 /* it's a real player */
116 /* XXX may need to free bigmap here */
121 player_next(struct player *lp)
124 lp = (struct player *)Players.q_forw;
126 lp = (struct player *)lp->queue.q_forw;
127 if (&lp->queue == &Players)
133 player_prev(struct player *lp)
136 lp = (struct player *)Players.q_back;
138 lp = (struct player *)lp->queue.q_back;
139 if (&lp->queue == &Players)
145 * Return player in state PS_PLAYING for CNUM.
148 getplayer(natid cnum)
150 struct emp_qelem *qp;
153 for (qp = Players.q_forw; qp != &Players; qp = qp->q_forw) {
154 pl = (struct player *)qp;
155 if (pl->cnum == cnum && pl->state == PS_PLAYING)
163 player_wakeup_all(natid cnum)
167 if (NULL != (lp = getplayer(cnum)))
172 player_wakeup(struct player *pl)
175 empth_wakeup(pl->proc);
180 player_accept(void *unused)
182 struct sockaddr *sap;
184 int s = player_socket;
191 #ifdef RESOLVE_IPADDRESS
192 struct hostent *hostp;
195 /* auto sockaddr_storage would be simpler, but less portable */
196 sap = malloc(player_addrlen);
199 empth_select(s, EMPTH_FD_READ);
200 len = player_addrlen;
201 ns = accept(s, sap, &len);
202 /* FIXME accept() can block on some systems (RST after select() reports ready) */
204 logerror("new socket accept");
207 /* FIXME SO_KEEPALIVE is useless, player_kill_idle() strikes long before */
208 (void)setsockopt(ns, SOL_SOCKET, SO_KEEPALIVE, &set, sizeof(set));
211 logerror("can't create player for fd %d", ns);
215 #ifdef HAVE_GETADDRINFO
216 inaddr = sap->sa_family == AF_INET
217 ? (void *)&((struct sockaddr_in *)sap)->sin_addr
218 : (void *)&((struct sockaddr_in6 *)sap)->sin6_addr;
219 /* Assumes that if you got getaddrinfo(), you got inet_ntop() too */
220 if (!inet_ntop(sap->sa_family, inaddr,
221 np->hostaddr, sizeof(np->hostaddr))) {
222 logerror("inet_ntop() failed: %s", strerror(errno));
227 inaddr = &((struct sockaddr_in *)sap)->sin_addr;
228 strcpy(np->hostaddr, inet_ntoa(*(struct in_addr *)inaddr));
230 #ifdef RESOLVE_IPADDRESS
231 hostp = gethostbyaddr(inaddr, player_addrlen, sap->sa_family);
233 strcpy(np->hostname, hostp->h_name);
234 #endif /* RESOLVE_IPADDRESS */
235 /* XXX may not be big enough */
237 /* budget */ + MAX(WORLD_X * WORLD_Y / 2 * sizeof(int) * 7,
238 /* power */ MAXNOC * sizeof(struct powstr));
239 sprintf(buf, "Player (fd #%d)", ns);
240 empth_create(PP_PLAYER, player_login, stacksize,
241 0, buf, "Empire player", np);