ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/include/network.h
(Generate patch)

Comparing deliantra/server/include/network.h (file contents):
Revision 1.5 by root, Wed Dec 20 01:19:11 2006 UTC vs.
Revision 1.38 by root, Wed Dec 5 21:18:37 2018 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 3 *
4 Copyright (C) 1992 Frank Tore Johansen 4 * Copyright (©) 2018 Marc Alexander Lehmann / the Deliantra team
5 * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 Copyright (C) 2002 Mark Wedel & Crossfire Development Team 6 * Copyright (©) 2002 Mark Wedel & Crossfire Development Team
6 Copyright (C) 2005, 2006 The Crossfire+ Development Team 7 * Copyright (©) 1992 Frank Tore Johansen
7 8 *
8 This program is free software; you can redistribute it and/or modify 9 * Deliantra is free software: you can redistribute it and/or modify it under
9 it under the terms of the GNU General Public License as published by 10 * the terms of the Affero GNU General Public License as published by the
10 the Free Software Foundation; either version 2 of the License, or 11 * Free Software Foundation, either version 3 of the License, or (at your
11 (at your option) any later version. 12 * option) any later version.
12 13 *
13 This program is distributed in the hope that it will be useful, 14 * This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of 15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details. 17 * GNU General Public License for more details.
17 18 *
18 You should have received a copy of the GNU General Public License 19 * You should have received a copy of the Affero GNU General Public License
19 along with this program; if not, write to the Free Software 20 * and the GNU General Public License along with this program. If not, see
20 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 21 * <http://www.gnu.org/licenses/>.
21 22 *
22 The authors can be reached via e-mail at crossfire@schmorp.de 23 * The authors can be reached via e-mail to <support@deliantra.net>
23*/ 24 */
24 25
25/* This file defines various flags that both the new client and 26/* This file defines various flags that both the new client and
26 * newserver uses. These should never be changed, only expanded. 27 * newserver uses. These should never be changed, only expanded.
27 * Changing them will likely cause all old clients to not work properly. 28 * Changing them will likely cause all old clients to not work properly.
28 * While called newclient, it is really used by both the client and 29 * While called newclient, it is really used by both the client and
… …
38 * or server area. But keeping one common file should make things 39 * or server area. But keeping one common file should make things
39 * more reliable, as both the client and server will definately be 40 * more reliable, as both the client and server will definately be
40 * talking about the same values. 41 * talking about the same values.
41 */ 42 */
42 43
43
44#ifndef NETWORK_H 44#ifndef NETWORK_H
45#define NETWORK_H 45#define NETWORK_H
46 46
47//+GPL
48
47#include <cstdarg> 49#include <cstdarg>
48 50
49/* Maximum size of any packet we expect. Using this makes it so we don't need to 51#include "ecb.h"
50 * allocated and deallocated the same buffer over and over again and the price 52
51 * of using a bit of extra memory. It also makes the code simpler. 53/* Maximum size of any packet we expect.
52 * 54 *
53 * The size must be the same in the server and the client (stupid), and its also NOT 55 * The size must be the same in the server and the client (stupid).
54 * the maximum buffer size as one would expect, but the maximum buffer size + 1. 56 * TODO: make the actual network configurable per client and use 2**16.
55 */ 57 */
56#define MAXSOCKBUF 10240 58#define MAXSOCKBUF 10239
57
58 59
59#define CS_QUERY_YESNO 0x1 /* Yes/no question */ 60#define CS_QUERY_YESNO 0x1 /* Yes/no question */
60#define CS_QUERY_SINGLECHAR 0x2 /* Single character response expected */ 61#define CS_QUERY_SINGLECHAR 0x2 /* Single character response expected */
61#define CS_QUERY_HIDEINPUT 0x4 /* Hide input being entered */ 62#define CS_QUERY_HIDEINPUT 0x4 /* Hide input being entered */
62 63
63#define CS_SAY_NORMAL 0x1 /* Normal say command */
64#define CS_SAY_SHOUT 0x2 /* Text is shouted. */
65#define CS_SAY_GSAY 0x4 /* Text is group say command */
66
67/* These are multiplication values that should be used when changing 64/* These are multiplication values that should be used when changing
68 * floats to ints, and vice version. MULTI is integer representatin 65 * floats to ints, and vice version. MULTI is integer representatin
69 * (float to int), MULTF is float, for going from int to float. 66 * (float to int), MULTF is float, for going from int to float.
70 */ 67 */
71#define FLOAT_MULTI 100000 68#define FLOAT_MULTI 100000
72#define FLOAT_MULTF 100000.0 69#define FLOAT_MULTF 100000.0
… …
124#define CS_STAT_RES_DEPLETE 114 121#define CS_STAT_RES_DEPLETE 114
125#define CS_STAT_RES_DEATH 115 122#define CS_STAT_RES_DEATH 115
126#define CS_STAT_RES_HOLYWORD 116 123#define CS_STAT_RES_HOLYWORD 116
127#define CS_STAT_RES_BLIND 117 124#define CS_STAT_RES_BLIND 117
128 125
129/* Start & end of skill experience + skill level, inclusive. */
130#define CS_STAT_SKILLEXP_START 118
131#define CS_STAT_SKILLEXP_END 129
132#define CS_STAT_SKILLEXP_AGILITY 118
133#define CS_STAT_SKILLEXP_AGLEVEL 119
134#define CS_STAT_SKILLEXP_PERSONAL 120
135#define CS_STAT_SKILLEXP_PELEVEL 121
136#define CS_STAT_SKILLEXP_MENTAL 122
137#define CS_STAT_SKILLEXP_MELEVEL 123
138#define CS_STAT_SKILLEXP_PHYSIQUE 124
139#define CS_STAT_SKILLEXP_PHLEVEL 125
140#define CS_STAT_SKILLEXP_MAGIC 126
141#define CS_STAT_SKILLEXP_MALEVEL 127
142#define CS_STAT_SKILLEXP_WISDOM 128
143#define CS_STAT_SKILLEXP_WILEVEL 129
144
145/* CS_STAT_SKILLINFO is used as the starting index point. Skill number->name 126/* CS_STAT_SKILLINFO is used as the starting index point. Skill number->name
146 * map is generated dynamically for the client, so a bunch of entries will 127 * map is generated dynamically for the client, so a bunch of entries will
147 * be used here. CS_NUM_SKILLS does not match how many skills there really 128 * be used here. CS_NUM_SKILLS does not match how many skills there really
148 * are - instead, it is used as a range of values so that the client 129 * are - instead, it is used as a range of values so that the client
149 * can have some idea how many skill categories there may be. 130 * can have some idea how many skill categories there may be.
… …
155 * server thinks the fireon & runon states are. 136 * server thinks the fireon & runon states are.
156 */ 137 */
157#define SF_FIREON 0x01 138#define SF_FIREON 0x01
158#define SF_RUNON 0x02 139#define SF_RUNON 0x02
159 140
160/* The following are the color flags passed to new_draw_info.
161 *
162 * We also set up some control flags
163 *
164 * NDI = New Draw Info
165 */
166
167/* Color specifications - note these match the order in xutil.c */
168/* Note 2: Black, the default color, is 0. Thus, it does not need to
169 * be implicitly specified.
170 */
171#define NDI_BLACK 0
172#define NDI_WHITE 1
173#define NDI_NAVY 2
174#define NDI_RED 3
175#define NDI_ORANGE 4
176#define NDI_BLUE 5 /* Actually, it is Dodger Blue */
177#define NDI_DK_ORANGE 6 /* DarkOrange2 */
178#define NDI_GREEN 7 /* SeaGreen */
179#define NDI_LT_GREEN 8 /* DarkSeaGreen, which is actually paler */
180 /* Than seagreen - also background color */
181#define NDI_GREY 9
182#define NDI_BROWN 10 /* Sienna */
183#define NDI_GOLD 11
184#define NDI_TAN 12 /* Khaki */
185
186#define NDI_MAX_COLOR 12 /* Last value in */
187#define NDI_COLOR_MASK 0xff /* Gives lots of room for expansion - we are */
188 /* using an int anyways, so we have the space */
189 /* to still do all the flags */
190
191
192#define NDI_UNIQUE 0x100 /* Print this out immediately, don't buffer */
193#define NDI_ALL 0x200 /* Inform all players of this message */
194
195/* Flags for the item command */ 141/* Flags for the item command */
196enum {a_none, a_readied, a_wielded, a_worn, a_active, a_applied}; 142enum {a_none, a_readied, a_wielded, a_worn, a_active, a_applied};
143
197#define F_APPLIED 0x000F 144#define F_APPLIED 0x000F
198#define F_LOCATION 0x00F0 145#define F_LOCATION 0x00F0
199#define F_UNPAID 0x0200 146#define F_UNPAID 0x0200
200#define F_MAGIC 0x0400 147#define F_MAGIC 0x0400
201#define F_CURSED 0x0800 148#define F_CURSED 0x0800
… …
230#define UPD_NROF 0x80 177#define UPD_NROF 0x80
231 178
232/* The flag values sent by the updspell command */ 179/* The flag values sent by the updspell command */
233#define UPD_SP_MANA 0x01 180#define UPD_SP_MANA 0x01
234#define UPD_SP_GRACE 0x02 181#define UPD_SP_GRACE 0x02
235#define UPD_SP_DAMAGE 0x04 182#define UPD_SP_LEVEL 0x04 // was UPD_SP_DAMAGE in <= server 2.93, client 2.10
236 183
237#define SOUND_NORMAL 0 184#define SOUND_NORMAL 0
238#define SOUND_SPELL 1 185#define SOUND_SPELL 1
239 186
187//-GPL
188
189template<int unique>
240struct data 190struct databuf
241{ 191{
242 unsigned int len; 192 unsigned int len;
243 const void *ptr; 193 const void *ptr;
244 194
245 data (const void *ptr, int len) : len (len), ptr (ptr) { } 195 databuf (const void *ptr, int len) : len (len), ptr (ptr) { }
246 data (const char *str) : len (strlen (str ? str : 0)), ptr ((void *)str) { } 196 databuf (const char *str) : len (strlen (str ? str : 0)), ptr ((void *)str) { }
247 data (const shstr &sh) : len (sh.length ()), ptr ((void *)&sh) { } 197 databuf (shstr_tmp sh) : len (sh.length ()), ptr ((void *)&sh) { }
198 databuf (dynbuf &buf) : len (buf.size ()), ptr (buf.linearise ()) { }
248}; 199};
249 200
250struct data8 201using data_n = databuf<0>;
202using data8 = databuf<1>;
203using data16 = databuf<2>;
204
205struct ber32
251{ 206{
252 unsigned int len; 207 enum { size = 5 }; // maximum length of an encoded ber32
253 const void *ptr; 208 uint32 val;
254 209
255 data8 (const void *ptr, int len) : len (len), ptr (ptr) { } 210 ber32 (uint32 val) : val (val) { }
256 data8 (const char *str) : len (strlen (str ? str : 0)), ptr ((void *)str) { }
257 data8 (const shstr &sh) : len (sh.length ()), ptr ((void *)&sh) { }
258};
259 211
260struct data16 212 static int encoded_size (uint32 val)
261{ 213 {
262 unsigned int len; 214 if (val >= (1 << 7*4)) return 5;
263 const void *ptr; 215 if (val >= (1 << 7*3)) return 4;
264 216 if (val >= (1 << 7*2)) return 3;
265 data16 (const void *ptr, int len) : len (len), ptr (ptr) { } 217 if (val >= (1 << 7*1)) return 2;
266 data16 (const char *str) : len (strlen (str ? str : 0)), ptr ((void *)str) { } 218 return 1;
267 data16 (const shstr &sh) : len (sh.length ()), ptr ((void *)&sh) { } 219 }
268}; 220};
269 221
270/* Contains the base information we use to make up a packet we want to send. */ 222/* Contains the base information we use to make up a packet we want to send. */
271struct packet 223struct packet
272{ 224{
… …
306 packet &operator <<(sint16 v) { return *this << (uint16)v; } 258 packet &operator <<(sint16 v) { return *this << (uint16)v; }
307 packet &operator <<(sint32 v) { return *this << (uint32)v; } 259 packet &operator <<(sint32 v) { return *this << (uint32)v; }
308 packet &operator <<(sint64 v) { return *this << (uint64)v; } 260 packet &operator <<(sint64 v) { return *this << (uint64)v; }
309 261
310 // checked 262 // checked
263 packet &operator <<(const ber32 v);
264
311 packet &operator <<(const data &v); 265 packet &operator <<(const data_n &v);
312 packet &operator <<(const data8 &v); 266 packet &operator <<(const data8 &v);
313 packet &operator <<(const data16 &v); 267 packet &operator <<(const data16 &v);
314 268
315 packet &operator <<(const char *v); 269 packet &operator <<(const char *v);
270 packet &operator <<(shstr_tmp sh) { return *this << data_n (sh); }
316 packet &operator <<(const shstr &sh) { return *this << data (&sh, sh.length ()); } 271 packet &operator <<(const std::string &s) { return *this << data_n (s.data (), s.size ()); }
317 272
318 void vprintf (const char *format, va_list ap); 273 void vprintf (const char *format, va_list ap);
319 274
320 void printf (const char *format, ...) 275 void printf (const char *format, ...) ecb_attribute ((format (printf, 2, 3)))
321 { 276 {
322 va_list ap; 277 va_list ap;
323 va_start (ap, format); 278 va_start (ap, format);
324 vprintf (format, ap); 279 vprintf (format, ap);
325 va_end (ap); 280 va_end (ap);
… …
329inline uint16 net_uint16 (uint8 *data) { return (data [0] << 8) | data [1]; } 284inline uint16 net_uint16 (uint8 *data) { return (data [0] << 8) | data [1]; }
330inline uint32 net_uint32 (uint8 *data) { return (net_uint16 (data) << 16) | net_uint16 (data + 2); } 285inline uint32 net_uint32 (uint8 *data) { return (net_uint16 (data) << 16) | net_uint16 (data + 2); }
331inline sint16 net_sint16 (uint8 *data) { return sint16 (net_uint16 (data)); } 286inline sint16 net_sint16 (uint8 *data) { return sint16 (net_uint16 (data)); }
332inline sint16 net_sint32 (uint8 *data) { return sint32 (net_uint32 (data)); } 287inline sint16 net_sint32 (uint8 *data) { return sint32 (net_uint32 (data)); }
333 288
334struct CS_Stats
335{
336 int ibytes; /* ibytes, obytes are bytes in, out */
337 int obytes;
338 short max_conn; /* Maximum connections received */
339 time_t time_start; /* When we started logging this */
340};
341
342extern CS_Stats cst_tot, cst_lst;
343
344#endif 289#endif
345 290

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines