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.18 by root, Thu Aug 16 06:36:56 2007 UTC vs.
Revision 1.34 by root, Wed Nov 16 23:42:00 2016 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team 4 * 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 5 * Copyright (©) 2002 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992 Frank Tore Johansen
7 * 7 *
8 * Crossfire TRT is free software: you can redistribute it and/or modify 8 * 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 9 * the terms of the Affero GNU General Public License as published by the
10 * the Free Software Foundation, either version 3 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your option) any later version. 11 * option) any later version.
12 * 12 *
13 * This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details. 16 * GNU General Public License for more details.
17 * 17 *
18 * You should have received a copy of the GNU General Public License 18 * You should have received a copy of the Affero GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>. 19 * and the GNU General Public License along with this program. If not, see
20 * <http://www.gnu.org/licenses/>.
20 * 21 *
21 * The authors can be reached via e-mail to <crossfire@schmorp.de> 22 * The authors can be reached via e-mail to <support@deliantra.net>
22 */ 23 */
23 24
24/* This file defines various flags that both the new client and 25/* This file defines various flags that both the new client and
25 * newserver uses. These should never be changed, only expanded. 26 * newserver uses. These should never be changed, only expanded.
26 * Changing them will likely cause all old clients to not work properly. 27 * Changing them will likely cause all old clients to not work properly.
… …
37 * or server area. But keeping one common file should make things 38 * or server area. But keeping one common file should make things
38 * more reliable, as both the client and server will definately be 39 * more reliable, as both the client and server will definately be
39 * talking about the same values. 40 * talking about the same values.
40 */ 41 */
41 42
42
43#ifndef NETWORK_H 43#ifndef NETWORK_H
44#define NETWORK_H 44#define NETWORK_H
45 45
46//+GPL
47
46#include <cstdarg> 48#include <cstdarg>
47 49
50#include "compiler.h"
51
48/* Maximum size of any packet we expect. 52/* Maximum size of any packet we expect.
49 * 53 *
50 * The size must be the same in the server and the client (stupid). 54 * The size must be the same in the server and the client (stupid).
51 * TODO: make the actual network configurable per clietn and use 2**16. 55 * TODO: make the actual network configurable per client and use 2**16.
52 */ 56 */
53#define MAXSOCKBUF 10239 57#define MAXSOCKBUF 10239
54 58
55#define CS_QUERY_YESNO 0x1 /* Yes/no question */ 59#define CS_QUERY_YESNO 0x1 /* Yes/no question */
56#define CS_QUERY_SINGLECHAR 0x2 /* Single character response expected */ 60#define CS_QUERY_SINGLECHAR 0x2 /* Single character response expected */
… …
116#define CS_STAT_RES_DEPLETE 114 120#define CS_STAT_RES_DEPLETE 114
117#define CS_STAT_RES_DEATH 115 121#define CS_STAT_RES_DEATH 115
118#define CS_STAT_RES_HOLYWORD 116 122#define CS_STAT_RES_HOLYWORD 116
119#define CS_STAT_RES_BLIND 117 123#define CS_STAT_RES_BLIND 117
120 124
121/* Start & end of skill experience + skill level, inclusive. */
122#define CS_STAT_SKILLEXP_START 118
123#define CS_STAT_SKILLEXP_END 129
124#define CS_STAT_SKILLEXP_AGILITY 118
125#define CS_STAT_SKILLEXP_AGLEVEL 119
126#define CS_STAT_SKILLEXP_PERSONAL 120
127#define CS_STAT_SKILLEXP_PELEVEL 121
128#define CS_STAT_SKILLEXP_MENTAL 122
129#define CS_STAT_SKILLEXP_MELEVEL 123
130#define CS_STAT_SKILLEXP_PHYSIQUE 124
131#define CS_STAT_SKILLEXP_PHLEVEL 125
132#define CS_STAT_SKILLEXP_MAGIC 126
133#define CS_STAT_SKILLEXP_MALEVEL 127
134#define CS_STAT_SKILLEXP_WISDOM 128
135#define CS_STAT_SKILLEXP_WILEVEL 129
136
137/* CS_STAT_SKILLINFO is used as the starting index point. Skill number->name 125/* CS_STAT_SKILLINFO is used as the starting index point. Skill number->name
138 * map is generated dynamically for the client, so a bunch of entries will 126 * map is generated dynamically for the client, so a bunch of entries will
139 * be used here. CS_NUM_SKILLS does not match how many skills there really 127 * be used here. CS_NUM_SKILLS does not match how many skills there really
140 * are - instead, it is used as a range of values so that the client 128 * are - instead, it is used as a range of values so that the client
141 * can have some idea how many skill categories there may be. 129 * can have some idea how many skill categories there may be.
… …
149#define SF_FIREON 0x01 137#define SF_FIREON 0x01
150#define SF_RUNON 0x02 138#define SF_RUNON 0x02
151 139
152/* Flags for the item command */ 140/* Flags for the item command */
153enum {a_none, a_readied, a_wielded, a_worn, a_active, a_applied}; 141enum {a_none, a_readied, a_wielded, a_worn, a_active, a_applied};
142
154#define F_APPLIED 0x000F 143#define F_APPLIED 0x000F
155#define F_LOCATION 0x00F0 144#define F_LOCATION 0x00F0
156#define F_UNPAID 0x0200 145#define F_UNPAID 0x0200
157#define F_MAGIC 0x0400 146#define F_MAGIC 0x0400
158#define F_CURSED 0x0800 147#define F_CURSED 0x0800
… …
187#define UPD_NROF 0x80 176#define UPD_NROF 0x80
188 177
189/* The flag values sent by the updspell command */ 178/* The flag values sent by the updspell command */
190#define UPD_SP_MANA 0x01 179#define UPD_SP_MANA 0x01
191#define UPD_SP_GRACE 0x02 180#define UPD_SP_GRACE 0x02
192#define UPD_SP_DAMAGE 0x04 181#define UPD_SP_LEVEL 0x04 // was UPD_SP_DAMAGE in <= server 2.93, client 2.10
193 182
194#define SOUND_NORMAL 0 183#define SOUND_NORMAL 0
195#define SOUND_SPELL 1 184#define SOUND_SPELL 1
196 185
186//-GPL
187
197struct data 188struct data
198{ 189{
199 unsigned int len; 190 unsigned int len;
200 const void *ptr; 191 const void *ptr;
201 192
202 data (const void *ptr, int len) : len (len), ptr (ptr) { } 193 data (const void *ptr, int len) : len (len), ptr (ptr) { }
203 data (const char *str) : len (strlen (str ? str : 0)), ptr ((void *)str) { } 194 data (const char *str) : len (strlen (str ? str : 0)), ptr ((void *)str) { }
204 data (const shstr &sh) : len (sh.length ()), ptr ((void *)&sh) { } 195 data (shstr_tmp sh) : len (sh.length ()), ptr ((void *)&sh) { }
196 data (dynbuf &buf) : len (buf.size ()), ptr (buf.linearise ()) { }
205}; 197};
206 198
207struct data8 199struct data8
208{ 200{
209 unsigned int len; 201 unsigned int len;
210 const void *ptr; 202 const void *ptr;
211 203
212 data8 (const void *ptr, int len) : len (len), ptr (ptr) { } 204 data8 (const void *ptr, int len) : len (len), ptr (ptr) { }
213 data8 (const char *str) : len (strlen (str ? str : 0)), ptr ((void *)str) { } 205 data8 (const char *str) : len (strlen (str ? str : 0)), ptr ((void *)str) { }
214 data8 (const shstr &sh) : len (sh.length ()), ptr ((void *)&sh) { } 206 data8 (shstr_tmp sh) : len (sh.length ()), ptr ((void *)&sh) { }
207 data8 (dynbuf &buf) : len (buf.size ()), ptr (buf.linearise ()) { }
215}; 208};
216 209
217struct data16 210struct data16
218{ 211{
219 unsigned int len; 212 unsigned int len;
220 const void *ptr; 213 const void *ptr;
221 214
222 data16 (const void *ptr, int len) : len (len), ptr (ptr) { } 215 data16 (const void *ptr, int len) : len (len), ptr (ptr) { }
223 data16 (const char *str) : len (strlen (str ? str : 0)), ptr ((void *)str) { } 216 data16 (const char *str) : len (strlen (str ? str : 0)), ptr ((void *)str) { }
224 data16 (const shstr &sh) : len (sh.length ()), ptr ((void *)&sh) { } 217 data16 (shstr_tmp sh) : len (sh.length ()), ptr ((void *)&sh) { }
218 data16 (dynbuf &buf) : len (buf.size ()), ptr (buf.linearise ()) { }
225}; 219};
226 220
227struct ber32 221struct ber32
228{ 222{
229 enum { size = 5 }; // maximum length of an encoded ber32 223 enum { size = 5 }; // maximum length of an encoded ber32
… …
287 packet &operator <<(const data &v); 281 packet &operator <<(const data &v);
288 packet &operator <<(const data8 &v); 282 packet &operator <<(const data8 &v);
289 packet &operator <<(const data16 &v); 283 packet &operator <<(const data16 &v);
290 284
291 packet &operator <<(const char *v); 285 packet &operator <<(const char *v);
292 packet &operator <<(const shstr &sh) { return *this << data (&sh, sh.length ()); } 286 packet &operator <<(shstr_tmp sh) { return *this << data (sh); }
293 packet &operator <<(const std::string &s) { return *this << data (s.data (), s.size ()); } 287 packet &operator <<(const std::string &s) { return *this << data (s.data (), s.size ()); }
294 288
295 void vprintf (const char *format, va_list ap); 289 void vprintf (const char *format, va_list ap);
296 290
297 void printf (const char *format, ...) 291 void printf (const char *format, ...) attribute ((format (printf, 2, 3)))
298 { 292 {
299 va_list ap; 293 va_list ap;
300 va_start (ap, format); 294 va_start (ap, format);
301 vprintf (format, ap); 295 vprintf (format, ap);
302 va_end (ap); 296 va_end (ap);

Diff Legend

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