summaryrefslogtreecommitdiff
blob: 605af8e3a07b9dd8c9490d144707571cc2d0ebab (plain)
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
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
#include <stdlib.h>
#include <string.h>
#include <stdint.h> /* defines SIZE_MAX */

#include "../error/error.h"

#include "knowledge.h"

/******************************************************************************/
/** INITIALIZING STRUCTURES ***************************************************/
/******************************************************************************/

static void initialize_sequence_collection
(
   struct ZoO_knowledge_sequence_collection c [const restrict static 1]
)
{
   c->sequences_ref = (struct ZoO_knowledge_sequence_data *) NULL;
   c->sequences_ref_length = 0;
   c->sequences_ref_sorted = (ZoO_index *) NULL;
}

static void initialize_word
(
   struct ZoO_knowledge_word w [const restrict static 1]
)
{
   w->word = (const ZoO_char *) NULL;
   w->word_length = 0;
   w->occurrences = 0;

   initialize_sequence_collection(&(w->swt));
   initialize_sequence_collection(&(w->tws));
}

/******************************************************************************/
/** ALLOCATING MEMORY *********************************************************/
/******************************************************************************/
static ZoO_char * copy_word
(
   const ZoO_char original [const restrict static 1],
   const ZoO_index original_length,
   FILE io [const restrict static 1]
)
{
   ZoO_char * result;

   result =
      (ZoO_char *)
      calloc
      (
         original_length,
         sizeof(ZoO_char)
      );

   if (result == (ZoO_char *) NULL)
   {
      ZoO_S_ERROR(io, "Unable to allocate memory to store new word.");

      return (ZoO_char *) NULL;
   }

   memcpy
   (
      (void *) result,
      (const void *) original,
      (((size_t) original_length) * sizeof(ZoO_char))
   );

   return result;
}

static int reallocate_words_list
(
   struct ZoO_knowledge k [const restrict static 1],
   FILE io [const restrict static 1]
)
{
   struct ZoO_knowledge_word * new_words;

   if
   (
      (SIZE_MAX / sizeof(struct ZoO_knowledge_word))
      < (size_t) k->words_length
   )
   {
      ZoO_S_ERROR
      (
         io,
         "Unable to store the size of the words list, as it would overflow"
         "size_t variables."
      );

      return -1;
   }

   new_words =
      (struct ZoO_knowledge_word *) realloc
      (
         (void *) k->words,
         (((size_t) k->words_length) * sizeof(struct ZoO_knowledge_word))
      );

   if (new_words == (struct ZoO_knowledge_word *) NULL)
   {
      ZoO_S_ERROR
      (
         io,
         "Unable to allocate the memory required for the new words list."
      );

      return -1;
   }

   k->words = new_words;

   return 0;
}

static int reallocate_words_sorted_list
(
   struct ZoO_knowledge k [const restrict static 1],
   FILE io [const restrict static 1]
)
{
   ZoO_index * new_words_sorted;

   /*
    * This has already been tested previously for a struct ZoO_knowledge_word,
    * whose size is bigger than a ZoO_index.
    * */
   /*
   if ((SIZE_MAX / sizeof(ZoO_index)) < k->words_length)
   {
      ZoO_S_ERROR
      (
         "Unable to store the size of the sorted words list, as it would"
         " overflow size_t variables."
      );

      return -1;
   }
   */

   new_words_sorted =
      (ZoO_index *) realloc
      (
         (void *) k->words_sorted,
         (((size_t) k->words_length) * sizeof(ZoO_index))
      );

   if (new_words_sorted == (ZoO_index *) NULL)
   {
      ZoO_S_ERROR
      (
         io,
         "Unable to allocate the memory required for the new sorted words list."
      );

      return -1;
   }

   k->words_sorted = new_words_sorted;

   return 0;
}

static void set_nth_word
(
   struct ZoO_knowledge k [const restrict static 1],
   const ZoO_index sorted_word_id,
   const ZoO_index word_id
)
{
   /* Safe: (> k->words_length 1) */
   if (sorted_word_id < (k->words_length - 1))
   {
      memmove
      (
         /* Safe: (=< (+ sorted_word_id 1) k->words_length) */
         (void *) (k->words_sorted + (sorted_word_id + 1)),
         (const void *) (k->words_sorted + sorted_word_id),
         (
            ((size_t) ((k->words_length - 1) - sorted_word_id))
            * sizeof(ZoO_index)
         )
      );
   }

   k->words_sorted[sorted_word_id] = word_id;
}

static int add_word
(
   struct ZoO_knowledge k [const restrict static 1],
   const ZoO_char word [const restrict static 1],
   const ZoO_index word_length,
   const ZoO_index word_id,
   const ZoO_index sorted_word_id,
   FILE io [const restrict static 1]
)
{
   ZoO_char * stored_word;

   if (k->words_length == ZoO_INDEX_MAX)
   {
      ZoO_S_ERROR
      (
         io,
         "Unable to add word: the variable that stores the number of known "
         "words would overflow."
      );

      return -1;
   }

   stored_word = copy_word(word, word_length, io);

   if (stored_word == (ZoO_char *) NULL)
   {
      return -1;
   }

   k->words_length += 1;

   if (reallocate_words_list(k, io) < 0)
   {
      k->words_length -= 1;

      return -1;
   }

   initialize_word(k->words + word_id);

   k->words[word_id].word = stored_word;
   k->words[word_id].word_length = word_length;

   if (reallocate_words_sorted_list(k, io) < 0)
   {
      k->words_length -= 1;

      return -1;
   }

   set_nth_word(k, sorted_word_id, word_id);

   return 0;
}

/******************************************************************************/
/** EXPORTED ******************************************************************/
/******************************************************************************/

int ZoO_knowledge_learn_word
(
   struct ZoO_knowledge k [const restrict static 1],
   const ZoO_char word [const restrict static 1],
   const size_t word_length,
   ZoO_index word_id [const restrict static 1],
   FILE io [const restrict static 1]
)
{
   ZoO_index sorted_id;

   if (word_length >= (size_t) ZoO_INDEX_MAX)
   {
      ZoO_S_ERROR(io, "Word is too long to be learned.");

      return -1;
   }

   if
   (
      ZoO_knowledge_find_word_id
      (
         k,
         word,
         (((size_t) word_length) * sizeof(ZoO_char)),
         word_id
      ) == 0
   )
   {
      ZoO_DEBUG
      (
         io,
         ZoO_DEBUG_KNOWLEDGE_LEARN_WORD,
         "Word of size %u is already known (id: %u).",
         (ZoO_index) word_length,
         *word_id
      );

      return 0;
   }

   sorted_id = *word_id;
   *word_id = k->words_length;

   ZoO_DEBUG
   (
      io,
      ZoO_DEBUG_KNOWLEDGE_LEARN_WORD,
      "Learning new word of size %u (id: %u, sorted_id: %u).",
      (ZoO_index) word_length,
      *word_id,
      sorted_id
   );

   return add_word(k, word, (ZoO_index) word_length, *word_id, sorted_id, io);
}