1 | |
|
|
2 | /* |
1 | /* |
3 | CrossFire, A Multiplayer game for X-windows |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
4 | |
3 | * |
5 | Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
6 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
7 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
8 | |
7 | * |
9 | This program is free software; you can redistribute it and/or modify |
8 | * Crossfire TRT is free software: you can redistribute it and/or modify |
10 | it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
11 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation, either version 3 of the License, or |
12 | (at your option) any later version. |
11 | * (at your option) any later version. |
13 | |
12 | * |
14 | This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
15 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
16 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
17 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
18 | |
17 | * |
19 | You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the GNU General Public License |
20 | along with this program; if not, write to the Free Software |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
21 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * |
22 | |
|
|
23 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
24 | */ |
22 | */ |
25 | |
|
|
26 | |
23 | |
27 | #include <global.h> |
24 | #include <global.h> |
28 | #include <random_map.h> |
25 | #include <random_map.h> |
29 | #include <rproto.h> |
26 | #include <rproto.h> |
30 | |
27 | |
… | |
… | |
52 | char style_name[1024]; |
49 | char style_name[1024]; |
53 | |
50 | |
54 | sprintf (style_name, "/styles/decorstyles"); |
51 | sprintf (style_name, "/styles/decorstyles"); |
55 | |
52 | |
56 | decor_map = find_style (style_name, decorstyle, -1); |
53 | decor_map = find_style (style_name, decorstyle, -1); |
57 | if (decor_map == NULL) |
54 | if (!decor_map) |
58 | return; |
55 | return; |
|
|
56 | |
59 | /* pick a random option, only 1 option right now. */ |
57 | /* pick a random option, only 1 option right now. */ |
60 | if (decor_option == 0) |
58 | if (decor_option == 0) |
61 | decor_option = RANDOM () % NR_DECOR_OPTIONS + 1; |
59 | decor_option = rndm (NR_DECOR_OPTIONS) + 1; |
|
|
60 | |
62 | switch (decor_option) |
61 | switch (decor_option) |
63 | { |
62 | { |
64 | case 0: |
63 | case 0: |
65 | break; |
64 | break; |
66 | case 1: |
65 | case 1: |
67 | { /* random placement of decor objects. */ |
66 | { /* random placement of decor objects. */ |
68 | int number_to_place = RANDOM () % ((RP->Xsize * RP->Ysize) / 5); |
67 | int number_to_place = rndm (RP->Xsize * RP->Ysize / 5); |
69 | int failures = 0; |
68 | int failures = 0; |
70 | object *new_decor_object; |
69 | object *new_decor_object; |
71 | |
70 | |
72 | while (failures < 100 && number_to_place > 0) |
71 | while (failures < 100 && number_to_place > 0) |
73 | { |
72 | { |
74 | int x, y; |
73 | int x, y; |
75 | |
74 | |
76 | x = RANDOM () % (RP->Xsize - 2) + 1; |
75 | x = rndm (RP->Xsize - 2) + 1; |
77 | y = RANDOM () % (RP->Ysize - 2) + 1; |
76 | y = rndm (RP->Ysize - 2) + 1; |
78 | if (maze[x][y] == 0 && obj_count_in_map (map, x, y) < 2) |
77 | if (maze[x][y] == 0 && obj_count_in_map (map, x, y) < 2) |
79 | { /* empty */ |
78 | { /* empty */ |
80 | object *this_object; |
79 | object *this_object; |
81 | |
80 | |
82 | new_decor_object = pick_random_object (decor_map); |
81 | new_decor_object = decor_map->pick_random_object (); |
83 | this_object = arch_to_object (new_decor_object->arch); |
82 | this_object = arch_to_object (new_decor_object->arch); |
84 | new_decor_object->copy_to (this_object); |
83 | new_decor_object->copy_to (this_object); |
85 | this_object->x = x; |
84 | this_object->x = x; |
86 | this_object->y = y; |
85 | this_object->y = y; |
87 | /* it screws things up if decor can stop people */ |
86 | /* it screws things up if decor can stop people */ |
88 | this_object->move_block = MOVE_BLOCK_DEFAULT; |
87 | this_object->move_block = 0; |
89 | insert_ob_in_map (this_object, map, NULL, 0); |
88 | insert_ob_in_map (this_object, map, NULL, 0); |
90 | number_to_place--; |
89 | number_to_place--; |
91 | } |
90 | } |
92 | else |
91 | else |
93 | failures++; |
92 | failures++; |
… | |
… | |
103 | { |
102 | { |
104 | if (maze[i][j] == 0) |
103 | if (maze[i][j] == 0) |
105 | { |
104 | { |
106 | object *new_decor_object, *this_object; |
105 | object *new_decor_object, *this_object; |
107 | |
106 | |
108 | new_decor_object = pick_random_object (decor_map); |
107 | new_decor_object = decor_map->pick_random_object (); |
109 | this_object = arch_to_object (new_decor_object->arch); |
108 | this_object = arch_to_object (new_decor_object->arch); |
110 | new_decor_object->copy_to (this_object); |
109 | new_decor_object->copy_to (this_object); |
111 | this_object->x = i; |
110 | this_object->x = i; |
112 | this_object->y = j; |
111 | this_object->y = j; |
113 | /* it screws things up if decor can stop people */ |
112 | /* it screws things up if decor can stop people */ |
114 | this_object->move_block = MOVE_BLOCK_DEFAULT; |
113 | this_object->move_block = 0; |
115 | insert_ob_in_map (this_object, map, NULL, 0); |
114 | insert_ob_in_map (this_object, map, NULL, 0); |
116 | } |
115 | } |
117 | } |
116 | } |
118 | break; |
117 | break; |
119 | } |
118 | } |