Merge topic branch t/ff-compat into master
[paraslash.git] / mood.c
1 /* Copyright (C) 2007 Andre Noll <maan@tuebingen.mpg.de>, see file COPYING. */
2
3 /** \file mood.c Paraslash's mood handling functions. */
4
5 #include <regex.h>
6 #include <osl.h>
7 #include <lopsub.h>
8
9 #include "para.h"
10 #include "error.h"
11 #include "string.h"
12 #include "afh.h"
13 #include "afs.h"
14 #include "list.h"
15 #include "mood.h"
16
17 /*
18 * Mood parser API. It's overkill to have an own header file for
19 * these declarations as they are only needed in this .c file.
20 */
21 struct mp_context;
22 int mp_init(const char *definition, int nbytes, struct mp_context **result,
23 char **errmsg);
24 bool mp_eval_row(const struct osl_row *aft_row, struct mp_context *ctx);
25 void mp_shutdown(struct mp_context *ctx);
26
27 /**
28 * Contains statistical data of the currently admissible audio files.
29 *
30 * It is used to assign normalized score values to each admissible audio file.
31 */
32 struct afs_statistics {
33 /** Sum of num played over all admissible files. */
34 int64_t num_played_sum;
35 /** Sum of last played times over all admissible files. */
36 int64_t last_played_sum;
37 /** Quadratic deviation of num played count. */
38 int64_t num_played_qd;
39 /** Quadratic deviation of last played time. */
40 int64_t last_played_qd;
41 /** Correction factor for the num played score. */
42 int64_t num_played_correction;
43 /** Correction factor for the last played score. */
44 int64_t last_played_correction;
45 /** Common divisor of the correction factors. */
46 int64_t normalization_divisor;
47 /** Number of admissible files */
48 unsigned num;
49 };
50 static struct afs_statistics statistics = {.normalization_divisor = 1};
51
52 struct mood {
53 /** The name of this mood. */
54 char *name;
55 /** Info for the bison parser. */
56 struct mp_context *parser_context;
57 };
58
59 /*
60 * If current_mood is NULL then no mood is currently open. If
61 * current_mood->name is NULL, the dummy mood is currently open.
62 */
63 static struct mood *current_mood;
64
65 /*
66 * Find the position of the most-significant set bit.
67 *
68 * Copied and slightly adapted from the linux source tree, version 4.9.39
69 * (2017-07).
70 */
71 __a_const static uint32_t fls64(uint64_t v)
72 {
73 int n = 63;
74 const uint64_t ones = ~(uint64_t)0U;
75
76 if ((v & (ones << 32)) == 0) {
77 n -= 32;
78 v <<= 32;
79 }
80 if ((v & (ones << (64 - 16))) == 0) {
81 n -= 16;
82 v <<= 16;
83 }
84 if ((v & (ones << (64 - 8))) == 0) {
85 n -= 8;
86 v <<= 8;
87 }
88 if ((v & (ones << (64 - 4))) == 0) {
89 n -= 4;
90 v <<= 4;
91 }
92 if ((v & (ones << (64 - 2))) == 0) {
93 n -= 2;
94 v <<= 2;
95 }
96 if ((v & (ones << (64 - 1))) == 0)
97 n -= 1;
98 return n;
99 }
100
101 /*
102 * Compute the integer square root floor(sqrt(x)).
103 *
104 * Taken 2007 from the linux source tree.
105 */
106 __a_const static uint64_t int_sqrt(uint64_t x)
107 {
108 uint64_t op = x, res = 0, one = 1;
109
110 one = one << (fls64(x) & ~one);
111 while (one != 0) {
112 if (op >= res + one) {
113 op = op - (res + one);
114 res = res + 2 * one;
115 }
116 res /= 2;
117 one /= 4;
118 }
119 return res;
120 }
121
122 /* returns 1 if row admissible, 0 if not, negative on errors */
123 static int row_is_admissible(const struct osl_row *aft_row, struct mood *m)
124 {
125 if (!m)
126 return -E_NO_MOOD;
127 return mp_eval_row(aft_row, m->parser_context);
128 }
129
130 static void destroy_mood(struct mood *m)
131 {
132 if (!m)
133 return;
134 mp_shutdown(m->parser_context);
135 free(m->name);
136 free(m);
137 }
138
139 static struct mood *alloc_new_mood(const char *name)
140 {
141 struct mood *m = para_calloc(sizeof(struct mood));
142 if (name)
143 m->name = para_strdup(name);
144 return m;
145 }
146
147 static int load_mood(const struct osl_row *mood_row, struct mood **m,
148 char **errmsg)
149 {
150 char *mood_name;
151 struct osl_object mood_def;
152 int ret;
153
154 ret = mood_get_name_and_def_by_row(mood_row, &mood_name, &mood_def);
155 if (ret < 0) {
156 if (errmsg)
157 *errmsg = make_message(
158 "could not read mood definition");
159 return ret;
160 }
161 assert(*mood_name);
162 *m = alloc_new_mood(mood_name);
163 PARA_INFO_LOG("opening mood %s\n", mood_name);
164 ret = mp_init(mood_def.data, mood_def.size, &(*m)->parser_context, errmsg);
165 osl_close_disk_object(&mood_def);
166 if (ret < 0)
167 destroy_mood(*m);
168 return ret;
169 }
170
171 static int check_mood(struct osl_row *mood_row, void *data)
172 {
173 struct para_buffer *pb = data;
174 char *mood_name, *errmsg;
175 struct osl_object mood_def;
176 struct mood *m;
177 int ret = mood_get_name_and_def_by_row(mood_row, &mood_name, &mood_def);
178
179 if (ret < 0) {
180 para_printf(pb, "cannot read mood\n");
181 return ret;
182 }
183 if (!*mood_name) /* ignore dummy row */
184 goto out;
185 m = alloc_new_mood("check");
186 ret = mp_init(mood_def.data, mood_def.size, &m->parser_context,
187 &errmsg);
188 if (ret < 0) {
189 para_printf(pb, "%s: %s\n", mood_name, errmsg);
190 free(errmsg);
191 para_printf(pb, "%s\n", para_strerror(-ret));
192 } else
193 destroy_mood(m);
194 ret = 1; /* don't fail the loop on invalid mood definitions */
195 out:
196 osl_close_disk_object(&mood_def);
197 return ret;
198 }
199
200 /**
201 * Check all moods for syntax errors.
202 *
203 * \param aca Only ->pbout is used for diagnostics.
204 *
205 * \return Negative on fatal errors. Inconsistent mood definitions are not
206 * considered an error.
207 */
208 int mood_check_callback(struct afs_callback_arg *aca)
209 {
210 para_printf(&aca->pbout, "checking moods...\n");
211 return osl(osl_rbtree_loop(moods_table, BLOBCOL_ID, &aca->pbout,
212 check_mood));
213 }
214
215 /*
216 * The normalized num_played and last_played values are defined as
217 *
218 * nn := -(np - mean_n) / sigma_n and nl := -(lp - mean_l) / sigma_l
219 *
220 * For a (hypothetical) file with np = 0 and lp = now we thus have
221 *
222 * nn = mean_n / sigma_n =: hn > 0
223 * nl = -(now - mean_l) / sigma_l =: hl < 0
224 *
225 * We design the score function so that both contributions get the same
226 * weight. Define the np and lp score of an arbitrary file as
227 *
228 * sn := nn * -hl and sl := nl * hn
229 *
230 * Example:
231 * num_played mean/sigma: 87/14
232 * last_played mean/sigma: 45/32 days
233 *
234 * We have hn = 87 / 14 = 6.21 and hl = -45 / 32 = -1.41. Multiplying
235 * nn of every file with the correction factor 1.41 and nl with
236 * 6.21 makes the weight of the two contributions equal.
237 *
238 * The total score s := sn + sl has the representation
239 *
240 * s = -cn * (np - mean_n) - cl * (lp - mean_l)
241 *
242 * with positive correction factors
243 *
244 * cn = (now - mean_l) / (sqrt(ql) * sqrt(qn) / n)
245 * cl = mean_n / (sqrt(ql) * sqrt(qn) / n)
246 *
247 * where ql and qn are the quadratic deviations stored in the statistics
248 * structure and n is the number of admissible files. To avoid integer
249 * overflows and rounding errors we store the common divisor of the
250 * correction factors separately.
251 */
252 static int64_t normalized_value(int64_t x, int64_t n, int64_t sum, int64_t qd)
253 {
254 if (!n || !qd)
255 return 0;
256 return 100 * (n * x - sum) / (int64_t)int_sqrt(n) / (int64_t)int_sqrt(qd);
257 }
258
259 static long compute_score(struct afs_info *afsi)
260 {
261 long score = -normalized_value(afsi->num_played, statistics.num,
262 statistics.num_played_sum, statistics.num_played_qd);
263 score -= normalized_value(afsi->last_played, statistics.num,
264 statistics.last_played_sum, statistics.last_played_qd);
265 return score / 2;
266 }
267
268 static int add_afs_statistics(const struct osl_row *row)
269 {
270 uint64_t n, x, s, q;
271 struct afs_info afsi;
272 int ret;
273
274 ret = get_afsi_of_row(row, &afsi);
275 if (ret < 0)
276 return ret;
277 n = statistics.num;
278 x = afsi.last_played;
279 s = statistics.last_played_sum;
280 if (n > 0) {
281 q = (x > s / n)? x - s / n : s / n - x;
282 statistics.last_played_qd += q * q * n / (n + 1);
283 }
284 statistics.last_played_sum += x;
285
286 x = afsi.num_played;
287 s = statistics.num_played_sum;
288 if (n > 0) {
289 q = (x > s / n)? x - s / n : s / n - x;
290 statistics.num_played_qd += q * q * n / (n + 1);
291 }
292 statistics.num_played_sum += x;
293 statistics.num++;
294 return 1;
295 }
296
297 static int del_afs_statistics(const struct osl_row *row)
298 {
299 uint64_t n, s, q, a, new_s;
300 struct afs_info afsi;
301 int ret;
302 ret = get_afsi_of_row(row, &afsi);
303 if (ret < 0)
304 return ret;
305 n = statistics.num;
306 assert(n);
307 if (n == 1) {
308 memset(&statistics, 0, sizeof(statistics));
309 statistics.normalization_divisor = 1;
310 return 1;
311 }
312
313 s = statistics.last_played_sum;
314 q = statistics.last_played_qd;
315 a = afsi.last_played;
316 new_s = s - a;
317 statistics.last_played_sum = new_s;
318 statistics.last_played_qd = q + s * s / n - a * a
319 - new_s * new_s / (n - 1);
320
321 s = statistics.num_played_sum;
322 q = statistics.num_played_qd;
323 a = afsi.num_played;
324 new_s = s - a;
325 statistics.num_played_sum = new_s;
326 statistics.num_played_qd = q + s * s / n - a * a
327 - new_s * new_s / (n - 1);
328
329 statistics.num--;
330 return 1;
331 }
332
333 /*
334 * At mood open time we determine the set of admissible files for the given
335 * mood where each file is identified by a pointer to a row of the audio file
336 * table. In the first pass the pointers are added to a temporary array and
337 * statistics are computed. When all admissible files have been processed in
338 * this way, the score of each admissible file is computed and the (row, score)
339 * pair is added to the score table. This has to be done in a second pass
340 * since the score depends on the statistics. Finally, the array is freed.
341 */
342 struct admissible_array {
343 /** Files are admissible wrt. this mood. */
344 struct mood *m;
345 /** The size of the array */
346 unsigned size;
347 /** Pointer to the array of admissible files. */
348 struct osl_row **array;
349 };
350
351 /*
352 * Check whether the given audio file is admissible. If it is, add it to array
353 * of admissible files.
354 */
355 static int add_if_admissible(struct osl_row *aft_row, void *data)
356 {
357 struct admissible_array *aa = data;
358 int ret;
359
360 ret = row_is_admissible(aft_row, aa->m);
361 if (ret <= 0)
362 return ret;
363 if (statistics.num >= aa->size) {
364 aa->size *= 2;
365 aa->size += 100;
366 aa->array = para_realloc(aa->array,
367 aa->size * sizeof(struct osl_row *));
368 }
369 aa->array[statistics.num] = aft_row;
370 return add_afs_statistics(aft_row);
371 }
372
373 /**
374 * Compute the new quadratic deviation in case one element changes.
375 *
376 * \param n Number of elements.
377 * \param old_qd The quadratic deviation before the change.
378 * \param old_val The value that was replaced.
379 * \param new_val The replacement value.
380 * \param old_sum The sum of all elements before the update.
381 *
382 * \return The new quadratic deviation resulting from replacing old_val
383 * by new_val.
384 *
385 * Given n real numbers a_1, ..., a_n, their sum S = a_1 + ... + a_n,
386 * their quadratic deviation
387 *
388 * q = (a_1 - S/n)^2 + ... + (a_n - S/n)^2,
389 *
390 * and a real number b, the quadratic deviation q' of a_1,...a_{n-1}, b (ie.
391 * the last number a_n was replaced by b) may be computed in O(1) time in terms
392 * of n, q, a_n, b, and S as
393 *
394 * q' = q + d * s - (2 * S + d) * d / n
395 * = q + d * (s - 2 * S / n - d /n),
396 *
397 * where d = b - a_n, and s = b + a_n.
398 *
399 * Example: n = 3, a_1 = 3, a_2 = 5, a_3 = 7, b = 10. Then S = 15, q = 8, d = 3,
400 * s = 17, so
401 *
402 * q + d * s - (2 * S + d) * d / n = 8 + 51 - 33 = 26,
403 *
404 * which equals q' = (3 - 6)^2 + (5 - 6)^2 + (10 - 6)^2.
405 *
406 */
407 _static_inline_ int64_t update_quadratic_deviation(int64_t n, int64_t old_qd,
408 int64_t old_val, int64_t new_val, int64_t old_sum)
409 {
410 int64_t delta = new_val - old_val;
411 int64_t sigma = new_val + old_val;
412 return old_qd + delta * (sigma - 2 * old_sum / n - delta / n);
413 }
414
415 static int update_afs_statistics(struct afs_info *old_afsi,
416 struct afs_info *new_afsi)
417 {
418 unsigned n;
419 int ret = get_num_admissible_files(&n);
420
421 if (ret < 0)
422 return ret;
423 assert(n);
424
425 statistics.last_played_qd = update_quadratic_deviation(n,
426 statistics.last_played_qd, old_afsi->last_played,
427 new_afsi->last_played, statistics.last_played_sum);
428 statistics.last_played_sum += new_afsi->last_played - old_afsi->last_played;
429
430 statistics.num_played_qd = update_quadratic_deviation(n,
431 statistics.num_played_qd, old_afsi->num_played,
432 new_afsi->num_played, statistics.num_played_sum);
433 statistics.num_played_sum += new_afsi->num_played - old_afsi->num_played;
434 return 1;
435 }
436
437 static int add_to_score_table(const struct osl_row *aft_row)
438 {
439 long score;
440 struct afs_info afsi;
441 int ret = get_afsi_of_row(aft_row, &afsi);
442
443 if (ret < 0)
444 return ret;
445 score = compute_score(&afsi);
446 return score_add(aft_row, score);
447 }
448
449 static int delete_from_statistics_and_score_table(const struct osl_row *aft_row)
450 {
451 int ret = del_afs_statistics(aft_row);
452 if (ret < 0)
453 return ret;
454 return score_delete(aft_row);
455 }
456
457 /**
458 * Delete one entry from the statistics and from the score table.
459 *
460 * \param aft_row The audio file which is no longer admissible.
461 *
462 * \return Positive on success, negative on errors.
463 *
464 * \sa \ref score_delete().
465 */
466 static int mood_delete_audio_file(const struct osl_row *aft_row)
467 {
468 int ret;
469
470 ret = row_belongs_to_score_table(aft_row, NULL);
471 if (ret < 0)
472 return ret;
473 if (!ret) /* not admissible, nothing to do */
474 return 1;
475 return delete_from_statistics_and_score_table(aft_row);
476 }
477
478 /**
479 * Compute the new score of an audio file wrt. the current mood.
480 *
481 * \param aft_row Determines the audio file.
482 * \param old_afsi The audio file selector info before updating.
483 *
484 * The \a old_afsi argument may be \p NULL which indicates that no changes to
485 * the audio file info were made.
486 *
487 * \return Positive on success, negative on errors.
488 */
489 static int mood_update_audio_file(const struct osl_row *aft_row,
490 struct afs_info *old_afsi)
491 {
492 long score, percent;
493 int ret, is_admissible, was_admissible = 0;
494 struct afs_info afsi;
495 unsigned rank;
496
497 if (!current_mood)
498 return 1; /* nothing to do */
499 ret = row_belongs_to_score_table(aft_row, &rank);
500 if (ret < 0)
501 return ret;
502 was_admissible = ret;
503 ret = row_is_admissible(aft_row, current_mood);
504 if (ret < 0)
505 return ret;
506 is_admissible = (ret > 0);
507 if (!was_admissible && !is_admissible)
508 return 1;
509 if (was_admissible && !is_admissible)
510 return delete_from_statistics_and_score_table(aft_row);
511 if (!was_admissible && is_admissible) {
512 ret = add_afs_statistics(aft_row);
513 if (ret < 0)
514 return ret;
515 return add_to_score_table(aft_row);
516 }
517 /* update score */
518 ret = get_afsi_of_row(aft_row, &afsi);
519 if (ret < 0)
520 return ret;
521 if (old_afsi) {
522 ret = update_afs_statistics(old_afsi, &afsi);
523 if (ret < 0)
524 return ret;
525 }
526 score = compute_score(&afsi);
527 PARA_DEBUG_LOG("score: %li\n", score);
528 percent = (score + 100) / 3;
529 if (percent > 100)
530 percent = 100;
531 else if (percent < 0)
532 percent = 0;
533 PARA_DEBUG_LOG("moving from rank %u to %li%%\n", rank, percent);
534 return score_update(aft_row, percent);
535 }
536
537 /* sse: seconds since epoch. */
538 static void log_statistics(int64_t sse)
539 {
540 unsigned n = statistics.num;
541 int mean_days, sigma_days;
542
543 assert(current_mood);
544 PARA_NOTICE_LOG("loaded mood %s\n", current_mood->name?
545 current_mood->name : "(dummy)");
546 if (!n) {
547 PARA_WARNING_LOG("no admissible files\n");
548 return;
549 }
550 PARA_NOTICE_LOG("%u admissible files\n", statistics.num);
551 mean_days = (sse - statistics.last_played_sum / n) / 3600 / 24;
552 sigma_days = int_sqrt(statistics.last_played_qd / n) / 3600 / 24;
553 PARA_NOTICE_LOG("last_played mean/sigma: %d/%d days\n", mean_days, sigma_days);
554 PARA_NOTICE_LOG("num_played mean/sigma: %" PRId64 "/%" PRIu64 "\n",
555 statistics.num_played_sum / n,
556 int_sqrt(statistics.num_played_qd / n));
557 PARA_NOTICE_LOG("num_played correction factor: %" PRId64 "\n",
558 statistics.num_played_correction);
559 PARA_NOTICE_LOG("last_played correction factor: %" PRId64 "\n",
560 statistics.last_played_correction);
561 PARA_NOTICE_LOG("normalization divisor: %" PRId64 "\n",
562 statistics.normalization_divisor);
563 }
564
565 /**
566 * Close the current mood.
567 *
568 * Frees all resources of the current mood.
569 */
570 void close_current_mood(void)
571 {
572 destroy_mood(current_mood);
573 current_mood = NULL;
574 memset(&statistics, 0, sizeof(statistics));
575 statistics.normalization_divisor = 1;
576 }
577
578 static void compute_correction_factors(int64_t sse)
579 {
580 struct afs_statistics *s = &statistics;
581
582 if (s->num > 0) {
583 s->normalization_divisor = int_sqrt(s->last_played_qd)
584 * int_sqrt(s->num_played_qd) / s->num / 100;
585 s->num_played_correction = sse - s->last_played_sum / s->num;
586 s->last_played_correction = s->num_played_sum / s->num;
587 }
588 if (s->num_played_correction == 0)
589 s->num_played_correction = 1;
590 if (s->normalization_divisor == 0)
591 s->normalization_divisor = 1;
592 if (s->last_played_correction == 0)
593 s->last_played_correction = 1;
594 }
595
596 /**
597 * Change the current mood.
598 *
599 * \param mood_name The name of the mood to open.
600 * \param errmsg Error description is returned here.
601 *
602 * If \a mood_name is \a NULL, load the dummy mood that accepts every audio file
603 * and uses a scoring method based only on the \a last_played information.
604 *
605 * The errmsg pointer may be NULL, in which case no error message will be
606 * returned. If a non-NULL pointer is given, the caller must free *errmsg.
607 *
608 * If there is already an open mood, it will be closed first.
609 *
610 * \return Positive on success, negative on errors.
611 *
612 * \sa struct \ref afs_info::last_played, \ref mp_eval_row().
613 */
614 int change_current_mood(const char *mood_name, char **errmsg)
615 {
616 int i, ret;
617 struct admissible_array aa = {
618 .size = 0,
619 .array = NULL
620 };
621 /*
622 * We can not use the "now" pointer from sched.c here because we are
623 * called before schedule(), which initializes "now".
624 */
625 struct timeval rnow;
626
627 if (mood_name) {
628 struct mood *m;
629 struct osl_row *row;
630 struct osl_object obj;
631
632 if (!*mood_name) {
633 *errmsg = make_message("empty mood name");
634 return -ERRNO_TO_PARA_ERROR(EINVAL);
635 }
636 obj.data = (char *)mood_name;
637 obj.size = strlen(mood_name) + 1;
638 ret = osl(osl_get_row(moods_table, BLOBCOL_NAME, &obj, &row));
639 if (ret < 0) {
640 if (errmsg)
641 *errmsg = make_message("no such mood: %s",
642 mood_name);
643 return ret;
644 }
645 ret = load_mood(row, &m, errmsg);
646 if (ret < 0)
647 return ret;
648 close_current_mood();
649 current_mood = m;
650 } else { /* load dummy mood */
651 close_current_mood();
652 current_mood = alloc_new_mood(NULL);
653 }
654 aa.m = current_mood;
655 PARA_NOTICE_LOG("computing statistics of admissible files\n");
656 ret = audio_file_loop(&aa, add_if_admissible);
657 if (ret < 0) {
658 if (errmsg)
659 *errmsg = make_message("audio file loop failed");
660 goto out;
661 }
662 clock_get_realtime(&rnow);
663 compute_correction_factors(rnow.tv_sec);
664 log_statistics(rnow.tv_sec);
665 for (i = 0; i < statistics.num; i++) {
666 ret = add_to_score_table(aa.array[i]);
667 if (ret < 0) {
668 if (errmsg)
669 *errmsg = make_message(
670 "could not add row to score table");
671 goto out;
672 }
673 }
674 ret = statistics.num;
675 out:
676 free(aa.array);
677 if (ret < 0)
678 close_current_mood();
679 return ret;
680 }
681
682 /*
683 * Close and re-open the current mood.
684 *
685 * This function is called on events which render the current list of
686 * admissible files useless, for example if an attribute is removed from the
687 * attribute table.
688 *
689 * If no mood is currently open, the function returns success.
690 */
691 static int reload_current_mood(void)
692 {
693 int ret;
694 char *mood_name = NULL;
695
696 ret = clear_score_table();
697 if (ret < 0)
698 return ret;
699 if (!current_mood)
700 return 1;
701 PARA_NOTICE_LOG("reloading %s\n", current_mood->name?
702 current_mood->name : "(dummy)");
703 if (current_mood->name)
704 mood_name = para_strdup(current_mood->name);
705 close_current_mood();
706 ret = change_current_mood(mood_name, NULL);
707 free(mood_name);
708 return ret;
709 }
710
711 /**
712 * Notification callback for the moods table.
713 *
714 * \param event Type of the event just occurred.
715 * \param pb Unused.
716 * \param data Its type depends on the event.
717 *
718 * This function updates the score table according to the event that has
719 * occurred. Two actions are possible: (a) reload the current mood, or (b)
720 * add/remove/update the row of the score table which corresponds to the audio
721 * file that has been modified or whose afs info has been changed. It depends
722 * on the type of the event which action (if any) is performed.
723 *
724 * The callbacks of command handlers such as com_add() or com_touch() which
725 * modify the audio file table call this function. The virtual streaming system
726 * also calls this after it has updated the afs info of the file it is about to
727 * stream (the one with the highest score). If the file stays admissible, its
728 * score is recomputed so that a different file is picked next time.
729 *
730 * \return Standard.
731 */
732 int moods_event_handler(enum afs_events event, __a_unused struct para_buffer *pb,
733 void *data)
734 {
735 if (!current_mood)
736 return 0;
737 switch (event) {
738 /*
739 * The three blob events might change the set of admissible files,
740 * so we must reload the score list.
741 */
742 case BLOB_RENAME:
743 case BLOB_REMOVE:
744 case BLOB_ADD:
745 if (data == moods_table || data == playlists_table)
746 return 1; /* no reload necessary for these */
747 return reload_current_mood();
748 /* these also require reload of the score table */
749 case ATTRIBUTE_ADD:
750 case ATTRIBUTE_REMOVE:
751 case ATTRIBUTE_RENAME:
752 return reload_current_mood();
753 /* changes to the aft only require to re-examine the audio file */
754 case AFSI_CHANGE: {
755 struct afsi_change_event_data *aced = data;
756 return mood_update_audio_file(aced->aft_row, aced->old_afsi);
757 }
758 case AFHI_CHANGE:
759 case AUDIO_FILE_RENAME:
760 case AUDIO_FILE_ADD:
761 return mood_update_audio_file(data, NULL);
762 case AUDIO_FILE_REMOVE:
763 return mood_delete_audio_file(data);
764 default:
765 return 1;
766 }
767 }