ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/readable.C
(Generate patch)

Comparing deliantra/server/common/readable.C (file contents):
Revision 1.8 by root, Thu Sep 14 21:16:11 2006 UTC vs.
Revision 1.10 by root, Fri Sep 29 21:55:54 2006 UTC

16 16
17 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
18 along with this program; if not, write to the Free Software 18 along with this program; if not, write to the Free Software
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20 20
21 The authors can be reached via e-mail at crossfire-devel@real-time.com 21 The authors can be reached via e-mail at <crossfire@schmorp.de>
22*/ 22*/
23 23
24 24
25/* This file contains code relevant to the BOOKS hack -- designed 25/* This file contains code relevant to the BOOKS hack -- designed
26 * to allow randomly occuring messages in non-magical texts. 26 * to allow randomly occuring messages in non-magical texts.
1978 strcpy (msgbuf, msgfile_msg (level, book_buf_size)); 1978 strcpy (msgbuf, msgfile_msg (level, book_buf_size));
1979 break; 1979 break;
1980 } 1980 }
1981 1981
1982 strcat (msgbuf, "\n"); /* safety -- we get ugly map saves/crashes w/o this */ 1982 strcat (msgbuf, "\n"); /* safety -- we get ugly map saves/crashes w/o this */
1983
1983 if (strlen (msgbuf) > 1) 1984 if (strlen (msgbuf) > 1)
1984 { 1985 {
1985 book->msg = msgbuf; 1986 book->msg = msgbuf;
1986 /* lets give the "book" a new name, which may be a compound word */ 1987 /* lets give the "book" a new name, which may be a compound word */
1987 change_book (book, msg_type); 1988 change_book (book, msg_type);
2016 delete title1; 2017 delete title1;
2017 } 2018 }
2018 2019
2019 delete tlist; 2020 delete tlist;
2020 } 2021 }
2022
2021 for (lmsg = first_msg; lmsg; lmsg = nextmsg) 2023 for (lmsg = first_msg; lmsg; lmsg = nextmsg)
2022 { 2024 {
2023 nextmsg = lmsg->next; 2025 nextmsg = lmsg->next;
2024 delete lmsg; 2026 delete lmsg;
2025 } 2027 }
2028
2026 for (monlink = first_mon_info; monlink; monlink = nextmon) 2029 for (monlink = first_mon_info; monlink; monlink = nextmon)
2027 { 2030 {
2028 nextmon = monlink->next; 2031 nextmon = monlink->next;
2029 free (monlink); 2032 free (monlink);
2030 } 2033 }

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines