1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
|
/*
* database.cc
* Crawl
*
* Created by Peter Berger on 4/15/07.
* Copyright 2007 __MyCompanyName__. All rights reserved.
*
*/
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <unistd.h>
#include <stdlib.h>
#include <cstdlib>
#include <fstream>
#include "database.h"
#include "files.h"
#include "libutil.h"
#include "stuff.h"
// Convenience functions for (read-only) access to generic
// berkeley DB databases.
db_list openDBList;
DBM *descriptionDB;
#define DESC_BASE_NAME "descript"
#define DESC_TXT_DIR "descript"
#define DESC_DB (DESC_BASE_NAME ".db")
static std::vector<std::string> description_txt_paths();
static void generate_description_db();
void databaseSystemInit()
{
if (!descriptionDB)
{
std::string descriptionPath = get_savedir_path(DESC_DB);
std::vector<std::string> textPaths = description_txt_paths();
// If any of the description text files are newer then
// aggregated description db, then regenerate the whole db
for (int i = 0, size = textPaths.size(); i < size; i++)
if (is_newer(textPaths[i], descriptionPath))
{
generate_description_db();
break;
}
descriptionPath.erase(descriptionPath.length() - 3);
if (!(descriptionDB = openDB(descriptionPath.c_str())))
end(1, true, "Failed to open DB: %s", descriptionPath.c_str());
}
}
void databaseSystemShutdown()
{
for (db_list::iterator i = openDBList.begin();
i != openDBList.end(); ++i)
{
dbm_close(*i);
}
openDBList.clear();
descriptionDB = NULL;
}
// This is here, and is external, just for future expansion -- if we
// want to allow external modules to manage their own DB, they can
// use this for the sake of convenience. It's arguable that it's
// morally wrong to have the database module manage the memory here.
// But hey, life is hard and you can write your own berkeley DB
// calls if you like.
DBM *openDB(const char *dbFilename)
{
DBM *dbToReturn = dbm_open(dbFilename, O_RDONLY, 0660);
if (dbToReturn)
openDBList.push_front(dbToReturn);
return dbToReturn;
}
datum database_fetch(DBM *database, const std::string &key)
{
datum result;
result.dptr = NULL;
result.dsize = 0;
datum dbKey;
dbKey.dptr = (DPTR_COERCE) key.c_str();
dbKey.dsize = key.length();
result = dbm_fetch(database, dbKey);
return result;
}
std::string getLongDescription(const std::string &key)
{
if (!descriptionDB)
return ("");
// We have to canonicalize the key (in case the user typed it
// in and got the case wrong.)
std::string canonical_key = key;
lowercase(canonical_key);
// Query the DB.
datum result = database_fetch(descriptionDB, canonical_key);
// Cons up a (C++) string to return. The caller must release it.
return std::string((const char *)result.dptr, result.dsize);
}
static std::vector<std::string> description_txt_paths()
{
std::vector<std::string> txt_file_names;
std::vector<std::string> paths;
txt_file_names.push_back("features");
txt_file_names.push_back("items");
txt_file_names.push_back("monsters");
txt_file_names.push_back("spells");
for (int i = 0, size = txt_file_names.size(); i < size; i++)
{
std::string name = DESC_TXT_DIR;
name += FILE_SEPARATOR;
name += txt_file_names[i];
name += ".txt";
std::string txt_path = datafile_path(name);
paths.push_back(txt_path);
}
return (paths);
}
static void store_descriptions(const std::string &in, const std::string &out);
static void generate_description_db()
{
std::string db_path = get_savedir_path(DESC_BASE_NAME);
std::string full_db_path = get_savedir_path(DESC_DB);
std::vector<std::string> txt_paths = description_txt_paths();
file_lock lock(get_savedir_path(DESC_BASE_NAME ".lk"), "wb");
unlink( full_db_path.c_str() );
for (int i = 0, size = txt_paths.size(); i < size; i++)
store_descriptions(txt_paths[i], db_path);
DO_CHMOD_PRIVATE(full_db_path.c_str());
}
static void trim_right(std::string &s)
{
s.erase(s.find_last_not_of(" \r\t\n") + 1);
}
static void trim_leading_newlines(std::string &s)
{
s.erase(0, s.find_first_not_of("\n"));
}
static void add_entry(DBM *db, const std::string &k, std::string &v)
{
trim_leading_newlines(v);
datum key, value;
key.dptr = (char *) k.c_str();
key.dsize = k.length();
value.dptr = (char *) v.c_str();
value.dsize = v.length();
if (dbm_store(db, key, value, DBM_REPLACE))
end(1, true, "Error storing %s", k.c_str());
}
static void parse_descriptions(std::ifstream &inf, DBM *db)
{
char buf[1000];
std::string key;
std::string value;
bool in_entry = false;
while (!inf.eof())
{
inf.getline(buf, sizeof buf);
if (*buf == '#')
continue;
if (!strncmp(buf, "%%%%", 4))
{
if (!key.empty())
add_entry(db, key, value);
key.clear();
value.clear();
in_entry = true;
continue;
}
if (!in_entry)
continue;
if (key.empty())
{
key = buf;
trim_string(key);
lowercase(key);
}
else
{
std::string line = buf;
trim_right(line);
value += line + "\n";
}
}
if (!key.empty())
add_entry(db, key, value);
}
static void store_descriptions(const std::string &in, const std::string &out)
{
std::ifstream inf(in.c_str());
if (!inf)
end(1, true, "Unable to open input file: %s", in.c_str());
if (DBM *db = dbm_open(out.c_str(), O_RDWR | O_CREAT, 0660))
{
parse_descriptions(inf, db);
dbm_close(db);
}
else
end(1, true, "Unable to open DB: %s", out.c_str());
inf.close();
}
|
