1 | /* |
|
|
2 | * static char *rcsid_player_c = |
|
|
3 | * "$Id: player.C,v 1.9 2006/08/29 07:34:00 root Exp $"; |
|
|
4 | */ |
|
|
5 | |
|
|
6 | /* |
1 | /* |
7 | CrossFire, A Multiplayer game for X-windows |
2 | CrossFire, A Multiplayer game for X-windows |
8 | |
3 | |
9 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
4 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
10 | Copyright (C) 1992 Frank Tore Johansen |
5 | Copyright (C) 1992 Frank Tore Johansen |
… | |
… | |
21 | |
16 | |
22 | You should have received a copy of the GNU General Public License |
17 | You should have received a copy of the GNU General Public License |
23 | along with this program; if not, write to the Free Software |
18 | along with this program; if not, write to the Free Software |
24 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
25 | |
20 | |
26 | The author can be reached via e-mail to crossfire-devel@real-time.com |
21 | The author can be reached via e-mail to <crossfire@schmorp.de> |
27 | */ |
22 | */ |
28 | |
23 | |
29 | #include <global.h> |
24 | #include <global.h> |
30 | #ifndef WIN32 /* ---win32 remove headers */ |
|
|
31 | #include <pwd.h> |
25 | #include <pwd.h> |
32 | #endif |
|
|
33 | #ifndef __CEXTRACT__ |
|
|
34 | #include <sproto.h> |
26 | #include <sproto.h> |
35 | #endif |
|
|
36 | #include <sounds.h> |
27 | #include <sounds.h> |
37 | #include <living.h> |
28 | #include <living.h> |
38 | #include <object.h> |
29 | #include <object.h> |
39 | #include <spells.h> |
30 | #include <spells.h> |
40 | #include <skills.h> |
31 | #include <skills.h> |
41 | #include <newclient.h> |
|
|
42 | |
32 | |
43 | #ifdef COZY_SERVER |
33 | #include <algorithm> |
44 | extern int same_party (partylist *a, partylist *b); |
34 | #include <functional> |
45 | #endif |
|
|
46 | |
35 | |
|
|
36 | player * |
47 | player *find_player(const char *plname) |
37 | find_player (const char *plname) |
48 | { |
38 | { |
49 | player *pl; |
39 | player *pl; |
|
|
40 | |
50 | for(pl=first_player;pl!=NULL;pl=pl->next) |
41 | for (pl = first_player; pl; pl = pl->next) |
51 | { |
|
|
52 | if(pl->ob != NULL && !strcmp(query_name(pl->ob),plname)) |
42 | if (pl->ob && !strcmp (query_name (pl->ob), plname)) |
53 | return pl; |
43 | return pl; |
54 | }; |
44 | |
55 | return NULL; |
45 | return 0; |
56 | } |
46 | } |
57 | |
47 | |
58 | player* find_player_partial_name( const char* plname ) |
48 | void |
|
|
49 | display_motd (const object *op) |
|
|
50 | { |
|
|
51 | char buf[MAX_BUF]; |
|
|
52 | char motd[HUGE_BUF]; |
|
|
53 | FILE *fp; |
|
|
54 | int comp; |
|
|
55 | int size; |
|
|
56 | |
|
|
57 | sprintf (buf, "%s/%s", settings.confdir, settings.motd); |
|
|
58 | if ((fp = open_and_uncompress (buf, 0, &comp)) == NULL) |
|
|
59 | return; |
|
|
60 | |
|
|
61 | motd[0] = '\0'; |
|
|
62 | size = 0; |
|
|
63 | |
|
|
64 | while (fgets (buf, MAX_BUF, fp)) |
59 | { |
65 | { |
60 | player* pl; |
66 | if (*buf == '#') |
61 | player* found = NULL; |
|
|
62 | size_t namelen = strlen( plname ); |
|
|
63 | for ( pl = first_player; pl != NULL; pl = pl->next ) |
|
|
64 | { |
|
|
65 | if ( strlen( pl->ob->name ) < namelen ) |
|
|
66 | continue; |
67 | continue; |
67 | |
68 | |
68 | if ( !strcmp( pl->ob->name, plname) ) |
69 | strncat (motd + size, buf, HUGE_BUF - size); |
69 | return pl; |
70 | size += strlen (buf); |
|
|
71 | } |
70 | |
72 | |
71 | if ( !strncasecmp( pl->ob->name, plname, namelen ) ) |
73 | draw_ext_info (NDI_UNIQUE | NDI_GREEN, 0, op, MSG_TYPE_MOTD, MSG_SUBTYPE_NONE, motd, NULL); |
|
|
74 | close_and_delete (fp, comp); |
|
|
75 | } |
|
|
76 | |
|
|
77 | void |
|
|
78 | send_rules (const object *op) |
|
|
79 | { |
|
|
80 | char buf[MAX_BUF]; |
|
|
81 | char rules[HUGE_BUF]; |
|
|
82 | FILE *fp; |
|
|
83 | int comp; |
|
|
84 | int size; |
|
|
85 | |
|
|
86 | sprintf (buf, "%s/%s", settings.confdir, settings.rules); |
|
|
87 | if ((fp = open_and_uncompress (buf, 0, &comp)) == NULL) |
|
|
88 | return; |
|
|
89 | |
|
|
90 | rules[0] = '\0'; |
|
|
91 | size = 0; |
|
|
92 | |
|
|
93 | while (fgets (buf, MAX_BUF, fp)) |
|
|
94 | { |
|
|
95 | if (*buf == '#') |
|
|
96 | continue; |
|
|
97 | |
|
|
98 | if (size + strlen (buf) >= HUGE_BUF) |
72 | { |
99 | { |
73 | if ( found ) |
100 | LOG (llevDebug, "Warning, rules size is > %d bytes.\n", HUGE_BUF); |
74 | return NULL; |
101 | break; |
|
|
102 | } |
75 | |
103 | |
76 | found = pl; |
104 | strncat (rules + size, buf, HUGE_BUF - size); |
|
|
105 | size += strlen (buf); |
|
|
106 | } |
|
|
107 | |
|
|
108 | draw_ext_info (NDI_UNIQUE | NDI_GREEN, 0, op, MSG_TYPE_ADMIN, MSG_TYPE_ADMIN_RULES, rules, NULL); |
|
|
109 | close_and_delete (fp, comp); |
|
|
110 | } |
|
|
111 | |
|
|
112 | void |
|
|
113 | send_news (const object *op) |
|
|
114 | { |
|
|
115 | char buf[MAX_BUF]; |
|
|
116 | char news[HUGE_BUF]; |
|
|
117 | char subject[MAX_BUF]; |
|
|
118 | FILE *fp; |
|
|
119 | int comp; |
|
|
120 | int size; |
|
|
121 | |
|
|
122 | sprintf (buf, "%s/%s", settings.confdir, settings.news); |
|
|
123 | if ((fp = open_and_uncompress (buf, 0, &comp)) == NULL) |
|
|
124 | return; |
|
|
125 | |
|
|
126 | news[0] = '\0'; |
|
|
127 | subject[0] = '\0'; |
|
|
128 | size = 0; |
|
|
129 | |
|
|
130 | while (fgets (buf, MAX_BUF, fp) != NULL) |
|
|
131 | { |
|
|
132 | if (*buf == '#') |
|
|
133 | continue; |
|
|
134 | |
|
|
135 | if (*buf == '%') |
|
|
136 | { /* send one news */ |
|
|
137 | if (size > 0) |
|
|
138 | draw_ext_info_format (NDI_UNIQUE | NDI_GREEN, 0, op, MSG_TYPE_ADMIN, MSG_TYPE_ADMIN_NEWS, "INFORMATION: %s\n%s", "%s\n%s", subject, news); /*send previously read news */ |
|
|
139 | strcpy (subject, buf + 1); |
|
|
140 | strip_endline (subject); |
|
|
141 | size = 0; |
|
|
142 | news[0] = '\0'; |
|
|
143 | } |
|
|
144 | else |
|
|
145 | { |
|
|
146 | if (size + strlen (buf) >= HUGE_BUF) |
|
|
147 | { |
|
|
148 | LOG (llevDebug, "Warning, one news item has size > %d bytes.\n", HUGE_BUF); |
|
|
149 | break; |
77 | } |
150 | } |
78 | } |
|
|
79 | return found; |
|
|
80 | } |
|
|
81 | |
|
|
82 | void display_motd(const object *op) { |
|
|
83 | char buf[MAX_BUF]; |
|
|
84 | char motd[HUGE_BUF]; |
|
|
85 | FILE *fp; |
|
|
86 | int comp; |
|
|
87 | int size; |
|
|
88 | |
|
|
89 | sprintf(buf, "%s/%s", settings.confdir, settings.motd); |
|
|
90 | if ((fp=open_and_uncompress(buf, 0, &comp)) == NULL) { |
|
|
91 | return; |
|
|
92 | } |
|
|
93 | motd[0]='\0'; |
|
|
94 | size=0; |
|
|
95 | while (fgets(buf, MAX_BUF, fp) != NULL) { |
|
|
96 | if( *buf == '#') |
|
|
97 | continue; |
|
|
98 | strncat(motd+size,buf,HUGE_BUF-size); |
|
|
99 | size+=strlen(buf); |
|
|
100 | } |
|
|
101 | draw_ext_info(NDI_UNIQUE | NDI_GREEN, 0, op, MSG_TYPE_MOTD, MSG_SUBTYPE_NONE, motd, NULL); |
|
|
102 | close_and_delete(fp, comp); |
|
|
103 | } |
|
|
104 | |
|
|
105 | void send_rules(const object *op) { |
|
|
106 | char buf[MAX_BUF]; |
|
|
107 | char rules[HUGE_BUF]; |
|
|
108 | FILE *fp; |
|
|
109 | int comp; |
|
|
110 | int size; |
|
|
111 | |
|
|
112 | sprintf(buf, "%s/%s", settings.confdir, settings.rules); |
|
|
113 | if ((fp=open_and_uncompress(buf, 0, &comp)) == NULL) { |
|
|
114 | return; |
|
|
115 | } |
|
|
116 | rules[0]='\0'; |
|
|
117 | size=0; |
|
|
118 | while (fgets(buf, MAX_BUF, fp) != NULL) { |
|
|
119 | if( *buf == '#') |
|
|
120 | continue; |
|
|
121 | if (size + strlen(buf)>=HUGE_BUF) |
|
|
122 | { |
|
|
123 | LOG(llevDebug, "Warning, rules size is > %d bytes.\n", HUGE_BUF); |
|
|
124 | break; |
|
|
125 | } |
|
|
126 | strncat(rules+size,buf,HUGE_BUF-size); |
|
|
127 | size+=strlen(buf); |
|
|
128 | } |
|
|
129 | draw_ext_info(NDI_UNIQUE | NDI_GREEN, 0, op, MSG_TYPE_ADMIN, MSG_TYPE_ADMIN_RULES, rules, NULL); |
|
|
130 | close_and_delete(fp, comp); |
|
|
131 | } |
|
|
132 | |
|
|
133 | void send_news(const object *op) { |
|
|
134 | char buf[MAX_BUF]; |
|
|
135 | char news[HUGE_BUF]; |
|
|
136 | char subject[MAX_BUF]; |
|
|
137 | FILE *fp; |
|
|
138 | int comp; |
|
|
139 | int size; |
|
|
140 | |
|
|
141 | sprintf(buf, "%s/%s", settings.confdir, settings.news); |
|
|
142 | if ((fp=open_and_uncompress(buf, 0, &comp)) == NULL) |
|
|
143 | return; |
|
|
144 | news[0]='\0'; |
|
|
145 | subject[0]='\0'; |
|
|
146 | size=0; |
|
|
147 | while (fgets(buf, MAX_BUF, fp) != NULL) { |
|
|
148 | if( *buf == '#') |
|
|
149 | continue; |
|
|
150 | if ( *buf =='%'){ /* send one news */ |
|
|
151 | if (size>0) |
|
|
152 | draw_ext_info_format(NDI_UNIQUE | NDI_GREEN, 0, op, |
|
|
153 | MSG_TYPE_ADMIN, MSG_TYPE_ADMIN_NEWS, |
|
|
154 | "INFORMATION: %s\n%s", |
|
|
155 | "%s\n%s", |
|
|
156 | subject, news); /*send previously read news*/ |
|
|
157 | strcpy(subject,buf+1); |
|
|
158 | strip_endline(subject); |
|
|
159 | size=0; |
|
|
160 | news[0]='\0'; |
|
|
161 | } |
|
|
162 | else{ |
|
|
163 | if (size + strlen(buf)>=HUGE_BUF) |
|
|
164 | { |
|
|
165 | LOG(llevDebug, "Warning, one news item has size > %d bytes.\n", HUGE_BUF); |
|
|
166 | break; |
|
|
167 | } |
|
|
168 | strncat(news+size,buf,HUGE_BUF-size); |
151 | strncat (news + size, buf, HUGE_BUF - size); |
169 | size+=strlen(buf); |
152 | size += strlen (buf); |
170 | } |
153 | } |
171 | } |
|
|
172 | |
154 | } |
|
|
155 | |
173 | draw_ext_info_format(NDI_UNIQUE | NDI_GREEN, 0, op, |
156 | draw_ext_info_format (NDI_UNIQUE | NDI_GREEN, 0, op, |
174 | MSG_TYPE_ADMIN, MSG_TYPE_ADMIN_NEWS, |
157 | MSG_TYPE_ADMIN, MSG_TYPE_ADMIN_NEWS, "INFORMATION: %s\n%s\n", "%s\n%s", subject, news); |
175 | "INFORMATION: %s\n%s\n", |
|
|
176 | "%s\n%s", |
|
|
177 | subject, news); |
|
|
178 | close_and_delete(fp, comp); |
158 | close_and_delete (fp, comp); |
179 | } |
159 | } |
180 | |
|
|
181 | int playername_ok(const char *cp) { |
|
|
182 | /* Don't allow - or _ as first character in the name */ |
|
|
183 | if (*cp == '-' || *cp == '_') return 0; |
|
|
184 | |
|
|
185 | for(;*cp!='\0';cp++) |
|
|
186 | if(!((*cp>='a'&&*cp<='z')||(*cp>='A'&&*cp<='Z'))&&*cp!='-'&&*cp!='_') |
|
|
187 | return 0; |
|
|
188 | return 1; |
|
|
189 | } |
|
|
190 | |
|
|
191 | /* This no longer sets the player map. Also, it now updates |
|
|
192 | * all the pointers so the caller doesn't need to do that. |
|
|
193 | * Caller is responsible for setting the correct map. |
|
|
194 | */ |
|
|
195 | |
|
|
196 | /* Redo this to do both get_player_ob and get_player. |
|
|
197 | * Hopefully this will be less bugfree and simpler. |
|
|
198 | * Returns the player structure. If 'p' is null, |
|
|
199 | * we create a new one. Otherwise, we recycle |
|
|
200 | * the one that is passed. |
|
|
201 | */ |
|
|
202 | static player* get_player(player *p) { |
|
|
203 | object *op=arch_to_object(get_player_archetype(NULL)); |
|
|
204 | int i; |
|
|
205 | |
|
|
206 | if (!p) { |
|
|
207 | p = (player *) malloc(sizeof(player)); |
|
|
208 | if(p==NULL) |
|
|
209 | fatal(OUT_OF_MEMORY); |
|
|
210 | |
|
|
211 | /* This adds the player in the linked list. There is extra |
|
|
212 | * complexity here because we want to add the new player at the |
|
|
213 | * end of the list - there is in fact no compelling reason that |
|
|
214 | * that needs to be done except for things like output of |
|
|
215 | * 'who'. |
|
|
216 | */ |
|
|
217 | player *tmp = first_player; |
|
|
218 | while(tmp!=NULL&&tmp->next!=NULL) |
|
|
219 | tmp=tmp->next; |
|
|
220 | if(tmp!=NULL) |
|
|
221 | tmp->next=p; |
|
|
222 | else |
|
|
223 | first_player=p; |
|
|
224 | |
|
|
225 | p->next = NULL; |
|
|
226 | } |
|
|
227 | |
|
|
228 | /* Clears basically the entire player structure except |
|
|
229 | * for next and socket. |
|
|
230 | */ |
|
|
231 | memset (static_cast<player_memset *>(p), 0, sizeof (player_memset)); |
|
|
232 | p->attachable_init (); //HACK |
|
|
233 | |
|
|
234 | /* There are some elements we want initialized to non zero value - |
|
|
235 | * we deal with that below this point. |
|
|
236 | */ |
|
|
237 | p->party=NULL; |
|
|
238 | p->outputs_sync=16; /* Every 2 seconds */ |
|
|
239 | p->outputs_count=1; /* Keeps present behaviour */ |
|
|
240 | p->unapply = unapply_nochoice; |
|
|
241 | p->Swap_First = -1; |
|
|
242 | |
|
|
243 | #ifdef AUTOSAVE |
|
|
244 | p->last_save_tick = 9999999; |
|
|
245 | #endif |
|
|
246 | |
|
|
247 | strcpy(p->savebed_map, first_map_path); /* Init. respawn position */ |
|
|
248 | |
|
|
249 | op->contr=p; /* this aren't yet in archetype */ |
|
|
250 | p->ob = op; |
|
|
251 | op->speed_left=0.5; |
|
|
252 | op->speed=1.0; |
|
|
253 | op->direction=5; /* So player faces south */ |
|
|
254 | op->stats.wc=2; |
|
|
255 | op->run_away = 25; /* Then we panick... */ |
|
|
256 | p->socket.monitor_spells = 0; /* Needed because esrv_update_spells( ) gets called by roll_stats */ |
|
|
257 | |
|
|
258 | roll_stats(op); |
|
|
259 | p->state=ST_ROLL_STAT; |
|
|
260 | clear_los(op); |
|
|
261 | |
|
|
262 | p->gen_sp_armour=10; |
|
|
263 | p->last_speed= -1; |
|
|
264 | p->shoottype=range_none; |
|
|
265 | p->bowtype=bow_normal; |
|
|
266 | p->petmode=pet_normal; |
|
|
267 | p->listening=10; |
|
|
268 | p->usekeys=containers; |
|
|
269 | p->last_weapon_sp= -1; |
|
|
270 | p->peaceful=1; /* default peaceful */ |
|
|
271 | p->do_los=1; |
|
|
272 | p->explore=0; |
|
|
273 | p->no_shout=0; /* default can shout */ |
|
|
274 | |
|
|
275 | strncpy(p->title, op->arch->clone.name, sizeof(p->title)-1); |
|
|
276 | p->title[sizeof(p->title)-1] = '\0'; |
|
|
277 | op->race = add_string (op->arch->clone.race); |
|
|
278 | |
|
|
279 | CLEAR_FLAG(op,FLAG_READY_SKILL); |
|
|
280 | |
|
|
281 | /* we need to clear these to -1 and not zero - otherwise, |
|
|
282 | * if a player quits and starts a new character, we wont |
|
|
283 | * send new values to the client, as things like exp start |
|
|
284 | * at zero. |
|
|
285 | */ |
|
|
286 | for (i=0; i < NUM_SKILLS; i++) { |
|
|
287 | p->last_skill_exp[i] = -1; |
|
|
288 | p->last_skill_ob[i] = NULL; |
|
|
289 | } |
|
|
290 | for (i=0; i < NROFATTACKS; i++) { |
|
|
291 | p->last_resist[i] = -1; |
|
|
292 | } |
|
|
293 | p->last_stats.exp = -1; |
|
|
294 | p->last_weight = (uint32)-1; |
|
|
295 | |
|
|
296 | p->socket.update_look=0; |
|
|
297 | p->socket.look_position=0; |
|
|
298 | return p; |
|
|
299 | } |
|
|
300 | |
|
|
301 | |
160 | |
302 | /* This loads the first map an puts the player on it. */ |
161 | /* This loads the first map an puts the player on it. */ |
|
|
162 | static void |
303 | static void set_first_map(object *op) |
163 | set_first_map (object *op) |
304 | { |
164 | { |
305 | strcpy(op->contr->maplevel, first_map_path); |
165 | strcpy (op->contr->maplevel, first_map_path); |
306 | op->x = -1; |
166 | op->x = -1; |
307 | op->y = -1; |
167 | op->y = -1; |
308 | enter_exit(op, NULL); |
168 | enter_exit (op, 0); |
309 | } |
169 | } |
310 | |
170 | |
|
|
171 | // connect the player with a specific client |
|
|
172 | // also changed, rationalises, and fixes some incorrect settings |
|
|
173 | void |
|
|
174 | player::connect (client *ns) |
|
|
175 | { |
|
|
176 | this->ns = ns; |
|
|
177 | ns->pl = this; |
|
|
178 | |
|
|
179 | next = first_player; |
|
|
180 | first_player = this; |
|
|
181 | |
|
|
182 | ns->update_look = 0; |
|
|
183 | ns->look_position = 0; |
|
|
184 | |
|
|
185 | clear_los (ob); |
|
|
186 | |
|
|
187 | ob->type = PLAYER; // we are paranoid |
|
|
188 | ob->race = ob->arch->clone.race; |
|
|
189 | |
|
|
190 | if (!legal_range (ob, shoottype)) |
|
|
191 | shoottype = range_none; |
|
|
192 | |
|
|
193 | ob->carrying = sum_weight (ob); |
|
|
194 | link_player_skills (ob); |
|
|
195 | |
|
|
196 | CLEAR_FLAG (ob, FLAG_NO_FIX_PLAYER); |
|
|
197 | ob->update_stats (); |
|
|
198 | update_ob_speed (ob); |
|
|
199 | |
|
|
200 | assign (title, ob->arch->clone.name); |
|
|
201 | |
|
|
202 | /* can_use_shield is a new flag. However, the can_use.. seems to largely come |
|
|
203 | * from the class, and not race. I don't see any way to get the class information |
|
|
204 | * to then update this. I don't think this will actually break anything - anyone |
|
|
205 | * that can use armour should be able to use a shield. What this may 'break' |
|
|
206 | * are features new characters get, eg, if someone starts up with a Q, they |
|
|
207 | * should be able to use a shield. However, old Q's won't get that advantage. |
|
|
208 | */ |
|
|
209 | if (QUERY_FLAG (ob, FLAG_USE_ARMOUR)) |
|
|
210 | SET_FLAG (ob, FLAG_USE_SHIELD); |
|
|
211 | |
|
|
212 | /* if it's a dragon player, set the correct title here */ |
|
|
213 | if (is_dragon_pl (ob)) |
|
|
214 | { |
|
|
215 | object *tmp, *abil = 0, *skin = 0; |
|
|
216 | |
|
|
217 | shstr_cmp dragon_ability_force ("dragon_ability_force"); |
|
|
218 | shstr_cmp dragon_skin_force ("dragon_skin_force"); |
|
|
219 | |
|
|
220 | for (tmp = ob->inv; tmp; tmp = tmp->below) |
|
|
221 | if (tmp->type == FORCE) |
|
|
222 | if (tmp->arch->name == dragon_ability_force) |
|
|
223 | abil = tmp; |
|
|
224 | else if (tmp->arch->name == dragon_skin_force) |
|
|
225 | skin = tmp; |
|
|
226 | |
|
|
227 | set_dragon_name (ob, abil, skin); |
|
|
228 | } |
|
|
229 | |
|
|
230 | CLEAR_FLAG (ob, FLAG_FRIENDLY); |
|
|
231 | add_friendly_object (ob); |
|
|
232 | |
|
|
233 | LOG (llevInfo, "LOGIN: Player named %s from ip %s\n", &ob->name, ns->host); |
|
|
234 | |
|
|
235 | new_draw_info (NDI_UNIQUE, 0, ob, "Welcome Back!"); |
|
|
236 | new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_DK_ORANGE, 5, NULL, "%s has entered the game.", &ob->name); |
|
|
237 | |
|
|
238 | ns->floorbox_update (); |
|
|
239 | |
|
|
240 | esrv_new_player (this, ob->weight + ob->carrying); |
|
|
241 | esrv_send_inventory (ob, ob); |
|
|
242 | esrv_add_spells (this, 0); |
|
|
243 | |
|
|
244 | enter_exit (ob, 0); |
|
|
245 | |
|
|
246 | // send_rules (ob);//TODO |
|
|
247 | // send_news (ob);//TODO |
|
|
248 | // display_motd (ob);//TODO |
|
|
249 | INVOKE_PLAYER (LOGIN, this); |
|
|
250 | } |
|
|
251 | |
|
|
252 | // the need for this function can be explained |
|
|
253 | // by load_object not returning the object |
|
|
254 | void |
|
|
255 | player::set_object (object *op) |
|
|
256 | { |
|
|
257 | ob = op; |
|
|
258 | ob->contr = this; /* this aren't yet in archetype */ |
|
|
259 | |
|
|
260 | ob->speed_left = 0.5; |
|
|
261 | ob->speed = 1.0; |
|
|
262 | ob->direction = 5; /* So player faces south */ |
|
|
263 | ob->stats.wc = 2; |
|
|
264 | ob->run_away = 25; /* Then we panick... */ |
|
|
265 | |
|
|
266 | set_first_map (ob); |
|
|
267 | |
|
|
268 | ob->roll_stats (); |
|
|
269 | } |
|
|
270 | |
|
|
271 | player::player () |
|
|
272 | { |
|
|
273 | /* There are some elements we want initialized to non zero value - |
|
|
274 | * we deal with that below this point. |
|
|
275 | */ |
|
|
276 | outputs_sync = 16; /* Every 2 seconds */ |
|
|
277 | outputs_count = 8; /* Keeps present behaviour */ |
|
|
278 | unapply = unapply_nochoice; |
|
|
279 | |
|
|
280 | assign (savebed_map, first_map_path); /* Init. respawn position */ |
|
|
281 | |
|
|
282 | gen_sp_armour = 10; |
|
|
283 | last_speed = -1; |
|
|
284 | shoottype = range_none; |
|
|
285 | bowtype = bow_normal; |
|
|
286 | petmode = pet_normal; |
|
|
287 | listening = 10; |
|
|
288 | usekeys = containers; |
|
|
289 | last_weapon_sp = -1; |
|
|
290 | peaceful = 1; /* default peaceful */ |
|
|
291 | do_los = 1; |
|
|
292 | |
|
|
293 | /* we need to clear these to -1 and not zero - otherwise, |
|
|
294 | * if a player quits and starts a new character, we wont |
|
|
295 | * send new values to the client, as things like exp start |
|
|
296 | * at zero. |
|
|
297 | */ |
|
|
298 | for (int i = 0; i < NUM_SKILLS; i++) |
|
|
299 | last_skill_exp[i] = -1; |
|
|
300 | |
|
|
301 | for (int i = 0; i < NROFATTACKS; i++) |
|
|
302 | last_resist[i] = -1; |
|
|
303 | |
|
|
304 | last_stats.exp = -1; |
|
|
305 | last_weight = (uint32) - 1; |
|
|
306 | } |
|
|
307 | |
|
|
308 | player::~player () |
|
|
309 | { |
|
|
310 | terminate_all_pets (ob); |
|
|
311 | |
|
|
312 | if (first_player != this) |
|
|
313 | { |
|
|
314 | player *prev = first_player; |
|
|
315 | |
|
|
316 | while (prev && prev->next && prev->next != this) |
|
|
317 | prev = prev->next; |
|
|
318 | |
|
|
319 | if (prev->next != this) |
|
|
320 | { |
|
|
321 | LOG (llevError, "Free_player: Can't find previous player.\n"); |
|
|
322 | abort (); |
|
|
323 | } |
|
|
324 | |
|
|
325 | prev->next = next; |
|
|
326 | } |
|
|
327 | else |
|
|
328 | first_player = next; |
|
|
329 | |
|
|
330 | if (ob) |
|
|
331 | { |
|
|
332 | ob->contr = 0; |
|
|
333 | ob->destroy (1); |
|
|
334 | } |
|
|
335 | |
|
|
336 | if (ns) |
|
|
337 | { |
|
|
338 | ns->send_packet ("goodbye"); |
|
|
339 | ns->flush (); |
|
|
340 | ns->pl = 0; |
|
|
341 | ns->destroy (); |
|
|
342 | } |
|
|
343 | |
|
|
344 | /* Clear item stack */ |
|
|
345 | free (stack_items); |
|
|
346 | } |
|
|
347 | |
311 | /* Tries to add player on the connection passwd in ns. |
348 | /* Tries to add player on the connection passed in ns. |
312 | * All we can really get in this is some settings like host and display |
349 | * All we can really get in this is some settings like host and display |
313 | * mode. |
350 | * mode. |
314 | */ |
351 | */ |
|
|
352 | player * |
|
|
353 | player::create () |
|
|
354 | { |
|
|
355 | player *pl = new player; |
315 | |
356 | |
316 | int add_player(NewSocket *ns) { |
357 | pl->set_object (arch_to_object (get_player_archetype (0))); |
317 | player *p; |
|
|
318 | |
358 | |
319 | p=get_player(NULL); |
|
|
320 | p->socket = *ns; |
|
|
321 | p->socket.faces_sent = (uint8*) malloc(p->socket.faces_sent_len*sizeof(*p->socket.faces_sent)); |
|
|
322 | if(p->socket.faces_sent == NULL) |
|
|
323 | fatal(OUT_OF_MEMORY); |
|
|
324 | memcpy(p->socket.faces_sent, ns->faces_sent, p->socket.faces_sent_len*sizeof(*p->socket.faces_sent)); |
|
|
325 | /* Needed because the socket we just copied over needs to be cleared. |
|
|
326 | * Note that this can result in a client reset if there is partial data |
|
|
327 | * on the uncoming socket. |
|
|
328 | */ |
|
|
329 | p->socket.inbuf.len = 0; |
|
|
330 | set_first_map(p->ob); |
|
|
331 | |
|
|
332 | CLEAR_FLAG(p->ob, FLAG_FRIENDLY); |
|
|
333 | add_friendly_object(p->ob); |
|
|
334 | send_rules(p->ob); |
|
|
335 | send_news(p->ob); |
|
|
336 | display_motd(p->ob); |
|
|
337 | get_name(p->ob); |
|
|
338 | return 0; |
359 | return pl; |
339 | } |
360 | } |
340 | |
361 | |
341 | /* |
362 | /* |
342 | * get_player_archetype() return next player archetype from archetype |
363 | * get_player_archetype() return next player archetype from archetype |
343 | * list. Not very efficient routine, but used only creating new players. |
364 | * list. Not very efficient routine, but used only creating new players. |
344 | * Note: there MUST be at least one player archetype! |
365 | * Note: there MUST be at least one player archetype! |
345 | */ |
366 | */ |
|
|
367 | archetype * |
346 | archetype *get_player_archetype(archetype* at) |
368 | get_player_archetype (archetype *at) |
347 | { |
369 | { |
348 | archetype *start = at; |
370 | archetype *start = at; |
|
|
371 | |
349 | for (;;) { |
372 | for (;;) |
|
|
373 | { |
350 | if (at==NULL || at->next==NULL) |
374 | if (at == NULL || at->next == NULL) |
351 | at=first_archetype; |
375 | at = first_archetype; |
352 | else |
376 | else |
353 | at=at->next; |
377 | at = at->next; |
|
|
378 | |
354 | if(at->clone.type==PLAYER) |
379 | if (at->clone.type == PLAYER) |
355 | return at; |
380 | return at; |
|
|
381 | |
356 | if (at == start) { |
382 | if (at == start) |
|
|
383 | { |
357 | LOG (llevError, "No Player archetypes\n"); |
384 | LOG (llevError, "No Player archetypes\n"); |
358 | exit (-1); |
385 | exit (-1); |
359 | } |
386 | } |
360 | } |
387 | } |
361 | } |
388 | } |
362 | |
389 | |
363 | |
390 | object * |
364 | object *get_nearest_player(object *mon) { |
391 | get_nearest_player (object *mon) |
|
|
392 | { |
365 | object *op = NULL; |
393 | object *op = NULL; |
366 | player *pl = NULL; |
394 | player *pl = NULL; |
367 | objectlink *ol; |
395 | objectlink *ol; |
368 | unsigned lastdist; |
396 | unsigned lastdist; |
369 | rv_vector rv; |
397 | rv_vector rv; |
370 | |
398 | |
371 | for(ol=first_friendly_object,lastdist=1000;ol!=NULL;ol=ol->next) { |
399 | for (ol = first_friendly_object, lastdist = 1000; ol != NULL; ol = ol->next) |
|
|
400 | { |
372 | /* We should not find free objects on this friendly list, but it |
401 | /* We should not find free objects on this friendly list, but it |
373 | * does periodically happen. Given that, lets deal with it. |
402 | * does periodically happen. Given that, lets deal with it. |
374 | * While unlikely, it is possible the next object on the friendly |
403 | * While unlikely, it is possible the next object on the friendly |
375 | * list is also free, so encapsulate this in a while loop. |
404 | * list is also free, so encapsulate this in a while loop. |
376 | */ |
405 | */ |
377 | while (QUERY_FLAG(ol->ob, FLAG_FREED) || !QUERY_FLAG(ol->ob, FLAG_FRIENDLY)) { |
406 | while (QUERY_FLAG (ol->ob, FLAG_FREED) || !QUERY_FLAG (ol->ob, FLAG_FRIENDLY)) |
|
|
407 | { |
378 | object *tmp=ol->ob; |
408 | object *tmp = ol->ob; |
379 | |
409 | |
380 | /* Can't do much more other than log the fact, because the object |
410 | /* Can't do much more other than log the fact, because the object |
381 | * itself will have been cleared. |
411 | * itself will have been cleared. |
382 | */ |
412 | */ |
383 | LOG(llevDebug,"get_nearest_player: Found free/non friendly object on friendly list\n"); |
413 | LOG (llevDebug, "get_nearest_player: Found free/non friendly object on friendly list\n"); |
384 | ol = ol->next; |
414 | ol = ol->next; |
385 | remove_friendly_object(tmp); |
415 | remove_friendly_object (tmp); |
386 | if (!ol) return op; |
416 | if (!ol) |
387 | } |
417 | return op; |
|
|
418 | } |
388 | |
419 | |
389 | /* Remove special check for player from this. First, it looks to cause |
420 | /* Remove special check for player from this. First, it looks to cause |
390 | * some crashes (ol->ob->contr not set properly?), but secondly, a more |
421 | * some crashes (ol->ob->contr not set properly?), but secondly, a more |
391 | * complicated method of state checking would be needed in any case - |
422 | * complicated method of state checking would be needed in any case - |
392 | * as it was, a clever player could type quit, and the function would |
423 | * as it was, a clever player could type quit, and the function would |
393 | * skip them over while waiting for confirmation. Remove |
424 | * skip them over while waiting for confirmation. Remove |
394 | * on_same_map check, as can_detect_enemy also does this |
425 | * on_same_map check, as can_detect_enemy also does this |
395 | */ |
426 | */ |
396 | if (!can_detect_enemy(mon,ol->ob,&rv)) |
427 | if (!can_detect_enemy (mon, ol->ob, &rv)) |
397 | continue; |
428 | continue; |
398 | |
429 | |
399 | if(lastdist>rv.distance) { |
430 | if (lastdist > rv.distance) |
|
|
431 | { |
400 | op=ol->ob; |
432 | op = ol->ob; |
401 | lastdist=rv.distance; |
433 | lastdist = rv.distance; |
402 | } |
434 | } |
403 | } |
435 | } |
404 | for (pl=first_player; pl != NULL; pl=pl->next) { |
436 | for (pl = first_player; pl != NULL; pl = pl->next) |
|
|
437 | { |
405 | if (can_detect_enemy(mon, pl->ob,&rv)) { |
438 | if (can_detect_enemy (mon, pl->ob, &rv)) |
|
|
439 | { |
406 | |
440 | |
407 | if(lastdist>rv.distance) { |
441 | if (lastdist > rv.distance) |
408 | op=pl->ob; |
442 | { |
409 | lastdist=rv.distance; |
443 | op = pl->ob; |
410 | } |
444 | lastdist = rv.distance; |
411 | } |
445 | } |
|
|
446 | } |
412 | } |
447 | } |
413 | #if 0 |
448 | #if 0 |
414 | LOG(llevDebug,"get_nearest_player() finds player: %s\n",op?op->name:"(null)"); |
449 | LOG (llevDebug, "get_nearest_player() finds player: %s\n", op ? &op->name : "(null)"); |
415 | #endif |
450 | #endif |
416 | return op; |
451 | return op; |
417 | } |
452 | } |
418 | |
453 | |
419 | /* I believe this can safely go to 2, 3 is questionable, 4 will likely |
454 | /* I believe this can safely go to 2, 3 is questionable, 4 will likely |
420 | * result in a monster paths backtracking. It basically determines how large a |
455 | * result in a monster paths backtracking. It basically determines how large a |
421 | * detour a monster will take from the direction path when looking |
456 | * detour a monster will take from the direction path when looking |
… | |
… | |
435 | * circling behaviour. Unfortunately, this function is also used to determined |
470 | * circling behaviour. Unfortunately, this function is also used to determined |
436 | * if the creature should cast a spell, so returning a direction in that case |
471 | * if the creature should cast a spell, so returning a direction in that case |
437 | * is probably not a good thing. |
472 | * is probably not a good thing. |
438 | */ |
473 | */ |
439 | #define MAX_SPACES 50 |
474 | #define MAX_SPACES 50 |
440 | |
|
|
441 | |
475 | |
442 | /* |
476 | /* |
443 | * Returns the direction to the player, if valid. Returns 0 otherwise. |
477 | * Returns the direction to the player, if valid. Returns 0 otherwise. |
444 | * modified to verify there is a path to the player. Does this by stepping towards |
478 | * modified to verify there is a path to the player. Does this by stepping towards |
445 | * player and if path is blocked then see if blockage is close enough to player that |
479 | * player and if path is blocked then see if blockage is close enough to player that |
… | |
… | |
458 | * monster can in fact move one space in that direction. |
492 | * monster can in fact move one space in that direction. |
459 | * 3) I'm not sure how good this code will be for moving multipart monsters, |
493 | * 3) I'm not sure how good this code will be for moving multipart monsters, |
460 | * since only simple checks to blocked are being called, which could mean the monster |
494 | * since only simple checks to blocked are being called, which could mean the monster |
461 | * is blocking itself. |
495 | * is blocking itself. |
462 | */ |
496 | */ |
|
|
497 | int |
463 | int path_to_player(object *mon, object *pl, unsigned mindiff) { |
498 | path_to_player (object *mon, object *pl, unsigned mindiff) |
|
|
499 | { |
464 | rv_vector rv; |
500 | rv_vector rv; |
465 | sint16 x,y; |
501 | sint16 x, y; |
466 | int lastx,lasty,dir,i,diff, firstdir=0,lastdir, max=MAX_SPACES, mflags, blocked; |
502 | int lastx, lasty, dir, i, diff, firstdir = 0, lastdir, max = MAX_SPACES, mflags, blocked; |
467 | mapstruct *m ,*lastmap; |
503 | maptile *m, *lastmap; |
468 | |
504 | |
469 | get_rangevector(mon, pl, &rv, 0); |
505 | get_rangevector (mon, pl, &rv, 0); |
470 | |
506 | |
471 | if (rv.distance<mindiff) return 0; |
507 | if (rv.distance < mindiff) |
472 | |
|
|
473 | x=mon->x; |
|
|
474 | y=mon->y; |
|
|
475 | m=mon->map; |
|
|
476 | dir = rv.direction; |
|
|
477 | lastdir = firstdir = rv.direction; /* perhaps we stand next to pl, init firstdir too */ |
|
|
478 | diff = FABS(rv.distance_x)>FABS(rv.distance_y)?FABS(rv.distance_x):FABS(rv.distance_y); |
|
|
479 | /* If we can't solve it within the search distance, return now. */ |
|
|
480 | if (diff>max) return 0; |
|
|
481 | while (diff >1 && max>0) { |
|
|
482 | lastx = x; |
|
|
483 | lasty = y; |
|
|
484 | lastmap = m; |
|
|
485 | x = lastx + freearr_x[dir]; |
|
|
486 | y = lasty + freearr_y[dir]; |
|
|
487 | |
|
|
488 | mflags = get_map_flags(m, &m, x, y, &x, &y); |
|
|
489 | blocked = (mflags & P_OUT_OF_MAP) ? MOVE_ALL : GET_MAP_MOVE_BLOCK(m, x, y); |
|
|
490 | |
|
|
491 | /* Space is blocked - try changing direction a little */ |
|
|
492 | if ((mflags & P_OUT_OF_MAP) || ((OB_TYPE_MOVE_BLOCK(mon, blocked) || (mflags&P_BLOCKSVIEW)) |
|
|
493 | && (m == mon->map && blocked_link(mon, m, x, y)))) { |
|
|
494 | /* recalculate direction from last good location. Possible |
|
|
495 | * we were not traversing ideal location before. |
|
|
496 | */ |
|
|
497 | get_rangevector_from_mapcoord(lastmap, lastx, lasty, pl, &rv, 0); |
|
|
498 | if (rv.direction != dir) { |
|
|
499 | /* OK - says direction should be different - lets reset the |
|
|
500 | * the values so it will try again. |
|
|
501 | */ |
|
|
502 | x = lastx; |
|
|
503 | y = lasty; |
|
|
504 | m = lastmap; |
|
|
505 | dir = firstdir = rv.direction; |
|
|
506 | } else { |
|
|
507 | /* direct path is blocked - try taking a side step to |
|
|
508 | * either the left or right. |
|
|
509 | * Note increase the values in the loop below to be |
|
|
510 | * more than -1/1 respectively will mean the monster takes |
|
|
511 | * bigger detour. Have to be careful about these values getting |
|
|
512 | * too big (3 or maybe 4 or higher) as the monster may just try |
|
|
513 | * stepping back and forth |
|
|
514 | */ |
|
|
515 | for (i=-DETOUR_AMOUNT; i<=DETOUR_AMOUNT; i++) { |
|
|
516 | if (i==0) continue; /* already did this, so skip it */ |
|
|
517 | /* Use lastdir here - otherwise, |
|
|
518 | * since the direction that the creature should move in |
|
|
519 | * may change, you could get infinite loops. |
|
|
520 | * ie, player is northwest, but monster can only |
|
|
521 | * move west, so it does that. It goes some distance, |
|
|
522 | * gets blocked, finds that it should move north, |
|
|
523 | * can't do that, but now finds it can move east, and |
|
|
524 | * gets back to its original point. lastdir contains |
|
|
525 | * the last direction the creature has successfully |
|
|
526 | * moved. |
|
|
527 | */ |
|
|
528 | |
|
|
529 | x = lastx + freearr_x[absdir(lastdir+i)]; |
|
|
530 | y = lasty + freearr_y[absdir(lastdir+i)]; |
|
|
531 | m = lastmap; |
|
|
532 | mflags = get_map_flags(m, &m, x, y, &x, &y); |
|
|
533 | if (mflags & P_OUT_OF_MAP) continue; |
|
|
534 | blocked = GET_MAP_MOVE_BLOCK(m, x, y); |
|
|
535 | if (OB_TYPE_MOVE_BLOCK(mon, blocked)) continue; |
|
|
536 | if (mflags & P_BLOCKSVIEW) continue; |
|
|
537 | |
|
|
538 | if (m == mon->map && blocked_link(mon, m, x, y)) break; |
|
|
539 | } |
|
|
540 | /* go through entire loop without finding a valid |
|
|
541 | * sidestep to take - thus, no valid path. |
|
|
542 | */ |
|
|
543 | if (i==(DETOUR_AMOUNT+1)) |
|
|
544 | return 0; |
|
|
545 | diff--; |
|
|
546 | lastdir=dir; |
|
|
547 | max--; |
|
|
548 | if (!firstdir) firstdir = dir+i; |
|
|
549 | } /* else check alternate directions */ |
|
|
550 | } /* if blocked */ |
|
|
551 | else { |
|
|
552 | /* we moved towards creature, so diff is less */ |
|
|
553 | diff--; |
|
|
554 | max--; |
|
|
555 | lastdir=dir; |
|
|
556 | if (!firstdir) firstdir = dir; |
|
|
557 | } |
|
|
558 | if (diff<=1) { |
|
|
559 | /* Recalculate diff (distance) because we may not have actually |
|
|
560 | * headed toward player for entire distance. |
|
|
561 | */ |
|
|
562 | get_rangevector_from_mapcoord(m, x, y, pl, &rv, 0); |
|
|
563 | diff = FABS(rv.distance_x)>FABS(rv.distance_y)?FABS(rv.distance_x):FABS(rv.distance_y); |
|
|
564 | } |
|
|
565 | if (diff>max) return 0; |
|
|
566 | } |
|
|
567 | /* If we reached the max, didn't find a direction in time */ |
|
|
568 | if (!max) return 0; |
|
|
569 | |
|
|
570 | return firstdir; |
|
|
571 | } |
|
|
572 | |
|
|
573 | void give_initial_items(object *pl,treasurelist *items) { |
|
|
574 | object *op,*next=NULL; |
|
|
575 | |
|
|
576 | if(pl->randomitems!=NULL) |
|
|
577 | create_treasure(items,pl,GT_STARTEQUIP | GT_ONLY_GOOD,1,0); |
|
|
578 | |
|
|
579 | for (op=pl->inv; op; op=next) { |
|
|
580 | next = op->below; |
|
|
581 | |
|
|
582 | /* Forces get applied per default, unless they have the |
|
|
583 | * flag "neutral" set. Sorry but I can't think of a better way |
|
|
584 | */ |
|
|
585 | if(op->type==FORCE && !QUERY_FLAG(op, FLAG_NEUTRAL)) |
|
|
586 | SET_FLAG(op,FLAG_APPLIED); |
|
|
587 | |
|
|
588 | /* we never give weapons/armour if these cannot be used |
|
|
589 | * by this player due to race restrictions |
|
|
590 | */ |
|
|
591 | if (pl->type == PLAYER) { |
|
|
592 | if ((!QUERY_FLAG(pl, FLAG_USE_ARMOUR) && |
|
|
593 | (op->type == ARMOUR || op->type == BOOTS || |
|
|
594 | op->type == CLOAK || op->type == HELMET || |
|
|
595 | op->type == SHIELD || op->type == GLOVES || |
|
|
596 | op->type == BRACERS || op->type == GIRDLE)) || |
|
|
597 | (!QUERY_FLAG(pl, FLAG_USE_WEAPON) && op->type == WEAPON)) { |
|
|
598 | remove_ob (op); |
|
|
599 | free_object (op); |
|
|
600 | continue; |
|
|
601 | } |
|
|
602 | } |
|
|
603 | |
|
|
604 | /* This really needs to be better - we should really give |
|
|
605 | * a substitute spellbook. The problem is that we don't really |
|
|
606 | * have a good idea what to replace it with (need something like |
|
|
607 | * a first level treasurelist for each skill.) |
|
|
608 | * remove duplicate skills also |
|
|
609 | */ |
|
|
610 | if(op->type==SPELLBOOK || op->type == SKILL) { |
|
|
611 | object *tmp; |
|
|
612 | |
|
|
613 | for (tmp=op->below; tmp; tmp=tmp->below) |
|
|
614 | if (tmp->type == op->type && tmp->name == op->name) break; |
|
|
615 | |
|
|
616 | if (tmp) { |
|
|
617 | remove_ob(op); |
|
|
618 | free_object(op); |
|
|
619 | LOG(llevError,"give_initial_items: Removing duplicate object %s\n", |
|
|
620 | tmp->name); |
|
|
621 | continue; |
|
|
622 | } |
|
|
623 | if (op->nrof > 1) op->nrof = 1; |
|
|
624 | } |
|
|
625 | |
|
|
626 | if (op->type == SPELLBOOK && op->inv) { |
|
|
627 | CLEAR_FLAG(op->inv, FLAG_STARTEQUIP); |
|
|
628 | } |
|
|
629 | |
|
|
630 | /* Give starting characters identified, uncursed, and undamned |
|
|
631 | * items. Just don't identify gold or silver, or it won't be |
|
|
632 | * merged properly. |
|
|
633 | */ |
|
|
634 | if (need_identify(op)) { |
|
|
635 | SET_FLAG(op, FLAG_IDENTIFIED); |
|
|
636 | CLEAR_FLAG(op, FLAG_CURSED); |
|
|
637 | CLEAR_FLAG(op, FLAG_DAMNED); |
|
|
638 | } |
|
|
639 | if(op->type==SPELL) { |
|
|
640 | remove_ob(op); |
|
|
641 | free_object(op); |
|
|
642 | continue; |
|
|
643 | } |
|
|
644 | else if(op->type==SKILL) { |
|
|
645 | SET_FLAG(op, FLAG_CAN_USE_SKILL); |
|
|
646 | op->stats.exp = 0; |
|
|
647 | op->level = 1; |
|
|
648 | } |
|
|
649 | /* lock all 'normal items by default */ |
|
|
650 | else SET_FLAG(op, FLAG_INV_LOCKED); |
|
|
651 | } /* for loop of objects in player inv */ |
|
|
652 | |
|
|
653 | /* Need to set up the skill pointers */ |
|
|
654 | link_player_skills(pl); |
|
|
655 | } |
|
|
656 | |
|
|
657 | void get_name(object *op) { |
|
|
658 | op->contr->write_buf[0]='\0'; |
|
|
659 | op->contr->state=ST_GET_NAME; |
|
|
660 | send_query(&op->contr->socket,0,"What is your name?\n:"); |
|
|
661 | } |
|
|
662 | |
|
|
663 | void get_password(object *op) { |
|
|
664 | op->contr->write_buf[0]='\0'; |
|
|
665 | op->contr->state=ST_GET_PASSWORD; |
|
|
666 | send_query(&op->contr->socket,CS_QUERY_HIDEINPUT, "What is your password?\n:"); |
|
|
667 | } |
|
|
668 | |
|
|
669 | void play_again(object *op) |
|
|
670 | { |
|
|
671 | op->contr->state=ST_PLAY_AGAIN; |
|
|
672 | op->chosen_skill = NULL; |
|
|
673 | send_query(&op->contr->socket, CS_QUERY_SINGLECHAR, "Do you want to play again (a/q)?"); |
|
|
674 | /* a bit of a hack, but there are various places early in th |
|
|
675 | * player creation process that a user can quit (eg, roll |
|
|
676 | * stats) that isn't removing the player. Taking a quick |
|
|
677 | * look, there are many places that call play_again without |
|
|
678 | * removing the player - it probably makes more sense |
|
|
679 | * to leave it to play_again to remove the object in all |
|
|
680 | * cases. |
|
|
681 | */ |
|
|
682 | if (!QUERY_FLAG(op, FLAG_REMOVED)) |
|
|
683 | remove_ob(op); |
|
|
684 | /* Need to set this to null - otherwise, it could point to garbage, |
|
|
685 | * and draw() doesn't check to see if the player is removed, only if |
|
|
686 | * the map is null or not swapped out. |
|
|
687 | */ |
|
|
688 | op->map = NULL; |
|
|
689 | } |
|
|
690 | |
|
|
691 | |
|
|
692 | int receive_play_again(object *op, char key) |
|
|
693 | { |
|
|
694 | if(key=='q'||key=='Q') { |
|
|
695 | remove_friendly_object(op); |
|
|
696 | leave(op->contr,0); /* ericserver will draw the message */ |
|
|
697 | return 2; |
|
|
698 | } |
|
|
699 | else if(key=='a'||key=='A') { |
|
|
700 | player *pl = op->contr; |
|
|
701 | const char *name = op->name; |
|
|
702 | |
|
|
703 | add_refcount(name); |
|
|
704 | remove_friendly_object(op); |
|
|
705 | free_object(op); |
|
|
706 | pl = get_player(pl); |
|
|
707 | op = pl->ob; |
|
|
708 | add_friendly_object(op); |
|
|
709 | op->contr->password[0]='~'; |
|
|
710 | FREE_AND_CLEAR_STR(op->name); |
|
|
711 | FREE_AND_CLEAR_STR(op->name_pl); |
|
|
712 | |
|
|
713 | /* Lets put a space in here */ |
|
|
714 | new_draw_info(NDI_UNIQUE, 0, op, "\n"); |
|
|
715 | get_name(op); |
|
|
716 | op->name = name; /* Alrady added a refcount above */ |
|
|
717 | op->name_pl = add_string(name); |
|
|
718 | set_first_map(op); |
|
|
719 | } else { |
|
|
720 | /* user pressed something else so just ask again... */ |
|
|
721 | play_again(op); |
|
|
722 | } |
|
|
723 | return 0; |
508 | return 0; |
724 | } |
|
|
725 | |
509 | |
726 | void confirm_password(object *op) { |
510 | x = mon->x; |
|
|
511 | y = mon->y; |
|
|
512 | m = mon->map; |
|
|
513 | dir = rv.direction; |
|
|
514 | lastdir = firstdir = rv.direction; /* perhaps we stand next to pl, init firstdir too */ |
|
|
515 | diff = FABS (rv.distance_x) > FABS (rv.distance_y) ? FABS (rv.distance_x) : FABS (rv.distance_y); |
|
|
516 | /* If we can't solve it within the search distance, return now. */ |
|
|
517 | if (diff > max) |
|
|
518 | return 0; |
|
|
519 | while (diff > 1 && max > 0) |
|
|
520 | { |
|
|
521 | lastx = x; |
|
|
522 | lasty = y; |
|
|
523 | lastmap = m; |
|
|
524 | x = lastx + freearr_x[dir]; |
|
|
525 | y = lasty + freearr_y[dir]; |
727 | |
526 | |
728 | op->contr->write_buf[0]='\0'; |
527 | mflags = get_map_flags (m, &m, x, y, &x, &y); |
729 | op->contr->state=ST_CONFIRM_PASSWORD; |
528 | blocked = (mflags & P_OUT_OF_MAP) ? MOVE_ALL : GET_MAP_MOVE_BLOCK (m, x, y); |
730 | send_query(&op->contr->socket, CS_QUERY_HIDEINPUT, "Please type your password again.\n:"); |
|
|
731 | } |
|
|
732 | |
529 | |
|
|
530 | /* Space is blocked - try changing direction a little */ |
|
|
531 | if ((mflags & P_OUT_OF_MAP) || ((OB_TYPE_MOVE_BLOCK (mon, blocked) || (mflags & P_BLOCKSVIEW)) |
|
|
532 | && (m == mon->map && blocked_link (mon, m, x, y)))) |
|
|
533 | { |
|
|
534 | /* recalculate direction from last good location. Possible |
|
|
535 | * we were not traversing ideal location before. |
|
|
536 | */ |
|
|
537 | get_rangevector_from_mapcoord (lastmap, lastx, lasty, pl, &rv, 0); |
|
|
538 | if (rv.direction != dir) |
|
|
539 | { |
|
|
540 | /* OK - says direction should be different - lets reset the |
|
|
541 | * the values so it will try again. |
|
|
542 | */ |
|
|
543 | x = lastx; |
|
|
544 | y = lasty; |
|
|
545 | m = lastmap; |
|
|
546 | dir = firstdir = rv.direction; |
|
|
547 | } |
|
|
548 | else |
|
|
549 | { |
|
|
550 | /* direct path is blocked - try taking a side step to |
|
|
551 | * either the left or right. |
|
|
552 | * Note increase the values in the loop below to be |
|
|
553 | * more than -1/1 respectively will mean the monster takes |
|
|
554 | * bigger detour. Have to be careful about these values getting |
|
|
555 | * too big (3 or maybe 4 or higher) as the monster may just try |
|
|
556 | * stepping back and forth |
|
|
557 | */ |
|
|
558 | for (i = -DETOUR_AMOUNT; i <= DETOUR_AMOUNT; i++) |
|
|
559 | { |
|
|
560 | if (i == 0) |
|
|
561 | continue; /* already did this, so skip it */ |
|
|
562 | /* Use lastdir here - otherwise, |
|
|
563 | * since the direction that the creature should move in |
|
|
564 | * may change, you could get infinite loops. |
|
|
565 | * ie, player is northwest, but monster can only |
|
|
566 | * move west, so it does that. It goes some distance, |
|
|
567 | * gets blocked, finds that it should move north, |
|
|
568 | * can't do that, but now finds it can move east, and |
|
|
569 | * gets back to its original point. lastdir contains |
|
|
570 | * the last direction the creature has successfully |
|
|
571 | * moved. |
|
|
572 | */ |
|
|
573 | |
|
|
574 | x = lastx + freearr_x[absdir (lastdir + i)]; |
|
|
575 | y = lasty + freearr_y[absdir (lastdir + i)]; |
|
|
576 | m = lastmap; |
|
|
577 | mflags = get_map_flags (m, &m, x, y, &x, &y); |
|
|
578 | if (mflags & P_OUT_OF_MAP) |
|
|
579 | continue; |
|
|
580 | blocked = GET_MAP_MOVE_BLOCK (m, x, y); |
|
|
581 | if (OB_TYPE_MOVE_BLOCK (mon, blocked)) |
|
|
582 | continue; |
|
|
583 | if (mflags & P_BLOCKSVIEW) |
|
|
584 | continue; |
|
|
585 | |
|
|
586 | if (m == mon->map && blocked_link (mon, m, x, y)) |
|
|
587 | break; |
|
|
588 | } |
|
|
589 | /* go through entire loop without finding a valid |
|
|
590 | * sidestep to take - thus, no valid path. |
|
|
591 | */ |
|
|
592 | if (i == (DETOUR_AMOUNT + 1)) |
|
|
593 | return 0; |
|
|
594 | diff--; |
|
|
595 | lastdir = dir; |
|
|
596 | max--; |
|
|
597 | if (!firstdir) |
|
|
598 | firstdir = dir + i; |
|
|
599 | } /* else check alternate directions */ |
|
|
600 | } /* if blocked */ |
|
|
601 | else |
|
|
602 | { |
|
|
603 | /* we moved towards creature, so diff is less */ |
|
|
604 | diff--; |
|
|
605 | max--; |
|
|
606 | lastdir = dir; |
|
|
607 | if (!firstdir) |
|
|
608 | firstdir = dir; |
|
|
609 | } |
|
|
610 | if (diff <= 1) |
|
|
611 | { |
|
|
612 | /* Recalculate diff (distance) because we may not have actually |
|
|
613 | * headed toward player for entire distance. |
|
|
614 | */ |
|
|
615 | get_rangevector_from_mapcoord (m, x, y, pl, &rv, 0); |
|
|
616 | diff = FABS (rv.distance_x) > FABS (rv.distance_y) ? FABS (rv.distance_x) : FABS (rv.distance_y); |
|
|
617 | } |
|
|
618 | if (diff > max) |
|
|
619 | return 0; |
|
|
620 | } |
|
|
621 | /* If we reached the max, didn't find a direction in time */ |
|
|
622 | if (!max) |
|
|
623 | return 0; |
|
|
624 | |
|
|
625 | return firstdir; |
|
|
626 | } |
|
|
627 | |
|
|
628 | void |
|
|
629 | give_initial_items (object *pl, treasurelist * items) |
|
|
630 | { |
|
|
631 | object *op, *next = NULL; |
|
|
632 | |
|
|
633 | if (pl->randomitems != NULL) |
|
|
634 | create_treasure (items, pl, GT_STARTEQUIP | GT_ONLY_GOOD, 1, 0); |
|
|
635 | |
|
|
636 | for (op = pl->inv; op; op = next) |
|
|
637 | { |
|
|
638 | next = op->below; |
|
|
639 | |
|
|
640 | /* Forces get applied per default, unless they have the |
|
|
641 | * flag "neutral" set. Sorry but I can't think of a better way |
|
|
642 | */ |
|
|
643 | if (op->type == FORCE && !QUERY_FLAG (op, FLAG_NEUTRAL)) |
|
|
644 | SET_FLAG (op, FLAG_APPLIED); |
|
|
645 | |
|
|
646 | /* we never give weapons/armour if these cannot be used |
|
|
647 | * by this player due to race restrictions |
|
|
648 | */ |
|
|
649 | if (pl->type == PLAYER) |
|
|
650 | { |
|
|
651 | if ((!QUERY_FLAG (pl, FLAG_USE_ARMOUR) && |
|
|
652 | (op->type == ARMOUR || op->type == BOOTS || |
|
|
653 | op->type == CLOAK || op->type == HELMET || |
|
|
654 | op->type == SHIELD || op->type == GLOVES || |
|
|
655 | op->type == BRACERS || op->type == GIRDLE)) || (!QUERY_FLAG (pl, FLAG_USE_WEAPON) && op->type == WEAPON)) |
|
|
656 | { |
|
|
657 | op->destroy (); |
|
|
658 | continue; |
|
|
659 | } |
|
|
660 | } |
|
|
661 | |
|
|
662 | /* This really needs to be better - we should really give |
|
|
663 | * a substitute spellbook. The problem is that we don't really |
|
|
664 | * have a good idea what to replace it with (need something like |
|
|
665 | * a first level treasurelist for each skill.) |
|
|
666 | * remove duplicate skills also |
|
|
667 | */ |
|
|
668 | if (op->type == SPELLBOOK || op->type == SKILL) |
|
|
669 | { |
|
|
670 | object *tmp; |
|
|
671 | |
|
|
672 | for (tmp = op->below; tmp; tmp = tmp->below) |
|
|
673 | if (tmp->type == op->type && tmp->name == op->name) |
|
|
674 | break; |
|
|
675 | |
|
|
676 | if (tmp) |
|
|
677 | { |
|
|
678 | op->destroy (); |
|
|
679 | LOG (llevError, "give_initial_items: Removing duplicate object %s\n", &tmp->name); |
|
|
680 | continue; |
|
|
681 | } |
|
|
682 | |
|
|
683 | if (op->nrof > 1) |
|
|
684 | op->nrof = 1; |
|
|
685 | } |
|
|
686 | |
|
|
687 | if (op->type == SPELLBOOK && op->inv) |
|
|
688 | { |
|
|
689 | CLEAR_FLAG (op->inv, FLAG_STARTEQUIP); |
|
|
690 | } |
|
|
691 | |
|
|
692 | /* Give starting characters identified, uncursed, and undamned |
|
|
693 | * items. Just don't identify gold or silver, or it won't be |
|
|
694 | * merged properly. |
|
|
695 | */ |
|
|
696 | if (need_identify (op)) |
|
|
697 | { |
|
|
698 | SET_FLAG (op, FLAG_IDENTIFIED); |
|
|
699 | CLEAR_FLAG (op, FLAG_CURSED); |
|
|
700 | CLEAR_FLAG (op, FLAG_DAMNED); |
|
|
701 | } |
|
|
702 | if (op->type == SPELL) |
|
|
703 | { |
|
|
704 | op->destroy (); |
|
|
705 | continue; |
|
|
706 | } |
|
|
707 | else if (op->type == SKILL) |
|
|
708 | { |
|
|
709 | SET_FLAG (op, FLAG_CAN_USE_SKILL); |
|
|
710 | op->stats.exp = 0; |
|
|
711 | op->level = 1; |
|
|
712 | } |
|
|
713 | /* lock all 'normal items by default */ |
|
|
714 | else |
|
|
715 | SET_FLAG (op, FLAG_INV_LOCKED); |
|
|
716 | } /* for loop of objects in player inv */ |
|
|
717 | |
|
|
718 | /* Need to set up the skill pointers */ |
|
|
719 | link_player_skills (pl); |
|
|
720 | } |
|
|
721 | |
|
|
722 | void |
733 | void get_party_password(object *op, partylist *party) { |
723 | get_party_password (object *op, partylist *party) |
|
|
724 | { |
734 | if (party == NULL) { |
725 | if (party == NULL) |
|
|
726 | { |
735 | LOG(llevError, "get_party_password(): tried to make player %s join a NULL party", op->name); |
727 | LOG (llevError, "get_party_password(): tried to make player %s join a NULL party", &op->name); |
736 | return; |
728 | return; |
737 | } |
729 | } |
|
|
730 | |
738 | op->contr->write_buf[0]='\0'; |
731 | op->contr->write_buf[0] = '\0'; |
739 | op->contr->state=ST_GET_PARTY_PASSWORD; |
732 | op->contr->ns->state = ST_GET_PARTY_PASSWORD; |
740 | op->contr->party_to_join = party; |
733 | op->contr->party_to_join = party; |
741 | send_query(&op->contr->socket, CS_QUERY_HIDEINPUT, "What is the password?\n:"); |
734 | send_query (op->contr->ns, CS_QUERY_HIDEINPUT, "What is the password?\n:"); |
742 | } |
735 | } |
743 | |
|
|
744 | |
736 | |
745 | /* This rolls four 1-6 rolls and sums the best 3 of the 4. */ |
737 | /* This rolls four 1-6 rolls and sums the best 3 of the 4. */ |
|
|
738 | static int |
746 | int roll_stat(void) { |
739 | roll_stat (void) |
|
|
740 | { |
747 | int a[4],i,j,k; |
741 | int a[4], i, j, k; |
748 | |
742 | |
749 | for(i=0;i<4;i++) |
743 | for (i = 0; i < 4; i++) |
750 | a[i]=(int)RANDOM()%6+1; |
744 | a[i] = (int) RANDOM () % 6 + 1; |
751 | |
745 | |
752 | for(i=0,j=0,k=7;i<4;i++) |
746 | for (i = 0, j = 0, k = 7; i < 4; i++) |
753 | if(a[i]<k) |
747 | if (a[i] < k) |
754 | k=a[i],j=i; |
748 | k = a[i], j = i; |
755 | |
749 | |
756 | for(i=0,k=0;i<4;i++) { |
750 | for (i = 0, k = 0; i < 4; i++) |
757 | if(i!=j) |
751 | if (i != j) |
758 | k+=a[i]; |
752 | k += a[i]; |
759 | } |
753 | |
760 | return k; |
754 | return k; |
761 | } |
755 | } |
762 | |
756 | |
763 | void roll_stats(object *op) { |
757 | void |
764 | int sum=0; |
758 | object::roll_stats () |
765 | int i = 0, j = 0; |
759 | { |
766 | int statsort[7]; |
760 | int statsort [7]; |
767 | |
761 | |
|
|
762 | for (;;) |
768 | do { |
763 | { |
769 | op->stats.Str=roll_stat(); |
764 | int sum = 0; |
770 | op->stats.Dex=roll_stat(); |
765 | for (int i = 7; i--; ) |
771 | op->stats.Int=roll_stat(); |
766 | sum += statsort [i] = roll_stat (); |
772 | op->stats.Con=roll_stat(); |
|
|
773 | op->stats.Wis=roll_stat(); |
|
|
774 | op->stats.Pow=roll_stat(); |
|
|
775 | op->stats.Cha=roll_stat(); |
|
|
776 | sum=op->stats.Str+op->stats.Dex+op->stats.Int+ |
|
|
777 | op->stats.Con+op->stats.Wis+op->stats.Pow+ |
|
|
778 | op->stats.Cha; |
|
|
779 | } while(sum<82||sum>116); |
|
|
780 | |
767 | |
|
|
768 | if (sum >= 82 && sum <= 116) |
|
|
769 | break; |
|
|
770 | } |
|
|
771 | |
781 | /* Sort the stats so that rerolling is easier... */ |
772 | // Sort the stats so that rerolling is easier... |
782 | statsort[0] = op->stats.Str; |
773 | std::sort (statsort, statsort + 7, std::greater<int>()); |
783 | statsort[1] = op->stats.Dex; |
|
|
784 | statsort[2] = op->stats.Int; |
|
|
785 | statsort[3] = op->stats.Con; |
|
|
786 | statsort[4] = op->stats.Wis; |
|
|
787 | statsort[5] = op->stats.Pow; |
|
|
788 | statsort[6] = op->stats.Cha; |
|
|
789 | |
774 | |
790 | /* a quick and dirty bubblesort? */ |
|
|
791 | do { |
|
|
792 | if (statsort[i] < statsort[i + 1]) { |
|
|
793 | j = statsort[i]; |
|
|
794 | statsort[i] = statsort[i + 1]; |
|
|
795 | statsort[i + 1] = j; |
|
|
796 | i = 0; |
|
|
797 | } else { |
|
|
798 | i++; |
|
|
799 | } |
|
|
800 | } while (i < 6); |
|
|
801 | |
|
|
802 | op->stats.Str = statsort[0]; |
775 | stats.Str = statsort[0]; |
803 | op->stats.Dex = statsort[1]; |
776 | stats.Dex = statsort[1]; |
804 | op->stats.Con = statsort[2]; |
777 | stats.Con = statsort[2]; |
805 | op->stats.Int = statsort[3]; |
778 | stats.Int = statsort[3]; |
806 | op->stats.Wis = statsort[4]; |
779 | stats.Wis = statsort[4]; |
807 | op->stats.Pow = statsort[5]; |
780 | stats.Pow = statsort[5]; |
808 | op->stats.Cha = statsort[6]; |
781 | stats.Cha = statsort[6]; |
809 | |
782 | |
810 | |
|
|
811 | op->contr->orig_stats.Str=op->stats.Str; |
|
|
812 | op->contr->orig_stats.Dex=op->stats.Dex; |
|
|
813 | op->contr->orig_stats.Int=op->stats.Int; |
|
|
814 | op->contr->orig_stats.Con=op->stats.Con; |
|
|
815 | op->contr->orig_stats.Wis=op->stats.Wis; |
|
|
816 | op->contr->orig_stats.Pow=op->stats.Pow; |
|
|
817 | op->contr->orig_stats.Cha=op->stats.Cha; |
|
|
818 | |
|
|
819 | op->level=1; |
|
|
820 | op->stats.exp=0; |
783 | stats.exp = 0; |
821 | op->stats.ac=0; |
784 | stats.ac = 0; |
822 | |
785 | |
|
|
786 | stats.hp = stats.maxhp; |
|
|
787 | stats.sp = stats.maxsp; |
|
|
788 | stats.grace = stats.maxgrace; |
|
|
789 | |
|
|
790 | if (contr) |
|
|
791 | { |
823 | op->contr->levhp[1] = 9; |
792 | contr->levhp[1] = 9; |
824 | op->contr->levsp[1] = 6; |
793 | contr->levsp[1] = 6; |
825 | op->contr->levgrace[1] = 3; |
794 | contr->levgrace[1] = 3; |
826 | |
795 | |
827 | fix_player(op); |
|
|
828 | op->stats.hp = op->stats.maxhp; |
|
|
829 | op->stats.sp = op->stats.maxsp; |
|
|
830 | op->stats.grace = op->stats.maxgrace; |
|
|
831 | op->contr->orig_stats=op->stats; |
796 | contr->orig_stats = stats; |
832 | } |
|
|
833 | |
|
|
834 | void Roll_Again(object *op) |
|
|
835 | { |
|
|
836 | esrv_new_player(op->contr, 0); |
|
|
837 | send_query(&op->contr->socket,CS_QUERY_SINGLECHAR,"[y] to roll new stats [n] to use stats\n[1-7] [1-7] to swap stats.\nRoll again (y/n/1-7)? "); |
|
|
838 | } |
|
|
839 | |
|
|
840 | void Swap_Stat(object *op,int Swap_Second) |
|
|
841 | { |
|
|
842 | signed char tmp; |
|
|
843 | char buf[MAX_BUF]; |
|
|
844 | |
|
|
845 | if ( op->contr->Swap_First == -1 ) { |
|
|
846 | new_draw_info(NDI_UNIQUE, 0,op,"How the hell did you get here?!?!!!"); |
|
|
847 | new_draw_info(NDI_UNIQUE, 0,op,"Error in Swap_Stat code,"); |
|
|
848 | new_draw_info(NDI_UNIQUE, 0,op,"mail korg@rdt.monash.edu.au"); |
|
|
849 | return; |
|
|
850 | } |
|
|
851 | |
|
|
852 | tmp = get_attr_value(&op->contr->orig_stats, op->contr->Swap_First); |
|
|
853 | |
|
|
854 | set_attr_value(&op->contr->orig_stats, op->contr->Swap_First, |
|
|
855 | get_attr_value(&op->contr->orig_stats, Swap_Second)); |
|
|
856 | |
|
|
857 | set_attr_value(&op->contr->orig_stats, Swap_Second, tmp); |
|
|
858 | |
|
|
859 | sprintf(buf,"%s done\n", short_stat_name[Swap_Second]); |
|
|
860 | new_draw_info(NDI_UNIQUE, 0,op, buf); |
|
|
861 | op->stats.Str = op->contr->orig_stats.Str; |
|
|
862 | op->stats.Dex = op->contr->orig_stats.Dex; |
|
|
863 | op->stats.Con = op->contr->orig_stats.Con; |
|
|
864 | op->stats.Int = op->contr->orig_stats.Int; |
|
|
865 | op->stats.Wis = op->contr->orig_stats.Wis; |
|
|
866 | op->stats.Pow = op->contr->orig_stats.Pow; |
|
|
867 | op->stats.Cha = op->contr->orig_stats.Cha; |
|
|
868 | op->stats.ac=0; |
|
|
869 | |
|
|
870 | op->level=1; |
|
|
871 | op->stats.exp=0; |
|
|
872 | op->stats.ac=0; |
|
|
873 | |
|
|
874 | op->contr->levhp[1] = 9; |
|
|
875 | op->contr->levsp[1] = 6; |
|
|
876 | op->contr->levgrace[1] = 3; |
|
|
877 | |
|
|
878 | fix_player(op); |
|
|
879 | op->stats.hp = op->stats.maxhp; |
|
|
880 | op->stats.sp = op->stats.maxsp; |
|
|
881 | op->stats.grace = op->stats.maxgrace; |
|
|
882 | op->contr->orig_stats=op->stats; |
|
|
883 | op->contr->Swap_First=-1; |
|
|
884 | } |
|
|
885 | |
|
|
886 | |
|
|
887 | /* This code has been greatly reduced, because with set_attr_value |
|
|
888 | * and get_attr_value, the stats can be accessed just numeric |
|
|
889 | * ids. stat_trans is a table that translate the number entered |
|
|
890 | * into the actual stat. It is needed because the order the stats |
|
|
891 | * are displayed in the stat window is not the same as how |
|
|
892 | * the number's access that stat. The table does that translation. |
|
|
893 | */ |
|
|
894 | int key_roll_stat(object *op, char key) |
|
|
895 | { |
|
|
896 | int keynum = key -'0'; |
|
|
897 | char buf[MAX_BUF]; |
|
|
898 | static sint8 stat_trans[] = {-1, STR, DEX, CON, INT, WIS, POW, CHA}; |
|
|
899 | |
|
|
900 | if (keynum>0 && keynum<=7) { |
|
|
901 | if (op->contr->Swap_First==-1) { |
|
|
902 | op->contr->Swap_First=stat_trans[keynum]; |
|
|
903 | sprintf(buf,"%s ->", short_stat_name[stat_trans[keynum]]); |
|
|
904 | new_draw_info(NDI_UNIQUE, 0,op,buf); |
|
|
905 | } |
|
|
906 | else |
|
|
907 | Swap_Stat(op,stat_trans[keynum]); |
|
|
908 | |
|
|
909 | send_query(&op->contr->socket,CS_QUERY_SINGLECHAR,""); |
|
|
910 | return 1; |
|
|
911 | } |
|
|
912 | switch (key) { |
|
|
913 | case 'n': |
|
|
914 | case 'N': { |
|
|
915 | SET_FLAG(op, FLAG_WIZ); |
|
|
916 | if(op->map==NULL) { |
|
|
917 | LOG(llevError,"Map == NULL in state 2\n"); |
|
|
918 | break; |
|
|
919 | } |
797 | } |
|
|
798 | } |
920 | |
799 | |
921 | #if 0 |
800 | void |
922 | /* So that enter_exit will put us at startx/starty */ |
801 | object::swap_stats (int a, int b) |
923 | op->x= -1; |
802 | { |
|
|
803 | int tmp = get_attr_value (&contr->orig_stats, a); |
|
|
804 | set_attr_value (&contr->orig_stats, a, get_attr_value (&contr->orig_stats, b)); |
|
|
805 | set_attr_value (&contr->orig_stats, b, tmp); |
924 | |
806 | |
925 | enter_exit(op,NULL); |
807 | stats.Str = contr->orig_stats.Str; |
926 | #endif |
808 | stats.Dex = contr->orig_stats.Dex; |
927 | SET_ANIMATION(op, 2); /* So player faces south */ |
809 | stats.Con = contr->orig_stats.Con; |
928 | /* Enter exit adds a player otherwise */ |
810 | stats.Int = contr->orig_stats.Int; |
929 | add_statbonus(op); |
811 | stats.Wis = contr->orig_stats.Wis; |
930 | send_query(&op->contr->socket,CS_QUERY_SINGLECHAR,"Now choose a character.\nPress any key to change outlook.\nPress `d' when you're pleased.\n"); |
812 | stats.Pow = contr->orig_stats.Pow; |
931 | op->contr->state = ST_CHANGE_CLASS; |
813 | stats.Cha = contr->orig_stats.Cha; |
932 | if (op->msg) |
|
|
933 | new_draw_info(NDI_BLUE, 0, op, op->msg); |
|
|
934 | return 0; |
|
|
935 | } |
|
|
936 | case 'y': |
|
|
937 | case 'Y': |
|
|
938 | roll_stats(op); |
|
|
939 | send_query(&op->contr->socket,CS_QUERY_SINGLECHAR,""); |
|
|
940 | return 1; |
|
|
941 | |
814 | |
942 | case 'q': |
815 | //TODO: the following code looks so borked and should, at the very least, |
943 | case 'Q': |
816 | // be merged with the similar code in roll_stats |
944 | play_again(op); |
817 | stats.ac = 0; |
945 | return 1; |
|
|
946 | |
818 | |
947 | default: |
819 | level = 1; |
948 | send_query(&op->contr->socket,CS_QUERY_SINGLECHAR,"Yes, No, Quit or 1-6. Roll again?"); |
820 | stats.exp = 0; |
949 | return 0; |
821 | stats.ac = 0; |
|
|
822 | |
|
|
823 | stats.hp = stats.maxhp; |
|
|
824 | stats.sp = stats.maxsp; |
|
|
825 | stats.grace = stats.maxgrace; |
|
|
826 | |
|
|
827 | if (contr) |
950 | } |
828 | { |
951 | return 0; |
829 | contr->levhp[1] = 9; |
|
|
830 | contr->levsp[1] = 6; |
|
|
831 | contr->levgrace[1] = 3; |
|
|
832 | |
|
|
833 | contr->orig_stats = stats; |
|
|
834 | } |
952 | } |
835 | } |
953 | |
836 | |
954 | /* This function takes the key that is passed, and does the |
837 | /* This function takes the key that is passed, and does the |
955 | * appropriate action with it (change race, or other things). |
838 | * appropriate action with it (change race, or other things). |
956 | * The function name is for historical reasons - now we have |
839 | * The function name is for historical reasons - now we have |
957 | * separate race and class; this actually changes the RACE, |
840 | * separate race and class; this actually changes the RACE, |
958 | * not the class. |
841 | * not the class. |
959 | */ |
842 | */ |
960 | |
843 | int |
961 | int key_change_class(object *op, char key) |
844 | key_change_class (object *op, char key) |
962 | { |
845 | { |
963 | int tmp_loop; |
846 | int tmp_loop; |
964 | |
847 | |
965 | if(key=='q'||key=='Q') { |
|
|
966 | remove_ob(op); |
|
|
967 | play_again(op); |
|
|
968 | return 0; |
|
|
969 | } |
|
|
970 | if(key=='d'||key=='D') { |
848 | if (key == 'd' || key == 'D') |
|
|
849 | { |
971 | char buf[MAX_BUF]; |
850 | char buf[MAX_BUF]; |
972 | |
851 | |
973 | /* this must before then initial items are given */ |
852 | /* this must before then initial items are given */ |
974 | esrv_new_player(op->contr, op->weight+op->carrying); |
853 | esrv_new_player (op->contr, op->weight + op->carrying); |
975 | create_treasure(find_treasurelist("starting_wealth"),op, 0, 0, 0); |
|
|
976 | |
854 | |
|
|
855 | treasurelist *tl = find_treasurelist ("starting_wealth"); |
|
|
856 | if (tl) |
|
|
857 | create_treasure (tl, op, 0, 0, 0); |
|
|
858 | |
977 | INVOKE_PLAYER (BIRTH, op->contr); |
859 | INVOKE_PLAYER (BIRTH, op->contr); |
978 | INVOKE_PLAYER (LOGIN, op->contr); |
860 | INVOKE_PLAYER (LOGIN, op->contr); |
979 | |
861 | |
980 | op->contr->state=ST_PLAYING; |
862 | op->contr->ns->state = ST_PLAYING; |
981 | |
863 | |
982 | if (op->msg) { |
864 | if (op->msg) |
983 | free_string(op->msg); |
|
|
984 | op->msg=NULL; |
865 | op->msg = NULL; |
985 | } |
|
|
986 | |
866 | |
987 | /* We create this now because some of the unique maps will need it |
867 | /* We create this now because some of the unique maps will need it |
988 | * to save here. |
868 | * to save here. |
989 | */ |
869 | */ |
990 | sprintf(buf,"%s/%s/%s",settings.localdir,settings.playerdir,op->name); |
870 | sprintf (buf, "%s/%s/%s", settings.localdir, settings.playerdir, &op->name); |
991 | make_path_to_file(buf); |
871 | make_path_to_file (buf); |
992 | |
872 | |
993 | #ifdef AUTOSAVE |
873 | #ifdef AUTOSAVE |
994 | op->contr->last_save_tick = pticks; |
874 | op->contr->last_save_tick = pticks; |
995 | #endif |
875 | #endif |
996 | start_info(op); |
876 | start_info (op); |
997 | CLEAR_FLAG(op, FLAG_WIZ); |
877 | CLEAR_FLAG (op, FLAG_WIZ); |
998 | give_initial_items(op,op->randomitems); |
878 | give_initial_items (op, op->randomitems); |
999 | link_player_skills(op); |
879 | link_player_skills (op); |
1000 | esrv_send_inventory(op, op); |
880 | esrv_send_inventory (op, op); |
1001 | fix_player(op); |
881 | op->update_stats (); |
1002 | |
882 | |
1003 | /* This moves the player to a different start map, if there |
883 | /* This moves the player to a different start map, if there |
1004 | * is one for this race |
884 | * is one for this race |
1005 | */ |
885 | */ |
1006 | if(*first_map_ext_path) { |
886 | if (*first_map_ext_path) |
|
|
887 | { |
1007 | object *tmp; |
888 | object *tmp; |
1008 | mapstruct *oldmap = op->map; |
|
|
1009 | char mapname[MAX_BUF]; |
889 | char mapname[MAX_BUF]; |
1010 | snprintf(mapname, MAX_BUF-1, "%s/%s", |
890 | |
1011 | first_map_ext_path, op->arch->name); |
891 | snprintf (mapname, MAX_BUF - 1, "%s/%s", first_map_ext_path, &op->arch->name); |
1012 | tmp=get_object(); |
892 | tmp = object::create (); |
1013 | EXIT_PATH(tmp) = add_string(mapname); |
893 | EXIT_PATH (tmp) = mapname; |
1014 | EXIT_X(tmp) = op->x; |
894 | EXIT_X (tmp) = op->x; |
1015 | EXIT_Y(tmp) = op->y; |
895 | EXIT_Y (tmp) = op->y; |
1016 | enter_exit(op,tmp); /* we don't really care if it succeeded; |
896 | enter_exit (op, tmp); /* we don't really care if it succeeded; |
1017 | * if the map isn't there, then stay on the |
897 | * if the map isn't there, then stay on the |
1018 | * default initial map */ |
898 | * default initial map */ |
1019 | free_object(tmp); |
899 | tmp->destroy (); |
|
|
900 | } |
1020 | } else { |
901 | else |
1021 | LOG(llevDebug,"first_map_ext_path not set\n"); |
902 | LOG (llevDebug, "first_map_ext_path not set\n"); |
1022 | } |
|
|
1023 | return 0; |
|
|
1024 | } |
|
|
1025 | |
903 | |
|
|
904 | return 0; |
|
|
905 | } |
|
|
906 | |
1026 | /* Following actually changes the race - this is the default command |
907 | /* Following actually changes the race - this is the default command |
1027 | * if we don't match with one of the options above. |
908 | * if we don't match with one of the options above. |
1028 | */ |
909 | */ |
1029 | |
910 | |
1030 | tmp_loop = 0; |
911 | tmp_loop = 0; |
1031 | while(!tmp_loop) { |
912 | while (!tmp_loop) |
1032 | const char *name = add_string (op->name); |
913 | { |
|
|
914 | shstr name = op->name; |
1033 | int x = op->x, y = op->y; |
915 | int x = op->x, y = op->y; |
1034 | remove_statbonus(op); |
916 | |
1035 | remove_ob (op); |
917 | op->remove_statbonus (); |
|
|
918 | op->remove (); |
1036 | op->arch = get_player_archetype(op->arch); |
919 | op->arch = get_player_archetype (op->arch); |
1037 | copy_object (&op->arch->clone, op); |
920 | op->arch->clone.copy_to (op); |
1038 | op->instantiate (); |
921 | op->instantiate (); |
1039 | op->stats = op->contr->orig_stats; |
922 | op->stats = op->contr->orig_stats; |
1040 | free_string (op->name); |
923 | op->name = op->name_pl = name; |
1041 | op->name = name; |
924 | op->x = x; |
1042 | free_string(op->name_pl); |
925 | op->y = y; |
1043 | op->name_pl = add_string(name); |
|
|
1044 | op->x = x; |
|
|
1045 | op->y = y; |
|
|
1046 | SET_ANIMATION(op, 2); /* So player faces south */ |
926 | SET_ANIMATION (op, 2); /* So player faces south */ |
1047 | insert_ob_in_map (op, op->map, op,0); |
927 | insert_ob_in_map (op, op->map, op, 0); |
1048 | strncpy(op->contr->title, op->arch->clone.name, sizeof(op->contr->title)-1); |
928 | assign (op->contr->title, op->arch->clone.name); |
1049 | op->contr->title[sizeof(op->contr->title)-1] = '\0'; |
929 | op->add_statbonus (); |
1050 | add_statbonus(op); |
|
|
1051 | tmp_loop=allowed_class(op); |
930 | tmp_loop = allowed_class (op); |
1052 | |
|
|
1053 | if (!strncmp (op->msg, "Edit me", 7)) tmp_loop = 0; // pippijn fucked it up //D//TODO |
|
|
1054 | } |
931 | } |
|
|
932 | |
1055 | update_object(op,UP_OBJ_FACE); |
933 | update_object (op, UP_OBJ_FACE); |
1056 | esrv_update_item(UPD_FACE,op,op); |
934 | esrv_update_item (UPD_FACE, op, op); |
1057 | fix_player(op); |
935 | op->update_stats (); |
1058 | op->stats.hp=op->stats.maxhp; |
936 | op->stats.hp = op->stats.maxhp; |
1059 | op->stats.sp=op->stats.maxsp; |
937 | op->stats.sp = op->stats.maxsp; |
1060 | op->stats.grace=0; |
938 | op->stats.grace = 0; |
|
|
939 | |
1061 | if (op->msg) |
940 | if (op->msg) |
1062 | new_draw_info(NDI_BLUE, 0, op, op->msg); |
941 | new_draw_info (NDI_BLUE, 0, op, op->msg); |
|
|
942 | |
1063 | send_query(&op->contr->socket,CS_QUERY_SINGLECHAR,"Press any key for the next race.\nPress `d' to play this race.\n"); |
943 | send_query (op->contr->ns, CS_QUERY_SINGLECHAR, "Press any key for the next race.\nPress `d' to play this race.\n"); |
1064 | return 0; |
944 | return 0; |
1065 | } |
945 | } |
1066 | |
946 | |
|
|
947 | int |
1067 | int key_confirm_quit(object *op, char key) |
948 | key_confirm_quit (object *op, char key) |
1068 | { |
949 | { |
1069 | char buf[MAX_BUF]; |
|
|
1070 | |
|
|
1071 | if(key!='y'&&key!='Y'&&key!='q'&&key!='Q') { |
950 | if (key != 'y' && key != 'Y' && key != 'q' && key != 'Q') |
|
|
951 | { |
1072 | op->contr->state=ST_PLAYING; |
952 | op->contr->ns->state = ST_PLAYING; |
1073 | new_draw_info(NDI_UNIQUE, 0,op,"OK, continuing to play."); |
953 | new_draw_info (NDI_UNIQUE, 0, op, "OK, continuing to play."); |
1074 | return 1; |
954 | return 1; |
1075 | } |
955 | } |
1076 | |
956 | |
1077 | INVOKE_PLAYER (LOGOUT, op->contr); |
957 | INVOKE_PLAYER (LOGOUT, op->contr); |
1078 | INVOKE_PLAYER (QUIT , op->contr); |
958 | INVOKE_PLAYER (QUIT, op->contr); |
1079 | |
959 | |
1080 | terminate_all_pets(op); |
960 | terminate_all_pets (op); |
1081 | leave_map(op); |
961 | leave_map (op); |
1082 | op->direction=0; |
962 | op->direction = 0; |
1083 | new_draw_info_format(NDI_UNIQUE | NDI_ALL, 5, NULL, |
963 | new_draw_info_format (NDI_UNIQUE | NDI_ALL, 5, NULL, "%s quits the game.", &op->name); |
1084 | "%s quits the game.",op->name); |
|
|
1085 | |
964 | |
1086 | strcpy(op->contr->killer,"quit"); |
965 | strcpy (op->contr->killer, "quit"); |
1087 | check_score(op); |
966 | check_score (op); |
1088 | op->contr->party=NULL; |
967 | op->contr->party = 0; |
1089 | if (settings.set_title == TRUE) |
|
|
1090 | op->contr->own_title[0]='\0'; |
968 | op->contr->own_title[0] = '\0'; |
1091 | |
969 | |
1092 | if(!QUERY_FLAG(op,FLAG_WAS_WIZ)) { |
970 | object_ptr ob = op; |
1093 | mapstruct *mp, *next; |
|
|
1094 | |
971 | |
|
|
972 | delete ob->contr; |
|
|
973 | |
1095 | /* We need to hunt for any per player unique maps in memory and |
974 | /* We need to hunt for any per player unique maps in memory and |
1096 | * get rid of them. The trailing slash in the path is intentional, |
975 | * get rid of them. The trailing slash in the path is intentional, |
1097 | * so that players named 'Ab' won't match against players 'Abe' pathname |
976 | * so that players named 'Ab' won't match against players 'Abe' pathname |
1098 | */ |
977 | */ |
|
|
978 | char buf[MAX_BUF]; |
1099 | sprintf(buf,"%s/%s/%s/", settings.localdir, settings.playerdir, op->name); |
979 | sprintf (buf, "%s/%s/%s/", settings.localdir, settings.playerdir, &op->name); |
1100 | for (mp=first_map; mp!=NULL; mp=next) { |
980 | |
|
|
981 | for (maptile *next, *mp = first_map; mp; mp = next) |
|
|
982 | { |
1101 | next = mp->next; |
983 | next = mp->next; |
|
|
984 | |
1102 | if (!strncmp(mp->path, buf, strlen(buf))) |
985 | if (!strncmp (mp->path, buf, strlen (buf))) |
1103 | delete_map(mp); |
986 | delete_map (mp); |
1104 | } |
987 | } |
1105 | |
988 | |
1106 | delete_character(op->name, 1); |
989 | delete_character (ob->name, 1); |
1107 | } |
990 | |
1108 | play_again(op); |
|
|
1109 | return 1; |
991 | return 1; |
1110 | } |
992 | } |
1111 | |
993 | |
|
|
994 | void |
1112 | void flee_player(object *op) { |
995 | flee_player (object *op) |
|
|
996 | { |
1113 | int dir,diff; |
997 | int dir, diff; |
1114 | rv_vector rv; |
998 | rv_vector rv; |
1115 | |
999 | |
1116 | if(op->stats.hp < 0) { |
1000 | if (op->stats.hp < 0) |
|
|
1001 | { |
1117 | LOG(llevDebug, "Fleeing player is dead.\n"); |
1002 | LOG (llevDebug, "Fleeing player is dead.\n"); |
1118 | CLEAR_FLAG(op, FLAG_SCARED); |
1003 | CLEAR_FLAG (op, FLAG_SCARED); |
1119 | return; |
1004 | return; |
1120 | } |
1005 | } |
1121 | |
1006 | |
1122 | if(op->enemy==NULL) { |
1007 | if (op->enemy == NULL) |
|
|
1008 | { |
1123 | LOG(llevDebug,"Fleeing player had no enemy.\n"); |
1009 | LOG (llevDebug, "Fleeing player had no enemy.\n"); |
1124 | CLEAR_FLAG(op, FLAG_SCARED); |
1010 | CLEAR_FLAG (op, FLAG_SCARED); |
1125 | return; |
1011 | return; |
1126 | } |
1012 | } |
1127 | |
1013 | |
1128 | /* Seen some crashes here. Since we don't store an |
1014 | /* Seen some crashes here. Since we don't store an |
1129 | * op->enemy_count, it is possible that something destroys the |
1015 | * op->enemy_count, it is possible that something destroys the |
1130 | * actual enemy, and the object is recycled. |
1016 | * actual enemy, and the object is recycled. |
1131 | */ |
1017 | */ |
1132 | if (op->enemy->map == NULL) { |
1018 | if (op->enemy->map == NULL) |
|
|
1019 | { |
1133 | CLEAR_FLAG(op, FLAG_SCARED); |
1020 | CLEAR_FLAG (op, FLAG_SCARED); |
1134 | op->enemy=NULL; |
1021 | op->enemy = NULL; |
1135 | return; |
1022 | return; |
1136 | } |
1023 | } |
1137 | |
1024 | |
1138 | if(!(random_roll(0, 4, op, PREFER_LOW)) && did_make_save(op, op->level, 0)) { |
1025 | if (!(random_roll (0, 4, op, PREFER_LOW)) && did_make_save (op, op->level, 0)) |
|
|
1026 | { |
1139 | op->enemy=NULL; |
1027 | op->enemy = NULL; |
1140 | CLEAR_FLAG(op, FLAG_SCARED); |
1028 | CLEAR_FLAG (op, FLAG_SCARED); |
1141 | return; |
1029 | return; |
1142 | } |
1030 | } |
|
|
1031 | |
1143 | get_rangevector(op, op->enemy, &rv, 0); |
1032 | get_rangevector (op, op->enemy, &rv, 0); |
1144 | |
1033 | |
1145 | dir=absdir(4+rv.direction); |
1034 | dir = absdir (4 + rv.direction); |
1146 | for(diff=0;diff<3;diff++) { |
1035 | for (diff = 0; diff < 3; diff++) |
1147 | int m=1-(RANDOM()&2); |
|
|
1148 | if(move_ob(op,absdir(dir+diff*m),op)|| |
|
|
1149 | (diff==0 && move_ob(op,absdir(dir-diff*m),op))) { |
|
|
1150 | return; |
|
|
1151 | } |
|
|
1152 | } |
1036 | { |
|
|
1037 | int m = 1 - (RANDOM () & 2); |
|
|
1038 | |
|
|
1039 | if (move_ob (op, absdir (dir + diff * m), op) || (diff == 0 && move_ob (op, absdir (dir - diff * m), op))) |
|
|
1040 | return; |
|
|
1041 | } |
|
|
1042 | |
1153 | /* Cornered, get rid of scared */ |
1043 | /* Cornered, get rid of scared */ |
1154 | CLEAR_FLAG(op, FLAG_SCARED); |
1044 | CLEAR_FLAG (op, FLAG_SCARED); |
1155 | op->enemy=NULL; |
1045 | op->enemy = NULL; |
1156 | } |
1046 | } |
1157 | |
1047 | |
1158 | |
1048 | |
1159 | /* check_pick sees if there is stuff to be picked up/picks up stuff. |
1049 | /* check_pick sees if there is stuff to be picked up/picks up stuff. |
1160 | * IT returns 1 if the player should keep on moving, 0 if he should |
1050 | * IT returns 1 if the player should keep on moving, 0 if he should |
1161 | * stop. |
1051 | * stop. |
1162 | */ |
1052 | */ |
|
|
1053 | int |
1163 | int check_pick(object *op) { |
1054 | check_pick (object *op) |
|
|
1055 | { |
1164 | object *tmp, *next; |
1056 | object *tmp, *next; |
1165 | tag_t next_tag=0, op_tag; |
|
|
1166 | int stop = 0; |
1057 | int stop = 0; |
1167 | int j, k, wvratio; |
1058 | int j, k, wvratio; |
1168 | char putstring[128], tmpstr[16]; |
1059 | char putstring[128], tmpstr[16]; |
1169 | |
1060 | |
1170 | |
|
|
1171 | /* if you're flying, you cna't pick up anything */ |
1061 | /* if you're flying, you cna't pick up anything */ |
1172 | if (op->move_type & MOVE_FLYING) |
1062 | if (op->move_type & MOVE_FLYING) |
1173 | return 1; |
1063 | return 1; |
1174 | |
1064 | |
1175 | op_tag = op->count; |
|
|
1176 | |
|
|
1177 | next = op->below; |
1065 | next = op->below; |
1178 | if (next) |
|
|
1179 | next_tag = next->count; |
|
|
1180 | |
1066 | |
1181 | /* loop while there are items on the floor that are not marked as |
1067 | /* loop while there are items on the floor that are not marked as |
1182 | * destroyed */ |
1068 | * destroyed */ |
1183 | while (next && ! was_destroyed (next, next_tag)) |
1069 | while (next && !next->destroyed ()) |
1184 | { |
1070 | { |
1185 | tmp = next; |
1071 | tmp = next; |
1186 | next = tmp->below; |
1072 | next = tmp->below; |
1187 | if (next) |
|
|
1188 | next_tag = next->count; |
|
|
1189 | |
1073 | |
1190 | if (was_destroyed (op, op_tag)) |
1074 | if (op->destroyed ()) |
1191 | return 0; |
1075 | return 0; |
1192 | |
1076 | |
1193 | if ( ! can_pick (op, tmp)) |
1077 | if (!can_pick (op, tmp)) |
1194 | continue; |
1078 | continue; |
1195 | |
1079 | |
1196 | if (op->contr->search_str[0]!='\0' && settings.search_items == TRUE) |
1080 | if (op->contr->search_str[0] != '\0' && settings.search_items == TRUE) |
1197 | { |
1081 | { |
1198 | if (item_matched_string (op, tmp, op->contr->search_str)) |
1082 | if (item_matched_string (op, tmp, op->contr->search_str)) |
1199 | pick_up (op, tmp); |
1083 | pick_up (op, tmp); |
1200 | continue; |
1084 | continue; |
1201 | } |
1085 | } |
1202 | |
1086 | |
1203 | /* high not bit set? We're using the old autopickup model */ |
1087 | /* high not bit set? We're using the old autopickup model */ |
1204 | if(!(op->contr->mode & PU_NEWMODE)) { |
1088 | if (!(op->contr->mode & PU_NEWMODE)) |
|
|
1089 | { |
1205 | switch (op->contr->mode) { |
1090 | switch (op->contr->mode) |
1206 | case 0: return 1; /* don't pick up */ |
1091 | { |
1207 | case 1: pick_up (op, tmp); |
1092 | case 0: |
1208 | return 1; |
1093 | return 1; /* don't pick up */ |
1209 | case 2: pick_up (op, tmp); |
1094 | case 1: |
1210 | return 0; |
1095 | pick_up (op, tmp); |
1211 | case 3: return 0; /* stop before pickup */ |
1096 | return 1; |
1212 | case 4: pick_up (op, tmp); |
1097 | case 2: |
1213 | break; |
1098 | pick_up (op, tmp); |
1214 | case 5: pick_up (op, tmp); |
1099 | return 0; |
1215 | stop = 1; |
1100 | case 3: |
1216 | break; |
1101 | return 0; /* stop before pickup */ |
1217 | case 6: |
1102 | case 4: |
1218 | if (QUERY_FLAG (tmp, FLAG_KNOWN_MAGICAL) && |
1103 | pick_up (op, tmp); |
1219 | ! QUERY_FLAG(tmp, FLAG_KNOWN_CURSED)) |
1104 | break; |
1220 | pick_up(op, tmp); |
1105 | case 5: |
1221 | break; |
1106 | pick_up (op, tmp); |
|
|
1107 | stop = 1; |
|
|
1108 | break; |
|
|
1109 | case 6: |
|
|
1110 | if (QUERY_FLAG (tmp, FLAG_KNOWN_MAGICAL) && !QUERY_FLAG (tmp, FLAG_KNOWN_CURSED)) |
|
|
1111 | pick_up (op, tmp); |
|
|
1112 | break; |
1222 | |
1113 | |
1223 | case 7: |
1114 | case 7: |
1224 | if (tmp->type == MONEY || tmp->type == GEM) |
1115 | if (tmp->type == MONEY || tmp->type == GEM) |
1225 | pick_up(op, tmp); |
1116 | pick_up (op, tmp); |
1226 | break; |
1117 | break; |
1227 | |
1118 | |
1228 | default: |
1119 | default: |
1229 | /* use value density */ |
1120 | /* use value density */ |
1230 | if ( ! QUERY_FLAG (tmp, FLAG_UNPAID) |
1121 | if (!QUERY_FLAG (tmp, FLAG_UNPAID) |
1231 | && (query_cost (tmp, op, F_TRUE) * 100 |
1122 | && (query_cost (tmp, op, F_TRUE) * 100 / (tmp->weight * MAX (tmp->nrof, 1))) >= op->contr->mode) |
1232 | / (tmp->weight * MAX (tmp->nrof, 1))) |
1123 | pick_up (op, tmp); |
1233 | >= op->contr->mode) |
1124 | } |
1234 | pick_up(op,tmp); |
1125 | } |
1235 | } |
1126 | else |
1236 | } |
1127 | { /* old model */ |
1237 | else { /* old model */ |
|
|
1238 | /* NEW pickup handling */ |
1128 | /* NEW pickup handling */ |
1239 | if(op->contr->mode & PU_DEBUG) |
1129 | if (op->contr->mode & PU_DEBUG) |
1240 | { |
1130 | { |
1241 | /* some debugging code to figure out item information */ |
1131 | /* some debugging code to figure out item information */ |
1242 | if(tmp->name!=NULL) |
1132 | if (tmp->name != NULL) |
1243 | sprintf(putstring,"item name: %s item type: %d weight/value: %d", |
1133 | sprintf (putstring, "item name: %s item type: %d weight/value: %d", |
1244 | tmp->name, tmp->type, |
1134 | &tmp->name, tmp->type, (int) (query_cost (tmp, op, F_TRUE) * 100 / (tmp->weight * MAX (tmp->nrof, 1)))); |
1245 | (int)(query_cost(tmp, op, F_TRUE)*100 / (tmp->weight * MAX(tmp->nrof,1)))); |
1135 | else |
1246 | else |
|
|
1247 | sprintf(putstring,"item name: %s item type: %d weight/value: %d", |
1136 | sprintf (putstring, "item name: %s item type: %d weight/value: %d", |
1248 | tmp->arch->name, tmp->type, |
1137 | &tmp->arch->name, tmp->type, (int) (query_cost (tmp, op, F_TRUE) * 100 / (tmp->weight * MAX (tmp->nrof, 1)))); |
1249 | (int)(query_cost(tmp, op, F_TRUE)*100 / (tmp->weight * MAX(tmp->nrof,1)))); |
|
|
1250 | new_draw_info(NDI_UNIQUE, 0,op,putstring); |
1138 | new_draw_info (NDI_UNIQUE, 0, op, putstring); |
1251 | |
1139 | |
1252 | sprintf(putstring,"...flags: "); |
1140 | sprintf (putstring, "...flags: "); |
1253 | for(k=0;k<4;k++) |
1141 | for (k = 0; k < 4; k++) |
1254 | { |
1142 | { |
1255 | for(j=0;j<32;j++) |
1143 | for (j = 0; j < 32; j++) |
1256 | { |
1144 | { |
1257 | if((tmp->flags[k]>>j)&0x01) |
1145 | if ((tmp->flags[k] >> j) & 0x01) |
1258 | { |
1146 | { |
1259 | sprintf(tmpstr,"%d ",k*32+j); |
1147 | sprintf (tmpstr, "%d ", k * 32 + j); |
1260 | strcat(putstring, tmpstr); |
1148 | strcat (putstring, tmpstr); |
1261 | } |
1149 | } |
1262 | } |
1150 | } |
1263 | } |
1151 | } |
1264 | new_draw_info(NDI_UNIQUE, 0,op,putstring); |
1152 | new_draw_info (NDI_UNIQUE, 0, op, putstring); |
1265 | |
1153 | |
1266 | #if 0 |
1154 | #if 0 |
1267 | /* print the flags too */ |
1155 | /* print the flags too */ |
1268 | for(k=0;k<4;k++) |
1156 | for (k = 0; k < 4; k++) |
1269 | { |
1157 | { |
1270 | fprintf(stderr,"%d [%d] ", k, k*32+31); |
1158 | fprintf (stderr, "%d [%d] ", k, k * 32 + 31); |
1271 | for(j=0;j<32;j++) |
1159 | for (j = 0; j < 32; j++) |
1272 | { |
1160 | { |
1273 | fprintf(stderr,"%d",tmp->flags[k]>>(31-j)&0x01); |
1161 | fprintf (stderr, "%d", tmp->flags[k] >> (31 - j) & 0x01); |
1274 | if(!((j+1)%4))fprintf(stderr," "); |
1162 | if (!((j + 1) % 4)) |
1275 | } |
1163 | fprintf (stderr, " "); |
|
|
1164 | } |
1276 | fprintf(stderr," [%d]\n", k*32); |
1165 | fprintf (stderr, " [%d]\n", k * 32); |
1277 | } |
1166 | } |
1278 | #endif |
1167 | #endif |
1279 | } |
1168 | } |
1280 | /* philosophy: |
1169 | /* philosophy: |
1281 | * It's easy to grab an item type from a pile, as long as it's |
1170 | * It's easy to grab an item type from a pile, as long as it's |
1282 | * generic. This takes no game-time. For more detailed pickups |
1171 | * generic. This takes no game-time. For more detailed pickups |
1283 | * and selections, select-items shoul dbe used. This is a |
1172 | * and selections, select-items shoul dbe used. This is a |
1284 | * grab-as-you-run type mode that's really useful for arrows for |
1173 | * grab-as-you-run type mode that's really useful for arrows for |
1285 | * example. |
1174 | * example. |
1286 | * The drawback: right now it has no frontend, so you need to |
1175 | * The drawback: right now it has no frontend, so you need to |
1287 | * stick the bits you want into a calculator in hex mode and then |
1176 | * stick the bits you want into a calculator in hex mode and then |
1288 | * convert to decimal and then 'pickup <#> |
1177 | * convert to decimal and then 'pickup <#> |
1289 | */ |
1178 | */ |
1290 | |
1179 | |
1291 | /* the first two modes are exclusive: if NOTHING we return, if |
1180 | /* the first two modes are exclusive: if NOTHING we return, if |
1292 | * STOP then we stop. All the rest are applied sequentially, |
1181 | * STOP then we stop. All the rest are applied sequentially, |
1293 | * meaning if any test passes, the item gets picked up. */ |
1182 | * meaning if any test passes, the item gets picked up. */ |
1294 | |
1183 | |
1295 | /* if mode is set to pick nothing up, return */ |
1184 | /* if mode is set to pick nothing up, return */ |
1296 | |
1185 | |
1297 | if(op->contr->mode & PU_NOTHING) return 1; |
1186 | if (op->contr->mode & PU_NOTHING) |
|
|
1187 | return 1; |
1298 | |
1188 | |
1299 | /* if mode is set to stop when encountering objects, return */ |
1189 | /* if mode is set to stop when encountering objects, return */ |
1300 | /* take STOP before INHIBIT since it doesn't actually pick |
1190 | /* take STOP before INHIBIT since it doesn't actually pick |
1301 | * anything up */ |
1191 | * anything up */ |
1302 | |
1192 | |
1303 | if(op->contr->mode & PU_STOP) return 0; |
1193 | if (op->contr->mode & PU_STOP) |
|
|
1194 | return 0; |
1304 | |
1195 | |
1305 | /* useful for going into stores and not losing your settings... */ |
1196 | /* useful for going into stores and not losing your settings... */ |
1306 | /* and for battles wher you don't want to get loaded down while |
1197 | /* and for battles wher you don't want to get loaded down while |
1307 | * fighting */ |
1198 | * fighting */ |
1308 | if(op->contr->mode & PU_INHIBIT) return 1; |
1199 | if (op->contr->mode & PU_INHIBIT) |
|
|
1200 | return 1; |
1309 | |
1201 | |
1310 | /* prevent us from turning into auto-thieves :) */ |
1202 | /* prevent us from turning into auto-thieves :) */ |
1311 | if (QUERY_FLAG (tmp, FLAG_UNPAID)) continue; |
1203 | if (QUERY_FLAG (tmp, FLAG_UNPAID)) |
|
|
1204 | continue; |
1312 | |
1205 | |
1313 | /* ignore known cursed objects */ |
1206 | /* ignore known cursed objects */ |
1314 | if (QUERY_FLAG (tmp, FLAG_KNOWN_CURSED) && op->contr->mode & PU_NOT_CURSED) continue; |
1207 | if (QUERY_FLAG (tmp, FLAG_KNOWN_CURSED) && op->contr->mode & PU_NOT_CURSED) |
|
|
1208 | continue; |
1315 | |
1209 | |
1316 | /* all food and drink if desired */ |
1210 | /* all food and drink if desired */ |
1317 | /* question: don't pick up known-poisonous stuff? */ |
1211 | /* question: don't pick up known-poisonous stuff? */ |
1318 | if(op->contr->mode & PU_FOOD) |
1212 | if (op->contr->mode & PU_FOOD) |
1319 | if (tmp->type == FOOD) |
1213 | if (tmp->type == FOOD) |
1320 | { pick_up(op, tmp); if(0)fprintf(stderr,"FOOD\n"); continue; } |
1214 | { |
|
|
1215 | pick_up (op, tmp); |
|
|
1216 | continue; |
|
|
1217 | } |
|
|
1218 | |
1321 | if(op->contr->mode & PU_DRINK) |
1219 | if (op->contr->mode & PU_DRINK) |
1322 | if (tmp->type == DRINK || (tmp->type == POISON && !QUERY_FLAG(tmp, FLAG_KNOWN_CURSED))) |
1220 | if (tmp->type == DRINK || (tmp->type == POISON && !QUERY_FLAG (tmp, FLAG_KNOWN_CURSED))) |
1323 | { pick_up(op, tmp); if(0)fprintf(stderr,"DRINK\n"); continue; } |
1221 | { |
|
|
1222 | pick_up (op, tmp); |
|
|
1223 | continue; |
|
|
1224 | } |
1324 | |
1225 | |
1325 | if(op->contr->mode & PU_POTION) |
1226 | if (op->contr->mode & PU_POTION) |
1326 | if (tmp->type == POTION) |
1227 | if (tmp->type == POTION) |
1327 | { pick_up(op, tmp); if(0)fprintf(stderr,"POTION\n"); continue; } |
1228 | { |
|
|
1229 | pick_up (op, tmp); |
|
|
1230 | continue; |
|
|
1231 | } |
1328 | |
1232 | |
1329 | /* spellbooks, skillscrolls and normal books/scrolls */ |
1233 | /* spellbooks, skillscrolls and normal books/scrolls */ |
1330 | if(op->contr->mode & PU_SPELLBOOK) |
1234 | if (op->contr->mode & PU_SPELLBOOK) |
1331 | if (tmp->type == SPELLBOOK) |
1235 | if (tmp->type == SPELLBOOK) |
1332 | { pick_up(op, tmp); if(0)fprintf(stderr,"SPELLBOOK\n"); continue; } |
1236 | { |
|
|
1237 | pick_up (op, tmp); |
|
|
1238 | continue; |
|
|
1239 | } |
|
|
1240 | |
1333 | if(op->contr->mode & PU_SKILLSCROLL) |
1241 | if (op->contr->mode & PU_SKILLSCROLL) |
1334 | if (tmp->type == SKILLSCROLL) |
1242 | if (tmp->type == SKILLSCROLL) |
1335 | { pick_up(op, tmp); if(0)fprintf(stderr,"SKILLSCROLL\n"); continue; } |
1243 | { |
|
|
1244 | pick_up (op, tmp); |
|
|
1245 | continue; |
|
|
1246 | } |
|
|
1247 | |
1336 | if(op->contr->mode & PU_READABLES) |
1248 | if (op->contr->mode & PU_READABLES) |
1337 | if (tmp->type == BOOK || tmp->type == SCROLL) |
1249 | if (tmp->type == BOOK || tmp->type == SCROLL) |
1338 | { pick_up(op, tmp); if(0)fprintf(stderr,"READABLES\n"); continue; } |
1250 | { |
|
|
1251 | pick_up (op, tmp); |
|
|
1252 | continue; |
|
|
1253 | } |
1339 | |
1254 | |
1340 | /* wands/staves/rods/horns */ |
1255 | /* wands/staves/rods/horns */ |
1341 | if (op->contr->mode & PU_MAGIC_DEVICE) |
1256 | if (op->contr->mode & PU_MAGIC_DEVICE) |
1342 | if (tmp->type == WAND || tmp->type == ROD || tmp->type == HORN) |
1257 | if (tmp->type == WAND || tmp->type == ROD || tmp->type == HORN) |
1343 | { pick_up(op, tmp); if(0)fprintf(stderr,"MAGIC_DEVICE\n"); continue; } |
1258 | { |
|
|
1259 | pick_up (op, tmp); |
|
|
1260 | continue; |
|
|
1261 | } |
1344 | |
1262 | |
1345 | /* pick up all magical items */ |
1263 | /* pick up all magical items */ |
1346 | if(op->contr->mode & PU_MAGICAL) |
1264 | if (op->contr->mode & PU_MAGICAL) |
1347 | if (QUERY_FLAG (tmp, FLAG_KNOWN_MAGICAL) && ! QUERY_FLAG(tmp, FLAG_KNOWN_CURSED)) |
1265 | if (QUERY_FLAG (tmp, FLAG_KNOWN_MAGICAL) && !QUERY_FLAG (tmp, FLAG_KNOWN_CURSED)) |
1348 | { pick_up(op, tmp); if(0)fprintf(stderr,"MAGICAL\n"); continue; } |
1266 | { |
|
|
1267 | pick_up (op, tmp); |
|
|
1268 | continue; |
|
|
1269 | } |
1349 | |
1270 | |
1350 | if(op->contr->mode & PU_VALUABLES) |
1271 | if (op->contr->mode & PU_VALUABLES) |
1351 | { |
1272 | { |
1352 | if (tmp->type == MONEY || tmp->type == GEM) |
1273 | if (tmp->type == MONEY || tmp->type == GEM) |
1353 | { pick_up(op, tmp); if(0)fprintf(stderr,"MONEY/GEM\n"); continue; } |
1274 | { |
1354 | } |
1275 | pick_up (op, tmp); |
|
|
1276 | continue; |
|
|
1277 | } |
|
|
1278 | } |
1355 | |
1279 | |
1356 | /* rings & amulets - talismans seems to be typed AMULET */ |
1280 | /* rings & amulets - talismans seems to be typed AMULET */ |
1357 | if(op->contr->mode & PU_JEWELS) |
1281 | if (op->contr->mode & PU_JEWELS) |
1358 | if (tmp->type == RING || tmp->type == AMULET) |
1282 | if (tmp->type == RING || tmp->type == AMULET) |
1359 | { pick_up(op, tmp); if(0)fprintf(stderr,"JEWELS\n"); continue; } |
1283 | { |
|
|
1284 | pick_up (op, tmp); |
|
|
1285 | continue; |
|
|
1286 | } |
1360 | |
1287 | |
|
|
1288 | /* we don't forget dragon food */ |
|
|
1289 | if (op->contr->mode & PU_FLESH) |
|
|
1290 | if (tmp->type == FLESH) |
|
|
1291 | { |
|
|
1292 | pick_up (op, tmp); |
|
|
1293 | continue; |
|
|
1294 | } |
|
|
1295 | |
1361 | /* bows and arrows. Bows are good for selling! */ |
1296 | /* bows and arrows. Bows are good for selling! */ |
1362 | if(op->contr->mode & PU_BOW) |
1297 | if (op->contr->mode & PU_BOW) |
1363 | if (tmp->type == BOW) |
1298 | if (tmp->type == BOW) |
1364 | { pick_up(op, tmp); if(0)fprintf(stderr,"BOW\n"); continue; } |
1299 | { |
|
|
1300 | pick_up (op, tmp); |
|
|
1301 | continue; |
|
|
1302 | } |
|
|
1303 | |
1365 | if(op->contr->mode & PU_ARROW) |
1304 | if (op->contr->mode & PU_ARROW) |
1366 | if (tmp->type == ARROW) |
1305 | if (tmp->type == ARROW) |
1367 | { pick_up(op, tmp); if(0)fprintf(stderr,"ARROW\n"); continue; } |
1306 | { |
|
|
1307 | pick_up (op, tmp); |
|
|
1308 | continue; |
|
|
1309 | } |
1368 | |
1310 | |
1369 | /* all kinds of armor etc. */ |
1311 | /* all kinds of armor etc. */ |
1370 | if(op->contr->mode & PU_ARMOUR) |
1312 | if (op->contr->mode & PU_ARMOUR) |
1371 | if (tmp->type == ARMOUR) |
1313 | if (tmp->type == ARMOUR) |
1372 | { pick_up(op, tmp); if(0)fprintf(stderr,"ARMOUR\n"); continue; } |
1314 | { |
|
|
1315 | pick_up (op, tmp); |
|
|
1316 | continue; |
|
|
1317 | } |
|
|
1318 | |
1373 | if(op->contr->mode & PU_HELMET) |
1319 | if (op->contr->mode & PU_HELMET) |
1374 | if (tmp->type == HELMET) |
1320 | if (tmp->type == HELMET) |
1375 | { pick_up(op, tmp); if(0)fprintf(stderr,"HELMET\n"); continue; } |
1321 | { |
|
|
1322 | pick_up (op, tmp); |
|
|
1323 | continue; |
|
|
1324 | } |
|
|
1325 | |
1376 | if(op->contr->mode & PU_SHIELD) |
1326 | if (op->contr->mode & PU_SHIELD) |
1377 | if (tmp->type == SHIELD) |
1327 | if (tmp->type == SHIELD) |
1378 | { pick_up(op, tmp); if(0)fprintf(stderr,"SHIELD\n"); continue; } |
1328 | { |
|
|
1329 | pick_up (op, tmp); |
|
|
1330 | continue; |
|
|
1331 | } |
|
|
1332 | |
1379 | if(op->contr->mode & PU_BOOTS) |
1333 | if (op->contr->mode & PU_BOOTS) |
1380 | if (tmp->type == BOOTS) |
1334 | if (tmp->type == BOOTS) |
1381 | { pick_up(op, tmp); if(0)fprintf(stderr,"BOOTS\n"); continue; } |
1335 | { |
|
|
1336 | pick_up (op, tmp); |
|
|
1337 | continue; |
|
|
1338 | } |
|
|
1339 | |
1382 | if(op->contr->mode & PU_GLOVES) |
1340 | if (op->contr->mode & PU_GLOVES) |
1383 | if (tmp->type == GLOVES) |
1341 | if (tmp->type == GLOVES) |
1384 | { pick_up(op, tmp); if(0)fprintf(stderr,"GLOVES\n"); continue; } |
1342 | { |
|
|
1343 | pick_up (op, tmp); |
|
|
1344 | continue; |
|
|
1345 | } |
|
|
1346 | |
1385 | if(op->contr->mode & PU_CLOAK) |
1347 | if (op->contr->mode & PU_CLOAK) |
1386 | if (tmp->type == CLOAK) |
1348 | if (tmp->type == CLOAK) |
1387 | { pick_up(op, tmp); if(0)fprintf(stderr,"GLOVES\n"); continue; } |
1349 | { |
|
|
1350 | pick_up (op, tmp); |
|
|
1351 | continue; |
|
|
1352 | } |
1388 | |
1353 | |
1389 | /* hoping to catch throwing daggers here */ |
1354 | /* hoping to catch throwing daggers here */ |
1390 | if(op->contr->mode & PU_MISSILEWEAPON) |
1355 | if (op->contr->mode & PU_MISSILEWEAPON) |
1391 | if(tmp->type == WEAPON && QUERY_FLAG(tmp, FLAG_IS_THROWN)) |
1356 | if (tmp->type == WEAPON && QUERY_FLAG (tmp, FLAG_IS_THROWN)) |
1392 | { pick_up(op, tmp); if(0)fprintf(stderr,"MISSILEWEAPON\n"); continue; } |
1357 | { |
|
|
1358 | pick_up (op, tmp); |
|
|
1359 | continue; |
|
|
1360 | } |
1393 | |
1361 | |
1394 | /* careful: chairs and tables are weapons! */ |
1362 | /* careful: chairs and tables are weapons! */ |
1395 | if(op->contr->mode & PU_ALLWEAPON) |
1363 | if (op->contr->mode & PU_ALLWEAPON) |
1396 | { |
1364 | { |
1397 | if(tmp->type == WEAPON && tmp->name!=NULL) |
1365 | if (tmp->type == WEAPON && tmp->name != NULL) |
1398 | { |
1366 | { |
1399 | if(strstr(tmp->name,"table")==NULL && strstr(tmp->arch->name,"table")==NULL && |
1367 | if (strstr (tmp->name, "table") == NULL && strstr (tmp->arch->name, "table") == NULL && |
1400 | strstr(tmp->name,"chair") && strstr(tmp->arch->name,"chair")==NULL) |
1368 | strstr (tmp->name, "chair") && strstr (tmp->arch->name, "chair") == NULL) |
1401 | { pick_up(op, tmp); if(0)fprintf(stderr,"WEAPON\n"); continue; } |
1369 | { |
1402 | } |
1370 | pick_up (op, tmp); |
|
|
1371 | continue; |
|
|
1372 | } |
|
|
1373 | } |
|
|
1374 | |
1403 | if(tmp->type == WEAPON && tmp->name==NULL) |
1375 | if (tmp->type == WEAPON && tmp->name == NULL) |
1404 | { |
1376 | { |
1405 | if(strstr(tmp->arch->name,"table")==NULL && |
1377 | if (strstr (tmp->arch->name, "table") == NULL && strstr (tmp->arch->name, "chair") == NULL) |
1406 | strstr(tmp->arch->name,"chair")==NULL) |
1378 | { |
1407 | { pick_up(op, tmp); if(0)fprintf(stderr,"WEAPON\n"); continue; } |
1379 | pick_up (op, tmp); |
1408 | } |
1380 | continue; |
1409 | } |
1381 | } |
|
|
1382 | } |
|
|
1383 | } |
1410 | |
1384 | |
1411 | /* misc stuff that's useful */ |
1385 | /* misc stuff that's useful */ |
1412 | if(op->contr->mode & PU_KEY) |
1386 | if (op->contr->mode & PU_KEY) |
1413 | if (tmp->type == KEY || tmp->type == SPECIAL_KEY) |
1387 | if (tmp->type == KEY || tmp->type == SPECIAL_KEY) |
1414 | { pick_up(op, tmp); if(0)fprintf(stderr,"KEY\n"); continue; } |
1388 | { |
|
|
1389 | pick_up (op, tmp); |
|
|
1390 | continue; |
|
|
1391 | } |
1415 | |
1392 | |
1416 | /* any of the last 4 bits set means we use the ratio for value |
1393 | /* any of the last 4 bits set means we use the ratio for value |
1417 | * pickups */ |
1394 | * pickups */ |
1418 | if(op->contr->mode & PU_RATIO) |
1395 | if (op->contr->mode & PU_RATIO) |
1419 | { |
1396 | { |
1420 | /* use value density to decide what else to grab */ |
1397 | /* use value density to decide what else to grab */ |
1421 | /* >=7 was >= op->contr->mode */ |
1398 | /* >=7 was >= op->contr->mode */ |
1422 | /* >=7 is the old standard setting. Now we take the last 4 bits |
1399 | /* >=7 is the old standard setting. Now we take the last 4 bits |
1423 | * and multiply them by 5, giving 0..15*5== 5..75 */ |
1400 | * and multiply them by 5, giving 0..15*5== 5..75 */ |
1424 | wvratio=(op->contr->mode & PU_RATIO) * 5; |
1401 | wvratio = (op->contr->mode & PU_RATIO) * 5; |
1425 | if ((query_cost(tmp, op, F_TRUE)*100 / (tmp->weight * MAX(tmp->nrof, 1))) >= wvratio) |
1402 | if ((query_cost (tmp, op, F_TRUE) * 100 / (tmp->weight * MAX (tmp->nrof, 1))) >= (unsigned int) wvratio) |
1426 | { |
1403 | { |
1427 | pick_up(op, tmp); |
1404 | pick_up (op, tmp); |
1428 | #if 0 |
1405 | #if 0 |
1429 | fprintf(stderr,"HIGH WEIGHT/VALUE ["); |
1406 | fprintf (stderr, "HIGH WEIGHT/VALUE ["); |
1430 | if(tmp->name!=NULL) { |
1407 | if (tmp->name != NULL) |
|
|
1408 | { |
1431 | fprintf(stderr,"%s", tmp->name); |
1409 | fprintf (stderr, "%s", tmp->name); |
1432 | } |
1410 | } |
1433 | else fprintf(stderr,"%s",tmp->arch->name); |
1411 | else |
|
|
1412 | fprintf (stderr, "%s", tmp->arch->name); |
1434 | fprintf(stderr,",%d] = ", tmp->type); |
1413 | fprintf (stderr, ",%d] = ", tmp->type); |
1435 | fprintf(stderr,"%d\n",(int)(query_cost(tmp,op,F_TRUE)*100 / (tmp->weight * MAX(tmp->nrof,1)))); |
1414 | fprintf (stderr, "%d\n", (int) (query_cost (tmp, op, F_TRUE) * 100 / (tmp->weight * MAX (tmp->nrof, 1)))); |
1436 | #endif |
1415 | #endif |
1437 | continue; |
1416 | continue; |
1438 | } |
1417 | } |
|
|
1418 | } |
|
|
1419 | } /* the new pickup model */ |
1439 | } |
1420 | } |
1440 | } /* the new pickup model */ |
1421 | |
1441 | } |
|
|
1442 | return ! stop; |
1422 | return !stop; |
1443 | } |
1423 | } |
1444 | |
1424 | |
1445 | /* |
1425 | /* |
1446 | * Find an arrow in the inventory and after that |
1426 | * Find an arrow in the inventory and after that |
1447 | * in the right type container (quiver). Pointer to the |
1427 | * in the right type container (quiver). Pointer to the |
1448 | * found object is returned. |
1428 | * found object is returned. |
1449 | */ |
1429 | */ |
|
|
1430 | object * |
1450 | object *find_arrow(object *op, const char *type) |
1431 | find_arrow (object *op, const char *type) |
1451 | { |
1432 | { |
1452 | object *tmp = NULL; |
1433 | object *tmp = NULL; |
1453 | |
1434 | |
1454 | for(op=op->inv; op; op=op->below) |
1435 | for (op = op->inv; op; op = op->below) |
1455 | if(!tmp && op->type==CONTAINER && op->race==type && |
1436 | if (!tmp && op->type == CONTAINER && op->race == type && QUERY_FLAG (op, FLAG_APPLIED)) |
1456 | QUERY_FLAG(op,FLAG_APPLIED)) |
|
|
1457 | tmp = find_arrow (op, type); |
1437 | tmp = find_arrow (op, type); |
1458 | else if (op->type==ARROW && op->race==type) |
1438 | else if (op->type == ARROW && op->race == type) |
1459 | return op; |
1439 | return op; |
1460 | return tmp; |
1440 | return tmp; |
1461 | } |
1441 | } |
1462 | |
1442 | |
1463 | /* |
1443 | /* |
1464 | * Similar to find_arrow, but looks for (roughly) the best arrow to use |
1444 | * Similar to find_arrow, but looks for (roughly) the best arrow to use |
1465 | * against the target. A full test is not performed, simply a basic test |
1445 | * against the target. A full test is not performed, simply a basic test |
1466 | * of resistances. The archer is making a quick guess at what he sees down |
1446 | * of resistances. The archer is making a quick guess at what he sees down |
1467 | * the hall. Failing that it does it's best to pick the highest plus arrow. |
1447 | * the hall. Failing that it does it's best to pick the highest plus arrow. |
1468 | */ |
1448 | */ |
1469 | |
1449 | |
|
|
1450 | object * |
1470 | object *find_better_arrow(object *op, object *target, const char *type, int *better) |
1451 | find_better_arrow (object *op, object *target, const char *type, int *better) |
1471 | { |
1452 | { |
1472 | object *tmp = NULL, *arrow, *ntmp; |
1453 | object *tmp = NULL, *arrow, *ntmp; |
1473 | int attacknum, attacktype, betterby=0, i; |
1454 | int attacknum, attacktype, betterby = 0, i; |
1474 | |
1455 | |
1475 | if (!type) |
1456 | if (!type) |
1476 | return NULL; |
1457 | return NULL; |
1477 | |
1458 | |
1478 | for (arrow=op->inv; arrow; arrow=arrow->below) { |
1459 | for (arrow = op->inv; arrow; arrow = arrow->below) |
1479 | if (arrow->type==CONTAINER && arrow->race==type && |
1460 | { |
1480 | QUERY_FLAG(arrow, FLAG_APPLIED)) { |
1461 | if (arrow->type == CONTAINER && arrow->race == type && QUERY_FLAG (arrow, FLAG_APPLIED)) |
1481 | i = 0; |
1462 | { |
|
|
1463 | i = 0; |
1482 | ntmp = find_better_arrow(arrow, target, type, &i); |
1464 | ntmp = find_better_arrow (arrow, target, type, &i); |
1483 | if (i > betterby) { |
1465 | if (i > betterby) |
1484 | tmp = ntmp; |
1466 | { |
1485 | betterby = i; |
1467 | tmp = ntmp; |
1486 | } |
1468 | betterby = i; |
|
|
1469 | } |
|
|
1470 | } |
1487 | } else if (arrow->type==ARROW && arrow->race==type) { |
1471 | else if (arrow->type == ARROW && arrow->race == type) |
|
|
1472 | { |
1488 | /* allways prefer assasination/slaying */ |
1473 | /* allways prefer assasination/slaying */ |
1489 | if (target->race != NULL && arrow->slaying != NULL && |
1474 | if (target->race != NULL && arrow->slaying != NULL && strstr (arrow->slaying, target->race)) |
1490 | strstr(arrow->slaying, target->race)) { |
1475 | { |
1491 | if (arrow->attacktype & AT_DEATH) { |
1476 | if (arrow->attacktype & AT_DEATH) |
1492 | *better = 100; |
1477 | { |
1493 | return arrow; |
1478 | *better = 100; |
1494 | } else { |
1479 | return arrow; |
1495 | tmp = arrow; |
1480 | } |
|
|
1481 | else |
|
|
1482 | { |
|
|
1483 | tmp = arrow; |
1496 | betterby = (arrow->magic + arrow->stats.dam) * 2; |
1484 | betterby = (arrow->magic + arrow->stats.dam) * 2; |
1497 | } |
1485 | } |
1498 | } else { |
1486 | } |
|
|
1487 | else |
|
|
1488 | { |
1499 | for (attacknum=0; attacknum < NROFATTACKS; attacknum++) { |
1489 | for (attacknum = 0; attacknum < NROFATTACKS; attacknum++) |
|
|
1490 | { |
1500 | attacktype = 1<<attacknum; |
1491 | attacktype = 1 << attacknum; |
1501 | if ((arrow->attacktype & attacktype) && (target->arch->clone.resist[attacknum]) < 0) |
1492 | if ((arrow->attacktype & attacktype) && (target->arch->clone.resist[attacknum]) < 0) |
1502 | if (((arrow->magic + arrow->stats.dam)*(100-target->arch->clone.resist[attacknum])/100) > betterby) { |
1493 | if (((arrow->magic + arrow->stats.dam) * (100 - target->arch->clone.resist[attacknum]) / 100) > betterby) |
1503 | tmp = arrow; |
1494 | { |
|
|
1495 | tmp = arrow; |
1504 | betterby = (arrow->magic + arrow->stats.dam)*(100-target->arch->clone.resist[attacknum])/100; |
1496 | betterby = (arrow->magic + arrow->stats.dam) * (100 - target->arch->clone.resist[attacknum]) / 100; |
1505 | } |
1497 | } |
1506 | } |
1498 | } |
1507 | if ((2 + arrow->magic + arrow->stats.dam) > betterby) { |
1499 | if ((2 + arrow->magic + arrow->stats.dam) > betterby) |
1508 | tmp = arrow; |
1500 | { |
|
|
1501 | tmp = arrow; |
1509 | betterby = 2 + arrow->magic + arrow->stats.dam; |
1502 | betterby = 2 + arrow->magic + arrow->stats.dam; |
1510 | } |
1503 | } |
1511 | if (arrow->title && (1 + arrow->magic + arrow->stats.dam) > betterby) { |
1504 | if (arrow->title && (1 + arrow->magic + arrow->stats.dam) > betterby) |
1512 | tmp = arrow; |
1505 | { |
|
|
1506 | tmp = arrow; |
1513 | betterby = 1 + arrow->magic + arrow->stats.dam; |
1507 | betterby = 1 + arrow->magic + arrow->stats.dam; |
1514 | } |
1508 | } |
|
|
1509 | } |
|
|
1510 | } |
1515 | } |
1511 | } |
1516 | } |
|
|
1517 | } |
|
|
1518 | if (tmp == NULL && arrow == NULL) |
1512 | if (tmp == NULL && arrow == NULL) |
1519 | return find_arrow(op, type); |
1513 | return find_arrow (op, type); |
1520 | |
1514 | |
1521 | *better = betterby; |
1515 | *better = betterby; |
1522 | return tmp; |
1516 | return tmp; |
1523 | } |
1517 | } |
1524 | |
1518 | |
1525 | /* looks in a given direction, finds the first valid target, and calls |
1519 | /* looks in a given direction, finds the first valid target, and calls |
1526 | * find_better_arrow to find a decent arrow to use. |
1520 | * find_better_arrow to find a decent arrow to use. |
1527 | * op = the shooter |
1521 | * op = the shooter |
1528 | * type = bow->race |
1522 | * type = bow->race |
1529 | * dir = fire direction |
1523 | * dir = fire direction |
1530 | */ |
1524 | */ |
1531 | |
1525 | |
|
|
1526 | object * |
1532 | object *pick_arrow_target(object *op, const char *type, int dir) |
1527 | pick_arrow_target (object *op, const char *type, int dir) |
1533 | { |
1528 | { |
1534 | object *tmp = NULL; |
1529 | object *tmp = NULL; |
1535 | mapstruct *m; |
1530 | maptile *m; |
1536 | int i, mflags, found, number; |
1531 | int i, mflags, found, number; |
1537 | sint16 x, y; |
1532 | sint16 x, y; |
1538 | |
1533 | |
1539 | if (op->map == NULL) |
1534 | if (op->map == NULL) |
1540 | return find_arrow(op, type); |
1535 | return find_arrow (op, type); |
1541 | |
1536 | |
1542 | /* do a dex check */ |
1537 | /* do a dex check */ |
1543 | number = (die_roll(2, 40, op, PREFER_LOW)-2)/2; |
1538 | number = (die_roll (2, 40, op, PREFER_LOW) - 2) / 2; |
1544 | if (number > (op->stats.Dex + (op->chosen_skill?op->chosen_skill->level:op->level))) |
1539 | if (number > (op->stats.Dex + (op->chosen_skill ? op->chosen_skill->level : op->level))) |
1545 | return find_arrow(op, type); |
1540 | return find_arrow (op, type); |
1546 | |
1541 | |
1547 | m = op->map; |
1542 | m = op->map; |
1548 | x = op->x; |
1543 | x = op->x; |
1549 | y = op->y; |
1544 | y = op->y; |
1550 | |
1545 | |
1551 | /* find the first target */ |
1546 | /* find the first target */ |
1552 | for (i=0, found=0; i<20; i++) { |
1547 | for (i = 0, found = 0; i < 20; i++) |
|
|
1548 | { |
1553 | x += freearr_x[dir]; |
1549 | x += freearr_x[dir]; |
1554 | y += freearr_y[dir]; |
1550 | y += freearr_y[dir]; |
1555 | mflags = get_map_flags(m, &m, x, y, &x, &y); |
1551 | mflags = get_map_flags (m, &m, x, y, &x, &y); |
1556 | if (mflags & P_OUT_OF_MAP || mflags & P_BLOCKSVIEW) { |
1552 | if (mflags & P_OUT_OF_MAP || mflags & P_BLOCKSVIEW) |
|
|
1553 | { |
1557 | tmp = NULL; |
1554 | tmp = NULL; |
1558 | break; |
1555 | break; |
|
|
1556 | } |
1559 | } else if (GET_MAP_MOVE_BLOCK(m, x, y) == MOVE_FLY_LOW) { |
1557 | else if (GET_MAP_MOVE_BLOCK (m, x, y) == MOVE_FLY_LOW) |
|
|
1558 | { |
1560 | /* This block presumes arrows and the like are MOVE_FLY_SLOW - |
1559 | /* This block presumes arrows and the like are MOVE_FLY_SLOW - |
1561 | * perhaps a bad assumption. |
1560 | * perhaps a bad assumption. |
1562 | */ |
1561 | */ |
1563 | tmp = NULL; |
1562 | tmp = NULL; |
1564 | break; |
1563 | break; |
1565 | } |
1564 | } |
1566 | if (mflags & P_IS_ALIVE) { |
1565 | if (mflags & P_IS_ALIVE) |
|
|
1566 | { |
1567 | for (tmp = GET_MAP_OB(m, x, y); tmp; tmp=tmp->above) |
1567 | for (tmp = GET_MAP_OB (m, x, y); tmp; tmp = tmp->above) |
1568 | if (QUERY_FLAG(tmp, FLAG_ALIVE)) { |
1568 | if (QUERY_FLAG (tmp, FLAG_ALIVE)) |
1569 | found++; |
1569 | { |
1570 | break; |
1570 | found++; |
1571 | } |
1571 | break; |
|
|
1572 | } |
1572 | if (found) |
1573 | if (found) |
1573 | break; |
1574 | break; |
1574 | } |
1575 | } |
1575 | } |
1576 | } |
1576 | if (tmp == NULL) |
1577 | if (tmp == NULL) |
1577 | return find_arrow(op, type); |
1578 | return find_arrow (op, type); |
1578 | |
1579 | |
1579 | if (tmp->head) |
1580 | if (tmp->head) |
1580 | tmp = tmp->head; |
1581 | tmp = tmp->head; |
1581 | |
1582 | |
1582 | return find_better_arrow(op, tmp, type, &i); |
1583 | return find_better_arrow (op, tmp, type, &i); |
1583 | } |
1584 | } |
1584 | |
1585 | |
1585 | /* |
1586 | /* |
1586 | * Creature fires a bow - op can be monster or player. Returns |
1587 | * Creature fires a bow - op can be monster or player. Returns |
1587 | * 1 if bow was actually fired, 0 otherwise. |
1588 | * 1 if bow was actually fired, 0 otherwise. |
… | |
… | |
1590 | * dir is the direction of fire. |
1591 | * dir is the direction of fire. |
1591 | * wc_mod is any special modifier to give (used in special player fire modes) |
1592 | * wc_mod is any special modifier to give (used in special player fire modes) |
1592 | * sx, sy are coordinates to fire arrow from - also used in some of the special |
1593 | * sx, sy are coordinates to fire arrow from - also used in some of the special |
1593 | * player fire modes. |
1594 | * player fire modes. |
1594 | */ |
1595 | */ |
|
|
1596 | int |
1595 | int fire_bow(object *op, object *part, object *arrow, int dir, int wc_mod, |
1597 | fire_bow (object *op, object *part, object *arrow, int dir, int wc_mod, sint16 sx, sint16 sy) |
1596 | sint16 sx, sint16 sy) |
|
|
1597 | { |
1598 | { |
1598 | object *left, *bow; |
1599 | object *left, *bow; |
1599 | tag_t left_tag, tag; |
|
|
1600 | int bowspeed, mflags; |
1600 | int bowspeed, mflags; |
1601 | mapstruct *m; |
1601 | maptile *m; |
1602 | |
1602 | |
1603 | if (!dir) { |
1603 | if (!dir) |
|
|
1604 | { |
1604 | new_draw_info(NDI_UNIQUE, 0, op, "You can't shoot yourself!"); |
1605 | new_draw_info (NDI_UNIQUE, 0, op, "You can't shoot yourself!"); |
1605 | return 0; |
1606 | return 0; |
1606 | } |
1607 | } |
|
|
1608 | |
1607 | if (op->type == PLAYER) |
1609 | if (op->type == PLAYER) |
1608 | bow=op->contr->ranges[range_bow]; |
1610 | bow = op->contr->ranges[range_bow]; |
1609 | else { |
1611 | else |
|
|
1612 | { |
1610 | for(bow=op->inv; bow; bow=bow->below) |
1613 | for (bow = op->inv; bow; bow = bow->below) |
1611 | /* Don't check for applied - monsters don't apply bows - in that way, they |
1614 | /* Don't check for applied - monsters don't apply bows - in that way, they |
1612 | * don't need to switch back and forth between bows and weapons. |
1615 | * don't need to switch back and forth between bows and weapons. |
1613 | */ |
1616 | */ |
1614 | if(bow->type==BOW) |
1617 | if (bow->type == BOW) |
1615 | break; |
1618 | break; |
1616 | |
1619 | |
1617 | if (!bow) { |
1620 | if (!bow) |
|
|
1621 | { |
1618 | LOG (llevError, "Range: bow without activated bow (%s).\n", op->name); |
1622 | LOG (llevError, "Range: bow without activated bow (%s).\n", &op->name); |
1619 | return 0; |
1623 | return 0; |
1620 | } |
1624 | } |
1621 | } |
1625 | } |
|
|
1626 | |
1622 | if( !bow->race || !bow->skill) { |
1627 | if (!bow->race || !bow->skill) |
|
|
1628 | { |
1623 | new_draw_info_format(NDI_UNIQUE, 0, op, "Your %s is broken.", bow->name); |
1629 | new_draw_info_format (NDI_UNIQUE, 0, op, "Your %s is broken.", &bow->name); |
1624 | return 0; |
1630 | return 0; |
1625 | } |
1631 | } |
1626 | |
1632 | |
1627 | bowspeed = bow->stats.sp + dex_bonus[op->stats.Dex]; |
1633 | bowspeed = bow->stats.sp + dex_bonus[op->stats.Dex]; |
1628 | |
1634 | |
1629 | /* penalize ROF for bestarrow */ |
1635 | /* penalize ROF for bestarrow */ |
1630 | if (op->type == PLAYER && op->contr->bowtype == bow_bestarrow) |
1636 | if (op->type == PLAYER && op->contr->bowtype == bow_bestarrow) |
1631 | bowspeed -= dex_bonus[op->stats.Dex] + 5; |
1637 | bowspeed -= dex_bonus[op->stats.Dex] + 5; |
|
|
1638 | |
1632 | if (bowspeed < 1) |
1639 | if (bowspeed < 1) |
1633 | bowspeed = 1; |
1640 | bowspeed = 1; |
1634 | |
1641 | |
1635 | if (arrow == NULL) { |
1642 | if (arrow == NULL) |
|
|
1643 | { |
1636 | if ((arrow=find_arrow(op, bow->race)) == NULL) { |
1644 | if ((arrow = find_arrow (op, bow->race)) == NULL) |
|
|
1645 | { |
1637 | if (op->type == PLAYER) |
1646 | if (op->type == PLAYER) |
1638 | new_draw_info_format(NDI_UNIQUE, 0, op, |
1647 | new_draw_info_format (NDI_UNIQUE, 0, op, "You have no %s left.", &bow->race); |
1639 | "You have no %s left.", bow->race); |
|
|
1640 | /* FLAG_READY_BOW will get reset if the monsters picks up some arrows */ |
1648 | /* FLAG_READY_BOW will get reset if the monsters picks up some arrows */ |
1641 | else |
1649 | else |
1642 | CLEAR_FLAG(op, FLAG_READY_BOW); |
1650 | CLEAR_FLAG (op, FLAG_READY_BOW); |
1643 | return 0; |
1651 | return 0; |
1644 | } |
1652 | } |
1645 | } |
1653 | } |
|
|
1654 | |
1646 | mflags = get_map_flags(op->map, &m, sx, sy, &sx, &sy); |
1655 | mflags = get_map_flags (op->map, &m, sx, sy, &sx, &sy); |
1647 | if (mflags & P_OUT_OF_MAP) { |
1656 | if (mflags & P_OUT_OF_MAP) |
1648 | return 0; |
1657 | return 0; |
1649 | } |
1658 | |
1650 | if (GET_MAP_MOVE_BLOCK(m, sx, sy) == MOVE_FLY_LOW) { |
1659 | if (GET_MAP_MOVE_BLOCK (m, sx, sy) == MOVE_FLY_LOW) |
|
|
1660 | { |
1651 | new_draw_info(NDI_UNIQUE, 0,op,"Something is in the way."); |
1661 | new_draw_info (NDI_UNIQUE, 0, op, "Something is in the way."); |
1652 | return 0; |
1662 | return 0; |
1653 | } |
1663 | } |
1654 | |
1664 | |
1655 | /* this should not happen, but sometimes does */ |
1665 | /* this should not happen, but sometimes does */ |
1656 | if (arrow->nrof==0) { |
1666 | if (arrow->nrof == 0) |
1657 | remove_ob(arrow); |
|
|
1658 | free_object(arrow); |
|
|
1659 | return 0; |
|
|
1660 | } |
1667 | { |
|
|
1668 | arrow->destroy (); |
|
|
1669 | return 0; |
|
|
1670 | } |
1661 | |
1671 | |
1662 | left = arrow; /* these are arrows left to the player */ |
1672 | left = arrow; /* these are arrows left to the player */ |
1663 | left_tag = left->count; |
|
|
1664 | arrow = get_split_ob(arrow, 1); |
1673 | arrow = get_split_ob (arrow, 1); |
1665 | if (arrow == NULL) { |
1674 | if (!arrow) |
|
|
1675 | { |
1666 | new_draw_info_format(NDI_UNIQUE, 0, op, "You have no %s left.", |
1676 | new_draw_info_format (NDI_UNIQUE, 0, op, "You have no %s left.", &bow->race); |
1667 | bow->race); |
1677 | return 0; |
1668 | return 0; |
|
|
1669 | } |
1678 | } |
1670 | set_owner(arrow, op); |
1679 | |
1671 | if (arrow->skill) free_string(arrow->skill); |
1680 | arrow->set_owner (op); |
1672 | arrow->skill = add_refcount(bow->skill); |
1681 | arrow->skill = bow->skill; |
1673 | |
1682 | |
1674 | arrow->direction=dir; |
1683 | arrow->direction = dir; |
1675 | arrow->x = sx; |
1684 | arrow->x = sx; |
1676 | arrow->y = sy; |
1685 | arrow->y = sy; |
1677 | |
1686 | |
1678 | if (op->type == PLAYER) { |
1687 | if (op->type == PLAYER) |
|
|
1688 | { |
1679 | op->speed_left = 0.01 - (float)FABS(op->speed) * 100 / bowspeed; |
1689 | op->speed_left = 0.01 - (float) FABS (op->speed) * 100 / bowspeed; |
1680 | fix_player(op); |
1690 | op->update_stats (); |
1681 | } |
1691 | } |
1682 | |
1692 | |
1683 | SET_ANIMATION(arrow, arrow->direction); |
1693 | SET_ANIMATION (arrow, arrow->direction); |
1684 | arrow->stats.sp = arrow->stats.wc; /* save original wc and dam */ |
1694 | arrow->stats.sp = arrow->stats.wc; /* save original wc and dam */ |
1685 | arrow->stats.hp = arrow->stats.dam; |
1695 | arrow->stats.hp = arrow->stats.dam; |
1686 | arrow->stats.grace = arrow->attacktype; |
1696 | arrow->stats.grace = arrow->attacktype; |
1687 | if (arrow->slaying != NULL) |
1697 | if (arrow->slaying != NULL) |
1688 | arrow->spellarg = strdup_local(arrow->slaying); |
1698 | arrow->spellarg = strdup (arrow->slaying); |
1689 | |
1699 | |
1690 | /* Note that this was different for monsters - they got their level |
1700 | /* Note that this was different for monsters - they got their level |
1691 | * added to the damage. I think the strength bonus is more proper. |
1701 | * added to the damage. I think the strength bonus is more proper. |
1692 | */ |
1702 | */ |
1693 | |
|
|
1694 | arrow->stats.dam += (QUERY_FLAG(bow, FLAG_NO_STRENGTH) ? |
|
|
1695 | 0 : dam_bonus[op->stats.Str]) + |
|
|
1696 | bow->stats.dam + bow->magic + arrow->magic; |
|
|
1697 | |
1703 | |
|
|
1704 | arrow->stats.dam += (QUERY_FLAG (bow, FLAG_NO_STRENGTH) ? 0 : dam_bonus[op->stats.Str]) + bow->stats.dam + bow->magic + arrow->magic; |
|
|
1705 | |
1698 | /* update the speed */ |
1706 | /* update the speed */ |
1699 | arrow->speed = (float)((QUERY_FLAG(bow, FLAG_NO_STRENGTH) ? |
1707 | arrow->speed = (float) ((QUERY_FLAG (bow, FLAG_NO_STRENGTH) ? |
1700 | 0 : dam_bonus[op->stats.Str]) + |
1708 | 0 : dam_bonus[op->stats.Str]) + bow->magic + arrow->magic) / 5.0 + (float) bow->stats.dam / 7.0; |
1701 | bow->magic + arrow->magic) / 5.0 + |
|
|
1702 | (float)bow->stats.dam / 7.0; |
|
|
1703 | |
1709 | |
1704 | if (arrow->speed < 1.0) |
1710 | if (arrow->speed < 1.0) |
1705 | arrow->speed = 1.0; |
1711 | arrow->speed = 1.0; |
1706 | update_ob_speed(arrow); |
1712 | update_ob_speed (arrow); |
1707 | arrow->speed_left = 0; |
1713 | arrow->speed_left = 0; |
1708 | |
1714 | |
1709 | if (op->type == PLAYER) { |
1715 | if (op->type == PLAYER) |
|
|
1716 | { |
1710 | arrow->stats.wc = 20 - bow->magic - arrow->magic - |
1717 | arrow->stats.wc = 20 - bow->magic - arrow->magic - |
1711 | (op->chosen_skill?op->chosen_skill->level:op->level) - |
1718 | (op->chosen_skill ? op->chosen_skill->level : op->level) - |
1712 | dex_bonus[op->stats.Dex] - thaco_bonus[op->stats.Str] - |
1719 | dex_bonus[op->stats.Dex] - thaco_bonus[op->stats.Str] - arrow->stats.wc - bow->stats.wc + wc_mod; |
1713 | arrow->stats.wc - bow->stats.wc + wc_mod; |
|
|
1714 | |
1720 | |
1715 | arrow->level = op->chosen_skill?op->chosen_skill->level:op->level; |
1721 | arrow->level = op->chosen_skill ? op->chosen_skill->level : op->level; |
1716 | } else { |
1722 | } |
|
|
1723 | else |
|
|
1724 | { |
1717 | arrow->stats.wc= op->stats.wc - bow->magic - arrow->magic - |
1725 | arrow->stats.wc = op->stats.wc - bow->magic - arrow->magic - arrow->stats.wc + wc_mod; |
1718 | arrow->stats.wc + wc_mod; |
|
|
1719 | |
|
|
1720 | arrow->level = op->level; |
1726 | arrow->level = op->level; |
1721 | } |
1727 | } |
|
|
1728 | |
1722 | if (arrow->attacktype == AT_PHYSICAL) |
1729 | if (arrow->attacktype == AT_PHYSICAL) |
1723 | arrow->attacktype |= bow->attacktype; |
1730 | arrow->attacktype |= bow->attacktype; |
|
|
1731 | |
1724 | if (bow->slaying != NULL) |
1732 | if (bow->slaying) |
1725 | arrow->slaying = add_string(bow->slaying); |
1733 | arrow->slaying = bow->slaying; |
1726 | |
1734 | |
1727 | arrow->map = m; |
1735 | arrow->map = m; |
1728 | arrow->move_type = MOVE_FLY_LOW; |
1736 | arrow->move_type = MOVE_FLY_LOW; |
1729 | arrow->move_on = MOVE_FLY_LOW | MOVE_WALK; |
1737 | arrow->move_on = MOVE_FLY_LOW | MOVE_WALK; |
1730 | |
1738 | |
1731 | play_sound_map(op->map, op->x, op->y, SOUND_FIRE_ARROW); |
1739 | play_sound_map (op->map, op->x, op->y, SOUND_FIRE_ARROW); |
1732 | tag = arrow->count; |
|
|
1733 | insert_ob_in_map(arrow, m, op, 0); |
1740 | insert_ob_in_map (arrow, m, op, 0); |
1734 | |
1741 | |
1735 | if (!was_destroyed(arrow, tag)) |
1742 | if (!arrow->destroyed ()) |
1736 | move_arrow(arrow); |
1743 | move_arrow (arrow); |
1737 | |
1744 | |
1738 | if (op->type == PLAYER) { |
1745 | if (op->type == PLAYER) |
1739 | if (was_destroyed (left, left_tag)) |
1746 | { |
|
|
1747 | if (left->destroyed ()) |
1740 | esrv_del_item(op->contr, left_tag); |
1748 | esrv_del_item (op->contr, left->count); |
1741 | else |
1749 | else |
1742 | esrv_send_item(op, left); |
1750 | esrv_send_item (op, left); |
1743 | } |
1751 | } |
|
|
1752 | |
1744 | return 1; |
1753 | return 1; |
1745 | } |
1754 | } |
1746 | |
1755 | |
1747 | /* Special fire code for players - this takes into |
1756 | /* Special fire code for players - this takes into |
1748 | * account the special fire modes players can have |
1757 | * account the special fire modes players can have |
1749 | * but monsters can't. Putting that code here |
1758 | * but monsters can't. Putting that code here |
1750 | * makes the fire_bow code much cleaner. |
1759 | * makes the fire_bow code much cleaner. |
1751 | * this function should only be called if 'op' is a player, |
1760 | * this function should only be called if 'op' is a player, |
1752 | * hence the function name. |
1761 | * hence the function name. |
1753 | */ |
1762 | */ |
|
|
1763 | int |
1754 | int player_fire_bow(object *op, int dir) |
1764 | player_fire_bow (object *op, int dir) |
1755 | { |
1765 | { |
1756 | int ret=0, wcmod=0; |
1766 | int ret = 0, wcmod = 0; |
1757 | |
1767 | |
1758 | if (op->contr->bowtype == bow_bestarrow) { |
1768 | if (op->contr->bowtype == bow_bestarrow) |
1759 | ret = fire_bow(op, op, |
1769 | { |
1760 | pick_arrow_target(op, op->contr->ranges[range_bow]->race, dir), |
1770 | ret = fire_bow (op, op, pick_arrow_target (op, op->contr->ranges[range_bow]->race, dir), dir, 0, op->x, op->y); |
1761 | dir, 0, op->x, op->y); |
1771 | } |
1762 | } else if (op->contr->bowtype >= bow_n && op->contr->bowtype <= bow_nw) { |
1772 | else if (op->contr->bowtype >= bow_n && op->contr->bowtype <= bow_nw) |
|
|
1773 | { |
1763 | if (!similar_direction(dir, op->contr->bowtype - bow_n + 1)) |
1774 | if (!similar_direction (dir, op->contr->bowtype - bow_n + 1)) |
1764 | wcmod =-1; |
1775 | wcmod = -1; |
1765 | ret = fire_bow(op, op, NULL, op->contr->bowtype - bow_n + 1, wcmod, |
1776 | ret = fire_bow (op, op, NULL, op->contr->bowtype - bow_n + 1, wcmod, op->x, op->y); |
1766 | op->x, op->y); |
1777 | } |
1767 | } else if (op->contr->bowtype == bow_threewide) { |
1778 | else if (op->contr->bowtype == bow_threewide) |
|
|
1779 | { |
1768 | ret = fire_bow(op, op, NULL, dir, 0, op->x, op->y); |
1780 | ret = fire_bow (op, op, NULL, dir, 0, op->x, op->y); |
1769 | ret |= fire_bow(op, op, NULL, dir, -5, op->x + freearr_x[absdir(dir+2)], op->y + freearr_y[absdir(dir+2)]); |
1781 | ret |= fire_bow (op, op, NULL, dir, -5, op->x + freearr_x[absdir (dir + 2)], op->y + freearr_y[absdir (dir + 2)]); |
1770 | ret |= fire_bow(op, op, NULL, dir, -5, op->x + freearr_x[absdir(dir-2)], op->y + freearr_y[absdir(dir-2)]); |
1782 | ret |= fire_bow (op, op, NULL, dir, -5, op->x + freearr_x[absdir (dir - 2)], op->y + freearr_y[absdir (dir - 2)]); |
|
|
1783 | } |
1771 | } else if (op->contr->bowtype == bow_spreadshot) { |
1784 | else if (op->contr->bowtype == bow_spreadshot) |
|
|
1785 | { |
1772 | ret |= fire_bow(op, op, NULL, dir, 0, op->x, op->y); |
1786 | ret |= fire_bow (op, op, NULL, dir, 0, op->x, op->y); |
1773 | ret |= fire_bow(op, op, NULL, absdir(dir-1), -5, op->x, op->y); |
1787 | ret |= fire_bow (op, op, NULL, absdir (dir - 1), -5, op->x, op->y); |
1774 | ret |= fire_bow(op, op, NULL, absdir(dir+1), -5, op->x, op->y); |
1788 | ret |= fire_bow (op, op, NULL, absdir (dir + 1), -5, op->x, op->y); |
1775 | |
1789 | |
1776 | } else { |
1790 | } |
|
|
1791 | else |
|
|
1792 | { |
1777 | /* Simple case */ |
1793 | /* Simple case */ |
1778 | ret = fire_bow(op, op, NULL, dir, 0, op->x, op->y); |
1794 | ret = fire_bow (op, op, NULL, dir, 0, op->x, op->y); |
1779 | } |
1795 | } |
1780 | return ret; |
1796 | return ret; |
1781 | } |
1797 | } |
1782 | |
1798 | |
1783 | |
1799 | |
1784 | /* Fires a misc (wand/rod/horn) object in 'dir'. |
1800 | /* Fires a misc (wand/rod/horn) object in 'dir'. |
1785 | * Broken apart from 'fire' to keep it more readable. |
1801 | * Broken apart from 'fire' to keep it more readable. |
1786 | */ |
1802 | */ |
|
|
1803 | void |
1787 | void fire_misc_object(object *op, int dir) |
1804 | fire_misc_object (object *op, int dir) |
1788 | { |
1805 | { |
1789 | object *item; |
1806 | object *item; |
1790 | |
1807 | |
1791 | if (!op->contr->ranges[range_misc]) { |
1808 | if (!op->contr->ranges[range_misc]) |
|
|
1809 | { |
1792 | new_draw_info(NDI_UNIQUE, 0,op,"You have range item readied."); |
1810 | new_draw_info (NDI_UNIQUE, 0, op, "You have range item readied."); |
1793 | return; |
1811 | return; |
1794 | } |
1812 | } |
1795 | |
1813 | |
1796 | item = op->contr->ranges[range_misc]; |
1814 | item = op->contr->ranges[range_misc]; |
1797 | if (!item->inv) { |
1815 | if (!item->inv) |
|
|
1816 | { |
1798 | LOG(llevError,"Object %s lacks a spell\n", item->name); |
1817 | LOG (llevError, "Object %s lacks a spell\n", &item->name); |
1799 | return; |
1818 | return; |
1800 | } |
1819 | } |
1801 | if (item->type == WAND) { |
1820 | if (item->type == WAND) |
|
|
1821 | { |
1802 | if(item->stats.food<=0) { |
1822 | if (item->stats.food <= 0) |
|
|
1823 | { |
1803 | play_sound_player_only(op->contr, SOUND_WAND_POOF,0,0); |
1824 | play_sound_player_only (op->contr, SOUND_WAND_POOF, 0, 0); |
1804 | new_draw_info_format(NDI_UNIQUE, 0,op,"The %s goes poof.", query_base_name(item, 0)); |
1825 | new_draw_info_format (NDI_UNIQUE, 0, op, "The %s goes poof.", query_base_name (item, 0)); |
1805 | return; |
1826 | return; |
1806 | } |
1827 | } |
|
|
1828 | } |
1807 | } else if (item->type == ROD || item->type==HORN) { |
1829 | else if (item->type == ROD || item->type == HORN) |
|
|
1830 | { |
1808 | if(item->stats.hp<MAX(item->inv->stats.sp, item->inv->stats.grace)) { |
1831 | if (item->stats.hp < MAX (item->inv->stats.sp, item->inv->stats.grace)) |
|
|
1832 | { |
1809 | play_sound_player_only(op->contr, SOUND_WAND_POOF,0,0); |
1833 | play_sound_player_only (op->contr, SOUND_WAND_POOF, 0, 0); |
1810 | if (item->type== ROD) |
1834 | if (item->type == ROD) |
1811 | new_draw_info_format(NDI_UNIQUE, 0,op, |
1835 | new_draw_info_format (NDI_UNIQUE, 0, op, "The %s whines for a while, but nothing happens.", query_base_name (item, 0)); |
1812 | "The %s whines for a while, but nothing happens.", query_base_name(item,0)); |
1836 | else |
1813 | else |
1837 | new_draw_info_format (NDI_UNIQUE, 0, op, "The %s needs more time to charge.", query_base_name (item, 0)); |
1814 | new_draw_info_format(NDI_UNIQUE, 0,op, |
|
|
1815 | "The %s needs more time to charge.", query_base_name(item,0)); |
|
|
1816 | return; |
1838 | return; |
1817 | } |
1839 | } |
1818 | } |
1840 | } |
1819 | |
1841 | |
1820 | if(cast_spell(op,item,dir,item->inv,NULL)) { |
1842 | if (cast_spell (op, item, dir, item->inv, NULL)) |
|
|
1843 | { |
1821 | SET_FLAG(op, FLAG_BEEN_APPLIED); /* You now know something about it */ |
1844 | SET_FLAG (op, FLAG_BEEN_APPLIED); /* You now know something about it */ |
1822 | if (item->type == WAND) { |
1845 | if (item->type == WAND) |
|
|
1846 | { |
1823 | if (!(--item->stats.food)) { |
1847 | if (!(--item->stats.food)) |
1824 | object *tmp; |
1848 | { |
1825 | if (item->arch) { |
1849 | object *tmp; |
|
|
1850 | |
|
|
1851 | if (item->arch) |
|
|
1852 | { |
1826 | CLEAR_FLAG(item, FLAG_ANIMATE); |
1853 | CLEAR_FLAG (item, FLAG_ANIMATE); |
1827 | item->face = item->arch->clone.face; |
1854 | item->face = item->arch->clone.face; |
1828 | item->speed = 0; |
1855 | item->speed = 0; |
1829 | update_ob_speed(item); |
1856 | update_ob_speed (item); |
1830 | } |
1857 | } |
1831 | if ((tmp=is_player_inv(item))) |
1858 | if ((tmp = item->in_player ())) |
1832 | esrv_update_item(UPD_ANIM, tmp, item); |
1859 | esrv_update_item (UPD_ANIM, tmp, item); |
1833 | } |
1860 | } |
1834 | } |
1861 | } |
1835 | else if (item->type == ROD || item->type==HORN) { |
1862 | else if (item->type == ROD || item->type == HORN) |
|
|
1863 | { |
1836 | drain_rod_charge(item); |
1864 | drain_rod_charge (item); |
1837 | } |
1865 | } |
1838 | } |
1866 | } |
1839 | } |
1867 | } |
1840 | |
1868 | |
1841 | /* Received a fire command for the player - go and do it. |
1869 | /* Received a fire command for the player - go and do it. |
1842 | */ |
1870 | */ |
|
|
1871 | void |
1843 | void fire(object *op,int dir) { |
1872 | fire (object *op, int dir) |
|
|
1873 | { |
1844 | int spellcost=0; |
1874 | int spellcost = 0; |
1845 | |
1875 | |
1846 | /* check for loss of invisiblity/hide */ |
1876 | /* check for loss of invisiblity/hide */ |
1847 | if (action_makes_visible(op)) make_visible(op); |
1877 | if (action_makes_visible (op)) |
|
|
1878 | make_visible (op); |
1848 | |
1879 | |
1849 | switch(op->contr->shoottype) { |
1880 | switch (op->contr->shoottype) |
|
|
1881 | { |
1850 | case range_none: |
1882 | case range_none: |
1851 | return; |
|
|
1852 | |
|
|
1853 | case range_bow: |
|
|
1854 | player_fire_bow(op, dir); |
|
|
1855 | return; |
|
|
1856 | |
|
|
1857 | case range_magic: /* Casting spells */ |
|
|
1858 | spellcost=(cast_spell(op,op,dir,op->contr->ranges[range_magic],op->contr->spellparam[0]?op->contr->spellparam:NULL)); |
|
|
1859 | return; |
|
|
1860 | |
|
|
1861 | case range_misc: |
|
|
1862 | fire_misc_object(op, dir); |
|
|
1863 | return; |
|
|
1864 | |
|
|
1865 | case range_golem: /* Control summoned monsters from scrolls */ |
|
|
1866 | if(op->contr->ranges[range_golem]==NULL || |
|
|
1867 | op->contr->golem_count != op->contr->ranges[range_golem]->count) { |
|
|
1868 | op->contr->ranges[range_golem] = NULL; |
|
|
1869 | op->contr->shoottype=range_none; |
|
|
1870 | op->contr->golem_count = 0; |
|
|
1871 | } |
|
|
1872 | else |
|
|
1873 | control_golem(op->contr->ranges[range_golem], dir); |
|
|
1874 | return; |
|
|
1875 | |
|
|
1876 | case range_skill: |
|
|
1877 | if(!op->chosen_skill) { |
|
|
1878 | if(op->type==PLAYER) |
|
|
1879 | new_draw_info(NDI_UNIQUE, 0,op,"You have no applicable skill to use."); |
|
|
1880 | return; |
|
|
1881 | } |
|
|
1882 | (void) do_skill(op,op,op->chosen_skill,dir,NULL); |
|
|
1883 | return; |
|
|
1884 | case range_builder: |
|
|
1885 | apply_map_builder( op, dir ); |
|
|
1886 | return; |
1883 | return; |
1887 | default: |
1884 | |
|
|
1885 | case range_bow: |
|
|
1886 | player_fire_bow (op, dir); |
|
|
1887 | return; |
|
|
1888 | |
|
|
1889 | case range_magic: /* Casting spells */ |
|
|
1890 | spellcost = (cast_spell (op, op, dir, op->contr->ranges[range_magic], op->contr->spellparam[0] ? op->contr->spellparam : 0)); |
|
|
1891 | return; |
|
|
1892 | |
|
|
1893 | case range_misc: |
|
|
1894 | fire_misc_object (op, dir); |
|
|
1895 | return; |
|
|
1896 | |
|
|
1897 | case range_golem: /* Control summoned monsters from scrolls */ |
|
|
1898 | if (QUERY_FLAG (op->contr->ranges[range_golem], FLAG_REMOVED)) |
|
|
1899 | { |
|
|
1900 | op->contr->ranges[range_golem] = 0; |
|
|
1901 | op->contr->shoottype = range_none; |
|
|
1902 | } |
|
|
1903 | else |
|
|
1904 | control_golem (op->contr->ranges[range_golem], dir); |
|
|
1905 | return; |
|
|
1906 | |
|
|
1907 | case range_skill: |
|
|
1908 | if (!op->chosen_skill) |
|
|
1909 | { |
|
|
1910 | if (op->type == PLAYER) |
|
|
1911 | new_draw_info (NDI_UNIQUE, 0, op, "You have no applicable skill to use."); |
|
|
1912 | return; |
|
|
1913 | } |
|
|
1914 | (void) do_skill (op, op, op->chosen_skill, dir, NULL); |
|
|
1915 | return; |
|
|
1916 | case range_builder: |
|
|
1917 | apply_map_builder (op, dir); |
|
|
1918 | return; |
|
|
1919 | default: |
1888 | new_draw_info(NDI_UNIQUE, 0,op,"Illegal shoot type."); |
1920 | new_draw_info (NDI_UNIQUE, 0, op, "Illegal shoot type."); |
1889 | return; |
1921 | return; |
1890 | } |
1922 | } |
1891 | } |
1923 | } |
1892 | |
1924 | |
1893 | |
1925 | |
1894 | |
1926 | |
… | |
… | |
1901 | * inv is the objects inventory to searched |
1933 | * inv is the objects inventory to searched |
1902 | * door is the door we are trying to match against. |
1934 | * door is the door we are trying to match against. |
1903 | * This function can be called recursively to search containers. |
1935 | * This function can be called recursively to search containers. |
1904 | */ |
1936 | */ |
1905 | |
1937 | |
|
|
1938 | object * |
1906 | object * find_key(object *pl, object *container, object *door) |
1939 | find_key (object *pl, object *container, object *door) |
1907 | { |
1940 | { |
1908 | object *tmp,*key; |
1941 | object *tmp, *key; |
1909 | |
1942 | |
1910 | /* Should not happen, but sanity checking is never bad */ |
1943 | /* Should not happen, but sanity checking is never bad */ |
1911 | if (container->inv == NULL) return NULL; |
1944 | if (container->inv == NULL) |
|
|
1945 | return NULL; |
1912 | |
1946 | |
1913 | /* First, lets try to find a key in the top level inventory */ |
1947 | /* First, lets try to find a key in the top level inventory */ |
1914 | for (tmp=container->inv; tmp!=NULL; tmp=tmp->below) { |
1948 | for (tmp = container->inv; tmp != NULL; tmp = tmp->below) |
|
|
1949 | { |
1915 | if (door->type==DOOR && tmp->type==KEY) break; |
1950 | if (door->type == DOOR && tmp->type == KEY) |
|
|
1951 | break; |
1916 | /* For sanity, we should really check door type, but other stuff |
1952 | /* For sanity, we should really check door type, but other stuff |
1917 | * (like containers) can be locked with special keys |
1953 | * (like containers) can be locked with special keys |
1918 | */ |
1954 | */ |
1919 | if (tmp->slaying && tmp->type==SPECIAL_KEY && |
1955 | if (tmp->slaying && tmp->type == SPECIAL_KEY && tmp->slaying == door->slaying) |
1920 | tmp->slaying==door->slaying) break; |
1956 | break; |
1921 | } |
1957 | } |
1922 | /* No key found - lets search inventories now */ |
1958 | /* No key found - lets search inventories now */ |
1923 | /* If we find and use a key in an inventory, return at that time. |
1959 | /* If we find and use a key in an inventory, return at that time. |
1924 | * otherwise, if we search all the inventories and still don't find |
1960 | * otherwise, if we search all the inventories and still don't find |
1925 | * a key, return |
1961 | * a key, return |
1926 | */ |
1962 | */ |
1927 | if (!tmp) { |
1963 | if (!tmp) |
|
|
1964 | { |
1928 | for (tmp=container->inv; tmp!=NULL; tmp=tmp->below) { |
1965 | for (tmp = container->inv; tmp != NULL; tmp = tmp->below) |
|
|
1966 | { |
1929 | /* No reason to search empty containers */ |
1967 | /* No reason to search empty containers */ |
1930 | if (tmp->type==CONTAINER && tmp->inv) { |
1968 | if (tmp->type == CONTAINER && tmp->inv) |
1931 | if ((key=find_key(pl, tmp, door))!=NULL) return key; |
1969 | { |
|
|
1970 | if ((key = find_key (pl, tmp, door)) != NULL) |
|
|
1971 | return key; |
|
|
1972 | } |
|
|
1973 | } |
|
|
1974 | if (!tmp) |
|
|
1975 | return NULL; |
1932 | } |
1976 | } |
1933 | } |
|
|
1934 | if (!tmp) return NULL; |
|
|
1935 | } |
|
|
1936 | /* We get down here if we have found a key. Now if its in a container, |
1977 | /* We get down here if we have found a key. Now if its in a container, |
1937 | * see if we actually want to use it |
1978 | * see if we actually want to use it |
1938 | */ |
1979 | */ |
1939 | if (pl!=container) { |
1980 | if (pl != container) |
|
|
1981 | { |
1940 | /* Only let players use keys in containers */ |
1982 | /* Only let players use keys in containers */ |
1941 | if (!pl->contr) return NULL; |
1983 | if (!pl->contr) |
|
|
1984 | return NULL; |
1942 | /* cases where this fails: |
1985 | /* cases where this fails: |
1943 | * If we only search the player inventory, return now since we |
1986 | * If we only search the player inventory, return now since we |
1944 | * are not in the players inventory. |
1987 | * are not in the players inventory. |
1945 | * If the container is not active, return now since only active |
1988 | * If the container is not active, return now since only active |
1946 | * containers can be used. |
1989 | * containers can be used. |
1947 | * If we only search keyrings and the container does not have |
1990 | * If we only search keyrings and the container does not have |
1948 | * a race/isn't a keyring. |
1991 | * a race/isn't a keyring. |
1949 | * No checking for all containers - to fall through past here, |
1992 | * No checking for all containers - to fall through past here, |
1950 | * inv must have been an container and must have been active. |
1993 | * inv must have been an container and must have been active. |
1951 | * |
1994 | * |
1952 | * Change the color so that the message doesn't disappear with |
1995 | * Change the color so that the message doesn't disappear with |
1953 | * all the others. |
1996 | * all the others. |
1954 | */ |
1997 | */ |
1955 | if (pl->contr->usekeys == key_inventory || |
1998 | if (pl->contr->usekeys == key_inventory || |
1956 | !QUERY_FLAG(container, FLAG_APPLIED) || |
1999 | !QUERY_FLAG (container, FLAG_APPLIED) || |
1957 | (pl->contr->usekeys == keyrings && |
2000 | (pl->contr->usekeys == keyrings && (!container->race || strcmp (container->race, "keys")))) |
1958 | (!container->race || strcmp(container->race, "keys"))) |
2001 | { |
1959 | ) { |
|
|
1960 | new_draw_info_format(NDI_UNIQUE|NDI_BROWN, 0, pl, |
2002 | new_draw_info_format (NDI_UNIQUE | NDI_BROWN, 0, pl, |
1961 | "The %s in your %s vibrates as you approach the door", |
2003 | "The %s in your %s vibrates as you approach the door", query_name (tmp), query_name (container)); |
1962 | query_name(tmp), query_name(container)); |
|
|
1963 | return NULL; |
2004 | return NULL; |
1964 | } |
2005 | } |
1965 | } |
2006 | } |
1966 | return tmp; |
2007 | return tmp; |
1967 | } |
2008 | } |
1968 | |
2009 | |
1969 | /* moved door processing out of move_player_attack. |
2010 | /* moved door processing out of move_player_attack. |
1970 | * returns 1 if player has opened the door with a key |
2011 | * returns 1 if player has opened the door with a key |
1971 | * such that the caller should not do anything more, |
2012 | * such that the caller should not do anything more, |
1972 | * 0 otherwise |
2013 | * 0 otherwise |
1973 | */ |
2014 | */ |
|
|
2015 | static int |
1974 | static int player_attack_door(object *op, object *door) |
2016 | player_attack_door (object *op, object *door) |
1975 | { |
2017 | { |
1976 | |
|
|
1977 | /* If its a door, try to find a use a key. If we do destroy the door, |
2018 | /* If its a door, try to find a use a key. If we do destroy the door, |
1978 | * might as well return immediately as there is nothing more to do - |
2019 | * might as well return immediately as there is nothing more to do - |
1979 | * otherwise, we fall through to the rest of the code. |
2020 | * otherwise, we fall through to the rest of the code. |
1980 | */ |
2021 | */ |
1981 | object *key=find_key(op, op, door); |
2022 | object *key = find_key (op, op, door); |
1982 | |
2023 | |
1983 | /* IF we found a key, do some extra work */ |
2024 | /* IF we found a key, do some extra work */ |
1984 | if (key) { |
2025 | if (key) |
|
|
2026 | { |
1985 | object *container=key->env; |
2027 | object *container = key->env; |
1986 | |
2028 | |
1987 | play_sound_map(op->map, op->x, op->y, SOUND_OPEN_DOOR); |
2029 | play_sound_map (op->map, op->x, op->y, SOUND_OPEN_DOOR); |
1988 | if(action_makes_visible(op)) make_visible(op); |
2030 | if (action_makes_visible (op)) |
|
|
2031 | make_visible (op); |
1989 | if(door->inv &&(door->inv->type ==RUNE || door->inv->type ==TRAP)) spring_trap(door->inv,op); |
2032 | if (door->inv && (door->inv->type == RUNE || door->inv->type == TRAP)) |
|
|
2033 | spring_trap (door->inv, op); |
1990 | if (door->type == DOOR) { |
2034 | if (door->type == DOOR) |
|
|
2035 | { |
1991 | hit_player(door,9998,op,AT_PHYSICAL,1); /* Break through the door */ |
2036 | hit_player (door, 9998, op, AT_PHYSICAL, 1); /* Break through the door */ |
1992 | } |
2037 | } |
1993 | else if(door->type==LOCKED_DOOR) { |
2038 | else if (door->type == LOCKED_DOOR) |
1994 | new_draw_info_format(NDI_UNIQUE, NDI_BROWN, op, |
2039 | { |
1995 | "You open the door with the %s", query_short_name(key)); |
2040 | new_draw_info_format (NDI_UNIQUE, NDI_BROWN, op, "You open the door with the %s", query_short_name (key)); |
1996 | remove_door2(door); /* remove door without violence ;-) */ |
2041 | remove_door2 (door); /* remove door without violence ;-) */ |
1997 | } |
2042 | } |
1998 | /* Do this after we print the message */ |
2043 | /* Do this after we print the message */ |
1999 | decrease_ob(key); /* Use up one of the keys */ |
2044 | decrease_ob (key); /* Use up one of the keys */ |
2000 | /* Need to update the weight the container the key was in */ |
2045 | /* Need to update the weight the container the key was in */ |
2001 | if (container != op) |
2046 | if (container != op) |
2002 | esrv_update_item(UPD_WEIGHT, op, container); |
2047 | esrv_update_item (UPD_WEIGHT, op, container); |
2003 | return 1; /* Nothing more to do below */ |
2048 | return 1; /* Nothing more to do below */ |
|
|
2049 | } |
2004 | } else if (door->type==LOCKED_DOOR) { |
2050 | else if (door->type == LOCKED_DOOR) |
|
|
2051 | { |
2005 | /* Might as well return now - no other way to open this */ |
2052 | /* Might as well return now - no other way to open this */ |
2006 | new_draw_info(NDI_UNIQUE | NDI_NAVY, 0, op, door->msg); |
2053 | new_draw_info (NDI_UNIQUE | NDI_NAVY, 0, op, door->msg); |
2007 | return 1; |
2054 | return 1; |
2008 | } |
2055 | } |
2009 | return 0; |
2056 | return 0; |
2010 | } |
2057 | } |
2011 | |
2058 | |
2012 | /* This function is just part of a breakup from move_player. |
2059 | /* This function is just part of a breakup from move_player. |
2013 | * It should keep the code cleaner. |
2060 | * It should keep the code cleaner. |
2014 | * When this is called, the players direction has been updated |
2061 | * When this is called, the players direction has been updated |
2015 | * (taking into account confusion.) The player is also actually |
2062 | * (taking into account confusion.) The player is also actually |
2016 | * going to try and move (not fire weapons). |
2063 | * going to try and move (not fire weapons). |
2017 | */ |
2064 | */ |
2018 | |
2065 | void |
2019 | void move_player_attack(object *op, int dir) |
2066 | move_player_attack (object *op, int dir) |
2020 | { |
2067 | { |
2021 | object *tmp, *mon; |
2068 | object *tmp, *mon; |
2022 | sint16 nx, ny; |
2069 | sint16 nx, ny; |
2023 | int on_battleground; |
2070 | int on_battleground; |
2024 | mapstruct *m; |
2071 | maptile *m; |
2025 | |
2072 | |
2026 | nx=freearr_x[dir]+op->x; |
2073 | nx = freearr_x[dir] + op->x; |
2027 | ny=freearr_y[dir]+op->y; |
2074 | ny = freearr_y[dir] + op->y; |
2028 | |
2075 | |
2029 | on_battleground = op_on_battleground(op, NULL, NULL); |
2076 | on_battleground = op_on_battleground (op, 0, 0); |
2030 | |
2077 | |
2031 | /* If braced, or can't move to the square, and it is not out of the |
2078 | /* If braced, or can't move to the square, and it is not out of the |
2032 | * map, attack it. Note order of if statement is important - don't |
2079 | * map, attack it. Note order of if statement is important - don't |
2033 | * want to be calling move_ob if braced, because move_ob will move the |
2080 | * want to be calling move_ob if braced, because move_ob will move the |
2034 | * player. This is a pretty nasty hack, because if we could |
2081 | * player. This is a pretty nasty hack, because if we could |
2035 | * move to some space, it then means that if we are braced, we should |
2082 | * move to some space, it then means that if we are braced, we should |
2036 | * do nothing at all. As it is, if we are braced, we go through |
2083 | * do nothing at all. As it is, if we are braced, we go through |
2037 | * quite a bit of processing. However, it probably is less than what |
2084 | * quite a bit of processing. However, it probably is less than what |
2038 | * move_ob uses. |
2085 | * move_ob uses. |
2039 | */ |
2086 | */ |
2040 | if ((op->contr->braced || !move_ob(op,dir,op)) && !out_of_map(op->map,nx,ny)) { |
2087 | if ((op->contr->braced || !move_ob (op, dir, op)) && !out_of_map (op->map, nx, ny)) |
|
|
2088 | { |
2041 | if (OUT_OF_REAL_MAP(op->map, nx, ny)) { |
2089 | if (OUT_OF_REAL_MAP (op->map, nx, ny)) |
|
|
2090 | { |
2042 | m = get_map_from_coord(op->map, &nx, &ny); |
2091 | m = get_map_from_coord (op->map, &nx, &ny); |
2043 | if (!m) return; /* Don't think this should happen */ |
2092 | if (!m) |
2044 | } |
2093 | return; /* Don't think this should happen */ |
2045 | else m =op->map; |
2094 | } |
2046 | |
2095 | else |
2047 | if ((tmp=get_map_ob(m,nx,ny))==NULL) { |
2096 | m = op->map; |
|
|
2097 | |
|
|
2098 | if ((tmp = GET_MAP_OB (m, nx, ny)) == NULL) |
|
|
2099 | { |
2048 | /* LOG(llevError,"player_move_attack: get_map_ob returns NULL, but player can not more there.\n");*/ |
2100 | /* LOG(llevError,"player_move_attack: GET_MAP_OB returns NULL, but player can not move there.\n"); */ |
2049 | return; |
2101 | return; |
2050 | } |
2102 | } |
2051 | |
2103 | |
2052 | mon = NULL; |
2104 | mon = 0; |
2053 | /* Go through all the objects, and find ones of interest. Only stop if |
2105 | /* Go through all the objects, and find ones of interest. Only stop if |
2054 | * we find a monster - that is something we know we want to attack. |
2106 | * we find a monster - that is something we know we want to attack. |
2055 | * if its a door or barrel (can roll) see if there may be monsters |
2107 | * if its a door or barrel (can roll) see if there may be monsters |
2056 | * on the space |
2108 | * on the space |
2057 | */ |
2109 | */ |
2058 | while (tmp!=NULL) { |
2110 | while (tmp) |
|
|
2111 | { |
2059 | if (tmp == op) { |
2112 | if (tmp == op) |
2060 | tmp=tmp->above; |
2113 | { |
2061 | continue; |
2114 | tmp = tmp->above; |
2062 | } |
2115 | continue; |
|
|
2116 | } |
|
|
2117 | |
2063 | if (QUERY_FLAG(tmp,FLAG_ALIVE)) { |
2118 | if (QUERY_FLAG (tmp, FLAG_ALIVE)) |
2064 | mon = tmp; |
2119 | { |
2065 | break; |
2120 | mon = tmp; |
2066 | } |
2121 | break; |
|
|
2122 | } |
|
|
2123 | |
2067 | if (tmp->type==LOCKED_DOOR || QUERY_FLAG(tmp,FLAG_CAN_ROLL)) |
2124 | if (tmp->type == LOCKED_DOOR || QUERY_FLAG (tmp, FLAG_CAN_ROLL)) |
2068 | mon = tmp; |
2125 | mon = tmp; |
|
|
2126 | |
2069 | tmp=tmp->above; |
2127 | tmp = tmp->above; |
2070 | } |
2128 | } |
2071 | |
2129 | |
2072 | if (mon==NULL) /* This happens anytime the player tries to move */ |
2130 | if (!mon) /* This happens anytime the player tries to move */ |
2073 | return; /* into a wall */ |
2131 | return; /* into a wall */ |
2074 | |
2132 | |
2075 | if(mon->head != NULL) |
2133 | if (mon->head) |
2076 | mon = mon->head; |
2134 | mon = mon->head; |
2077 | |
2135 | |
2078 | if ((mon->type==DOOR && mon->stats.hp>=0) || (mon->type==LOCKED_DOOR)) |
2136 | if ((mon->type == DOOR && mon->stats.hp >= 0) || (mon->type == LOCKED_DOOR)) |
2079 | if (player_attack_door(op, mon)) return; |
2137 | if (player_attack_door (op, mon)) |
|
|
2138 | return; |
2080 | |
2139 | |
2081 | /* The following deals with possibly attacking peaceful |
2140 | /* The following deals with possibly attacking peaceful |
2082 | * or frienddly creatures. Basically, all players are considered |
2141 | * or frienddly creatures. Basically, all players are considered |
2083 | * unaggressive. If the moving player has peaceful set, then the |
2142 | * unaggressive. If the moving player has peaceful set, then the |
2084 | * object should be pushed instead of attacked. It is assumed that |
2143 | * object should be pushed instead of attacked. It is assumed that |
2085 | * if you are braced, you will not attack friends accidently, |
2144 | * if you are braced, you will not attack friends accidently, |
2086 | * and thus will not push them. |
2145 | * and thus will not push them. |
2087 | */ |
2146 | */ |
2088 | |
2147 | |
2089 | /* If the creature is a pet, push it even if the player is not |
2148 | /* If the creature is a pet, push it even if the player is not |
2090 | * peaceful. Our assumption is the creature is a pet if the |
2149 | * peaceful. Our assumption is the creature is a pet if the |
2091 | * player owns it and it is either friendly or unagressive. |
2150 | * player owns it and it is either friendly or unagressive. |
2092 | */ |
2151 | */ |
2093 | if ((op->type==PLAYER) |
2152 | if ((op->type == PLAYER) |
2094 | #if COZY_SERVER |
2153 | #if COZY_SERVER |
2095 | && |
2154 | && |
2096 | ( |
2155 | ((mon->owner && mon->owner->contr |
2097 | (get_owner(mon) && get_owner(mon)->contr |
|
|
2098 | && same_party (get_owner(mon)->contr->party, op->contr->party)) |
2156 | && same_party (mon->owner->contr->party, op->contr->party)) || mon->owner == op) |
2099 | || get_owner(mon) == op |
|
|
2100 | ) |
|
|
2101 | #else |
2157 | #else |
2102 | && get_owner(mon)==op |
2158 | && mon->owner == op |
2103 | #endif |
2159 | #endif |
2104 | && (QUERY_FLAG(mon,FLAG_UNAGGRESSIVE) || QUERY_FLAG(mon, FLAG_FRIENDLY))) |
2160 | && (QUERY_FLAG (mon, FLAG_UNAGGRESSIVE) || QUERY_FLAG (mon, FLAG_FRIENDLY))) |
2105 | { |
2161 | { |
2106 | /* If we're braced, we don't want to switch places with it */ |
2162 | /* If we're braced, we don't want to switch places with it */ |
2107 | if (op->contr->braced) return; |
2163 | if (op->contr->braced) |
|
|
2164 | return; |
2108 | play_sound_map(op->map, op->x, op->y, SOUND_PUSH_PLAYER); |
2165 | play_sound_map (op->map, op->x, op->y, SOUND_PUSH_PLAYER); |
2109 | (void) push_ob(mon,dir,op); |
2166 | (void) push_ob (mon, dir, op); |
2110 | if(op->contr->tmp_invis||op->hide) make_visible(op); |
2167 | if (op->contr->tmp_invis || op->hide) |
|
|
2168 | make_visible (op); |
2111 | return; |
2169 | return; |
2112 | } |
2170 | } |
2113 | |
2171 | |
2114 | /* in certain circumstances, you shouldn't attack friendly |
2172 | /* in certain circumstances, you shouldn't attack friendly |
2115 | * creatures. Note that if you are braced, you can't push |
2173 | * creatures. Note that if you are braced, you can't push |
2116 | * someone, but put it inside this loop so that you won't |
2174 | * someone, but put it inside this loop so that you won't |
2117 | * attack them either. |
2175 | * attack them either. |
2118 | */ |
2176 | */ |
2119 | if ((mon->type==PLAYER || mon->enemy != op) && |
2177 | if ((mon->type == PLAYER || mon->enemy != op) && |
2120 | (mon->type==PLAYER || QUERY_FLAG(mon,FLAG_UNAGGRESSIVE) || QUERY_FLAG(mon, FLAG_FRIENDLY)) && |
2178 | (mon->type == PLAYER || QUERY_FLAG (mon, FLAG_UNAGGRESSIVE) || QUERY_FLAG (mon, FLAG_FRIENDLY)) && ( |
2121 | ( |
|
|
2122 | #ifdef PROHIBIT_PLAYERKILL |
2179 | #ifdef PROHIBIT_PLAYERKILL |
2123 | (op->contr->peaceful || (mon->type == PLAYER && mon->contr->peaceful)) && |
2180 | (op->contr->peaceful |
|
|
2181 | || (mon->type == PLAYER |
|
|
2182 | && mon->contr-> |
|
|
2183 | peaceful)) && |
2124 | #else |
2184 | #else |
2125 | op->contr->peaceful && |
2185 | op->contr->peaceful && |
2126 | #endif |
2186 | #endif |
2127 | !on_battleground |
2187 | !on_battleground)) |
|
|
2188 | { |
|
|
2189 | if (!op->contr->braced) |
2128 | )) { |
2190 | { |
2129 | if (!op->contr->braced) { |
|
|
2130 | play_sound_map(op->map, op->x, op->y, SOUND_PUSH_PLAYER); |
2191 | play_sound_map (op->map, op->x, op->y, SOUND_PUSH_PLAYER); |
2131 | (void) push_ob(mon,dir,op); |
2192 | (void) push_ob (mon, dir, op); |
2132 | } else { |
2193 | } |
|
|
2194 | else |
2133 | new_draw_info(0, 0,op,"You withhold your attack"); |
2195 | new_draw_info (0, 0, op, "You withhold your attack"); |
2134 | } |
|
|
2135 | if(op->contr->tmp_invis||op->hide) make_visible(op); |
|
|
2136 | } |
|
|
2137 | |
2196 | |
|
|
2197 | if (op->contr->tmp_invis || op->hide) |
|
|
2198 | make_visible (op); |
|
|
2199 | } |
|
|
2200 | |
2138 | /* If the object is a boulder or other rollable object, then |
2201 | /* If the object is a boulder or other rollable object, then |
2139 | * roll it if not braced. You can't roll it if you are braced. |
2202 | * roll it if not braced. You can't roll it if you are braced. |
2140 | */ |
2203 | */ |
2141 | else if(QUERY_FLAG(mon,FLAG_CAN_ROLL)&&(!op->contr->braced)) { |
2204 | else if (QUERY_FLAG (mon, FLAG_CAN_ROLL) && (!op->contr->braced)) |
|
|
2205 | { |
2142 | recursive_roll(mon,dir,op); |
2206 | recursive_roll (mon, dir, op); |
2143 | if(action_makes_visible(op)) make_visible(op); |
2207 | if (action_makes_visible (op)) |
2144 | } |
2208 | make_visible (op); |
|
|
2209 | } |
2145 | |
2210 | |
2146 | /* Any generic living creature. Including things like doors. |
2211 | /* Any generic living creature. Including things like doors. |
2147 | * Way it works is like this: First, it must have some hit points |
2212 | * Way it works is like this: First, it must have some hit points |
2148 | * and be living. Then, it must be one of the following: |
2213 | * and be living. Then, it must be one of the following: |
2149 | * 1) Not a player, 2) A player, but of a different party. Note |
2214 | * 1) Not a player, 2) A player, but of a different party. Note |
2150 | * that party_number -1 is no party, so attacks can still happen. |
2215 | * that party_number -1 is no party, so attacks can still happen. |
2151 | */ |
2216 | */ |
2152 | |
2217 | |
2153 | else if ((mon->stats.hp>=0) && QUERY_FLAG(mon, FLAG_ALIVE) && |
2218 | else if ((mon->stats.hp >= 0) && QUERY_FLAG (mon, FLAG_ALIVE) && |
2154 | ((mon->type!=PLAYER || op->contr->party==NULL || |
2219 | ((mon->type != PLAYER || op->contr->party == NULL || op->contr->party != mon->contr->party))) |
2155 | op->contr->party!=mon->contr->party))) { |
2220 | { |
2156 | |
2221 | |
2157 | /* If the player hasn't hit something this tick, and does |
2222 | /* If the player hasn't hit something this tick, and does |
2158 | * so, give them speed boost based on weapon speed. Doing |
2223 | * so, give them speed boost based on weapon speed. Doing |
2159 | * it here is better than process_players2, which basically |
2224 | * it here is better than process_players2, which basically |
2160 | * incurred a 1 tick offset. |
2225 | * incurred a 1 tick offset. |
2161 | */ |
2226 | */ |
2162 | if (!op->contr->has_hit) { |
2227 | if (!op->contr->has_hit) |
|
|
2228 | { |
2163 | op->speed_left += op->speed / op->contr->weapon_sp; |
2229 | op->speed_left += op->speed / op->contr->weapon_sp; |
2164 | |
2230 | |
2165 | op->contr->has_hit = 1; /* The last action was to hit, so use weapon_sp */ |
2231 | op->contr->has_hit = 1; /* The last action was to hit, so use weapon_sp */ |
2166 | } |
2232 | } |
2167 | |
2233 | |
2168 | skill_attack(mon, op, 0, NULL, NULL); |
2234 | skill_attack (mon, op, 0, 0, 0); |
2169 | |
2235 | |
2170 | /* If attacking another player, that player gets automatic |
2236 | /* If attacking another player, that player gets automatic |
2171 | * hitback, and doesn't loose luck either. |
2237 | * hitback, and doesn't loose luck either. |
2172 | * Disable hitback on the battleground or if the target is |
2238 | * Disable hitback on the battleground or if the target is |
2173 | * the wiz. |
2239 | * the wiz. |
2174 | */ |
2240 | */ |
2175 | if (mon->type == PLAYER && mon->stats.hp >= 0 && !mon->contr->has_hit && |
2241 | if (mon->type == PLAYER && mon->stats.hp >= 0 && !mon->contr->has_hit && !on_battleground && !QUERY_FLAG (mon, FLAG_WIZ)) |
2176 | !on_battleground && !QUERY_FLAG(mon, FLAG_WIZ)) { |
2242 | { |
2177 | short luck = mon->stats.luck; |
2243 | short luck = mon->stats.luck; |
|
|
2244 | |
2178 | mon->contr->has_hit = 1; |
2245 | mon->contr->has_hit = 1; |
2179 | skill_attack(op, mon, 0, NULL, NULL); |
2246 | skill_attack (op, mon, 0, 0, 0); |
2180 | mon->stats.luck = luck; |
2247 | mon->stats.luck = luck; |
2181 | } |
2248 | } |
2182 | if(action_makes_visible(op)) make_visible(op); |
2249 | |
2183 | } |
2250 | if (action_makes_visible (op)) |
|
|
2251 | make_visible (op); |
|
|
2252 | } |
2184 | } /* if player should attack something */ |
2253 | } /* if player should attack something */ |
2185 | } |
2254 | } |
2186 | |
2255 | |
|
|
2256 | int |
2187 | int move_player(object *op,int dir) { |
2257 | move_player (object *op, int dir) |
|
|
2258 | { |
2188 | int pick; |
2259 | int pick; |
2189 | |
2260 | |
2190 | if(op->map == NULL || op->map->in_memory != MAP_IN_MEMORY) |
2261 | if (op->map == NULL || op->map->in_memory != MAP_IN_MEMORY) |
2191 | return 0; |
|
|
2192 | |
|
|
2193 | /* Sanity check: make sure dir is valid */ |
|
|
2194 | if ( ( dir < 0 ) || ( dir >= 9 ) ) { |
|
|
2195 | LOG( llevError, "move_player: invalid direction %d\n", dir); |
|
|
2196 | return 0; |
|
|
2197 | } |
|
|
2198 | |
|
|
2199 | /* peterm: added following line */ |
|
|
2200 | if(QUERY_FLAG(op,FLAG_CONFUSED) && dir) |
|
|
2201 | dir = absdir(dir + RANDOM()%3 + RANDOM()%3 - 2); |
|
|
2202 | |
|
|
2203 | op->facing = dir; |
|
|
2204 | |
|
|
2205 | if(op->hide) do_hidden_move(op); |
|
|
2206 | |
|
|
2207 | if(op->contr->fire_on) { |
|
|
2208 | fire(op,dir); |
|
|
2209 | } |
|
|
2210 | else move_player_attack(op,dir); |
|
|
2211 | |
|
|
2212 | pick = check_pick(op); |
|
|
2213 | |
|
|
2214 | |
|
|
2215 | /* Add special check for newcs players and fire on - this way, the |
|
|
2216 | * server can handle repeat firing. |
|
|
2217 | */ |
|
|
2218 | if (op->contr->fire_on || (op->contr->run_on && pick!=0)) { |
|
|
2219 | op->direction = dir; |
|
|
2220 | } else { |
|
|
2221 | op->direction=0; |
|
|
2222 | } |
|
|
2223 | /* Update how the player looks. Use the facing, so direction may |
|
|
2224 | * get reset to zero. This allows for full animation capabilities |
|
|
2225 | * for players. |
|
|
2226 | */ |
|
|
2227 | animate_object(op, op->facing); |
|
|
2228 | return 0; |
2262 | return 0; |
|
|
2263 | |
|
|
2264 | /* Sanity check: make sure dir is valid */ |
|
|
2265 | if ((dir < 0) || (dir >= 9)) |
|
|
2266 | { |
|
|
2267 | LOG (llevError, "move_player: invalid direction %d\n", dir); |
|
|
2268 | return 0; |
|
|
2269 | } |
|
|
2270 | |
|
|
2271 | /* peterm: added following line */ |
|
|
2272 | if (QUERY_FLAG (op, FLAG_CONFUSED) && dir) |
|
|
2273 | dir = absdir (dir + RANDOM () % 3 + RANDOM () % 3 - 2); |
|
|
2274 | |
|
|
2275 | op->facing = dir; |
|
|
2276 | |
|
|
2277 | if (op->hide) |
|
|
2278 | do_hidden_move (op); |
|
|
2279 | |
|
|
2280 | if (INVOKE_PLAYER (MOVE, op->contr, ARG_INT (dir))) |
|
|
2281 | /*nop */ ; |
|
|
2282 | else if (op->contr->fire_on) |
|
|
2283 | fire (op, dir); |
|
|
2284 | else |
|
|
2285 | { |
|
|
2286 | move_player_attack (op, dir); |
|
|
2287 | pick = check_pick (op); |
|
|
2288 | } |
|
|
2289 | |
|
|
2290 | /* Add special check for newcs players and fire on - this way, the |
|
|
2291 | * server can handle repeat firing. |
|
|
2292 | */ |
|
|
2293 | if (op->contr->fire_on || (op->contr->run_on && pick != 0)) |
|
|
2294 | op->direction = dir; |
|
|
2295 | else |
|
|
2296 | op->direction = 0; |
|
|
2297 | |
|
|
2298 | /* Update how the player looks. Use the facing, so direction may |
|
|
2299 | * get reset to zero. This allows for full animation capabilities |
|
|
2300 | * for players. |
|
|
2301 | */ |
|
|
2302 | animate_object (op, op->facing); |
|
|
2303 | return 0; |
2229 | } |
2304 | } |
2230 | |
2305 | |
2231 | /* This is similar to handle_player, below, but is only used by the |
2306 | /* This is similar to handle_player, below, but is only used by the |
2232 | * new client/server stuff. |
2307 | * new client/server stuff. |
2233 | * This is sort of special, in that the new client/server actually uses |
2308 | * This is sort of special, in that the new client/server actually uses |
2234 | * the new speed values for commands. |
2309 | * the new speed values for commands. |
2235 | * |
2310 | * |
2236 | * Returns true if there are more actions we can do. |
2311 | * Returns true if there are more actions we can do. |
2237 | */ |
2312 | */ |
|
|
2313 | int |
2238 | int handle_newcs_player(object *op) |
2314 | handle_newcs_player (object *op) |
2239 | { |
2315 | { |
2240 | if (op->contr->hidden) { |
2316 | if (op->contr->hidden) |
|
|
2317 | { |
2241 | op->invisible = 1000; |
2318 | op->invisible = 1000; |
2242 | /* the socket code flashes the player visible/invisible |
2319 | /* the socket code flashes the player visible/invisible |
2243 | * depending on the value of invisible, so we need to |
2320 | * depending on the value of invisible, so we need to |
2244 | * alternate it here for it to work correctly. |
2321 | * alternate it here for it to work correctly. |
2245 | */ |
2322 | */ |
2246 | if (pticks & 2) op->invisible--; |
2323 | if (pticks & 2) |
|
|
2324 | op->invisible--; |
2247 | } |
2325 | } |
2248 | else if(op->invisible&&!(QUERY_FLAG(op,FLAG_MAKE_INVIS))) { |
2326 | else if (op->invisible && !(QUERY_FLAG (op, FLAG_MAKE_INVIS))) |
|
|
2327 | { |
2249 | op->invisible--; |
2328 | op->invisible--; |
2250 | if(!op->invisible) { |
2329 | if (!op->invisible) |
|
|
2330 | { |
2251 | make_visible(op); |
2331 | make_visible (op); |
2252 | new_draw_info(NDI_UNIQUE, 0, op, "Your invisibility spell runs out."); |
2332 | new_draw_info (NDI_UNIQUE, 0, op, "Your invisibility spell runs out."); |
2253 | } |
2333 | } |
2254 | } |
2334 | } |
2255 | |
2335 | |
2256 | if (QUERY_FLAG(op, FLAG_SCARED)) { |
2336 | if (QUERY_FLAG (op, FLAG_SCARED)) |
|
|
2337 | { |
2257 | flee_player(op); |
2338 | flee_player (op); |
2258 | /* If player is still scared, that is his action for this tick */ |
2339 | /* If player is still scared, that is his action for this tick */ |
2259 | if (QUERY_FLAG(op, FLAG_SCARED)) { |
2340 | if (QUERY_FLAG (op, FLAG_SCARED)) |
|
|
2341 | { |
2260 | op->speed_left--; |
2342 | op->speed_left--; |
2261 | return 0; |
2343 | return 0; |
2262 | } |
2344 | } |
2263 | } |
2345 | } |
2264 | |
2346 | |
2265 | /* I've been seeing crashes where the golem has been destroyed, but |
2347 | /* I've been seeing crashes where the golem has been destroyed, but |
2266 | * the player object still points to the defunct golem. The code that |
2348 | * the player object still points to the defunct golem. The code that |
2267 | * destroys the golem looks correct, and it doesn't always happen, so |
2349 | * destroys the golem looks correct, and it doesn't always happen, so |
2268 | * put this in a a workaround to clean up the golem pointer. |
2350 | * put this in a a workaround to clean up the golem pointer. |
2269 | */ |
2351 | */ |
2270 | if (op->contr->ranges[range_golem] && |
2352 | if (op->contr->ranges[range_golem] && QUERY_FLAG (op->contr->ranges[range_golem], FLAG_REMOVED)) |
2271 | ((op->contr->golem_count != op->contr->ranges[range_golem]->count) || |
|
|
2272 | QUERY_FLAG(op->contr->ranges[range_golem], FLAG_REMOVED))) { |
|
|
2273 | op->contr->ranges[range_golem] = NULL; |
2353 | op->contr->ranges[range_golem] = 0; |
2274 | op->contr->golem_count = 0; |
|
|
2275 | } |
|
|
2276 | |
2354 | |
2277 | /* call this here - we also will call this in do_ericserver, but |
2355 | /* call this here - we also will call this in do_ericserver, but |
2278 | * the players time has been increased when doericserver has been |
2356 | * the players time has been increased when doericserver has been |
2279 | * called, so we recheck it here. |
2357 | * called, so we recheck it here. |
2280 | */ |
2358 | */ |
2281 | HandleClient(&op->contr->socket, op->contr); |
2359 | //TODO: better than handling 8 commands, use some more intelligent rate-limiting |
2282 | if (op->speed_left<0) return 0; |
2360 | for (int rep = 8; --rep && op->contr->ns->handle_command (); ) |
2283 | |
|
|
2284 | if(op->direction && (op->contr->run_on || op->contr->fire_on)) { |
|
|
2285 | /* All move commands take 1 tick, at least for now */ |
|
|
2286 | op->speed_left--; |
|
|
2287 | |
|
|
2288 | /* Instead of all the stuff below, let move_player take care |
|
|
2289 | * of it. Also, some of the skill stuff is only put in |
|
|
2290 | * there, as well as the confusion stuff. |
|
|
2291 | */ |
|
|
2292 | move_player(op, op->direction); |
|
|
2293 | if (op->speed_left>0) return 1; |
|
|
2294 | else return 0; |
|
|
2295 | } |
2361 | ; |
|
|
2362 | |
|
|
2363 | if (op->speed_left < 0) |
2296 | return 0; |
2364 | return 0; |
2297 | } |
|
|
2298 | |
2365 | |
|
|
2366 | if (op->direction && (op->contr->run_on || op->contr->fire_on)) |
|
|
2367 | { |
|
|
2368 | /* All move commands take 1 tick, at least for now */ |
|
|
2369 | op->speed_left--; |
|
|
2370 | |
|
|
2371 | /* Instead of all the stuff below, let move_player take care |
|
|
2372 | * of it. Also, some of the skill stuff is only put in |
|
|
2373 | * there, as well as the confusion stuff. |
|
|
2374 | */ |
|
|
2375 | move_player (op, op->direction); |
|
|
2376 | if (op->speed_left > 0) |
|
|
2377 | return 1; |
|
|
2378 | else |
|
|
2379 | return 0; |
|
|
2380 | } |
|
|
2381 | |
|
|
2382 | return 0; |
|
|
2383 | } |
|
|
2384 | |
|
|
2385 | int |
2299 | int save_life(object *op) { |
2386 | save_life (object *op) |
2300 | object *tmp; |
2387 | { |
2301 | |
|
|
2302 | if(!QUERY_FLAG(op,FLAG_LIFESAVE)) |
2388 | if (!QUERY_FLAG (op, FLAG_LIFESAVE)) |
2303 | return 0; |
|
|
2304 | |
|
|
2305 | for(tmp=op->inv;tmp!=NULL;tmp=tmp->below) |
|
|
2306 | if(QUERY_FLAG(tmp, FLAG_APPLIED)&&QUERY_FLAG(tmp,FLAG_LIFESAVE)) { |
|
|
2307 | play_sound_map(op->map, op->x, op->y, SOUND_OB_EVAPORATE); |
|
|
2308 | new_draw_info_format(NDI_UNIQUE, 0,op, |
|
|
2309 | "Your %s vibrates violently, then evaporates.", |
|
|
2310 | query_name(tmp)); |
|
|
2311 | if (op->contr) |
|
|
2312 | esrv_del_item(op->contr, tmp->count); |
|
|
2313 | remove_ob(tmp); |
|
|
2314 | free_object(tmp); |
|
|
2315 | CLEAR_FLAG(op, FLAG_LIFESAVE); |
|
|
2316 | if(op->stats.hp<0) |
|
|
2317 | op->stats.hp = op->stats.maxhp; |
|
|
2318 | if(op->stats.food<0) |
|
|
2319 | op->stats.food = 999; |
|
|
2320 | fix_player(op); |
|
|
2321 | return 1; |
|
|
2322 | } |
|
|
2323 | LOG(llevError,"Error: LIFESAVE set without applied object.\n"); |
|
|
2324 | CLEAR_FLAG(op, FLAG_LIFESAVE); |
|
|
2325 | enter_player_savebed(op); /* bring him home. */ |
|
|
2326 | return 0; |
2389 | return 0; |
|
|
2390 | |
|
|
2391 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
|
|
2392 | if (QUERY_FLAG (tmp, FLAG_APPLIED) && QUERY_FLAG (tmp, FLAG_LIFESAVE)) |
|
|
2393 | { |
|
|
2394 | play_sound_map (op->map, op->x, op->y, SOUND_OB_EVAPORATE); |
|
|
2395 | new_draw_info_format (NDI_UNIQUE, 0, op, "Your %s vibrates violently, then evaporates.", query_name (tmp)); |
|
|
2396 | |
|
|
2397 | if (op->contr) |
|
|
2398 | esrv_del_item (op->contr, tmp->count); |
|
|
2399 | |
|
|
2400 | tmp->destroy (); |
|
|
2401 | CLEAR_FLAG (op, FLAG_LIFESAVE); |
|
|
2402 | |
|
|
2403 | if (op->stats.hp < 0) |
|
|
2404 | op->stats.hp = op->stats.maxhp; |
|
|
2405 | |
|
|
2406 | if (op->stats.food < 0) |
|
|
2407 | op->stats.food = 999; |
|
|
2408 | |
|
|
2409 | op->update_stats (); |
|
|
2410 | return 1; |
|
|
2411 | } |
|
|
2412 | |
|
|
2413 | LOG (llevError, "Error: LIFESAVE set without applied object.\n"); |
|
|
2414 | CLEAR_FLAG (op, FLAG_LIFESAVE); |
|
|
2415 | enter_player_savebed (op); /* bring him home. */ |
|
|
2416 | return 0; |
2327 | } |
2417 | } |
2328 | |
2418 | |
2329 | /* This goes throws the inventory and removes unpaid objects, and puts them |
2419 | /* This goes throws the inventory and removes unpaid objects, and puts them |
2330 | * back in the map (location and map determined by values of env). This |
2420 | * back in the map (location and map determined by values of env). This |
2331 | * function will descend into containers. op is the object to start the search |
2421 | * function will descend into containers. op is the object to start the search |
2332 | * from. |
2422 | * from. |
2333 | */ |
2423 | */ |
|
|
2424 | void |
2334 | void remove_unpaid_objects(object *op, object *env) |
2425 | remove_unpaid_objects (object *op, object *env) |
2335 | { |
2426 | { |
2336 | object *next; |
2427 | object *next; |
2337 | |
2428 | |
2338 | while (op) { |
2429 | while (op) |
|
|
2430 | { |
2339 | next=op->below; /* Make sure we have a good value, in case |
2431 | next = op->below; /* Make sure we have a good value, in case |
2340 | * we remove object 'op' |
2432 | * we remove object 'op' |
2341 | */ |
2433 | */ |
2342 | if (QUERY_FLAG(op, FLAG_UNPAID)) { |
2434 | if (QUERY_FLAG (op, FLAG_UNPAID)) |
2343 | remove_ob(op); |
2435 | { |
|
|
2436 | op->remove (); |
2344 | op->x = env->x; |
2437 | op->x = env->x; |
2345 | op->y = env->y; |
2438 | op->y = env->y; |
2346 | if (env->type == PLAYER) |
2439 | if (env->type == PLAYER) |
2347 | esrv_del_item(env->contr, op->count); |
2440 | esrv_del_item (env->contr, op->count); |
2348 | insert_ob_in_map(op, env->map, NULL,0); |
2441 | insert_ob_in_map (op, env->map, NULL, 0); |
2349 | } |
2442 | } |
2350 | else if (op->inv) remove_unpaid_objects(op->inv, env); |
2443 | else if (op->inv) |
2351 | op=next; |
2444 | remove_unpaid_objects (op->inv, env); |
2352 | } |
|
|
2353 | } |
|
|
2354 | |
2445 | |
|
|
2446 | op = next; |
|
|
2447 | } |
|
|
2448 | } |
2355 | |
2449 | |
2356 | /* |
2450 | /* |
2357 | * Returns pointer a static string containing gravestone text |
2451 | * Returns pointer a static string containing gravestone text |
2358 | * Moved from apply.c to player.c - player.c is what |
2452 | * Moved from apply.c to player.c - player.c is what |
2359 | * actually uses this function. player.c may not be quite the |
2453 | * actually uses this function. player.c may not be quite the |
2360 | * best, a misc file for object actions is probably better, |
2454 | * best, a misc file for object actions is probably better, |
2361 | * but there isn't one in the server directory. |
2455 | * but there isn't one in the server directory. |
2362 | */ |
2456 | */ |
|
|
2457 | char * |
2363 | char *gravestone_text (object *op) |
2458 | gravestone_text (object *op) |
2364 | { |
2459 | { |
2365 | static char buf2[MAX_BUF]; |
2460 | static char buf2[MAX_BUF]; |
2366 | char buf[MAX_BUF]; |
2461 | char buf[MAX_BUF]; |
2367 | time_t now = time (NULL); |
2462 | time_t now = time (NULL); |
2368 | |
2463 | |
2369 | strcpy (buf2, " R.I.P.\n\n"); |
2464 | strcpy (buf2, " R.I.P.\n\n"); |
2370 | if (op->type == PLAYER) |
2465 | if (op->type == PLAYER) |
2371 | sprintf (buf, "%s the %s\n", op->name, op->contr->title); |
2466 | sprintf (buf, "%s the %s\n", &op->name, op->contr->title); |
2372 | else |
2467 | else |
2373 | sprintf (buf, "%s\n", op->name); |
2468 | sprintf (buf, "%s\n", &op->name); |
|
|
2469 | |
2374 | strncat (buf2, " ", 20 - strlen (buf) / 2); |
2470 | strncat (buf2, " ", 20 - strlen (buf) / 2); |
2375 | strcat (buf2, buf); |
2471 | strcat (buf2, buf); |
2376 | if (op->type == PLAYER) |
2472 | if (op->type == PLAYER) |
2377 | sprintf (buf, "who was in level %d when killed\n", op->level); |
2473 | sprintf (buf, "who was in level %d when killed\n", op->level); |
2378 | else |
2474 | else |
2379 | sprintf (buf, "who was in level %d when died.\n\n", op->level); |
2475 | sprintf (buf, "who was in level %d when died.\n\n", op->level); |
|
|
2476 | |
2380 | strncat (buf2, " ", 20 - strlen (buf) / 2); |
2477 | strncat (buf2, " ", 20 - strlen (buf) / 2); |
2381 | strcat (buf2, buf); |
2478 | strcat (buf2, buf); |
2382 | if (op->type == PLAYER) { |
2479 | if (op->type == PLAYER) |
|
|
2480 | { |
2383 | sprintf (buf, "by %s.\n\n", op->contr->killer); |
2481 | sprintf (buf, "by %s.\n\n", op->contr->killer); |
2384 | strncat (buf2, " ", 21 - strlen (buf) / 2); |
2482 | strncat (buf2, " ", 21 - strlen (buf) / 2); |
2385 | strcat (buf2, buf); |
2483 | strcat (buf2, buf); |
2386 | } |
2484 | } |
|
|
2485 | |
2387 | strftime (buf, MAX_BUF, "%b %d %Y\n", localtime (&now)); |
2486 | strftime (buf, MAX_BUF, "%b %d %Y\n", localtime (&now)); |
2388 | strncat (buf2, " ", 20 - strlen (buf) / 2); |
2487 | strncat (buf2, " ", 20 - strlen (buf) / 2); |
2389 | strcat (buf2, buf); |
2488 | strcat (buf2, buf); |
|
|
2489 | |
2390 | return buf2; |
2490 | return buf2; |
2391 | } |
2491 | } |
2392 | |
2492 | |
2393 | |
2493 | void |
2394 | |
|
|
2395 | void do_some_living(object *op) { |
2494 | do_some_living (object *op) |
|
|
2495 | { |
2396 | int last_food=op->stats.food; |
2496 | int last_food = op->stats.food; |
2397 | int gen_hp, gen_sp, gen_grace; |
2497 | int gen_hp, gen_sp, gen_grace; |
2398 | int over_hp, over_sp, over_grace; |
2498 | int over_hp, over_sp, over_grace; |
2399 | int i; |
2499 | int i; |
2400 | int rate_hp = 1200; |
2500 | int rate_hp = 1200; |
2401 | int rate_sp = 2500; |
2501 | int rate_sp = 2500; |
2402 | int rate_grace = 2000; |
2502 | int rate_grace = 2000; |
2403 | const int max_hp = 1; |
2503 | const int max_hp = 1; |
2404 | const int max_sp = 1; |
2504 | const int max_sp = 1; |
2405 | const int max_grace = 1; |
2505 | const int max_grace = 1; |
2406 | |
2506 | |
2407 | if (op->contr->outputs_sync) { |
2507 | if (op->contr->outputs_sync) |
|
|
2508 | { |
2408 | for (i=0; i<NUM_OUTPUT_BUFS; i++) |
2509 | for (i = 0; i < NUM_OUTPUT_BUFS; i++) |
2409 | if (op->contr->outputs[i].buf!=NULL && |
2510 | if (op->contr->outputs[i].buf && (op->contr->outputs[i].first_update + op->contr->outputs_sync) < (uint16) pticks) |
2410 | (op->contr->outputs[i].first_update+op->contr->outputs_sync)<pticks) |
|
|
2411 | flush_output_element(op, &op->contr->outputs[i]); |
2511 | flush_output_element (op, &op->contr->outputs[i]); |
2412 | } |
2512 | } |
2413 | |
2513 | |
2414 | if(op->contr->state==ST_PLAYING) { |
2514 | if (op->contr->ns->state == ST_PLAYING) |
2415 | |
2515 | { |
2416 | /* these next three if clauses make it possible to SLOW DOWN |
2516 | /* these next three if clauses make it possible to SLOW DOWN |
2417 | hp/grace/spellpoint regeneration. */ |
2517 | hp/grace/spellpoint regeneration. */ |
2418 | if(op->contr->gen_hp >= 0 ) |
2518 | if (op->contr->gen_hp >= 0) |
2419 | gen_hp=(op->contr->gen_hp+1)*op->stats.maxhp; |
2519 | gen_hp = (op->contr->gen_hp + 1) * op->stats.maxhp; |
2420 | else { |
2520 | else |
|
|
2521 | { |
2421 | gen_hp = op->stats.maxhp; |
2522 | gen_hp = op->stats.maxhp; |
2422 | rate_hp -= rate_hp/2 * op->contr->gen_hp; |
2523 | rate_hp -= rate_hp / 2 * op->contr->gen_hp; |
2423 | } |
2524 | } |
|
|
2525 | |
2424 | if(op->contr->gen_sp >= 0 ) |
2526 | if (op->contr->gen_sp >= 0) |
2425 | gen_sp=(op->contr->gen_sp+1)*op->stats.maxsp; |
2527 | gen_sp = (op->contr->gen_sp + 1) * op->stats.maxsp; |
2426 | else { |
2528 | else |
|
|
2529 | { |
2427 | gen_sp = op->stats.maxsp; |
2530 | gen_sp = op->stats.maxsp; |
2428 | rate_sp -= rate_sp/2 * op->contr->gen_sp; |
2531 | rate_sp -= rate_sp / 2 * op->contr->gen_sp; |
2429 | } |
2532 | } |
|
|
2533 | |
2430 | if(op->contr->gen_grace >= 0) |
2534 | if (op->contr->gen_grace >= 0) |
2431 | gen_grace=(op->contr->gen_grace+1)*op->stats.maxgrace; |
2535 | gen_grace = (op->contr->gen_grace + 1) * op->stats.maxgrace; |
2432 | else { |
2536 | else |
|
|
2537 | { |
2433 | gen_grace = op->stats.maxgrace; |
2538 | gen_grace = op->stats.maxgrace; |
2434 | rate_grace -= rate_grace/2 * op->contr->gen_grace; |
2539 | rate_grace -= rate_grace / 2 * op->contr->gen_grace; |
2435 | } |
2540 | } |
2436 | |
2541 | |
2437 | /* Regenerate Spell Points */ |
2542 | /* Regenerate Spell Points */ |
2438 | if(op->contr->ranges[range_golem]==NULL && --op->last_sp<0) { |
2543 | if (op->contr->ranges[range_golem] == NULL && --op->last_sp < 0) |
|
|
2544 | { |
2439 | gen_sp = gen_sp * 10 / (op->contr->gen_sp_armour < 10? 10 : op->contr->gen_sp_armour); |
2545 | gen_sp = gen_sp * 10 / (op->contr->gen_sp_armour < 10 ? 10 : op->contr->gen_sp_armour); |
2440 | if(op->stats.sp<op->stats.maxsp) { |
2546 | if (op->stats.sp < op->stats.maxsp) |
2441 | op->stats.sp++; |
2547 | { |
|
|
2548 | op->stats.sp++; |
2442 | /* dms do not consume food */ |
2549 | /* dms do not consume food */ |
2443 | if (!QUERY_FLAG(op,FLAG_WIZ)) { |
2550 | if (!QUERY_FLAG (op, FLAG_WIZ)) |
2444 | op->stats.food--; |
2551 | { |
|
|
2552 | op->stats.food--; |
2445 | if(op->contr->digestion<0) |
2553 | if (op->contr->digestion < 0) |
2446 | op->stats.food+=op->contr->digestion; |
2554 | op->stats.food += op->contr->digestion; |
2447 | else if(op->contr->digestion>0 && |
2555 | else if (op->contr->digestion > 0 && random_roll (0, op->contr->digestion, op, PREFER_HIGH)) |
2448 | random_roll(0, op->contr->digestion, op, PREFER_HIGH)) |
|
|
2449 | op->stats.food=last_food; |
2556 | op->stats.food = last_food; |
|
|
2557 | } |
|
|
2558 | } |
|
|
2559 | |
|
|
2560 | if (max_sp > 1) |
|
|
2561 | { |
|
|
2562 | over_sp = (gen_sp + 10) / rate_sp; |
|
|
2563 | if (over_sp > 0) |
|
|
2564 | { |
|
|
2565 | if (op->stats.sp < op->stats.maxsp) |
|
|
2566 | { |
|
|
2567 | op->stats.sp += over_sp > max_sp ? max_sp : over_sp; |
|
|
2568 | |
|
|
2569 | if (random_roll (0, rate_sp - 1, op, PREFER_LOW) > ((gen_sp + 10) % rate_sp)) |
|
|
2570 | op->stats.sp--; |
|
|
2571 | |
|
|
2572 | if (op->stats.sp > op->stats.maxsp) |
|
|
2573 | op->stats.sp = op->stats.maxsp; |
|
|
2574 | } |
|
|
2575 | op->last_sp = 0; |
|
|
2576 | } |
|
|
2577 | else |
|
|
2578 | op->last_sp = rate_sp / (gen_sp < 20 ? 30 : gen_sp + 10); |
|
|
2579 | } |
|
|
2580 | else |
|
|
2581 | op->last_sp = rate_sp / (gen_sp < 20 ? 30 : gen_sp + 10); |
2450 | } |
2582 | } |
2451 | } |
|
|
2452 | if (max_sp>1) { |
|
|
2453 | over_sp = (gen_sp+10)/rate_sp; |
|
|
2454 | if (over_sp > 0) { |
|
|
2455 | if(op->stats.sp<op->stats.maxsp) { |
|
|
2456 | op->stats.sp += over_sp>max_sp ? max_sp : over_sp; |
|
|
2457 | if(random_roll(0, rate_sp-1, op, PREFER_LOW) > ((gen_sp+10)%rate_sp)) |
|
|
2458 | op->stats.sp--; |
|
|
2459 | if(op->stats.sp>op->stats.maxsp) |
|
|
2460 | op->stats.sp=op->stats.maxsp; |
|
|
2461 | } |
|
|
2462 | op->last_sp=0; |
|
|
2463 | } else { |
|
|
2464 | op->last_sp=rate_sp/(gen_sp<20 ? 30 : gen_sp+10); |
|
|
2465 | } |
|
|
2466 | } else { |
|
|
2467 | op->last_sp=rate_sp/(gen_sp<20 ? 30 : gen_sp+10); |
|
|
2468 | } |
|
|
2469 | } |
|
|
2470 | |
2583 | |
2471 | /* Regenerate Grace */ |
2584 | /* Regenerate Grace */ |
2472 | /* I altered this a little - maximum grace is ony achieved through prayer -b.t.*/ |
2585 | /* I altered this a little - maximum grace is ony achieved through prayer -b.t. */ |
2473 | if(--op->last_grace<0) { |
2586 | if (--op->last_grace < 0) |
|
|
2587 | { |
2474 | if(op->stats.grace<op->stats.maxgrace/2) |
2588 | if (op->stats.grace < op->stats.maxgrace / 2) |
2475 | op->stats.grace++; /* no penalty in food for regaining grace */ |
2589 | op->stats.grace++; /* no penalty in food for regaining grace */ |
2476 | if(max_grace>1) { |
2590 | |
|
|
2591 | if (max_grace > 1) |
|
|
2592 | { |
2477 | over_grace = (gen_grace<20 ? 30 : gen_grace+10)/rate_grace; |
2593 | over_grace = (gen_grace < 20 ? 30 : gen_grace + 10) / rate_grace; |
2478 | if (over_grace > 0) { |
2594 | if (over_grace > 0) |
2479 | op->stats.sp += over_grace |
2595 | { |
|
|
2596 | op->stats.sp += over_grace |
2480 | + (random_roll(0, rate_grace-1, op, PREFER_HIGH) > ((gen_grace<20 ? 30 : gen_grace+10)%rate_grace))? -1 : 0; |
2597 | + (random_roll (0, rate_grace - 1, op, PREFER_HIGH) > ((gen_grace < 20 ? 30 : gen_grace + 10) % rate_grace)) ? -1 : 0; |
2481 | op->last_grace=0; |
2598 | op->last_grace = 0; |
2482 | } else { |
2599 | } |
|
|
2600 | else |
|
|
2601 | { |
2483 | op->last_grace=rate_grace/(gen_grace<20 ? 30 : gen_grace+10); |
2602 | op->last_grace = rate_grace / (gen_grace < 20 ? 30 : gen_grace + 10); |
2484 | } |
2603 | } |
2485 | } else { |
2604 | } |
|
|
2605 | else |
|
|
2606 | { |
2486 | op->last_grace=rate_grace/(gen_grace<20 ? 30 : gen_grace+10); |
2607 | op->last_grace = rate_grace / (gen_grace < 20 ? 30 : gen_grace + 10); |
2487 | } |
2608 | } |
2488 | /* wearing stuff doesn't detract from grace generation. */ |
2609 | /* wearing stuff doesn't detract from grace generation. */ |
2489 | } |
2610 | } |
2490 | |
2611 | |
2491 | /* Regenerate Hit Points */ |
2612 | /* Regenerate Hit Points */ |
2492 | if(--op->last_heal<0) { |
2613 | if (--op->last_heal < 0) |
|
|
2614 | { |
2493 | if(op->stats.hp<op->stats.maxhp) { |
2615 | if (op->stats.hp < op->stats.maxhp) |
2494 | op->stats.hp++; |
2616 | { |
|
|
2617 | op->stats.hp++; |
2495 | /* dms do not consume food */ |
2618 | /* dms do not consume food */ |
2496 | if (!QUERY_FLAG(op,FLAG_WIZ)) { |
2619 | if (!QUERY_FLAG (op, FLAG_WIZ)) |
2497 | op->stats.food--; |
2620 | { |
|
|
2621 | op->stats.food--; |
2498 | if(op->contr->digestion<0) |
2622 | if (op->contr->digestion < 0) |
2499 | op->stats.food+=op->contr->digestion; |
2623 | op->stats.food += op->contr->digestion; |
2500 | else if(op->contr->digestion>0 && |
2624 | else if (op->contr->digestion > 0 && random_roll (0, op->contr->digestion, op, PREFER_HIGH)) |
2501 | random_roll(0, op->contr->digestion, op, PREFER_HIGH)) |
|
|
2502 | op->stats.food=last_food; |
2625 | op->stats.food = last_food; |
|
|
2626 | } |
|
|
2627 | } |
|
|
2628 | |
|
|
2629 | if (max_hp > 1) |
|
|
2630 | { |
|
|
2631 | over_hp = (gen_hp < 20 ? 30 : gen_hp + 10) / rate_hp; |
|
|
2632 | if (over_hp > 0) |
|
|
2633 | { |
|
|
2634 | op->stats.sp += over_hp + (RANDOM () % rate_hp > ((gen_hp < 20 ? 30 : gen_hp + 10) % rate_hp)) ? -1 : 0; |
|
|
2635 | op->last_heal = 0; |
|
|
2636 | } |
|
|
2637 | else |
|
|
2638 | { |
|
|
2639 | op->last_heal = rate_hp / (gen_hp < 20 ? 30 : gen_hp + 10); |
|
|
2640 | } |
|
|
2641 | } |
|
|
2642 | else |
|
|
2643 | { |
|
|
2644 | op->last_heal = rate_hp / (gen_hp < 20 ? 30 : gen_hp + 10); |
|
|
2645 | } |
2503 | } |
2646 | } |
2504 | } |
|
|
2505 | if(max_hp>1) { |
|
|
2506 | over_hp = (gen_hp<20 ? 30 : gen_hp+10)/rate_hp; |
|
|
2507 | if (over_hp > 0) { |
|
|
2508 | op->stats.sp += over_hp |
|
|
2509 | + (RANDOM()%rate_hp > ((gen_hp<20 ? 30 : gen_hp+10)%rate_hp))? -1 : 0; |
|
|
2510 | op->last_heal=0; |
|
|
2511 | } else { |
|
|
2512 | op->last_heal=rate_hp/(gen_hp<20 ? 30 : gen_hp+10); |
|
|
2513 | } |
|
|
2514 | } else { |
|
|
2515 | op->last_heal=rate_hp/(gen_hp<20 ? 30 : gen_hp+10); |
|
|
2516 | } |
|
|
2517 | } |
|
|
2518 | |
2647 | |
2519 | /* Digestion */ |
2648 | /* Digestion */ |
2520 | if(--op->last_eat<0) { |
2649 | if (--op->last_eat < 0) |
|
|
2650 | { |
2521 | #ifdef COZY_SERVER |
2651 | #ifdef COZY_SERVER |
2522 | int dg = op->contr->digestion>=0 && op->contr->digestion<2 ? 2 : op->contr->digestion; |
2652 | int dg = op->contr->digestion >= 0 && op->contr->digestion < 2 ? 2 : op->contr->digestion; |
2523 | int bonus=dg>0?dg:0, |
2653 | int bonus = dg > 0 ? dg : 0, penalty = dg < 0 ? -dg : 0; |
2524 | penalty=dg<0?-dg:0; |
|
|
2525 | #else |
2654 | #else |
2526 | int bonus=op->contr->digestion>0?op->contr->digestion:0, |
2655 | int bonus = op->contr->digestion > 0 ? op->contr->digestion : 0, penalty = op->contr->digestion < 0 ? -op->contr->digestion : 0; |
2527 | penalty=op->contr->digestion<0?-op->contr->digestion:0; |
|
|
2528 | #endif |
2656 | #endif |
2529 | |
2657 | |
2530 | if(op->contr->gen_hp > 0) |
2658 | if (op->contr->gen_hp > 0) |
2531 | op->last_eat=25*(1+bonus)/(op->contr->gen_hp+penalty+1); |
2659 | op->last_eat = 25 * (1 + bonus) / (op->contr->gen_hp + penalty + 1); |
2532 | else |
2660 | else |
2533 | op->last_eat=25*(1+bonus)/(penalty +1); |
2661 | op->last_eat = 25 * (1 + bonus) / (penalty + 1); |
|
|
2662 | |
2534 | /* dms do not consume food */ |
2663 | /* dms do not consume food */ |
2535 | if (!QUERY_FLAG(op,FLAG_WIZ)) op->stats.food--; |
2664 | if (!QUERY_FLAG (op, FLAG_WIZ)) |
2536 | } |
2665 | op->stats.food--; |
2537 | } |
2666 | } |
2538 | |
2667 | |
2539 | if(op->contr->state==ST_PLAYING&&op->stats.food<0&&op->stats.hp>=0) { |
2668 | if (op->stats.food < 0 && op->stats.hp >= 0) |
2540 | object *tmp, *flesh=NULL; |
2669 | { |
|
|
2670 | object *tmp, *flesh = 0; |
2541 | |
2671 | |
2542 | for(tmp=op->inv;tmp!=NULL;tmp=tmp->below) { |
2672 | for (tmp = op->inv; tmp; tmp = tmp->below) |
|
|
2673 | { |
2543 | if(!QUERY_FLAG(tmp, FLAG_UNPAID)) { |
2674 | if (!QUERY_FLAG (tmp, FLAG_UNPAID)) |
|
|
2675 | { |
2544 | if (tmp->type==FOOD || tmp->type==DRINK || tmp->type==POISON) { |
2676 | if (tmp->type == FOOD || tmp->type == DRINK || tmp->type == POISON) |
|
|
2677 | { |
2545 | new_draw_info(NDI_UNIQUE, 0,op,"You blindly grab for a bite of food."); |
2678 | new_draw_info (NDI_UNIQUE, 0, op, "You blindly grab for a bite of food."); |
2546 | manual_apply(op,tmp,0); |
2679 | manual_apply (op, tmp, 0); |
2547 | if(op->stats.food>=0||op->stats.hp<0) |
2680 | if (op->stats.food >= 0 || op->stats.hp < 0) |
2548 | break; |
2681 | break; |
2549 | } |
2682 | } |
2550 | else if (tmp->type==FLESH) flesh=tmp; |
2683 | else if (tmp->type == FLESH) |
2551 | } /* End if paid for object */ |
2684 | flesh = tmp; |
2552 | } /* end of for loop */ |
2685 | } /* End if paid for object */ |
|
|
2686 | } /* end of for loop */ |
|
|
2687 | |
2553 | /* If player is still starving, it means they don't have any food, so |
2688 | /* If player is still starving, it means they don't have any food, so |
2554 | * eat flesh instead. |
2689 | * eat flesh instead. |
2555 | */ |
2690 | */ |
2556 | if (op->stats.food<0 && op->stats.hp>=0 && flesh) { |
2691 | if (op->stats.food < 0 && op->stats.hp >= 0 && flesh) |
|
|
2692 | { |
2557 | new_draw_info(NDI_UNIQUE, 0,op,"You blindly grab for a bite of food."); |
2693 | new_draw_info (NDI_UNIQUE, 0, op, "You blindly grab for a bite of food."); |
2558 | manual_apply(op,flesh,0); |
2694 | manual_apply (op, flesh, 0); |
2559 | } |
2695 | } |
2560 | } /* end if player is starving */ |
2696 | } |
2561 | |
2697 | |
2562 | while(op->stats.food<0&&op->stats.hp>0) |
2698 | while (op->stats.food < 0 && op->stats.hp >= 0) |
2563 | op->stats.food++,op->stats.hp--; |
2699 | op->stats.food++, op->stats.hp--; |
2564 | |
2700 | |
2565 | if (!op->contr->state&&!QUERY_FLAG(op,FLAG_WIZ)&&(op->stats.hp<0||op->stats.food<0)) |
2701 | if (op->stats.hp < 0 && !QUERY_FLAG (op, FLAG_WIZ)) |
2566 | kill_player(op); |
2702 | kill_player (op); |
|
|
2703 | } |
2567 | } |
2704 | } |
2568 | |
|
|
2569 | |
|
|
2570 | |
2705 | |
2571 | /* If the player should die (lack of hp, food, etc), we call this. |
2706 | /* If the player should die (lack of hp, food, etc), we call this. |
2572 | * op is the player in jeopardy. If the player can not be saved (not |
2707 | * op is the player in jeopardy. If the player can not be saved (not |
2573 | * permadeath, no lifesave), this will take care of removing the player |
2708 | * permadeath, no lifesave), this will take care of removing the player |
2574 | * file. |
2709 | * file. |
2575 | */ |
2710 | */ |
|
|
2711 | void |
2576 | void kill_player(object *op) |
2712 | kill_player (object *op) |
2577 | { |
2713 | { |
2578 | char buf[MAX_BUF]; |
2714 | char buf[MAX_BUF]; |
2579 | int x,y,i; |
2715 | int x, y; |
|
|
2716 | |
|
|
2717 | //int i; |
2580 | mapstruct *map; /* this is for resurrection */ |
2718 | maptile *map; /* this is for resurrection */ |
|
|
2719 | |
2581 | int z; |
2720 | /* int z; |
2582 | int num_stats_lose; |
2721 | int num_stats_lose; |
2583 | int lost_a_stat; |
2722 | int lost_a_stat; |
2584 | int lose_this_stat; |
2723 | int lose_this_stat; |
2585 | int this_stat; |
2724 | int this_stat; */ |
2586 | int will_kill_again; |
2725 | int will_kill_again; |
2587 | archetype *at; |
2726 | archetype *at; |
2588 | object *tmp; |
2727 | object *tmp; |
2589 | |
2728 | |
2590 | if(save_life(op)) |
2729 | if (save_life (op)) |
2591 | return; |
2730 | return; |
2592 | |
2731 | |
2593 | |
2732 | |
2594 | /* If player dies on BATTLEGROUND, no stat/exp loss! For Combat-Arenas |
2733 | /* If player dies on BATTLEGROUND, no stat/exp loss! For Combat-Arenas |
2595 | * in cities ONLY!!! It is very important that this doesn't get abused. |
2734 | * in cities ONLY!!! It is very important that this doesn't get abused. |
2596 | * Look at op_on_battleground() for more info --AndreasV |
2735 | * Look at op_on_battleground() for more info --AndreasV |
2597 | */ |
2736 | */ |
2598 | if (op_on_battleground(op, &x, &y)) { |
2737 | if (op_on_battleground (op, &x, &y)) |
2599 | new_draw_info(NDI_UNIQUE | NDI_NAVY, 0,op, |
2738 | { |
2600 | "You have been defeated in combat!"); |
2739 | new_draw_info (NDI_UNIQUE | NDI_NAVY, 0, op, "You have been defeated in combat!"); |
2601 | new_draw_info(NDI_UNIQUE | NDI_NAVY, 0,op, |
2740 | new_draw_info (NDI_UNIQUE | NDI_NAVY, 0, op, "Local medics have saved your life..."); |
2602 | "Local medics have saved your life..."); |
2741 | |
2603 | |
|
|
2604 | /* restore player */ |
2742 | /* restore player */ |
2605 | at = find_archetype("poisoning"); |
2743 | at = archetype::find ("poisoning"); |
2606 | tmp=present_arch_in_ob(at,op); |
2744 | tmp = present_arch_in_ob (at, op); |
2607 | if (tmp) { |
2745 | if (tmp) |
2608 | remove_ob(tmp); |
2746 | { |
2609 | free_object(tmp); |
2747 | tmp->destroy (); |
2610 | new_draw_info(NDI_UNIQUE, 0,op, "Your body feels cleansed"); |
2748 | new_draw_info (NDI_UNIQUE, 0, op, "Your body feels cleansed"); |
2611 | } |
2749 | } |
2612 | |
2750 | |
2613 | at = find_archetype("confusion"); |
2751 | at = archetype::find ("confusion"); |
2614 | tmp=present_arch_in_ob(at,op); |
2752 | tmp = present_arch_in_ob (at, op); |
2615 | if (tmp) { |
2753 | if (tmp) |
2616 | remove_ob(tmp); |
2754 | { |
2617 | free_object(tmp); |
2755 | tmp->destroy (); |
2618 | new_draw_info(NDI_UNIQUE, 0,tmp, "Your mind feels clearer"); |
2756 | new_draw_info (NDI_UNIQUE, 0, tmp, "Your mind feels clearer"); |
2619 | } |
2757 | } |
2620 | |
2758 | |
2621 | cure_disease(op,0); /* remove any disease */ |
2759 | cure_disease (op, 0); /* remove any disease */ |
2622 | op->stats.hp=op->stats.maxhp; |
2760 | op->stats.hp = op->stats.maxhp; |
2623 | if (op->stats.food<=0) op->stats.food=999; |
2761 | if (op->stats.food <= 0) |
2624 | |
2762 | op->stats.food = 999; |
|
|
2763 | |
2625 | /* create a bodypart-trophy to make the winner happy */ |
2764 | /* create a bodypart-trophy to make the winner happy */ |
2626 | tmp=arch_to_object(find_archetype("finger")); |
2765 | tmp = arch_to_object (archetype::find ("finger")); |
2627 | if (tmp != NULL) |
2766 | if (tmp != NULL) |
2628 | { |
2767 | { |
2629 | sprintf(buf,"%s's finger",op->name); |
2768 | sprintf (buf, "%s's finger", &op->name); |
2630 | tmp->name = add_string(buf); |
2769 | tmp->name = buf; |
2631 | sprintf(buf," This finger has been cut off %s\n" |
2770 | sprintf (buf, " This finger has been cut off %s\n" |
2632 | " the %s, when he was defeated at\n level %d by %s.\n", |
2771 | " the %s, when he was defeated at\n level %d by %s.\n", |
2633 | op->name, op->contr->title, (int)(op->level), |
2772 | &op->name, op->contr->title, (int) (op->level), op->contr->killer); |
2634 | op->contr->killer); |
2773 | tmp->msg = buf; |
2635 | tmp->msg=add_string(buf); |
|
|
2636 | tmp->value=0, tmp->material=0, tmp->type=0; |
2774 | tmp->value = 0, tmp->material = 0, tmp->type = 0; |
2637 | tmp->materialname = NULL; |
2775 | tmp->materialname = NULL; |
2638 | tmp->x = op->x, tmp->y = op->y; |
2776 | tmp->x = op->x, tmp->y = op->y; |
2639 | insert_ob_in_map(tmp,op->map,op,0); |
2777 | insert_ob_in_map (tmp, op->map, op, 0); |
2640 | } |
|
|
2641 | |
2778 | } |
|
|
2779 | |
2642 | /* teleport defeated player to new destination*/ |
2780 | /* teleport defeated player to new destination */ |
2643 | transfer_ob(op, x, y, 0, NULL); |
2781 | transfer_ob (op, x, y, 0, NULL); |
2644 | op->contr->braced=0; |
2782 | op->contr->braced = 0; |
2645 | return; |
2783 | return; |
2646 | } |
2784 | } |
2647 | |
2785 | |
2648 | INVOKE_PLAYER (DEATH, op->contr); |
2786 | INVOKE_PLAYER (DEATH, op->contr); |
2649 | |
2787 | |
2650 | command_kill_pets (op, 0); |
2788 | command_kill_pets (op, 0); |
2651 | |
2789 | |
2652 | if(op->stats.food<0) { |
2790 | if (op->stats.food < 0) |
|
|
2791 | { |
2653 | if (op->contr->explore) { |
2792 | if (op->contr->explore) |
|
|
2793 | { |
2654 | new_draw_info(NDI_UNIQUE, 0,op,"You would have starved, but you are"); |
2794 | new_draw_info (NDI_UNIQUE, 0, op, "You would have starved, but you are"); |
2655 | new_draw_info(NDI_UNIQUE, 0,op,"in explore mode, so..."); |
2795 | new_draw_info (NDI_UNIQUE, 0, op, "in explore mode, so..."); |
2656 | op->stats.food=999; |
2796 | op->stats.food = 999; |
2657 | return; |
2797 | return; |
2658 | } |
2798 | } |
2659 | sprintf(buf,"%s starved to death.",op->name); |
2799 | sprintf (buf, "%s starved to death.", &op->name); |
2660 | strcpy(op->contr->killer,"starvation"); |
2800 | strcpy (op->contr->killer, "starvation"); |
|
|
2801 | } |
|
|
2802 | else |
2661 | } |
2803 | { |
2662 | else { |
|
|
2663 | if (op->contr->explore) { |
2804 | if (op->contr->explore) |
|
|
2805 | { |
2664 | new_draw_info(NDI_UNIQUE, 0,op,"You would have died, but you are"); |
2806 | new_draw_info (NDI_UNIQUE, 0, op, "You would have died, but you are"); |
2665 | new_draw_info(NDI_UNIQUE, 0,op,"in explore mode, so..."); |
2807 | new_draw_info (NDI_UNIQUE, 0, op, "in explore mode, so..."); |
2666 | op->stats.hp=op->stats.maxhp; |
2808 | op->stats.hp = op->stats.maxhp; |
2667 | return; |
2809 | return; |
2668 | } |
2810 | } |
2669 | sprintf(buf,"%s died.",op->name); |
2811 | sprintf (buf, "%s died.", &op->name); |
2670 | } |
2812 | } |
2671 | play_sound_player_only(op->contr, SOUND_PLAYER_DIES,0,0); |
2813 | play_sound_player_only (op->contr, SOUND_PLAYER_DIES, 0, 0); |
2672 | |
2814 | |
2673 | /* save the map location for corpse, gravestone*/ |
2815 | /* save the map location for corpse, gravestone */ |
2674 | x=op->x;y=op->y;map=op->map; |
2816 | x = op->x; |
|
|
2817 | y = op->y; |
|
|
2818 | map = op->map; |
2675 | |
2819 | |
2676 | |
2820 | |
2677 | if (settings.not_permadeth == TRUE) { |
|
|
2678 | /* NOT_PERMADEATH code. This basically brings the character back to |
2821 | /* NOT_PERMADEATH code. This basically brings the character back to |
2679 | * life if they are dead - it takes some exp and a random stat. |
2822 | * life if they are dead - it takes some exp and a random stat. |
2680 | * See the config.h file for a little more in depth detail about this. |
2823 | * See the config.h file for a little more in depth detail about this. |
2681 | */ |
2824 | */ |
2682 | |
2825 | |
2683 | /* Basically two ways to go - remove a stat permanently, or just |
2826 | /* Basically two ways to go - remove a stat permanently, or just |
2684 | * make it depletion. This bunch of code deals with that aspect |
2827 | * make it depletion. This bunch of code deals with that aspect |
2685 | * of death. |
2828 | * of death. |
2686 | */ |
2829 | */ |
2687 | #ifndef COZY_SERVER |
2830 | #ifndef COZY_SERVER |
2688 | if (settings.balanced_stat_loss) { |
2831 | if (settings.balanced_stat_loss) |
|
|
2832 | { |
2689 | /* If stat loss is permanent, lose one stat only. */ |
2833 | /* If stat loss is permanent, lose one stat only. */ |
2690 | /* Lower level chars don't lose as many stats because they suffer |
2834 | /* Lower level chars don't lose as many stats because they suffer |
2691 | more if they do. */ |
2835 | more if they do. */ |
2692 | /* Higher level characters can afford things such as potions of |
2836 | /* Higher level characters can afford things such as potions of |
2693 | restoration, or better, stat potions. So we slug them that |
2837 | restoration, or better, stat potions. So we slug them that |
2694 | little bit harder. */ |
2838 | little bit harder. */ |
2695 | /* GD */ |
2839 | /* GD */ |
2696 | if (settings.stat_loss_on_death) |
2840 | if (settings.stat_loss_on_death) |
2697 | num_stats_lose = 1; |
2841 | num_stats_lose = 1; |
2698 | else |
2842 | else |
2699 | num_stats_lose = 1 + op->level/BALSL_NUMBER_LOSSES_RATIO; |
2843 | num_stats_lose = 1 + op->level / BALSL_NUMBER_LOSSES_RATIO; |
2700 | } else { |
2844 | } |
|
|
2845 | else |
|
|
2846 | { |
2701 | num_stats_lose = 1; |
2847 | num_stats_lose = 1; |
2702 | } |
2848 | } |
2703 | lost_a_stat = 0; |
2849 | lost_a_stat = 0; |
2704 | |
2850 | |
2705 | for (z=0; z<num_stats_lose; z++) { |
2851 | for (z = 0; z < num_stats_lose; z++) |
|
|
2852 | { |
2706 | i = RANDOM() % NUM_STATS; |
2853 | i = RANDOM () % NUM_STATS; |
2707 | |
2854 | |
2708 | if (settings.stat_loss_on_death) { |
2855 | if (settings.stat_loss_on_death) |
|
|
2856 | { |
2709 | /* Pick a random stat and take a point off it. Tell the player |
2857 | /* Pick a random stat and take a point off it. Tell the player |
2710 | * what he lost. |
2858 | * what he lost. |
2711 | */ |
2859 | */ |
2712 | change_attr_value(&(op->stats), i,-1); |
2860 | change_attr_value (&(op->stats), i, -1); |
2713 | check_stat_bounds(&(op->stats)); |
2861 | check_stat_bounds (&(op->stats)); |
2714 | change_attr_value(&(op->contr->orig_stats), i,-1); |
2862 | change_attr_value (&(op->contr->orig_stats), i, -1); |
2715 | check_stat_bounds(&(op->contr->orig_stats)); |
2863 | check_stat_bounds (&(op->contr->orig_stats)); |
2716 | new_draw_info(NDI_UNIQUE, 0,op, lose_msg[i]); |
2864 | new_draw_info (NDI_UNIQUE, 0, op, lose_msg[i]); |
2717 | lost_a_stat = 1; |
2865 | lost_a_stat = 1; |
2718 | } else { |
2866 | } |
|
|
2867 | else |
|
|
2868 | { |
2719 | /* deplete a stat */ |
2869 | /* deplete a stat */ |
2720 | archetype *deparch=find_archetype("depletion"); |
2870 | archetype *deparch = archetype::find ("depletion"); |
2721 | object *dep; |
2871 | object *dep; |
|
|
2872 | |
|
|
2873 | dep = present_arch_in_ob (deparch, op); |
|
|
2874 | if (!dep) |
2722 | |
2875 | { |
2723 | dep = present_arch_in_ob(deparch,op); |
|
|
2724 | if(!dep) { |
|
|
2725 | dep = arch_to_object(deparch); |
2876 | dep = arch_to_object (deparch); |
2726 | insert_ob_in_ob(dep, op); |
2877 | insert_ob_in_ob (dep, op); |
2727 | } |
|
|
2728 | lose_this_stat = 1; |
|
|
2729 | if (settings.balanced_stat_loss) { |
|
|
2730 | /* GD */ |
|
|
2731 | /* Get the stat that we're about to deplete. */ |
|
|
2732 | this_stat = get_attr_value(&(dep->stats), i); |
|
|
2733 | if (this_stat < 0) { |
|
|
2734 | int loss_chance = 1 + op->level/BALSL_LOSS_CHANCE_RATIO; |
|
|
2735 | int keep_chance = this_stat * this_stat; |
|
|
2736 | /* Yes, I am paranoid. Sue me. */ |
|
|
2737 | if (keep_chance < 1) |
|
|
2738 | keep_chance = 1; |
|
|
2739 | |
|
|
2740 | /* There is a maximum depletion total per level. */ |
|
|
2741 | if (this_stat < -1 - op->level/BALSL_MAX_LOSS_RATIO) { |
|
|
2742 | lose_this_stat = 0; |
|
|
2743 | /* Take loss chance vs keep chance to see if we |
|
|
2744 | retain the stat. */ |
|
|
2745 | } else { |
|
|
2746 | if (random_roll(0, loss_chance + keep_chance-1, |
|
|
2747 | op, PREFER_LOW) < keep_chance) |
|
|
2748 | lose_this_stat = 0; |
|
|
2749 | /* LOG(llevDebug, "Determining stat loss. Stat: %d Keep: %d Lose: %d Result: %s.\n", |
|
|
2750 | this_stat, keep_chance, loss_chance, |
|
|
2751 | lose_this_stat?"LOSE":"KEEP"); */ |
|
|
2752 | } |
|
|
2753 | } |
|
|
2754 | } |
|
|
2755 | |
2878 | } |
2756 | if (lose_this_stat) { |
2879 | lose_this_stat = 1; |
|
|
2880 | if (settings.balanced_stat_loss) |
|
|
2881 | { |
|
|
2882 | /* GD */ |
|
|
2883 | /* Get the stat that we're about to deplete. */ |
2757 | this_stat = get_attr_value(&(dep->stats), i); |
2884 | this_stat = get_attr_value (&(dep->stats), i); |
|
|
2885 | if (this_stat < 0) |
|
|
2886 | { |
|
|
2887 | int loss_chance = 1 + op->level / BALSL_LOSS_CHANCE_RATIO; |
|
|
2888 | int keep_chance = this_stat * this_stat; |
|
|
2889 | |
|
|
2890 | /* Yes, I am paranoid. Sue me. */ |
|
|
2891 | if (keep_chance < 1) |
|
|
2892 | keep_chance = 1; |
|
|
2893 | |
|
|
2894 | /* There is a maximum depletion total per level. */ |
|
|
2895 | if (this_stat < -1 - op->level / BALSL_MAX_LOSS_RATIO) |
|
|
2896 | { |
|
|
2897 | lose_this_stat = 0; |
|
|
2898 | /* Take loss chance vs keep chance to see if we |
|
|
2899 | retain the stat. */ |
|
|
2900 | } |
|
|
2901 | else |
|
|
2902 | { |
|
|
2903 | if (random_roll (0, loss_chance + keep_chance - 1, op, PREFER_LOW) < keep_chance) |
|
|
2904 | lose_this_stat = 0; |
|
|
2905 | /* LOG(llevDebug, "Determining stat loss. Stat: %d Keep: %d Lose: %d Result: %s.\n", |
|
|
2906 | this_stat, keep_chance, loss_chance, |
|
|
2907 | lose_this_stat?"LOSE":"KEEP"); */ |
|
|
2908 | } |
|
|
2909 | } |
|
|
2910 | } |
|
|
2911 | |
|
|
2912 | if (lose_this_stat) |
|
|
2913 | { |
|
|
2914 | this_stat = get_attr_value (&(dep->stats), i); |
2758 | /* We could try to do something clever like find another |
2915 | /* We could try to do something clever like find another |
2759 | * stat to reduce if this fails. But chances are, if |
2916 | * stat to reduce if this fails. But chances are, if |
2760 | * stats have been depleted to -50, all are pretty low |
2917 | * stats have been depleted to -50, all are pretty low |
2761 | * and should be roughly the same, so it shouldn't make a |
2918 | * and should be roughly the same, so it shouldn't make a |
2762 | * difference. |
2919 | * difference. |
2763 | */ |
2920 | */ |
2764 | if (this_stat>=-50) { |
2921 | if (this_stat >= -50) |
|
|
2922 | { |
2765 | change_attr_value(&(dep->stats), i, -1); |
2923 | change_attr_value (&(dep->stats), i, -1); |
2766 | SET_FLAG(dep, FLAG_APPLIED); |
2924 | SET_FLAG (dep, FLAG_APPLIED); |
2767 | new_draw_info(NDI_UNIQUE, 0,op, lose_msg[i]); |
2925 | new_draw_info (NDI_UNIQUE, 0, op, lose_msg[i]); |
2768 | fix_player(op); |
2926 | op->update_stats (); |
2769 | lost_a_stat = 1; |
2927 | lost_a_stat = 1; |
2770 | } |
2928 | } |
2771 | } |
2929 | } |
|
|
2930 | } |
2772 | } |
2931 | } |
2773 | } |
|
|
2774 | /* If no stat lost, tell the player. */ |
2932 | /* If no stat lost, tell the player. */ |
2775 | if (!lost_a_stat) |
2933 | if (!lost_a_stat) |
2776 | { |
2934 | { |
2777 | /* determine_god() seems to not work sometimes... why is this? |
2935 | /* determine_god() seems to not work sometimes... why is this? |
2778 | Should I be using something else? GD */ |
2936 | Should I be using something else? GD */ |
2779 | const char *god = determine_god(op); |
2937 | const char *god = determine_god (op); |
|
|
2938 | |
2780 | if (god && (strcmp(god, "none"))) |
2939 | if (god && (strcmp (god, "none"))) |
2781 | new_draw_info_format(NDI_UNIQUE, 0, op, "For a brief " |
2940 | new_draw_info_format (NDI_UNIQUE, 0, op, "For a brief moment you feel the holy presence of %s protecting" " you.", god); |
2782 | "moment you feel the holy presence of %s protecting" |
2941 | else |
2783 | " you.", god); |
2942 | new_draw_info (NDI_UNIQUE, 0, op, "For a brief moment you feel a holy presence protecting you."); |
2784 | else |
|
|
2785 | new_draw_info(NDI_UNIQUE, 0, op, "For a brief moment you" |
|
|
2786 | " feel a holy presence protecting you."); |
|
|
2787 | } |
2943 | } |
|
|
2944 | #else |
|
|
2945 | new_draw_info (NDI_UNIQUE, 0, op, "For a brief moment you" " feel a holy presence protecting you from losing yourself completely."); |
2788 | #endif |
2946 | #endif |
2789 | new_draw_info(NDI_UNIQUE, 0, op, "For a brief moment you" |
|
|
2790 | " feel a holy presence protecting you from losing yourself completely."); |
|
|
2791 | |
2947 | |
2792 | /* Put a gravestone up where the character 'almost' died. List the |
2948 | /* Put a gravestone up where the character 'almost' died. List the |
2793 | * exp loss on the stone. |
2949 | * exp loss on the stone. |
2794 | */ |
2950 | */ |
2795 | tmp=arch_to_object(find_archetype("gravestone")); |
2951 | tmp = arch_to_object (archetype::find ("gravestone")); |
2796 | sprintf(buf,"%s's gravestone",op->name); |
2952 | sprintf (buf, "%s's gravestone", &op->name); |
2797 | FREE_AND_COPY(tmp->name, buf); |
2953 | tmp->name = buf; |
2798 | sprintf(buf,"%s's gravestones",op->name); |
2954 | sprintf (buf, "%s's gravestones", &op->name); |
2799 | FREE_AND_COPY(tmp->name_pl, buf); |
2955 | tmp->name_pl = buf; |
2800 | sprintf(buf,"RIP\nHere rests the hero %s the %s,\n" |
2956 | sprintf (buf, "RIP\nHere rests the hero %s the %s,\n" "who was killed\n" "by %s.\n", &op->name, op->contr->title, op->contr->killer); |
2801 | "who was killed\n" |
2957 | tmp->msg = buf; |
2802 | "by %s.\n", |
|
|
2803 | op->name, op->contr->title, |
|
|
2804 | op->contr->killer); |
|
|
2805 | tmp->msg = add_string(buf); |
|
|
2806 | tmp->x=op->x,tmp->y=op->y; |
2958 | tmp->x = op->x, tmp->y = op->y; |
2807 | insert_ob_in_map (tmp, op->map, NULL,0); |
2959 | insert_ob_in_map (tmp, op->map, NULL, 0); |
2808 | |
2960 | |
2809 | /**************************************/ |
2961 | /**************************************/ |
2810 | /* */ |
2962 | /* */ |
2811 | /* Subtract the experience points, */ |
2963 | /* Subtract the experience points, */ |
2812 | /* if we died cause of food, give us */ |
2964 | /* if we died cause of food, give us */ |
2813 | /* food, and reset HP's... */ |
2965 | /* food, and reset HP's... */ |
2814 | /* */ |
2966 | /* */ |
2815 | /**************************************/ |
2967 | /**************************************/ |
2816 | |
2968 | |
2817 | /* remove any poisoning and confusion the character may be suffering.*/ |
2969 | /* remove any poisoning and confusion the character may be suffering. */ |
2818 | /* restore player */ |
2970 | /* restore player */ |
2819 | at = find_archetype("poisoning"); |
2971 | at = archetype::find ("poisoning"); |
2820 | tmp=present_arch_in_ob(at,op); |
2972 | tmp = present_arch_in_ob (at, op); |
|
|
2973 | |
2821 | if (tmp) { |
2974 | if (tmp) |
2822 | remove_ob(tmp); |
2975 | { |
2823 | free_object(tmp); |
2976 | tmp->destroy (); |
2824 | new_draw_info(NDI_UNIQUE, 0,op, "Your body feels cleansed"); |
2977 | new_draw_info (NDI_UNIQUE, 0, op, "Your body feels cleansed"); |
2825 | } |
2978 | } |
2826 | |
2979 | |
2827 | at = find_archetype("confusion"); |
2980 | at = archetype::find ("confusion"); |
2828 | tmp=present_arch_in_ob(at,op); |
2981 | tmp = present_arch_in_ob (at, op); |
2829 | if (tmp) { |
2982 | if (tmp) |
2830 | remove_ob(tmp); |
2983 | { |
2831 | free_object(tmp); |
2984 | tmp->destroy (); |
2832 | new_draw_info(NDI_UNIQUE, 0,tmp, "Your mind feels clearer"); |
2985 | new_draw_info (NDI_UNIQUE, 0, tmp, "Your mind feels clearer"); |
2833 | } |
2986 | } |
|
|
2987 | |
2834 | cure_disease(op,0); /* remove any disease */ |
2988 | cure_disease (op, 0); /* remove any disease */ |
2835 | |
2989 | |
2836 | /*add_exp(op, (op->stats.exp * -0.20)); */ |
2990 | /*add_exp(op, (op->stats.exp * -0.20)); */ |
2837 | apply_death_exp_penalty(op); |
2991 | apply_death_exp_penalty (op); |
2838 | if(op->stats.food < 100) op->stats.food = 900; |
2992 | if (op->stats.food < 100) |
|
|
2993 | op->stats.food = 900; |
2839 | op->stats.hp = op->stats.maxhp; |
2994 | op->stats.hp = op->stats.maxhp; |
2840 | op->stats.sp = MAX(op->stats.sp, op->stats.maxsp); |
2995 | op->stats.sp = MAX (op->stats.sp, op->stats.maxsp); |
2841 | op->stats.grace = MAX(op->stats.grace, op->stats.maxgrace); |
2996 | op->stats.grace = MAX (op->stats.grace, op->stats.maxgrace); |
2842 | |
2997 | |
2843 | /* |
2998 | /* |
2844 | * Check to see if the player is in a shop. IF so, then check to see if |
2999 | * Check to see if the player is in a shop. IF so, then check to see if |
2845 | * the player has any unpaid items. If so, remove them and put them back |
3000 | * the player has any unpaid items. If so, remove them and put them back |
2846 | * in the map. |
3001 | * in the map. |
2847 | */ |
3002 | */ |
2848 | |
3003 | |
2849 | for (tmp= get_map_ob(op->map, op->x, op->y); tmp; tmp=tmp->above) { |
3004 | if (is_in_shop (op)) |
2850 | if (tmp->type == SHOP_FLOOR) { |
|
|
2851 | remove_unpaid_objects(op->inv, op); |
3005 | remove_unpaid_objects (op->inv, op); |
2852 | break; |
|
|
2853 | } |
|
|
2854 | } |
|
|
2855 | |
|
|
2856 | |
3006 | |
2857 | /****************************************/ |
3007 | /****************************************/ |
2858 | /* */ |
3008 | /* */ |
2859 | /* Move player to his current respawn- */ |
3009 | /* Move player to his current respawn- */ |
2860 | /* position (usually last savebed) */ |
3010 | /* position (usually last savebed) */ |
2861 | /* */ |
3011 | /* */ |
2862 | /****************************************/ |
3012 | /****************************************/ |
2863 | |
3013 | |
2864 | enter_player_savebed(op); |
3014 | enter_player_savebed (op); |
2865 | |
3015 | |
2866 | /* Save the player before inserting the force to reduce |
3016 | /* Save the player before inserting the force to reduce |
2867 | * chance of abuse. |
3017 | * chance of abuse. |
2868 | */ |
3018 | */ |
2869 | op->contr->braced=0; |
3019 | op->contr->braced = 0; |
2870 | save_player(op,1); |
3020 | op->contr->save (); |
2871 | |
3021 | |
2872 | /* it is possible that the player has blown something up |
3022 | /* it is possible that the player has blown something up |
2873 | * at his savebed location, and that can have long lasting |
3023 | * at his savebed location, and that can have long lasting |
2874 | * spell effects. So first see if there is a spell effect |
3024 | * spell effects. So first see if there is a spell effect |
2875 | * on the space that might harm the player. |
3025 | * on the space that might harm the player. |
2876 | */ |
3026 | */ |
2877 | will_kill_again=0; |
3027 | will_kill_again = 0; |
2878 | for (tmp= get_map_ob(op->map, op->x, op->y); tmp; tmp=tmp->above) { |
3028 | for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp; tmp = tmp->above) |
2879 | if (tmp->type ==SPELL_EFFECT) |
3029 | if (tmp->type == SPELL_EFFECT) |
2880 | will_kill_again|=tmp->attacktype; |
3030 | will_kill_again |= tmp->attacktype; |
2881 | } |
3031 | |
2882 | if (will_kill_again) { |
3032 | if (will_kill_again) |
|
|
3033 | { |
2883 | object *force; |
3034 | object *force; |
2884 | int at; |
3035 | int at; |
2885 | |
3036 | |
2886 | force=get_archetype(FORCE_NAME); |
3037 | force = get_archetype (FORCE_NAME); |
2887 | /* 50 ticks should be enough time for the spell to abate */ |
3038 | /* 50 ticks should be enough time for the spell to abate */ |
2888 | force->speed=0.1; |
3039 | force->speed = 0.1; |
2889 | force->speed_left=-5.0; |
3040 | force->speed_left = -5.0; |
2890 | SET_FLAG(force, FLAG_APPLIED); |
3041 | SET_FLAG (force, FLAG_APPLIED); |
2891 | for (at=0; at<NROFATTACKS; at++) { |
3042 | for (at = 0; at < NROFATTACKS; at++) |
2892 | if (will_kill_again & (1 << at)) |
3043 | if (will_kill_again & (1 << at)) |
2893 | force->resist[at] = 100; |
3044 | force->resist[at] = 100; |
2894 | } |
3045 | |
2895 | insert_ob_in_ob(force, op); |
3046 | insert_ob_in_ob (force, op); |
2896 | fix_player(op); |
3047 | op->update_stats (); |
2897 | |
|
|
2898 | } |
|
|
2899 | /**************************************/ |
|
|
2900 | /* */ |
|
|
2901 | /* Repaint the characters inv, and */ |
|
|
2902 | /* stats, and show a nasty message ;) */ |
|
|
2903 | /* */ |
|
|
2904 | /**************************************/ |
|
|
2905 | |
3048 | |
|
|
3049 | } |
|
|
3050 | |
2906 | new_draw_info(NDI_UNIQUE, 0,op,"YOU HAVE DIED."); |
3051 | new_draw_info (NDI_UNIQUE, 0, op, "YOU HAVE DIED."); |
2907 | return; |
|
|
2908 | } /* NOT_PERMADETH */ |
|
|
2909 | else { |
|
|
2910 | /* If NOT_PERMADETH is set, then the rest of this is not reachable. This |
|
|
2911 | * should probably be embedded in an else statement. |
|
|
2912 | */ |
|
|
2913 | |
|
|
2914 | op->contr->party=NULL; |
|
|
2915 | if (settings.set_title == TRUE) |
|
|
2916 | op->contr->own_title[0]='\0'; |
|
|
2917 | new_draw_info(NDI_UNIQUE|NDI_ALL, 0,NULL, buf); |
|
|
2918 | check_score(op); |
|
|
2919 | if(op->contr->ranges[range_golem]!=NULL) { |
|
|
2920 | remove_friendly_object(op->contr->ranges[range_golem]); |
|
|
2921 | remove_ob(op->contr->ranges[range_golem]); |
|
|
2922 | free_object(op->contr->ranges[range_golem]); |
|
|
2923 | op->contr->ranges[range_golem]=NULL; |
|
|
2924 | op->contr->golem_count=0; |
|
|
2925 | } |
|
|
2926 | loot_object(op); /* Remove some of the items for good */ |
|
|
2927 | remove_ob(op); |
|
|
2928 | op->direction=0; |
|
|
2929 | |
|
|
2930 | if(!QUERY_FLAG(op,FLAG_WAS_WIZ)&&op->stats.exp) { |
|
|
2931 | delete_character(op->name,0); |
|
|
2932 | if (settings.resurrection == TRUE) { |
|
|
2933 | /* save playerfile sans equipment when player dies |
|
|
2934 | ** then save it as player.pl.dead so that future resurrection |
|
|
2935 | ** type spells will work on them nicely |
|
|
2936 | */ |
|
|
2937 | delete_character(op->name,0); |
|
|
2938 | op->stats.hp = op->stats.maxhp; |
|
|
2939 | op->stats.food = 999; |
|
|
2940 | |
|
|
2941 | /* set the location of where the person will reappear when */ |
|
|
2942 | /* maybe resurrection code should fix map also */ |
|
|
2943 | strcpy(op->contr->maplevel, settings.emergency_mapname); |
|
|
2944 | if(op->map!=NULL) |
|
|
2945 | op->map = NULL; |
|
|
2946 | op->x = settings.emergency_x; |
|
|
2947 | op->y = settings.emergency_y; |
|
|
2948 | save_player(op,0); |
|
|
2949 | op->map = map; |
|
|
2950 | /* please see resurrection.c: peterm */ |
|
|
2951 | dead_player(op); |
|
|
2952 | } else { |
|
|
2953 | delete_character(op->name,1); |
|
|
2954 | } |
|
|
2955 | } |
|
|
2956 | play_again(op); |
|
|
2957 | |
|
|
2958 | /* peterm: added to create a corpse at deathsite. */ |
|
|
2959 | tmp=arch_to_object(find_archetype("corpse_pl")); |
|
|
2960 | sprintf(buf,"%s", op->name); |
|
|
2961 | FREE_AND_COPY(tmp->name, buf); |
|
|
2962 | FREE_AND_COPY(tmp->name_pl, buf); |
|
|
2963 | tmp->level=op->level; |
|
|
2964 | tmp->x=x;tmp->y=y; |
|
|
2965 | if (tmp->msg) |
|
|
2966 | free_string(tmp->msg); |
|
|
2967 | tmp->msg = add_string (gravestone_text(op)); |
|
|
2968 | SET_FLAG (tmp, FLAG_UNIQUE); |
|
|
2969 | insert_ob_in_map (tmp, map, NULL,0); |
|
|
2970 | } |
|
|
2971 | } |
3052 | } |
2972 | |
3053 | |
2973 | |
3054 | void |
2974 | void loot_object(object *op) { /* Grab and destroy some treasure */ |
3055 | loot_object (object *op) |
|
|
3056 | { /* Grab and destroy some treasure */ |
2975 | object *tmp,*tmp2,*next; |
3057 | object *tmp, *tmp2, *next; |
2976 | |
3058 | |
|
|
3059 | if (op->container) |
2977 | if (op->container) { /* close open sack first */ |
3060 | esrv_apply_container (op, op->container); /* close open sack first */ |
2978 | esrv_apply_container (op, op->container); |
|
|
2979 | } |
|
|
2980 | |
3061 | |
2981 | for(tmp=op->inv;tmp!=NULL;tmp=next) { |
3062 | for (tmp = op->inv; tmp; tmp = next) |
|
|
3063 | { |
2982 | next=tmp->below; |
3064 | next = tmp->below; |
2983 | if (tmp->type==EXPERIENCE || tmp->invisible) continue; |
3065 | |
2984 | remove_ob(tmp); |
3066 | if (tmp->invisible) |
|
|
3067 | continue; |
|
|
3068 | |
|
|
3069 | tmp->remove (); |
2985 | tmp->x=op->x,tmp->y=op->y; |
3070 | tmp->x = op->x, tmp->y = op->y; |
2986 | if (tmp->type == CONTAINER) { /* empty container to ground */ |
3071 | if (tmp->type == CONTAINER) |
2987 | loot_object(tmp); |
3072 | { /* empty container to ground */ |
2988 | } |
3073 | loot_object (tmp); |
2989 | if(!QUERY_FLAG(tmp, FLAG_UNIQUE) && (QUERY_FLAG(tmp, FLAG_STARTEQUIP) |
3074 | } |
2990 | || QUERY_FLAG(tmp,FLAG_NO_DROP) || !(RANDOM()%3))) { |
3075 | if (!QUERY_FLAG (tmp, FLAG_UNIQUE) && (QUERY_FLAG (tmp, FLAG_STARTEQUIP) || QUERY_FLAG (tmp, FLAG_NO_DROP) || !(RANDOM () % 3))) |
|
|
3076 | { |
2991 | if(tmp->nrof>1) { |
3077 | if (tmp->nrof > 1) |
|
|
3078 | { |
2992 | tmp2=get_split_ob(tmp,1+RANDOM()%(tmp->nrof-1)); |
3079 | tmp2 = get_split_ob (tmp, 1 + RANDOM () % (tmp->nrof - 1)); |
2993 | free_object(tmp2); |
3080 | tmp2->destroy (); |
2994 | insert_ob_in_map(tmp,op->map,NULL,0); |
3081 | insert_ob_in_map (tmp, op->map, NULL, 0); |
|
|
3082 | } |
|
|
3083 | else |
|
|
3084 | tmp->destroy (); |
|
|
3085 | } |
2995 | } else |
3086 | else |
2996 | free_object(tmp); |
|
|
2997 | } else |
|
|
2998 | insert_ob_in_map(tmp,op->map,NULL,0); |
3087 | insert_ob_in_map (tmp, op->map, NULL, 0); |
2999 | } |
3088 | } |
3000 | } |
3089 | } |
3001 | |
3090 | |
3002 | /* |
3091 | /* |
3003 | * fix_weight(): Check recursively the weight of all players, and fix |
3092 | * fix_weight(): Check recursively the weight of all players, and fix |
3004 | * what needs to be fixed. Refresh windows and fix speed if anything |
3093 | * what needs to be fixed. Refresh windows and fix speed if anything |
3005 | * was changed. |
3094 | * was changed. |
3006 | */ |
3095 | */ |
3007 | |
3096 | |
|
|
3097 | void |
3008 | void fix_weight(void) { |
3098 | fix_weight (void) |
3009 | player *pl; |
3099 | { |
3010 | for (pl = first_player; pl != NULL; pl = pl->next) { |
3100 | for (player *pl = first_player; pl; pl = pl->next) |
|
|
3101 | { |
3011 | int old = pl->ob->carrying, sum = sum_weight(pl->ob); |
3102 | int old = pl->ob->carrying, sum = sum_weight (pl->ob); |
|
|
3103 | |
3012 | if(old == sum) |
3104 | if (old == sum) |
3013 | continue; |
3105 | continue; |
3014 | fix_player(pl->ob); |
3106 | pl->ob->update_stats (); |
3015 | LOG(llevDebug,"Fixed inventory in %s (%d -> %d)\n", |
3107 | LOG (llevDebug, "Fixed inventory in %s (%d -> %d)\n", &pl->ob->name, old, sum); |
3016 | pl->ob->name, old, sum); |
|
|
3017 | } |
3108 | } |
3018 | } |
3109 | } |
3019 | |
3110 | |
|
|
3111 | void |
3020 | void fix_luck(void) { |
3112 | fix_luck (void) |
3021 | player *pl; |
3113 | { |
3022 | for (pl = first_player; pl != NULL; pl = pl->next) |
3114 | for (player *pl = first_player; pl; pl = pl->next) |
3023 | if (!pl->ob->contr->state) |
3115 | if (!pl->ob->contr->ns->state) |
3024 | change_luck(pl->ob, 0); |
3116 | pl->ob->change_luck (0); |
3025 | } |
3117 | } |
3026 | |
|
|
3027 | |
3118 | |
3028 | /* cast_dust() - handles op throwing objects of type 'DUST'. |
3119 | /* cast_dust() - handles op throwing objects of type 'DUST'. |
3029 | * This is much simpler in the new spell code - we basically |
3120 | * This is much simpler in the new spell code - we basically |
3030 | * just treat this as any other spell casting object. |
3121 | * just treat this as any other spell casting object. |
3031 | */ |
3122 | */ |
3032 | |
|
|
3033 | void |
3123 | void |
3034 | cast_dust (object * op, object * throw_ob, int dir) |
3124 | cast_dust (object *op, object *throw_ob, int dir) |
3035 | { |
3125 | { |
3036 | object *skop, *spob; |
3126 | object *skop, *spob; |
3037 | |
3127 | |
3038 | skop = find_skill_by_name (op, throw_ob->skill); |
3128 | skop = find_skill_by_name (op, throw_ob->skill); |
3039 | |
3129 | |
3040 | /* casting POTION 'dusts' is really a use_magic_item skill */ |
3130 | /* casting POTION 'dusts' is really a use_magic_item skill */ |
3041 | if (op->type == PLAYER && throw_ob->type == POTION && !skop) |
3131 | if (op->type == PLAYER && throw_ob->type == POTION && !skop) |
3042 | { |
3132 | { |
3043 | LOG (llevError, "Player %s lacks critical skill use_magic_item!\n", |
3133 | LOG (llevError, "Player %s lacks critical skill use_magic_item!\n", &op->name); |
3044 | op->name); |
|
|
3045 | return; |
3134 | return; |
3046 | } |
3135 | } |
3047 | |
3136 | |
3048 | spob = throw_ob->inv; |
3137 | spob = throw_ob->inv; |
3049 | |
3138 | |
3050 | // elmex Tue Aug 15 17:19:46 CEST 2006: Added this check to |
3139 | // elmex Tue Aug 15 17:19:46 CEST 2006: Added this check to |
3051 | // not pass NULL to cast_spell (which did indeed check itself, but |
3140 | // not pass NULL to cast_spell (which did indeed check itself, but |
3052 | // errors should be reported as early as possible IMHO) |
3141 | // errors should be reported as early as possible IMHO) |
3053 | if (!spob) |
3142 | if (!spob) |
3054 | { |
3143 | { |
3055 | LOG (llevError, "cast_dust: thrown object %s (by %s) had no spell in it!", |
3144 | LOG (llevError, "cast_dust: thrown object %s (by %s) had no spell in it!", &throw_ob->name, &op->name); |
3056 | throw_ob->name, op->name); |
|
|
3057 | return; |
3145 | return; |
3058 | } |
3146 | } |
3059 | |
3147 | |
3060 | if (op->type == PLAYER) |
3148 | if (op->type == PLAYER) |
3061 | new_draw_info_format (NDI_UNIQUE, 0, op, "You cast %s.", spob->name); |
3149 | new_draw_info_format (NDI_UNIQUE, 0, op, "You cast %s.", &spob->name); |
3062 | |
3150 | |
3063 | cast_spell (op, throw_ob, dir, spob, NULL); |
3151 | cast_spell (op, throw_ob, dir, spob, NULL); |
3064 | |
3152 | |
3065 | if (!QUERY_FLAG (throw_ob, FLAG_REMOVED)) |
3153 | throw_ob->destroy (); |
3066 | remove_ob (throw_ob); |
|
|
3067 | free_object (throw_ob); |
|
|
3068 | } |
3154 | } |
3069 | |
3155 | |
|
|
3156 | void |
3070 | void make_visible (object *op) { |
3157 | make_visible (object *op) |
|
|
3158 | { |
3071 | op->hide = 0; |
3159 | op->hide = 0; |
3072 | op->invisible = 0; |
3160 | op->invisible = 0; |
3073 | if(op->type==PLAYER) { |
3161 | if (op->type == PLAYER) |
|
|
3162 | { |
3074 | op->contr->tmp_invis = 0; |
3163 | op->contr->tmp_invis = 0; |
3075 | if (op->contr->invis_race) FREE_AND_CLEAR_STR(op->contr->invis_race); |
3164 | op->contr->invis_race = 0; |
3076 | } |
3165 | } |
3077 | update_object(op,UP_OBJ_FACE); |
3166 | update_object (op, UP_OBJ_FACE); |
3078 | } |
3167 | } |
3079 | |
3168 | |
|
|
3169 | int |
3080 | int is_true_undead(object *op) { |
3170 | is_true_undead (object *op) |
|
|
3171 | { |
3081 | object *tmp=NULL; |
3172 | object *tmp = NULL; |
3082 | |
3173 | |
3083 | if(QUERY_FLAG(&op->arch->clone,FLAG_UNDEAD)) return 1; |
3174 | if (QUERY_FLAG (&op->arch->clone, FLAG_UNDEAD)) |
|
|
3175 | return 1; |
3084 | |
3176 | |
3085 | if(op->type==PLAYER) |
|
|
3086 | for(tmp=op->inv;tmp;tmp=tmp->below) |
|
|
3087 | if(tmp->type==EXPERIENCE && tmp->stats.Wis) |
|
|
3088 | if(QUERY_FLAG(tmp,FLAG_UNDEAD)) return 1; |
|
|
3089 | return 0; |
3177 | return 0; |
3090 | } |
3178 | } |
3091 | |
3179 | |
3092 | /* look at the surrounding terrain to determine |
3180 | /* look at the surrounding terrain to determine |
3093 | * the hideability of this object. Positive levels |
3181 | * the hideability of this object. Positive levels |
3094 | * indicate greater hideability. |
3182 | * indicate greater hideability. |
3095 | */ |
3183 | */ |
3096 | |
3184 | |
|
|
3185 | int |
3097 | int hideability(object *ob) { |
3186 | hideability (object *ob) |
|
|
3187 | { |
3098 | int i,level=0, mflag; |
3188 | int i, level = 0, mflag; |
3099 | sint16 x,y; |
3189 | sint16 x, y; |
3100 | |
3190 | |
3101 | if(!ob||!ob->map) return 0; |
3191 | if (!ob || !ob->map) |
|
|
3192 | return 0; |
3102 | |
3193 | |
3103 | /* so, on normal lighted maps, its hard to hide */ |
3194 | /* so, on normal lighted maps, its hard to hide */ |
3104 | level=ob->map->darkness - 2; |
3195 | level = ob->map->darkness - 2; |
3105 | |
3196 | |
3106 | /* this also picks up whether the object is glowing. |
3197 | /* this also picks up whether the object is glowing. |
3107 | * If you carry a light on a non-dark map, its not |
3198 | * If you carry a light on a non-dark map, its not |
3108 | * as bad as carrying a light on a pitch dark map */ |
3199 | * as bad as carrying a light on a pitch dark map */ |
3109 | if(has_carried_lights(ob)) level =- (10 + (2*ob->map->darkness)); |
3200 | if (has_carried_lights (ob)) |
|
|
3201 | level = -(10 + (2 * ob->map->darkness)); |
3110 | |
3202 | |
3111 | /* scan through all nearby squares for terrain to hide in */ |
3203 | /* scan through all nearby squares for terrain to hide in */ |
3112 | for(i=0,x=ob->x,y=ob->y;i<9;i++,x=ob->x+freearr_x[i],y=ob->y+freearr_y[i]) { |
3204 | for (i = 0, x = ob->x, y = ob->y; i < 9; i++, x = ob->x + freearr_x[i], y = ob->y + freearr_y[i]) |
|
|
3205 | { |
3113 | mflag = get_map_flags(ob->map, NULL, x, y, NULL, NULL); |
3206 | mflag = get_map_flags (ob->map, NULL, x, y, NULL, NULL); |
3114 | if (mflag & P_OUT_OF_MAP) { continue; } |
3207 | if (mflag & P_OUT_OF_MAP) |
|
|
3208 | { |
|
|
3209 | continue; |
|
|
3210 | } |
3115 | if(mflag & P_BLOCKSVIEW) /* something to hide near! */ |
3211 | if (mflag & P_BLOCKSVIEW) /* something to hide near! */ |
3116 | level += 2; |
3212 | level += 2; |
3117 | else /* open terrain! */ |
3213 | else /* open terrain! */ |
3118 | level -= 1; |
3214 | level -= 1; |
3119 | } |
3215 | } |
3120 | |
3216 | |
3121 | #if 0 |
3217 | #if 0 |
3122 | LOG(llevDebug,"hideability of %s is %d\n",ob->name,level); |
3218 | LOG (llevDebug, "hideability of %s is %d\n", ob->name, level); |
3123 | #endif |
3219 | #endif |
3124 | return level; |
3220 | return level; |
3125 | } |
3221 | } |
3126 | |
3222 | |
3127 | /* For Hidden creatures - a chance of becoming 'unhidden' |
3223 | /* For Hidden creatures - a chance of becoming 'unhidden' |
3128 | * every time they move - as we subtract off 'invisibility' |
3224 | * every time they move - as we subtract off 'invisibility' |
3129 | * AND, for players, if they move into a ridiculously unhideable |
3225 | * AND, for players, if they move into a ridiculously unhideable |
3130 | * spot (surrounded by clear terrain in broad daylight). -b.t. |
3226 | * spot (surrounded by clear terrain in broad daylight). -b.t. |
3131 | */ |
3227 | */ |
3132 | |
3228 | |
|
|
3229 | void |
3133 | void do_hidden_move (object *op) { |
3230 | do_hidden_move (object *op) |
|
|
3231 | { |
3134 | int hide=0, num=random_roll(0, 19, op, PREFER_LOW); |
3232 | int hide = 0, num = random_roll (0, 19, op, PREFER_LOW); |
3135 | object *skop; |
3233 | object *skop; |
3136 | |
3234 | |
3137 | if(!op || !op->map) return; |
3235 | if (!op || !op->map) |
|
|
3236 | return; |
3138 | |
3237 | |
3139 | skop = find_obj_by_type_subtype(op, SKILL, SK_HIDING); |
3238 | skop = find_obj_by_type_subtype (op, SKILL, SK_HIDING); |
3140 | |
3239 | |
3141 | /* its *extremely* hard to run and sneak/hide at the same time! */ |
3240 | /* its *extremely* hard to run and sneak/hide at the same time! */ |
3142 | if(op->type==PLAYER && op->contr->run_on) { |
3241 | if (op->type == PLAYER && op->contr->run_on) |
|
|
3242 | { |
3143 | if(!skop || num >= skop->level) { |
3243 | if (!skop || num >= skop->level) |
|
|
3244 | { |
3144 | new_draw_info(NDI_UNIQUE,0,op,"You ran too much! You are no longer hidden!"); |
3245 | new_draw_info (NDI_UNIQUE, 0, op, "You ran too much! You are no longer hidden!"); |
3145 | make_visible(op); |
3246 | make_visible (op); |
3146 | return; |
3247 | return; |
3147 | } else num += 20; |
3248 | } |
|
|
3249 | else |
|
|
3250 | num += 20; |
3148 | } |
3251 | } |
3149 | num += op->map->difficulty; |
3252 | num += op->map->difficulty; |
3150 | hide = hideability(op); /* modify by terrain hidden level */ |
3253 | hide = hideability (op); /* modify by terrain hidden level */ |
3151 | num -= hide; |
3254 | num -= hide; |
3152 | if((op->type==PLAYER && hide<-10) || ((op->invisible-=num)<=0)) { |
3255 | if ((op->type == PLAYER && hide < -10) || ((op->invisible -= num) <= 0)) |
|
|
3256 | { |
3153 | make_visible(op); |
3257 | make_visible (op); |
3154 | if(op->type==PLAYER) new_draw_info(NDI_UNIQUE, 0,op, |
3258 | if (op->type == PLAYER) |
3155 | "You moved out of hiding! You are visible!"); |
3259 | new_draw_info (NDI_UNIQUE, 0, op, "You moved out of hiding! You are visible!"); |
3156 | } |
3260 | } |
3157 | else if (op->type == PLAYER && skop) { |
3261 | else if (op->type == PLAYER && skop) |
|
|
3262 | { |
3158 | change_exp(op, calc_skill_exp(op, NULL, skop), skop->skill, 0); |
3263 | change_exp (op, calc_skill_exp (op, NULL, skop), skop->skill, 0); |
3159 | } |
3264 | } |
3160 | } |
3265 | } |
3161 | |
3266 | |
3162 | /* determine if who is standing near a hostile creature. */ |
3267 | /* determine if who is standing near a hostile creature. */ |
3163 | |
3268 | |
|
|
3269 | int |
3164 | int stand_near_hostile( object *who ) { |
3270 | stand_near_hostile (object *who) |
|
|
3271 | { |
3165 | object *tmp=NULL; |
3272 | object *tmp = NULL; |
3166 | int i,friendly=0,player=0, mflags; |
3273 | int i, friendly = 0, player = 0, mflags; |
3167 | mapstruct *m; |
3274 | maptile *m; |
3168 | sint16 x,y; |
3275 | sint16 x, y; |
3169 | |
3276 | |
3170 | if(!who) return 0; |
3277 | if (!who) |
3171 | |
|
|
3172 | if(who->type==PLAYER) player=1; |
|
|
3173 | else friendly = QUERY_FLAG(who,FLAG_FRIENDLY); |
|
|
3174 | |
|
|
3175 | /* search adjacent squares */ |
|
|
3176 | for(i=1;i<9;i++) { |
|
|
3177 | x = who->x+freearr_x[i]; |
|
|
3178 | y = who->y+freearr_y[i]; |
|
|
3179 | m = who->map; |
|
|
3180 | mflags = get_map_flags(m, &m, x, y, &x, &y); |
|
|
3181 | /* space must be blocked if there is a monster. If not |
|
|
3182 | * blocked, don't need to check this space. |
|
|
3183 | */ |
|
|
3184 | if (mflags & P_OUT_OF_MAP) continue; |
|
|
3185 | if (OB_TYPE_MOVE_BLOCK(who, GET_MAP_MOVE_BLOCK(m, x, y))) continue; |
|
|
3186 | |
|
|
3187 | for(tmp=get_map_ob(m,x,y);tmp;tmp=tmp->above) { |
|
|
3188 | if((player||friendly) |
|
|
3189 | &&QUERY_FLAG(tmp,FLAG_MONSTER)&&!QUERY_FLAG(tmp,FLAG_UNAGGRESSIVE)) |
|
|
3190 | return 1; |
|
|
3191 | else if(tmp->type==PLAYER) |
|
|
3192 | { |
|
|
3193 | /*don't let a hidden DM prevent you from hiding*/ |
|
|
3194 | if(!QUERY_FLAG(tmp, FLAG_WIZ) || tmp->contr->hidden == 0) |
|
|
3195 | return 1; |
|
|
3196 | } |
|
|
3197 | } |
|
|
3198 | } |
|
|
3199 | return 0; |
3278 | return 0; |
|
|
3279 | |
|
|
3280 | if (who->type == PLAYER) |
|
|
3281 | player = 1; |
|
|
3282 | |
|
|
3283 | else |
|
|
3284 | friendly = QUERY_FLAG (who, FLAG_FRIENDLY); |
|
|
3285 | |
|
|
3286 | /* search adjacent squares */ |
|
|
3287 | for (i = 1; i < 9; i++) |
|
|
3288 | { |
|
|
3289 | x = who->x + freearr_x[i]; |
|
|
3290 | y = who->y + freearr_y[i]; |
|
|
3291 | m = who->map; |
|
|
3292 | mflags = get_map_flags (m, &m, x, y, &x, &y); |
|
|
3293 | /* space must be blocked if there is a monster. If not |
|
|
3294 | * blocked, don't need to check this space. |
|
|
3295 | */ |
|
|
3296 | if (mflags & P_OUT_OF_MAP) |
|
|
3297 | continue; |
|
|
3298 | if (OB_TYPE_MOVE_BLOCK (who, GET_MAP_MOVE_BLOCK (m, x, y))) |
|
|
3299 | continue; |
|
|
3300 | |
|
|
3301 | for (tmp = GET_MAP_OB (m, x, y); tmp; tmp = tmp->above) |
|
|
3302 | { |
|
|
3303 | if ((player ||friendly) &&QUERY_FLAG (tmp, FLAG_MONSTER) && !QUERY_FLAG (tmp, FLAG_UNAGGRESSIVE)) |
|
|
3304 | return 1; |
|
|
3305 | else if (tmp->type == PLAYER) |
|
|
3306 | { |
|
|
3307 | /*don't let a hidden DM prevent you from hiding */ |
|
|
3308 | if (!QUERY_FLAG (tmp, FLAG_WIZ) || tmp->contr->hidden == 0) |
|
|
3309 | return 1; |
|
|
3310 | } |
|
|
3311 | } |
|
|
3312 | } |
|
|
3313 | return 0; |
3200 | } |
3314 | } |
3201 | |
3315 | |
3202 | /* check the player los field for viewability of the |
3316 | /* check the player los field for viewability of the |
3203 | * object op. This function works fine for monsters, |
3317 | * object op. This function works fine for monsters, |
3204 | * but we dont worry if the object isnt the top one in |
3318 | * but we dont worry if the object isnt the top one in |
… | |
… | |
3211 | * for them to differ. Sigh, this fctn could get a bit more complex. |
3325 | * for them to differ. Sigh, this fctn could get a bit more complex. |
3212 | * -b.t. |
3326 | * -b.t. |
3213 | * This function is now map tiling safe. |
3327 | * This function is now map tiling safe. |
3214 | */ |
3328 | */ |
3215 | |
3329 | |
|
|
3330 | int |
3216 | int player_can_view (object *pl,object *op) { |
3331 | player_can_view (object *pl, object *op) |
|
|
3332 | { |
3217 | rv_vector rv; |
3333 | rv_vector rv; |
3218 | int dx,dy; |
3334 | int dx, dy; |
3219 | |
3335 | |
3220 | if(pl->type!=PLAYER) { |
3336 | if (pl->type != PLAYER) |
|
|
3337 | { |
3221 | LOG(llevError,"player_can_view() called for non-player object\n"); |
3338 | LOG (llevError, "player_can_view() called for non-player object\n"); |
3222 | return -1; |
|
|
3223 | } |
|
|
3224 | if (!pl || !op) return 0; |
|
|
3225 | |
|
|
3226 | if(op->head) { op = op->head; } |
|
|
3227 | get_rangevector(pl, op, &rv, 0x1); |
|
|
3228 | |
|
|
3229 | /* starting with the 'head' part, lets loop |
|
|
3230 | * through the object and find if it has any |
|
|
3231 | * part that is in the los array but isnt on |
|
|
3232 | * a blocked los square. |
|
|
3233 | * we use the archetype to figure out offsets. |
|
|
3234 | */ |
|
|
3235 | while(op) { |
|
|
3236 | dx = rv.distance_x + op->arch->clone.x; |
|
|
3237 | dy = rv.distance_y + op->arch->clone.y; |
|
|
3238 | |
|
|
3239 | /* only the viewable area the player sees is updated by LOS |
|
|
3240 | * code, so we need to restrict ourselves to that range of values |
|
|
3241 | * for any meaningful values. |
|
|
3242 | */ |
|
|
3243 | if (FABS(dx) <= (pl->contr->socket.mapx/2) && |
|
|
3244 | FABS(dy) <= (pl->contr->socket.mapy/2) && |
|
|
3245 | !pl->contr->blocked_los[dx + (pl->contr->socket.mapx/2)][dy+(pl->contr->socket.mapy/2)] ) |
|
|
3246 | return 1; |
3339 | return -1; |
3247 | op = op->more; |
|
|
3248 | } |
3340 | } |
|
|
3341 | if (!pl || !op) |
3249 | return 0; |
3342 | return 0; |
|
|
3343 | |
|
|
3344 | if (op->head) |
|
|
3345 | { |
|
|
3346 | op = op->head; |
|
|
3347 | } |
|
|
3348 | get_rangevector (pl, op, &rv, 0x1); |
|
|
3349 | |
|
|
3350 | /* starting with the 'head' part, lets loop |
|
|
3351 | * through the object and find if it has any |
|
|
3352 | * part that is in the los array but isnt on |
|
|
3353 | * a blocked los square. |
|
|
3354 | * we use the archetype to figure out offsets. |
|
|
3355 | */ |
|
|
3356 | while (op) |
|
|
3357 | { |
|
|
3358 | dx = rv.distance_x + op->arch->clone.x; |
|
|
3359 | dy = rv.distance_y + op->arch->clone.y; |
|
|
3360 | |
|
|
3361 | /* only the viewable area the player sees is updated by LOS |
|
|
3362 | * code, so we need to restrict ourselves to that range of values |
|
|
3363 | * for any meaningful values. |
|
|
3364 | */ |
|
|
3365 | if (FABS (dx) <= (pl->contr->ns->mapx / 2) && |
|
|
3366 | FABS (dy) <= (pl->contr->ns->mapy / 2) && |
|
|
3367 | !pl->contr->blocked_los[dx + (pl->contr->ns->mapx / 2)][dy + (pl->contr->ns->mapy / 2)]) |
|
|
3368 | return 1; |
|
|
3369 | op = op->more; |
|
|
3370 | } |
|
|
3371 | return 0; |
3250 | } |
3372 | } |
3251 | |
3373 | |
3252 | /* routine for both players and monsters. We call this when |
3374 | /* routine for both players and monsters. We call this when |
3253 | * there is a possibility for our action distrubing our hiding |
3375 | * there is a possibility for our action distrubing our hiding |
3254 | * place or invisiblity spell. Artefact invisiblity is not |
3376 | * place or invisiblity spell. Artefact invisiblity is not |
3255 | * effected by this. If we arent invisible to begin with, we |
3377 | * effected by this. If we arent invisible to begin with, we |
3256 | * return 0. |
3378 | * return 0. |
3257 | */ |
3379 | */ |
|
|
3380 | int |
3258 | int action_makes_visible (object *op) { |
3381 | action_makes_visible (object *op) |
|
|
3382 | { |
3259 | |
3383 | |
3260 | if(op->invisible && QUERY_FLAG(op,FLAG_ALIVE)) { |
3384 | if (op->invisible && QUERY_FLAG (op, FLAG_ALIVE)) |
|
|
3385 | { |
3261 | if(QUERY_FLAG(op,FLAG_MAKE_INVIS)) |
3386 | if (QUERY_FLAG (op, FLAG_MAKE_INVIS)) |
3262 | return 0; |
3387 | return 0; |
3263 | |
3388 | |
3264 | if (op->contr && op->contr->tmp_invis == 0) return 0; |
3389 | if (op->contr && op->contr->tmp_invis == 0) |
|
|
3390 | return 0; |
3265 | |
3391 | |
3266 | /* If monsters, they should become visible */ |
3392 | /* If monsters, they should become visible */ |
3267 | if(op->hide || !op->contr || (op->contr && op->contr->tmp_invis)) { |
3393 | if (op->hide || !op->contr || (op->contr && op->contr->tmp_invis)) |
|
|
3394 | { |
3268 | new_draw_info_format(NDI_UNIQUE, 0,op,"You become %s!",op->hide?"unhidden":"visible"); |
3395 | new_draw_info_format (NDI_UNIQUE, 0, op, "You become %s!", op->hide ? "unhidden" : "visible"); |
3269 | return 1; |
3396 | return 1; |
3270 | } |
3397 | } |
3271 | } |
3398 | } |
3272 | return 0; |
3399 | return 0; |
3273 | } |
3400 | } |
3274 | |
3401 | |
3275 | /* op_on_battleground - checks if the given object op (usually |
3402 | /* op_on_battleground - checks if the given object op (usually |
3276 | * a player) is standing on a valid battleground-tile, |
3403 | * a player) is standing on a valid battleground-tile, |
3277 | * function returns TRUE/FALSE. If true x, y returns the battleground |
3404 | * function returns TRUE/FALSE. If true x, y returns the battleground |
3278 | * -exit-coord. (and if x, y not NULL) |
3405 | * -exit-coord. (and if x, y not NULL) |
3279 | * 19 March 2005 - josh@woosworld.net modifed to check if the battleground also has slaying, maxhp, and maxsp set |
3406 | * 19 March 2005 - josh@woosworld.net modifed to check if the battleground also has slaying, maxhp, and maxsp set |
3280 | * and if those are all set and the player has a marker that matches the slaying send them to a different x, y |
3407 | * and if those are all set and the player has a marker that matches the slaying send them to a different x, y |
3281 | * Default is to do the same as before, so only people wanting to have different points need worry about this |
3408 | * Default is to do the same as before, so only people wanting to have different points need worry about this |
3282 | */ |
3409 | */ |
|
|
3410 | int |
3283 | int op_on_battleground (object *op, int *x, int *y) { |
3411 | op_on_battleground (object *op, int *x, int *y) |
|
|
3412 | { |
3284 | object *tmp; |
3413 | object *tmp; |
3285 | |
3414 | |
3286 | /* A battleground-tile needs the following attributes to be valid: |
3415 | /* A battleground-tile needs the following attributes to be valid: |
3287 | * is_floor 1 (has to be the FIRST floor beneath the player's feet), |
3416 | * is_floor 1 (has to be the FIRST floor beneath the player's feet), |
3288 | * name="battleground", no_pick 1, type=58 (type BATTLEGROUND) |
3417 | * name="battleground", no_pick 1, type=58 (type BATTLEGROUND) |
3289 | * and the exit-coordinates sp/hp must both be > 0. |
3418 | * and the exit-coordinates sp/hp must both be > 0. |
3290 | * => The intention here is to prevent abuse of the battleground- |
3419 | * => The intention here is to prevent abuse of the battleground- |
3291 | * feature (like pickable or hidden battleground tiles). */ |
3420 | * feature (like pickable or hidden battleground tiles). */ |
3292 | for (tmp=op->below; tmp!=NULL; tmp=tmp->below) { |
3421 | for (tmp = op->below; tmp != NULL; tmp = tmp->below) |
|
|
3422 | { |
3293 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) { |
3423 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
|
|
3424 | { |
3294 | if (QUERY_FLAG (tmp, FLAG_NO_PICK) && |
3425 | if (QUERY_FLAG (tmp, FLAG_NO_PICK) && |
3295 | strcmp(tmp->name, "battleground")==0 && |
3426 | strcmp (tmp->name, "battleground") == 0 && tmp->type == BATTLEGROUND && EXIT_X (tmp) && EXIT_Y (tmp)) |
3296 | tmp->type == BATTLEGROUND && EXIT_X(tmp) && EXIT_Y(tmp)) { |
3427 | { |
3297 | /*before we assign the exit, check if this is a teambattle*/ |
3428 | /*before we assign the exit, check if this is a teambattle */ |
3298 | if ( EXIT_ALT_X(tmp) && EXIT_ALT_Y(tmp) && EXIT_PATH(tmp) ){ |
3429 | if (EXIT_ALT_X (tmp) && EXIT_ALT_Y (tmp) && EXIT_PATH (tmp)) |
|
|
3430 | { |
3299 | object *invtmp; |
3431 | object *invtmp; |
|
|
3432 | |
3300 | for(invtmp=op->inv; invtmp != NULL; invtmp=invtmp->below) { |
3433 | for (invtmp = op->inv; invtmp != NULL; invtmp = invtmp->below) |
3301 | if(invtmp->type==FORCE && invtmp->slaying && |
3434 | { |
3302 | !strcmp(EXIT_PATH(tmp), invtmp->slaying)){ |
3435 | if (invtmp->type == FORCE && invtmp->slaying && !strcmp (EXIT_PATH (tmp), invtmp->slaying)) |
|
|
3436 | { |
|
|
3437 | if (x != NULL && y != NULL) |
|
|
3438 | *x = EXIT_ALT_X (tmp), *y = EXIT_ALT_Y (tmp); |
|
|
3439 | return 1; |
|
|
3440 | } |
|
|
3441 | } |
|
|
3442 | } |
3303 | if (x != NULL && y != NULL) |
3443 | if (x != NULL && y != NULL) |
3304 | *x=EXIT_ALT_X(tmp), *y=EXIT_ALT_Y(tmp); |
3444 | *x = EXIT_X (tmp), *y = EXIT_Y (tmp); |
3305 | return 1; |
3445 | return 1; |
3306 | } |
3446 | } |
3307 | } |
3447 | } |
3308 | } |
|
|
3309 | if (x != NULL && y != NULL) |
|
|
3310 | *x=EXIT_X(tmp), *y=EXIT_Y(tmp); |
|
|
3311 | return 1; |
|
|
3312 | } |
3448 | } |
3313 | } |
|
|
3314 | } |
|
|
3315 | /* If we got here, did not find a battleground */ |
3449 | /* If we got here, did not find a battleground */ |
3316 | return 0; |
3450 | return 0; |
3317 | } |
3451 | } |
3318 | |
3452 | |
3319 | /* |
3453 | /* |
… | |
… | |
3323 | * attributes: |
3457 | * attributes: |
3324 | * object *who the dragon player |
3458 | * object *who the dragon player |
3325 | * int atnr the attack-number of the ability focus |
3459 | * int atnr the attack-number of the ability focus |
3326 | * int level ability level |
3460 | * int level ability level |
3327 | */ |
3461 | */ |
|
|
3462 | void |
3328 | void dragon_ability_gain(object *who, int atnr, int level) { |
3463 | dragon_ability_gain (object *who, int atnr, int level) |
|
|
3464 | { |
3329 | treasurelist *trlist = NULL; /* treasurelist */ |
3465 | treasurelist *trlist = NULL; /* treasurelist */ |
3330 | treasure *tr; /* treasure */ |
3466 | treasure *tr; /* treasure */ |
3331 | object *tmp,*skop; /* tmp. object */ |
3467 | object *tmp, *skop; /* tmp. object */ |
3332 | object *item; /* treasure object */ |
3468 | object *item; /* treasure object */ |
3333 | char buf[MAX_BUF]; /* tmp. string buffer */ |
3469 | char buf[MAX_BUF]; /* tmp. string buffer */ |
3334 | int i=0, j=0; |
3470 | int i = 0, j = 0; |
3335 | |
3471 | |
3336 | /* get the appropriate treasurelist */ |
3472 | /* get the appropriate treasurelist */ |
3337 | if (atnr == ATNR_FIRE) |
3473 | if (atnr == ATNR_FIRE) |
3338 | trlist = find_treasurelist("dragon_ability_fire"); |
3474 | trlist = find_treasurelist ("dragon_ability_fire"); |
3339 | else if (atnr == ATNR_COLD) |
3475 | else if (atnr == ATNR_COLD) |
3340 | trlist = find_treasurelist("dragon_ability_cold"); |
3476 | trlist = find_treasurelist ("dragon_ability_cold"); |
3341 | else if (atnr == ATNR_ELECTRICITY) |
3477 | else if (atnr == ATNR_ELECTRICITY) |
3342 | trlist = find_treasurelist("dragon_ability_elec"); |
3478 | trlist = find_treasurelist ("dragon_ability_elec"); |
3343 | else if (atnr == ATNR_POISON) |
3479 | else if (atnr == ATNR_POISON) |
3344 | trlist = find_treasurelist("dragon_ability_poison"); |
3480 | trlist = find_treasurelist ("dragon_ability_poison"); |
3345 | |
3481 | |
3346 | if (trlist == NULL || who->type != PLAYER) |
3482 | if (trlist == NULL || who->type != PLAYER) |
3347 | return; |
3483 | return; |
3348 | |
3484 | |
3349 | for (i=0, tr = trlist->items; tr != NULL && i<level-1; |
3485 | for (i = 0, tr = trlist->items; tr != NULL && i < level - 1; tr = tr->next, i++); |
3350 | tr = tr->next, i++); |
3486 | |
3351 | |
|
|
3352 | if (tr == NULL || tr->item == NULL) { |
3487 | if (tr == NULL || tr->item == NULL) |
|
|
3488 | { |
3353 | /* LOG(llevDebug, "-> no more treasure for %s\n", change_resist_msg[atnr]); */ |
3489 | /* LOG(llevDebug, "-> no more treasure for %s\n", change_resist_msg[atnr]); */ |
3354 | return; |
3490 | return; |
3355 | } |
3491 | } |
3356 | |
3492 | |
3357 | /* everything seems okay - now bring on the gift: */ |
3493 | /* everything seems okay - now bring on the gift: */ |
3358 | item = &(tr->item->clone); |
3494 | item = &(tr->item->clone); |
3359 | |
3495 | |
3360 | if (item->type == SPELL) { |
3496 | if (item->type == SPELL) |
|
|
3497 | { |
3361 | if (check_spell_known (who, item->name)) |
3498 | if (check_spell_known (who, item->name)) |
3362 | return; |
3499 | return; |
3363 | |
3500 | |
3364 | new_draw_info_format(NDI_UNIQUE|NDI_BLUE, 0, who, "You gained the ability of %s", item->name); |
3501 | new_draw_info_format (NDI_UNIQUE | NDI_BLUE, 0, who, "You gained the ability of %s", &item->name); |
3365 | do_learn_spell (who, item, 0); |
3502 | do_learn_spell (who, item, 0); |
3366 | return; |
3503 | return; |
3367 | } |
3504 | } |
3368 | |
3505 | |
3369 | /* grant direct spell */ |
3506 | /* grant direct spell */ |
3370 | if (item->type == SPELLBOOK) { |
3507 | if (item->type == SPELLBOOK) |
|
|
3508 | { |
3371 | if (!item->inv) { |
3509 | if (!item->inv) |
|
|
3510 | { |
3372 | LOG(llevDebug,"dragon_ability_gain: Broken spellbook %s\n", |
3511 | LOG (llevDebug, "dragon_ability_gain: Broken spellbook %s\n", &item->name); |
3373 | item->name); |
|
|
3374 | return; |
3512 | return; |
3375 | } |
3513 | } |
3376 | if (check_spell_known (who, item->inv->name)) |
3514 | if (check_spell_known (who, item->inv->name)) |
3377 | return; |
3515 | return; |
3378 | if (item->invisible) { |
3516 | if (item->invisible) |
|
|
3517 | { |
3379 | new_draw_info_format(NDI_UNIQUE|NDI_BLUE, 0, who, "You gained the ability of %s", item->inv->name); |
3518 | new_draw_info_format (NDI_UNIQUE | NDI_BLUE, 0, who, "You gained the ability of %s", &item->inv->name); |
3380 | do_learn_spell (who, item->inv, 0); |
3519 | do_learn_spell (who, item->inv, 0); |
3381 | return; |
3520 | return; |
3382 | } |
3521 | } |
3383 | } |
3522 | } |
3384 | else if (item->type == SKILL_TOOL && item->invisible) { |
3523 | else if (item->type == SKILL_TOOL && item->invisible) |
|
|
3524 | { |
3385 | if (item->subtype == SK_CLAWING && (skop=find_skill_by_name(who, item->skill))!=NULL) { |
3525 | if (item->subtype == SK_CLAWING && (skop = find_skill_by_name (who, item->skill)) != NULL) |
|
|
3526 | { |
3386 | |
3527 | |
3387 | /* should this perhaps be (skop->attackyp & item->attacktype)!=item->attacktype ... |
3528 | /* should this perhaps be (skop->attackyp & item->attacktype)!=item->attacktype ... |
3388 | * in this way, if the player is missing any of the attacktypes, he gets |
3529 | * in this way, if the player is missing any of the attacktypes, he gets |
3389 | * them. As it is now, if the player has any that match the granted skill, |
3530 | * them. As it is now, if the player has any that match the granted skill, |
3390 | * but not all of them, he gets nothing. |
3531 | * but not all of them, he gets nothing. |
3391 | */ |
3532 | */ |
3392 | if (!(skop->attacktype & item->attacktype)) { |
3533 | if (!(skop->attacktype & item->attacktype)) |
|
|
3534 | { |
3393 | /* Give new attacktype */ |
3535 | /* Give new attacktype */ |
3394 | skop->attacktype |= item->attacktype; |
3536 | skop->attacktype |= item->attacktype; |
3395 | |
3537 | |
3396 | /* always add physical if there's none */ |
3538 | /* always add physical if there's none */ |
3397 | skop->attacktype |= AT_PHYSICAL; |
3539 | skop->attacktype |= AT_PHYSICAL; |
3398 | |
3540 | |
3399 | if (item->msg != NULL) |
3541 | if (item->msg != NULL) |
3400 | new_draw_info(NDI_UNIQUE|NDI_BLUE, 0, who, item->msg); |
3542 | new_draw_info (NDI_UNIQUE | NDI_BLUE, 0, who, item->msg); |
3401 | |
3543 | |
3402 | /* Give player new face */ |
3544 | /* Give player new face */ |
3403 | if (item->animation_id) { |
3545 | if (item->animation_id) |
|
|
3546 | { |
3404 | who->face = skop->face; |
3547 | who->face = skop->face; |
3405 | who->animation_id = item->animation_id; |
3548 | who->animation_id = item->animation_id; |
3406 | who->anim_speed = item->anim_speed; |
3549 | who->anim_speed = item->anim_speed; |
3407 | who->last_anim = 0; |
3550 | who->last_anim = 0; |
3408 | who->state = 0; |
3551 | who->state = 0; |
3409 | animate_object(who, who->direction); |
3552 | animate_object (who, who->direction); |
3410 | } |
3553 | } |
|
|
3554 | } |
|
|
3555 | } |
3411 | } |
3556 | } |
3412 | } |
|
|
3413 | } |
|
|
3414 | else if (item->type == FORCE) { |
3557 | else if (item->type == FORCE) |
|
|
3558 | { |
3415 | /* forces in the treasurelist can alter the player's stats */ |
3559 | /* forces in the treasurelist can alter the player's stats */ |
3416 | object *skin; |
3560 | object *skin; |
|
|
3561 | |
3417 | /* first get the dragon skin force */ |
3562 | /* first get the dragon skin force */ |
3418 | for (skin=who->inv; skin!=NULL && strcmp(skin->arch->name, "dragon_skin_force")!=0; |
3563 | shstr_cmp dragon_skin_force ("dragon_skin_force"); |
3419 | skin=skin->below); |
3564 | for (skin = who->inv; skin && !(skin->arch->name == dragon_skin_force); skin = skin->below) |
3420 | if (skin == NULL) return; |
3565 | ; |
3421 | |
3566 | |
|
|
3567 | if (!skin) |
|
|
3568 | return; |
|
|
3569 | |
3422 | /* adding new spellpath attunements */ |
3570 | /* adding new spellpath attunements */ |
3423 | if (item->path_attuned > 0 && !(skin->path_attuned & item->path_attuned)) { |
3571 | if (item->path_attuned > 0 && !(skin->path_attuned & item->path_attuned)) |
|
|
3572 | { |
3424 | skin->path_attuned |= item->path_attuned; /* add attunement to skin */ |
3573 | skin->path_attuned |= item->path_attuned; /* add attunement to skin */ |
3425 | |
3574 | |
3426 | /* print message */ |
3575 | /* print message */ |
3427 | sprintf(buf, "You feel attuned to "); |
3576 | sprintf (buf, "You feel attuned to "); |
3428 | for(i=0, j=0; i<NRSPELLPATHS; i++) { |
3577 | for (i = 0, j = 0; i < NRSPELLPATHS; i++) |
3429 | if(item->path_attuned & (1<<i)) { |
3578 | { |
3430 | if (j) |
3579 | if (item->path_attuned & (1 << i)) |
3431 | strcat(buf," and "); |
3580 | { |
3432 | else |
3581 | if (j) |
3433 | j = 1; |
3582 | strcat (buf, " and "); |
|
|
3583 | else |
|
|
3584 | j = 1; |
3434 | strcat(buf, spellpathnames[i]); |
3585 | strcat (buf, spellpathnames[i]); |
3435 | } |
3586 | } |
3436 | } |
3587 | } |
3437 | strcat(buf,"."); |
3588 | strcat (buf, "."); |
3438 | new_draw_info(NDI_UNIQUE|NDI_BLUE, 0, who, buf); |
3589 | new_draw_info (NDI_UNIQUE | NDI_BLUE, 0, who, buf); |
3439 | } |
3590 | } |
3440 | |
3591 | |
3441 | /* evtl. adding flags: */ |
3592 | /* evtl. adding flags: */ |
3442 | if(QUERY_FLAG(item, FLAG_XRAYS)) |
3593 | if (QUERY_FLAG (item, FLAG_XRAYS)) |
3443 | SET_FLAG(skin, FLAG_XRAYS); |
3594 | SET_FLAG (skin, FLAG_XRAYS); |
3444 | if(QUERY_FLAG(item, FLAG_STEALTH)) |
3595 | if (QUERY_FLAG (item, FLAG_STEALTH)) |
3445 | SET_FLAG(skin, FLAG_STEALTH); |
3596 | SET_FLAG (skin, FLAG_STEALTH); |
3446 | if(QUERY_FLAG(item, FLAG_SEE_IN_DARK)) |
3597 | if (QUERY_FLAG (item, FLAG_SEE_IN_DARK)) |
3447 | SET_FLAG(skin, FLAG_SEE_IN_DARK); |
3598 | SET_FLAG (skin, FLAG_SEE_IN_DARK); |
3448 | |
3599 | |
3449 | /* print message if there is one */ |
3600 | /* print message if there is one */ |
3450 | if (item->msg != NULL) |
3601 | if (item->msg != NULL) |
3451 | new_draw_info(NDI_UNIQUE|NDI_BLUE, 0, who, item->msg); |
3602 | new_draw_info (NDI_UNIQUE | NDI_BLUE, 0, who, item->msg); |
|
|
3603 | } |
|
|
3604 | else |
3452 | } |
3605 | { |
3453 | else { |
|
|
3454 | /* generate misc. treasure */ |
3606 | /* generate misc. treasure */ |
3455 | tmp = arch_to_object (tr->item); |
3607 | tmp = arch_to_object (tr->item); |
3456 | new_draw_info_format(NDI_UNIQUE|NDI_BLUE, 0, who, "You gained %s", query_short_name(tmp)); |
3608 | new_draw_info_format (NDI_UNIQUE | NDI_BLUE, 0, who, "You gained %s", query_short_name (tmp)); |
3457 | tmp = insert_ob_in_ob (tmp, who); |
3609 | tmp = insert_ob_in_ob (tmp, who); |
3458 | if (who->type == PLAYER) |
3610 | if (who->type == PLAYER) |
3459 | esrv_send_item(who, tmp); |
3611 | esrv_send_item (who, tmp); |
3460 | } |
3612 | } |
3461 | } |
3613 | } |
3462 | |
3614 | |
3463 | /** |
3615 | /** |
3464 | * Unready an object for a player. This function does nothing if the object was |
3616 | * Unready an object for a player. This function does nothing if the object was |
3465 | * not readied. |
3617 | * not readied. |
3466 | */ |
3618 | */ |
|
|
3619 | void |
3467 | void player_unready_range_ob(player *pl, object *ob) { |
3620 | player_unready_range_ob (player *pl, object *ob) |
|
|
3621 | { |
3468 | rangetype i; |
3622 | rangetype i; |
3469 | |
3623 | |
3470 | for (i = (rangetype)0; i < range_size; i = (rangetype) ((int)i + 1)) { |
3624 | for (i = (rangetype) 0; i < range_size; i = (rangetype) ((int) i + 1)) |
|
|
3625 | { |
3471 | if (pl->ranges[i] == ob) { |
3626 | if (pl->ranges[i] == ob) |
|
|
3627 | { |
3472 | pl->ranges[i] = NULL; |
3628 | pl->ranges[i] = NULL; |
3473 | if (pl->shoottype == i) { |
3629 | if (pl->shoottype == i) |
|
|
3630 | { |
3474 | pl->shoottype = range_none; |
3631 | pl->shoottype = range_none; |
3475 | } |
3632 | } |
3476 | } |
3633 | } |
3477 | } |
3634 | } |
3478 | } |
3635 | } |