2 * Copyright (C) 2007-2009 Andre Noll <maan@systemlinux.org>
4 * Licensed under the GPL v2. For licencing details see COPYING.
7 /** \file mood.c Paraslash's mood handling functions. */
20 * Contains statistical data of the currently admissible audio files.
22 * It is used to assign normalized score values to each admissible audio file.
24 struct afs_statistics {
25 /** Sum of num played over all admissible files. */
26 int64_t num_played_sum;
27 /** Sum of last played times over all admissible files. */
28 int64_t last_played_sum;
29 /** Quadratic deviation of num played time. */
30 int64_t num_played_qd;
31 /** Quadratic deviation of last played time. */
32 int64_t last_played_qd;
33 /** Number of admissible files */
36 struct afs_statistics statistics;
39 * Assign scores according to a mood_method.
41 * Each mood_method has its own mood_score_function. The first three parameters
42 * passed to that function are informations about the audio file whose score is
43 * to be computed. The data argument depends on the mood method this function
44 * is used for. It usually is the argument given at the end of a mood line.
46 * Mood score functions must return values between -100 and +100 inclusively.
47 * Boolean score functions should always return either -100 or +100.
49 * \sa struct mood_method, mood_parser.
51 typedef int mood_score_function(const char *path, const struct afs_info *afsi,
52 const struct afh_info *afhi, const void *data);
55 * Pre-process a mood line.
57 * The mood_parser of a mood_method is called once at mood open time for each
58 * line of the current mood definition that contains the mood_method's name as
59 * a keyword. The line is passed to the mood_parser as the first argument. The
60 * mood_parser must determine whether the line is syntactically correct and
61 * return a positive value if so and a negative value otherwise.
63 * Some mood parsers pre-process the data given in the mood line to compute a
64 * structure which depends of the particular mood_method and which is used
65 * later in the mood_score_function of the mood_method. The mood_parser may
66 * store a pointer to its structure via the void** pointer.
68 * \sa mood_open(), mood_cleanup_function, mood_score_function.
70 typedef int mood_parser(int, char **, void **);
73 * Deallocate resources which were allocated by the mood_parser.
75 * This optional function of a mood_method is used to free any resources
76 * allocated in mood_open() by the mood_parser. The argument passed is a
77 * pointer to the mood_method specific data structure that was returned by the
82 typedef void mood_cleanup_function(void *);
85 * Used for scoring and to determine whether a file is admissible.
88 /** The name of the method. */
90 /** Pointer to the mood parser. */
92 /** Pointer to the score function */
93 mood_score_function *score_function;
94 /** Optional cleanup function. */
95 mood_cleanup_function *cleanup;
99 * Each line of the current mood corresponds to a mood_item.
102 /** The method this line is referring to. */
103 const struct mood_method *method;
104 /** The data structure computed by the mood parser. */
106 /** The given score value, or zero if none was given. */
108 /** Non-zero if random scoring was requested. */
110 /** Whether the "not" keyword was given in the mood line. */
112 /** The position in the list of items. */
113 struct list_head mood_item_node;
117 * Created from the mood definition by mood_open().
119 * When a mood is opened, each line of its definition is investigated, and a
120 * corresponding mood item is produced. Each mood line starts with \p accept,
121 * \p deny, or \p score which determines the type of the mood line. For each
122 * such type a linked list is maintained whose entries are the mood items.
124 * \sa mood_item, mood_open().
127 /** The name of this mood. */
129 /** The list of mood items of type \p accept. */
130 struct list_head accept_list;
131 /** The list of mood items of type \p deny. */
132 struct list_head deny_list;
133 /** The list of mood items of type \p score. */
134 struct list_head score_list;
137 static struct mood *current_mood;
140 * Rough approximation to sqrt.
142 * \param x Integer of which to calculate the sqrt.
144 * \return An integer res with res * res <= x.
146 static uint64_t int_sqrt(uint64_t x)
148 uint64_t op, res, one = 1;
157 if (op >= res + one) {
158 op = op - (res + one);
164 // PARA_NOTICE_LOG("sqrt(%llu) = %llu\n", x, res);
168 static int mm_no_attributes_set_parser(int argc, __a_unused char **argv,
169 __a_unused void **ignored)
171 return argc? -E_MOOD_SYNTAX : 1;
174 static int mm_no_attributes_set_score_function(__a_unused const char *path,
175 const struct afs_info *afsi,
176 __a_unused const struct afh_info *afhi,
177 __a_unused const void *data)
179 if (!afsi->attributes)
184 static int mm_played_rarely_score_function(__a_unused const char *path,
185 const struct afs_info *afsi,
186 __a_unused const struct afh_info *afhi,
187 __a_unused const void *data)
190 int ret = get_num_admissible_files(&num);
194 if (statistics.num_played_sum - num * afsi->num_played
195 > int_sqrt(statistics.num_played_qd * num))
200 static int mm_played_rarely_parser(int argc, __a_unused char **argv,
201 __a_unused void **ignored)
203 return argc? -E_MOOD_SYNTAX : 1;
206 static int mm_path_matches_score_function(const char *path,
207 __a_unused const struct afs_info *afsi,
208 __a_unused const struct afh_info *afhi,
211 if (fnmatch(data, path, 0))
216 static int mm_path_matches_parser(int argc, char **argv, void **data)
219 return -E_MOOD_SYNTAX;
220 *data = para_strdup(argv[1]);
224 static void mm_path_matches_cleanup(void *data)
229 static int mm_is_set_parser(int argc, char **argv, void **bitnum)
232 unsigned char c, *res;
235 return -E_MOOD_SYNTAX;
236 ret = get_attribute_bitnum_by_name(argv[1], &c);
239 res = para_malloc(1);
245 static int mm_is_set_score_function(__a_unused const char *path,
246 __a_unused const struct afs_info *afsi,
247 __a_unused const struct afh_info *afhi,
250 const unsigned char *bn = data;
251 if (afsi->attributes & (1ULL << *bn))
256 /* returns 1 if row matches score item, negative otherwise */
257 static int add_item_score(const struct osl_row *row, struct mood_item *item, long *score,
260 struct afs_info afsi;
261 struct afh_info afhi;
265 *score_arg_sum += item->random_score? 100 : PARA_ABS(item->score_arg);
268 ret = get_afsi_of_row(row, &afsi);
271 ret = get_afhi_of_row(row, &afhi);
274 ret = get_audio_file_path_of_row(row, &path);
277 ret = item->method->score_function(path, &afsi, &afhi,
279 if ((ret < 0 && !item->logical_not) || (ret >= 0 && item->logical_not))
280 return -1; /* no match */
282 if (item->random_score)
283 *score += PARA_ABS(ret) * para_random(100);
285 *score += PARA_ABS(ret) * item->score_arg;
289 static int compute_mood_score(const struct osl_row *aft_row, struct mood *m,
292 struct mood_item *item;
294 long score_arg_sum = 0, score = 0;
298 /* reject audio file if it matches any entry in the deny list */
299 list_for_each_entry(item, &m->deny_list, mood_item_node)
300 if (add_item_score(aft_row, item, &score, &score_arg_sum) > 0)
301 return -E_NOT_ADMISSIBLE;
302 list_for_each_entry(item, &m->accept_list, mood_item_node)
303 if (add_item_score(aft_row, item, &score, &score_arg_sum) > 0)
305 /* reject if there is no matching entry in the accept list */
306 if (!match && !list_empty(&m->accept_list))
307 return -E_NOT_ADMISSIBLE;
308 list_for_each_entry(item, &m->score_list, mood_item_node)
309 add_item_score(aft_row, item, &score, &score_arg_sum);
311 score /= score_arg_sum;
316 #define DEFINE_MOOD_METHOD(_name) \
317 .parser = mm_ ## _name ## _parser, \
318 .score_function = mm_ ## _name ## _score_function, \
321 #define DEFINE_MOOD_METHOD_WITH_CLEANUP(_name) \
322 DEFINE_MOOD_METHOD(_name), \
323 .cleanup = mm_ ## _name ## _cleanup
325 static const struct mood_method mood_methods[] = {
326 {DEFINE_MOOD_METHOD(no_attributes_set)},
327 {DEFINE_MOOD_METHOD(played_rarely)},
328 {DEFINE_MOOD_METHOD(is_set)},
329 {DEFINE_MOOD_METHOD_WITH_CLEANUP(path_matches)},
333 static void cleanup_list_entry(struct mood_item *item)
335 if (item->method && item->method->cleanup)
336 item->method->cleanup(item->parser_data);
338 free(item->parser_data);
339 list_del(&item->mood_item_node);
343 static void destroy_mood(struct mood *m)
345 struct mood_item *tmp, *item;
349 list_for_each_entry_safe(item, tmp, &m->accept_list, mood_item_node)
350 cleanup_list_entry(item);
351 list_for_each_entry_safe(item, tmp, &m->deny_list, mood_item_node)
352 cleanup_list_entry(item);
353 list_for_each_entry_safe(item, tmp, &m->score_list, mood_item_node)
354 cleanup_list_entry(item);
359 static struct mood *alloc_new_mood(const char *name)
361 struct mood *m = para_calloc(sizeof(struct mood));
362 m->name = para_strdup(name);
363 INIT_LIST_HEAD(&m->accept_list);
364 INIT_LIST_HEAD(&m->deny_list);
365 INIT_LIST_HEAD(&m->score_list);
369 /** The different types of a mood line. */
370 enum mood_line_type {
381 /** Data passed to the parser of a mood line. */
382 struct mood_line_parser_data {
383 /** The mood this mood line belongs to. */
385 /** The line number in the mood definition. */
390 * <accept [with score <score>] | deny [with score <score>] | score <score>>
391 * [if] [not] <mood_method> [options]
392 * <score> is either an integer or "random" which assigns a random score to
396 static int parse_mood_line(char *mood_line, void *data)
398 struct mood_line_parser_data *mlpd = data;
403 enum mood_line_type mlt = ML_INVALID;
404 struct mood_item *mi = NULL;
407 ret = create_argv(mood_line, " \t", &argv);
411 if (!num_words) /* empty line */
414 if (**w == '#') /* comment */
416 if (!strcmp(*w, "accept"))
418 else if (!strcmp(*w, "deny"))
420 else if (!strcmp(*w, "score"))
422 ret = -E_MOOD_SYNTAX;
423 if (mlt == ML_INVALID)
425 mi = para_calloc(sizeof(struct mood_item));
426 if (mlt != ML_SCORE) {
427 ret = -E_MOOD_SYNTAX;
431 if (strcmp(*w, "with"))
436 if (strcmp(*w, "score"))
439 if (mlt == ML_SCORE || !strcmp(*w, "score")) {
440 ret = -E_MOOD_SYNTAX;
444 if (strcmp(*w, "random")) {
445 mi->random_score = 0;
446 ret = para_atoi32(*w, &mi->score_arg);
450 mi->random_score = 1;
452 goto success; /* the line "score random" is valid */
456 ret = -E_MOOD_SYNTAX;
461 if (!strcmp(*w, "if")) {
462 ret = -E_MOOD_SYNTAX;
467 if (!strcmp(*w, "not")) {
468 ret = -E_MOOD_SYNTAX;
475 for (i = 0; mood_methods[i].parser; i++) {
476 if (strcmp(*w, mood_methods[i].name))
480 ret = -E_MOOD_SYNTAX;
481 if (!mood_methods[i].parser)
483 ret = mood_methods[i].parser(num_words - 1 - (w - argv), w,
487 mi->method = &mood_methods[i];
490 if (mlt == ML_ACCEPT)
491 para_list_add(&mi->mood_item_node, &mlpd->m->accept_list);
492 else if (mlt == ML_DENY)
493 para_list_add(&mi->mood_item_node, &mlpd->m->deny_list);
495 para_list_add(&mi->mood_item_node, &mlpd->m->score_list);
497 PARA_DEBUG_LOG("%s entry added, method: %p\n", mlt == ML_ACCEPT? "accept" :
498 (mlt == ML_DENY? "deny" : "score"), mi->method);
505 free(mi->parser_data);
511 static int load_mood(const struct osl_row *mood_row, struct mood **m)
514 struct osl_object mood_def;
515 struct mood_line_parser_data mlpd = {.line_num = 0};
516 int ret = mood_get_name_and_def_by_row(mood_row, &mood_name, &mood_def);
522 mlpd.m = alloc_new_mood(mood_name);
523 ret = for_each_line_ro(mood_def.data, mood_def.size,
524 parse_mood_line, &mlpd);
525 osl_close_disk_object(&mood_def);
527 PARA_ERROR_LOG("unable to load mood %s: %s\n", mlpd.m->name,
528 para_strerror(-ret));
529 destroy_mood(mlpd.m);
536 static int check_mood(struct osl_row *mood_row, void *data)
538 struct para_buffer *pb = data;
540 struct osl_object mood_def;
541 struct mood_line_parser_data mlpd = {.line_num = 0};
543 int ret = mood_get_name_and_def_by_row(mood_row, &mood_name, &mood_def);
546 para_printf(pb, "failed to get mood definition: %s\n",
547 para_strerror(-ret));
550 if (!*mood_name) /* ignore dummy row */
552 ret = para_printf(pb, "checking mood %s...\n", mood_name);
555 ret = for_each_line_ro(mood_def.data, mood_def.size,
556 parse_mood_line, &mlpd);
558 para_printf(pb, "%s line %u: %s\n", mood_name, mlpd.line_num,
559 para_strerror(-ret));
561 osl_close_disk_object(&mood_def);
566 * Check all moods for syntax errors.
568 * \param fd The afs socket.
569 * \param query Unused.
571 void mood_check_callback(int fd, __a_unused const struct osl_object *query)
573 struct para_buffer pb = {
576 .max_size_handler = pass_buffer_as_shm
579 int ret = para_printf(&pb, "checking moods...\n");
582 osl_rbtree_loop(moods_table, BLOBCOL_ID, &pb,
585 pass_buffer_as_shm(pb.buf, pb.offset, &fd);
590 static unsigned int_log2(uint64_t x)
602 static int64_t normalized_value(int64_t x, int64_t n, int64_t sum, int64_t qd)
606 return 100 * (n * x - sum) / (int64_t)int_sqrt(n * qd);
609 static long compute_num_played_score(struct afs_info *afsi)
611 return -normalized_value(afsi->num_played, statistics.num,
612 statistics.num_played_sum, statistics.num_played_qd);
615 static long compute_last_played_score(struct afs_info *afsi)
617 return -normalized_value(afsi->last_played, statistics.num,
618 statistics.last_played_sum, statistics.last_played_qd);
621 static long compute_dynamic_score(const struct osl_row *aft_row)
623 struct afs_info afsi;
624 int64_t score, nscore = 0, lscore = 0;
627 ret = get_afsi_of_row(aft_row, &afsi);
630 nscore = compute_num_played_score(&afsi);
631 lscore = compute_last_played_score(&afsi);
632 score = nscore + lscore;
636 static int add_afs_statistics(const struct osl_row *row)
639 struct afs_info afsi;
642 ret = get_afsi_of_row(row, &afsi);
646 x = afsi.last_played;
647 s = statistics.last_played_sum;
649 statistics.last_played_qd += (x - s / n) * (x - s / n) * n / (n + 1);
650 statistics.last_played_sum += x;
653 s = statistics.num_played_sum;
655 statistics.num_played_qd += (x - s / n) * (x - s / n) * n / (n + 1);
656 statistics.num_played_sum += x;
661 static int del_afs_statistics(const struct osl_row *row)
663 uint64_t n, s, q, a, new_s;
664 struct afs_info afsi;
666 ret = get_afsi_of_row(row, &afsi);
672 memset(&statistics, 0, sizeof(statistics));
676 s = statistics.last_played_sum;
677 q = statistics.last_played_qd;
678 a = afsi.last_played;
680 statistics.last_played_sum = new_s;
681 statistics.last_played_qd = q + s * s / n - a * a
682 - new_s * new_s / (n - 1);
684 s = statistics.num_played_sum;
685 q = statistics.num_played_qd;
688 statistics.num_played_sum = new_s;
689 statistics.num_played_qd = q + s * s / n - a * a
690 - new_s * new_s / (n - 1);
697 * Structure used during mood_open().
699 * At mood open time, we look at each file in the audio file table in order to
700 * determine whether it is admissible. If a file happens to be admissible, its
701 * mood score is computed by calling each relevant mood_score_function. Next,
702 * we update the afs_statistics and add a struct admissible_file_info to a
705 * If all files have been processed that way, the final score of each
706 * admissible file is computed by adding the dynamic score (which depends on
707 * the afs_statistics) to the mood score. Finally, all audio files in the
708 * array are added to the score table and the admissible array is freed.
710 * \sa mood_method, admissible_array.
712 struct admissible_file_info
714 /** The admissible audio file. */
715 struct osl_row *aft_row;
720 /** The temporary array of admissible files. */
721 struct admissible_array {
722 /** Files are admissible wrt. this mood. */
724 /** The size of the array */
726 /** Pointer to the array of admissible files. */
727 struct admissible_file_info *array;
731 * Add an entry to the array of admissible files.
733 * \param aft_row The audio file to be added.
734 * \param private_data Pointer to a struct admissible_file_info.
736 * \return Negative on errors, positive on success.
738 static int add_if_admissible(struct osl_row *aft_row, void *data)
740 struct admissible_array *aa = data;
744 ret = compute_mood_score(aft_row, aa->m, &score);
746 return (ret == -E_NOT_ADMISSIBLE)? 1 : ret;
747 if (statistics.num >= aa->size) {
750 aa->array = para_realloc(aa->array,
751 aa->size * sizeof(struct admissible_file_info));
753 aa->array[statistics.num].aft_row = aft_row;
754 aa->array[statistics.num].score = score;
755 ret = add_afs_statistics(aft_row);
762 * Compute the new quadratic deviation in case one element changes.
764 * \param n Number of elements.
765 * \param old_qd The quadratic deviation before the change.
766 * \param old_val The value that was replaced.
767 * \param new_val The replacement value.
768 * \param old_sum The sum of all elements before the update.
770 * \return The new quadratic deviation resulting from replacing old_val
773 * Given n real numbers a_1, ..., a_n, their sum S = a_1 + ... + a_n,
774 * their quadratic deviation
776 * q = (a_1 - S/n)^2 + ... + (a_n - S/n)^2,
778 * and a real number b, the quadratic deviation q' of a_1,...a_{n-1}, b (ie.
779 * the last number a_n was replaced by b) may be computed in O(1) time in terms
780 * of n, q, a_n, b, and S as
782 * q' = q + d * s - (2 * S + d) * d / n,
784 * where d = b - a_n, and s = b + a_n.
786 * Example: n = 3, a_1 = 3, a_2 = 5, a_3 = 7, b = 10. Then S = 15, q = 8, d = 3,
789 * q + d * s - (2 * S + d) * d / n = 8 + 51 - 33 = 26,
791 * which equals q' = (3 - 6)^2 + (5 - 6)^2 + (10 - 6)^2.
794 _static_inline_ int64_t update_quadratic_deviation(int64_t n, int64_t old_qd,
795 int64_t old_val, int64_t new_val, int64_t old_sum)
797 int64_t delta = new_val - old_val;
798 int64_t sigma = new_val + old_val;
799 return old_qd + delta * sigma - (2 * old_sum + delta) * delta / n;
802 static int update_afs_statistics(struct afs_info *old_afsi, struct afs_info *new_afsi)
805 int ret = get_num_admissible_files(&n);
811 statistics.last_played_qd = update_quadratic_deviation(n,
812 statistics.last_played_qd, old_afsi->last_played,
813 new_afsi->last_played, statistics.last_played_sum);
814 statistics.last_played_sum += new_afsi->last_played - old_afsi->last_played;
816 statistics.num_played_qd = update_quadratic_deviation(n,
817 statistics.num_played_qd, old_afsi->num_played,
818 new_afsi->num_played, statistics.num_played_sum);
819 statistics.num_played_sum += new_afsi->num_played - old_afsi->num_played;
823 static int add_to_score_table(const struct osl_row *aft_row, long mood_score)
825 long score = (compute_dynamic_score(aft_row) + mood_score) / 3;
826 return score_add(aft_row, score);
829 static int delete_from_statistics_and_score_table(const struct osl_row *aft_row)
831 int ret = del_afs_statistics(aft_row);
834 return score_delete(aft_row);
838 * Delete one entry from the statistics and from the score table.
840 * \param aft_row The audio file which is no longer admissible.
842 * \return Positive on success, negative on errors.
844 * \sa score_delete().
846 static int mood_delete_audio_file(const struct osl_row *aft_row)
850 ret = row_belongs_to_score_table(aft_row, NULL);
853 if (!ret) /* not admissible, nothing to do */
855 return delete_from_statistics_and_score_table(aft_row);
859 * Compute the new score of an audio file wrt. the current mood.
861 * \param aft_row Determines the audio file.
862 * \param old_afsi The audio file selector info before updating.
864 * The \a old_afsi argument may be \p NULL which indicates that no changes to
865 * the audio file info were made.
867 * \return Positive on success, negative on errors.
869 static int mood_update_audio_file(const struct osl_row *aft_row,
870 struct afs_info *old_afsi)
873 int ret, is_admissible, was_admissible = 0;
874 struct afs_info afsi;
878 return 1; /* nothing to do */
879 ret = row_belongs_to_score_table(aft_row, &rank);
882 was_admissible = ret;
883 ret = compute_mood_score(aft_row, current_mood, &score);
884 is_admissible = (ret > 0);
885 if (!was_admissible && !is_admissible)
887 if (was_admissible && !is_admissible)
888 return delete_from_statistics_and_score_table(aft_row);
889 if (!was_admissible && is_admissible) {
890 ret = add_afs_statistics(aft_row);
893 return add_to_score_table(aft_row, score);
896 ret = get_afsi_of_row(aft_row, &afsi);
900 ret = update_afs_statistics(old_afsi, &afsi);
904 score += compute_num_played_score(&afsi);
905 score += compute_last_played_score(&afsi);
907 PARA_DEBUG_LOG("score: %li\n", score);
908 percent = (score + 100) / 3;
911 else if (percent < 0)
913 PARA_DEBUG_LOG("moving from rank %u to %lu%%\n", rank, percent);
914 return score_update(aft_row, percent);
917 static void log_statistics(void)
919 unsigned n = statistics.num;
922 PARA_NOTICE_LOG("no admissible files\n");
925 PARA_INFO_LOG("last_played mean: %lli, last_played sigma: %llu\n",
926 (long long int)(statistics.last_played_sum / n),
927 (long long unsigned)int_sqrt(statistics.last_played_qd / n));
928 PARA_INFO_LOG("num_played mean: %lli, num_played sigma: %llu\n",
929 (long long int)statistics.num_played_sum / n,
930 (long long unsigned)int_sqrt(statistics.num_played_qd / n));
934 * Close the current mood.
936 * Free all resources of the current mood which were allocated during
939 void close_current_mood(void)
941 destroy_mood(current_mood);
943 memset(&statistics, 0, sizeof(statistics));
948 * Change the current mood.
950 * \param mood_name The name of the mood to open.
952 * If \a mood_name is \a NULL, load the dummy mood that accepts every audio file
953 * and uses a scoring method based only on the \a last_played information.
955 * If there is already an open mood, it will be closed first.
957 * \return Positive on success, negative on errors. Loading the dummy mood
960 * \sa struct admissible_file_info, struct admissible_array, struct
961 * afs_info::last_played, mood_close().
963 int change_current_mood(char *mood_name)
966 struct admissible_array aa = {
974 struct osl_object obj = {
976 .size = strlen(mood_name) + 1
978 ret = osl(osl_get_row(moods_table, BLOBCOL_NAME, &obj, &row));
980 PARA_NOTICE_LOG("no such mood: %s\n", mood_name);
983 ret = load_mood(row, &m);
986 close_current_mood();
989 close_current_mood();
990 current_mood = alloc_new_mood("dummy");
993 PARA_NOTICE_LOG("computing statistics of admissible files\n");
994 ret = audio_file_loop(&aa, add_if_admissible);
998 PARA_INFO_LOG("%d admissible files \n", statistics.num);
999 for (i = 0; i < statistics.num; i++) {
1000 struct admissible_file_info *a = aa.array + i;
1001 ret = add_to_score_table(a->aft_row, a->score);
1005 PARA_NOTICE_LOG("loaded mood %s\n", current_mood->name);
1006 ret = statistics.num;
1012 * Close and re-open the current mood.
1014 * This function is used if changes to the audio file table or the
1015 * attribute table were made that render the current list of admissible
1016 * files useless. For example, if an attribute is removed from the
1017 * attribute table, this function is called.
1019 * \return Positive on success, negative on errors. If no mood is currently
1020 * open, the function returns success.
1022 * \sa mood_open(), mood_close().
1024 int reload_current_mood(void)
1027 char *mood_name = NULL;
1031 PARA_NOTICE_LOG("reloading %s\n", current_mood->name?
1032 current_mood->name : "(dummy)");
1033 if (current_mood->name)
1034 mood_name = para_strdup(current_mood->name);
1035 close_current_mood();
1036 ret = change_current_mood(mood_name);
1041 int moods_event_handler(enum afs_events event, __a_unused struct para_buffer *pb,
1046 * The three blob events might change the set of admissible files,
1047 * so we must reload the score list.
1052 if (data == moods_table || data == playlists_table)
1053 return 1; /* no reload necessary for these */
1054 return reload_current_mood();
1055 /* these also require reload of the score table */
1057 case ATTRIBUTE_REMOVE:
1058 case ATTRIBUTE_RENAME:
1059 return reload_current_mood();
1060 /* changes to the aft only require to re-examine the audio file */
1062 struct afsi_change_event_data *aced = data;
1063 return mood_update_audio_file(aced->aft_row, aced->old_afsi);
1066 case AUDIO_FILE_RENAME:
1067 case AUDIO_FILE_ADD:
1068 return mood_update_audio_file(data, NULL);
1069 case AUDIO_FILE_REMOVE:
1070 return mood_delete_audio_file(data);