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.25 by root, Thu Nov 5 15:57:16 2009 UTC vs.
Revision 1.37 by root, Sat Nov 17 23:33:18 2018 UTC

1/* 1/*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2018 Marc Alexander Lehmann / the Deliantra team
4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / 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 (©) 2002,2007 Mark Wedel & Crossfire Development Team 6 * Copyright (©) 2002 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 7 * Copyright (©) 1992 Frank Tore Johansen
7 * 8 *
8 * Deliantra is free software: you can redistribute it and/or modify it under 9 * Deliantra is free software: you can redistribute it and/or modify it under
9 * the terms of the Affero GNU General Public License as published by the 10 * the terms of the Affero GNU General Public License as published by the
10 * Free Software Foundation, either version 3 of the License, or (at your 11 * Free Software Foundation, either version 3 of the License, or (at your
11 * 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 Affero GNU General Public License 19 * You should have received a copy of the Affero GNU General Public License
19 * and the GNU General Public License along with this program. If not, see 20 * and the GNU General Public License along with this program. If not, see
20 * <http://www.gnu.org/licenses/>. 21 * <http://www.gnu.org/licenses/>.
21 * 22 *
22 * The authors can be reached via e-mail to <support@deliantra.net> 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.
… …
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 47//+GPL
48 48
49#include <cstdarg> 49#include <cstdarg>
50
51#include "compiler.h"
50 52
51/* Maximum size of any packet we expect. 53/* Maximum size of any packet we expect.
52 * 54 *
53 * The size must be the same in the server and the client (stupid). 55 * The size must be the same in the server and the client (stupid).
54 * TODO: make the actual network configurable per client and use 2**16. 56 * TODO: make the actual network configurable per client and use 2**16.
… …
57 59
58#define CS_QUERY_YESNO 0x1 /* Yes/no question */ 60#define CS_QUERY_YESNO 0x1 /* Yes/no question */
59#define CS_QUERY_SINGLECHAR 0x2 /* Single character response expected */ 61#define CS_QUERY_SINGLECHAR 0x2 /* Single character response expected */
60#define CS_QUERY_HIDEINPUT 0x4 /* Hide input being entered */ 62#define CS_QUERY_HIDEINPUT 0x4 /* Hide input being entered */
61 63
62/* These are multiplication values that should be used when changing 64/* These are multiplication values that should be used when changing
63 * floats to ints, and vice version. MULTI is integer representatin 65 * floats to ints, and vice version. MULTI is integer representatin
64 * (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.
65 */ 67 */
66#define FLOAT_MULTI 100000 68#define FLOAT_MULTI 100000
67#define FLOAT_MULTF 100000.0 69#define FLOAT_MULTF 100000.0
… …
119#define CS_STAT_RES_DEPLETE 114 121#define CS_STAT_RES_DEPLETE 114
120#define CS_STAT_RES_DEATH 115 122#define CS_STAT_RES_DEATH 115
121#define CS_STAT_RES_HOLYWORD 116 123#define CS_STAT_RES_HOLYWORD 116
122#define CS_STAT_RES_BLIND 117 124#define CS_STAT_RES_BLIND 117
123 125
124/* Start & end of skill experience + skill level, inclusive. */
125#define CS_STAT_SKILLEXP_START 118
126#define CS_STAT_SKILLEXP_END 129
127#define CS_STAT_SKILLEXP_AGILITY 118
128#define CS_STAT_SKILLEXP_AGLEVEL 119
129#define CS_STAT_SKILLEXP_PERSONAL 120
130#define CS_STAT_SKILLEXP_PELEVEL 121
131#define CS_STAT_SKILLEXP_MENTAL 122
132#define CS_STAT_SKILLEXP_MELEVEL 123
133#define CS_STAT_SKILLEXP_PHYSIQUE 124
134#define CS_STAT_SKILLEXP_PHLEVEL 125
135#define CS_STAT_SKILLEXP_MAGIC 126
136#define CS_STAT_SKILLEXP_MALEVEL 127
137#define CS_STAT_SKILLEXP_WISDOM 128
138#define CS_STAT_SKILLEXP_WILEVEL 129
139
140/* 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
141 * 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
142 * 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
143 * 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
144 * can have some idea how many skill categories there may be. 130 * can have some idea how many skill categories there may be.
… …
191#define UPD_NROF 0x80 177#define UPD_NROF 0x80
192 178
193/* The flag values sent by the updspell command */ 179/* The flag values sent by the updspell command */
194#define UPD_SP_MANA 0x01 180#define UPD_SP_MANA 0x01
195#define UPD_SP_GRACE 0x02 181#define UPD_SP_GRACE 0x02
196#define UPD_SP_DAMAGE 0x04 182#define UPD_SP_LEVEL 0x04 // was UPD_SP_DAMAGE in <= server 2.93, client 2.10
197 183
198#define SOUND_NORMAL 0 184#define SOUND_NORMAL 0
199#define SOUND_SPELL 1 185#define SOUND_SPELL 1
200 186
201//-GPL 187//-GPL
202 188
189template<int unique>
203struct data 190struct databuf
204{ 191{
205 unsigned int len; 192 unsigned int len;
206 const void *ptr; 193 const void *ptr;
207 194
208 data (const void *ptr, int len) : len (len), ptr (ptr) { } 195 databuf (const void *ptr, int len) : len (len), ptr (ptr) { }
209 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) { }
210 data (shstr_tmp sh) : len (sh.length ()), ptr ((void *)&sh) { } 197 databuf (shstr_tmp sh) : len (sh.length ()), ptr ((void *)&sh) { }
211 data (dynbuf &buf) : len (buf.size ()), ptr (buf.linearise ()) { } 198 databuf (dynbuf &buf) : len (buf.size ()), ptr (buf.linearise ()) { }
212}; 199};
213 200
214struct data8 201using data_n = databuf<0>;
215{ 202using data8 = databuf<1>;
216 unsigned int len; 203using data16 = databuf<2>;
217 const void *ptr;
218
219 data8 (const void *ptr, int len) : len (len), ptr (ptr) { }
220 data8 (const char *str) : len (strlen (str ? str : 0)), ptr ((void *)str) { }
221 data8 (shstr_tmp sh) : len (sh.length ()), ptr ((void *)&sh) { }
222 data8 (dynbuf &buf) : len (buf.size ()), ptr (buf.linearise ()) { }
223};
224
225struct data16
226{
227 unsigned int len;
228 const void *ptr;
229
230 data16 (const void *ptr, int len) : len (len), ptr (ptr) { }
231 data16 (const char *str) : len (strlen (str ? str : 0)), ptr ((void *)str) { }
232 data16 (shstr_tmp sh) : len (sh.length ()), ptr ((void *)&sh) { }
233 data16 (dynbuf &buf) : len (buf.size ()), ptr (buf.linearise ()) { }
234};
235 204
236struct ber32 205struct ber32
237{ 206{
238 enum { size = 5 }; // maximum length of an encoded ber32 207 enum { size = 5 }; // maximum length of an encoded ber32
239 uint32 val; 208 uint32 val;
… …
291 packet &operator <<(sint64 v) { return *this << (uint64)v; } 260 packet &operator <<(sint64 v) { return *this << (uint64)v; }
292 261
293 // checked 262 // checked
294 packet &operator <<(const ber32 v); 263 packet &operator <<(const ber32 v);
295 264
296 packet &operator <<(const data &v); 265 packet &operator <<(const data_n &v);
297 packet &operator <<(const data8 &v); 266 packet &operator <<(const data8 &v);
298 packet &operator <<(const data16 &v); 267 packet &operator <<(const data16 &v);
299 268
300 packet &operator <<(const char *v); 269 packet &operator <<(const char *v);
301 packet &operator <<(shstr_tmp sh) { return *this << data (sh); } 270 packet &operator <<(shstr_tmp sh) { return *this << data_n (sh); }
302 packet &operator <<(const std::string &s) { return *this << data (s.data (), s.size ()); } 271 packet &operator <<(const std::string &s) { return *this << data_n (s.data (), s.size ()); }
303 272
304 void vprintf (const char *format, va_list ap); 273 void vprintf (const char *format, va_list ap);
305 274
306 void printf (const char *format, ...) 275 void printf (const char *format, ...) ecb_attribute ((format (printf, 2, 3)))
307 { 276 {
308 va_list ap; 277 va_list ap;
309 va_start (ap, format); 278 va_start (ap, format);
310 vprintf (format, ap); 279 vprintf (format, ap);
311 va_end (ap); 280 va_end (ap);

Diff Legend

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