1 /* src/server/things.c */
4 #include <stddef.h> /* NULL */
5 #include <stdint.h> /* uint8_t, uint16_t, UINT8_MAX, UINT16_MAX */
6 #include <stdlib.h> /* free() */
7 #include <string.h> /* memset(), strlen() */
8 #include "../common/rexit.h" /* exit_err() */
9 #include "../common/try_malloc.h" /* try_malloc() */
10 #include "../common/yx_uint8.h" /* yx_uint8 */
11 #include "map.h" /* is_passable() */
12 #include "rrand.h" /* rrand() */
13 #include "world.h" /* global world */
14 #include "yx_uint8.h" /* yx_uint8_cmp() */
19 /* Return lowest unused id for new thing. */
20 static uint8_t get_lowest_unused_id();
24 static uint8_t get_lowest_unused_id()
29 if (!get_thing(world.things, i, 1))
33 exit_err(i == UINT8_MAX, "No unused ID available to add new thing.");
40 extern struct Thing * get_thing(struct Thing * ptr, uint8_t id, uint8_t deep)
44 if (NULL == ptr || id == ptr->id)
50 struct Thing * owned_thing = get_thing(ptr->owns, id, 1);
51 if (NULL != owned_thing)
62 extern void free_thing_types(struct ThingType * tt_start)
68 free_thing_types(tt_start->next);
75 extern struct Thing * add_thing(int16_t id, uint8_t type, uint8_t find_pos)
77 char * f_name = "add_thing()";
78 struct ThingType * tt = get_thing_type(type);
79 struct Thing * t = try_malloc(sizeof(struct Thing), f_name);
80 memset(t, 0, sizeof(struct Thing));
81 t->id = (0 <= id && id <= UINT8_MAX) ? id : get_lowest_unused_id();
83 t->lifepoints = tt->lifepoints;
84 char * err = "Space to put thing on too hard to find. Map too small?";
86 memset(&(t->pos), 0, sizeof(struct yx_uint8));
90 for (pos.y = pos.x = 0; 0 == is_passable(pos); i++)
92 exit_err(UINT16_MAX == i, err);
93 pos.y = rrand() % world.map.length;
94 pos.x = rrand() % world.map.length;
98 for (t_ptr = world.things; t_ptr != NULL; t_ptr = t_ptr->next)
100 if (yx_uint8_cmp(&pos, &t_ptr->pos) && 0 != t_ptr->lifepoints)
112 struct Thing ** t_ptr_ptr = &world.things;
113 for (; NULL != * t_ptr_ptr; t_ptr_ptr = &(*t_ptr_ptr)->next);
120 extern void add_things(uint8_t type, uint8_t n)
123 for (i = 0; i < n; i++)
125 add_thing(-1, type, 1);
131 extern void free_things(struct Thing * t_start)
137 free_things(t_start->owns);
138 free_things(t_start->next);
139 free(t_start->fov_map);
141 if (t_start == world.things) /* So add_things()' NULL-delimited thing */
142 { /* iteration loop does not iterate over */
143 world.things = NULL; /* freed memory when called the first time */
144 } /* after world re-seeding. */
149 extern void own_thing(struct Thing ** target, struct Thing ** source,
153 if (id == (*source)->id)
160 struct Thing * penult = * source;
163 if (id == penult->next->id)
167 penult = penult->next;
170 penult->next = t->next;
172 struct Thing ** t_ptr_ptr = target;
173 for (; NULL != * t_ptr_ptr; t_ptr_ptr = &(*t_ptr_ptr)->next);
180 extern struct Thing * get_player()
182 return get_thing(world.things, 0, 1);
187 extern struct ThingType * get_thing_type(uint8_t id)
189 char * f_name = "get_thing_type()";
190 struct ThingType * tt = world.thing_types;
191 for (; NULL != tt && id != tt->id; tt = tt->next);
192 char * err_intro = "Requested thing type of unused ID ";
193 uint16_t size = strlen(err_intro) + 3 + 1 + 1;
194 char * err = try_malloc(size, f_name);
195 sprintf(err, "%s%d.", err_intro, id);
196 exit_err(NULL == tt, err);
203 extern void set_thing_position(struct Thing * t, struct yx_uint8 pos)
206 struct Thing * owned = t->owns;
207 for (; owned != NULL; set_thing_position(owned, pos), owned = owned->next);