2 * Copyright (C) 2007 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. */
18 * Contains statistical data of the currently admissible audio files.
20 * It is used to assign normalized score values to each admissible audio file.
22 struct afs_statistics
{
23 /** Sum of num played over all admissible files. */
24 int64_t num_played_sum
;
25 /** Sum of last played times over all admissible files. */
26 int64_t last_played_sum
;
27 /** Quadratic deviation of num played time. */
28 int64_t num_played_qd
;
29 /** Quadratic deviation of last played time. */
30 int64_t last_played_qd
;
31 /** Number of admissible files */
34 struct afs_statistics statistics
;
37 * Assign scores according to a mood_method.
39 * Each mood_method has its own mood_score_function. The first three parameters
40 * passed to that function are informations about the audio file whose score is
41 * to be computed. The data argument depends on the mood method this function
42 * is used for. It usually is the argument given at the end of a mood line.
44 * Mood score functions must return values between -100 and +100 inclusively.
45 * Boolean score functions should always return either -100 or +100.
47 * \sa struct mood_method, mood_parser.
49 typedef int mood_score_function(const char *path
, const struct afs_info
*afsi
,
50 const struct afh_info
*afhi
, const void *data
);
53 * Pre-process a mood line.
55 * The mood_parser of a mood_method is called once at mood open time for each
56 * line of the current mood definition that contains the mood_method's name as
57 * a keyword. The line is passed to the mood_parser as the first argument. The
58 * mood_parser must determine whether the line is syntactically correct and
59 * return a positive value if so and a negative value otherwise.
61 * Some mood parsers pre-process the data given in the mood line to compute a
62 * structure which depends of the particular mood_method and which is used
63 * later in the mood_score_function of the mood_method. The mood_parser may
64 * store a pointer to its structure via the second argument.
66 * \sa mood_open(), mood_cleanup_function, mood_score_function.
68 typedef int mood_parser(const char *, void **);
71 * Deallocate resources which were allocated by the mood_parser.
73 * This optional function of a mood_method is used to free any resources
74 * allocated in mood_open() by the mood_parser. The argument passed is a
75 * pointer to the mood_method specific data structure that was returned by the
80 typedef void mood_cleanup_function(void *);
83 * Used for scoring and to determine whether a file is admissible.
86 /* The name of the method. */
88 /** Pointer to the mood parser. */
90 /** Pointer to the score function */
91 mood_score_function
*score_function
;
92 /** Optional cleanup function. */
93 mood_cleanup_function
*cleanup
;
97 * Each line of the current mood corresponds to a mood_item.
100 /** The method this line is referring to. */
101 const struct mood_method
*method
;
102 /** The data structure computed by the mood parser. */
104 /** The given score value, or zero if none was given. */
106 /** Non-zero if random scoring was requested. */
108 /** Whether the "not" keyword was given in the mood line. */
110 /** The position in the list of items. */
111 struct list_head mood_item_node
;
115 * Created from the mood definition by mood_open().
117 * When a mood is opened, each line of its definition is investigated, and a
118 * corresponding mood item is produced. Each mood line starts with \p accept,
119 * \p deny, or \p score which determines the type of the mood line. For each
120 * such type a linked list is maintained whose entries are the mood items.
122 * \sa mood_item, mood_open().
125 /** The name of this mood. */
127 /** The list of mood items of type \p accept. */
128 struct list_head accept_list
;
129 /** The list of mood items of type \p deny. */
130 struct list_head deny_list
;
131 /** The list of mood items of type \p score. */
132 struct list_head score_list
;
135 static struct mood
*current_mood
;
138 * Rough approximation to sqrt.
140 * \param x Integer of which to calculate the sqrt.
142 * \return An integer res with res * res <= x.
144 static uint64_t int_sqrt(uint64_t x
)
146 uint64_t op
, res
, one
= 1;
155 if (op
>= res
+ one
) {
156 op
= op
- (res
+ one
);
162 // PARA_NOTICE_LOG("sqrt(%llu) = %llu\n", x, res);
166 static int mm_no_attributes_set_parser(const char *arg
, __a_unused
void **ignored
)
169 PARA_WARNING_LOG("ignored junk at eol: %s\n", arg
);
173 static int mm_no_attributes_set_score_function(__a_unused
const char *path
,
174 const struct afs_info
*afsi
,
175 __a_unused
const struct afh_info
*afhi
,
176 __a_unused
const void *data
)
178 if (!afsi
->attributes
)
183 static int mm_played_rarely_score_function(__a_unused
const char *path
,
184 const struct afs_info
*afsi
,
185 __a_unused
const struct afh_info
*afhi
,
186 __a_unused
const void *data
)
189 int ret
= get_num_admissible_files(&num
);
193 if (statistics
.num_played_sum
- num
* afsi
->num_played
194 > int_sqrt(statistics
.num_played_qd
* num
))
199 static int mm_played_rarely_parser(const char *arg
, __a_unused
void **ignored
)
202 PARA_WARNING_LOG("ignored junk at eol: %s\n", arg
);
206 static int mm_name_like_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_name_like_parser(const char *arg
, void **data
)
218 *data
= para_strdup(arg
);
222 static void mm_name_like_cleanup(void *data
)
227 static int mm_is_set_parser(const char *arg
, void **bitnum
)
229 unsigned char *c
= para_malloc(1);
230 int ret
= get_attribute_bitnum_by_name(arg
, c
);
239 static int mm_is_set_score_function(__a_unused
const char *path
,
240 __a_unused
const struct afs_info
*afsi
,
241 __a_unused
const struct afh_info
*afhi
,
244 const unsigned char *bn
= data
;
245 if (afsi
->attributes
& (1ULL << *bn
))
250 /* returns 1 if row matches score item, negative otherwise */
251 static int add_item_score(const struct osl_row
*row
, struct mood_item
*item
, long *score
,
254 struct afs_info afsi
;
255 struct afh_info afhi
;
259 *score_arg_sum
+= item
->random_score
? 100 : PARA_ABS(item
->score_arg
);
262 ret
= get_afsi_of_row(row
, &afsi
);
265 ret
= get_afhi_of_row(row
, &afhi
);
268 ret
= get_audio_file_path_of_row(row
, &path
);
271 ret
= item
->method
->score_function(path
, &afsi
, &afhi
,
273 if ((ret
< 0 && !item
->logical_not
) || (ret
>= 0 && item
->logical_not
))
274 return -1; /* no match */
276 if (item
->random_score
)
277 *score
+= PARA_ABS(ret
) * para_random(100);
279 *score
+= PARA_ABS(ret
) * item
->score_arg
;
283 static int compute_mood_score(const struct osl_row
*aft_row
, struct mood
*m
,
286 struct mood_item
*item
;
288 long score_arg_sum
= 0, score
= 0;
292 /* reject audio file if it matches any entry in the deny list */
293 list_for_each_entry(item
, &m
->deny_list
, mood_item_node
)
294 if (add_item_score(aft_row
, item
, &score
, &score_arg_sum
) > 0)
295 return -E_NOT_ADMISSIBLE
;
296 list_for_each_entry(item
, &m
->accept_list
, mood_item_node
)
297 if (add_item_score(aft_row
, item
, &score
, &score_arg_sum
) > 0)
299 /* reject if there is no matching entry in the accept list */
300 if (!match
&& !list_empty(&m
->accept_list
))
301 return -E_NOT_ADMISSIBLE
;
302 list_for_each_entry(item
, &m
->score_list
, mood_item_node
)
303 add_item_score(aft_row
, item
, &score
, &score_arg_sum
);
305 score
/= score_arg_sum
;
310 #define DEFINE_MOOD_METHOD(_name) \
311 .parser = mm_ ## _name ## _parser, \
312 .score_function = mm_ ## _name ## _score_function, \
315 #define DEFINE_MOOD_METHOD_WITH_CLEANUP(_name) \
316 DEFINE_MOOD_METHOD(_name), \
317 .cleanup = mm_ ## _name ## _cleanup
319 static const struct mood_method mood_methods
[] = {
320 {DEFINE_MOOD_METHOD(no_attributes_set
)},
321 {DEFINE_MOOD_METHOD(played_rarely
)},
322 {DEFINE_MOOD_METHOD(is_set
)},
323 {DEFINE_MOOD_METHOD_WITH_CLEANUP(name_like
)},
327 static void cleanup_list_entry(struct mood_item
*item
)
329 if (item
->method
&& item
->method
->cleanup
)
330 item
->method
->cleanup(item
->parser_data
);
332 free(item
->parser_data
);
333 list_del(&item
->mood_item_node
);
337 static void destroy_mood(struct mood
*m
)
339 struct mood_item
*tmp
, *item
;
343 list_for_each_entry_safe(item
, tmp
, &m
->accept_list
, mood_item_node
)
344 cleanup_list_entry(item
);
345 list_for_each_entry_safe(item
, tmp
, &m
->deny_list
, mood_item_node
)
346 cleanup_list_entry(item
);
347 list_for_each_entry_safe(item
, tmp
, &m
->score_list
, mood_item_node
)
348 cleanup_list_entry(item
);
353 static struct mood
*alloc_new_mood(const char *name
)
355 struct mood
*m
= para_calloc(sizeof(struct mood
));
356 m
->name
= para_strdup(name
);
357 INIT_LIST_HEAD(&m
->accept_list
);
358 INIT_LIST_HEAD(&m
->deny_list
);
359 INIT_LIST_HEAD(&m
->score_list
);
363 /** The different types of a mood line. */
364 enum mood_line_type
{
375 struct mood_line_parser_data
{
381 * <accept [with score <score>] | deny [with score <score>] | score <score>>
382 * [if] [not] <mood_method> [options]
383 * <score> is either an integer or "random" which assigns a random score to
387 static int parse_mood_line(char *mood_line
, void *data
)
389 struct mood_line_parser_data
*mlpd
= data
;
395 enum mood_line_type mlt
= ML_INVALID
;
396 struct mood_item
*mi
= NULL
;
397 char *buf
= para_strdup(mood_line
);
400 num_words
= split_args(buf
, &argv
, delim
);
402 if (!num_words
) /* empty line */
405 if (**w
== '#') /* comment */
407 if (!strcmp(*w
, "accept"))
409 else if (!strcmp(*w
, "deny"))
411 else if (!strcmp(*w
, "score"))
413 ret
= -E_MOOD_SYNTAX
;
414 if (mlt
== ML_INVALID
)
416 mi
= para_calloc(sizeof(struct mood_item
));
417 if (mlt
!= ML_SCORE
) {
418 ret
= -E_MOOD_SYNTAX
;
422 if (strcmp(*w
, "with"))
427 if (strcmp(*w
, "score"))
430 if (mlt
== ML_SCORE
|| !strcmp(*w
, "score")) {
431 ret
= -E_MOOD_SYNTAX
;
435 if (strcmp(*w
, "random")) {
436 mi
->random_score
= 0;
437 ret
= para_atoi32(*w
, &mi
->score_arg
);
441 mi
->random_score
= 1;
443 goto success
; /* the line "score random" is valid */
447 ret
= -E_MOOD_SYNTAX
;
452 if (!strcmp(*w
, "if")) {
453 ret
= -E_MOOD_SYNTAX
;
458 if (!strcmp(*w
, "not")) {
459 ret
= -E_MOOD_SYNTAX
;
466 for (i
= 0; mood_methods
[i
].parser
; i
++) {
467 if (strcmp(*w
, mood_methods
[i
].name
))
471 ret
= -E_MOOD_SYNTAX
;
472 if (!mood_methods
[i
].parser
)
475 ret
= mood_methods
[i
].parser(*w
, &mi
->parser_data
);
478 mi
->method
= &mood_methods
[i
];
481 if (mlt
== ML_ACCEPT
)
482 para_list_add(&mi
->mood_item_node
, &mlpd
->m
->accept_list
);
483 else if (mlt
== ML_DENY
)
484 para_list_add(&mi
->mood_item_node
, &mlpd
->m
->deny_list
);
486 para_list_add(&mi
->mood_item_node
, &mlpd
->m
->score_list
);
488 PARA_DEBUG_LOG("%s entry added, method: %p\n", mlt
== ML_ACCEPT
? "accept" :
489 (mlt
== ML_DENY
? "deny" : "score"), mi
->method
);
497 free(mi
->parser_data
);
503 static int load_mood(const struct osl_row
*mood_row
, struct mood
**m
)
506 struct osl_object mood_def
;
507 struct mood_line_parser_data mlpd
= {.line_num
= 0};
508 int ret
= mood_get_name_and_def_by_row(mood_row
, &mood_name
, &mood_def
);
514 mlpd
.m
= alloc_new_mood(mood_name
);
515 ret
= for_each_line_ro(mood_def
.data
, mood_def
.size
,
516 parse_mood_line
, &mlpd
);
517 osl_close_disk_object(&mood_def
);
519 PARA_ERROR_LOG("unable to load mood %s: %s\n", mlpd
.m
->name
,
520 PARA_STRERROR(-ret
));
521 destroy_mood(mlpd
.m
);
528 static int check_mood(struct osl_row
*mood_row
, void *data
)
530 struct para_buffer
*pb
= data
;
532 struct osl_object mood_def
;
533 struct mood_line_parser_data mlpd
= {.line_num
= 0};
535 int ret
= mood_get_name_and_def_by_row(mood_row
, &mood_name
, &mood_def
);
538 para_printf(pb
, "failed to get mood definition\n");
541 if (!*mood_name
) /* ignore dummy row */
543 para_printf(pb
, "checking mood %s...\n", mood_name
);
544 ret
= for_each_line_ro(mood_def
.data
, mood_def
.size
,
545 parse_mood_line
, &mlpd
);
547 para_printf(pb
, "%s line %u: %s\n", mood_name
, mlpd
.line_num
,
548 PARA_STRERROR(-ret
));
550 osl_close_disk_object(&mood_def
);
555 * Check all moods for syntax errors.
557 * \param query Unused.
558 * \param result: Contains check messages.
560 int mood_check_callback(__a_unused
const struct osl_object
*query
,
561 struct osl_object
*result
)
563 struct para_buffer pb
= {.buf
= NULL
};
565 para_printf(&pb
, "checking moods...\n");
566 osl_rbtree_loop(moods_table
, BLOBCOL_ID
, &pb
,
568 result
->data
= pb
.buf
;
569 result
->size
= pb
.size
;
574 static unsigned int_log2(uint64_t x
)
586 static int64_t normalized_value(int64_t x
, int64_t n
, int64_t sum
, int64_t qd
)
590 return 100 * (n
* x
- sum
) / (int64_t)int_sqrt(n
* qd
);
593 static long compute_num_played_score(struct afs_info
*afsi
)
595 return -normalized_value(afsi
->num_played
, statistics
.num
,
596 statistics
.num_played_sum
, statistics
.num_played_qd
);
599 static long compute_last_played_score(struct afs_info
*afsi
)
601 return -normalized_value(afsi
->last_played
, statistics
.num
,
602 statistics
.last_played_sum
, statistics
.last_played_qd
);
605 static long compute_dynamic_score(const struct osl_row
*aft_row
)
607 struct afs_info afsi
;
608 int64_t score
, nscore
= 0, lscore
= 0;
611 ret
= get_afsi_of_row(aft_row
, &afsi
);
614 nscore
= compute_num_played_score(&afsi
);
615 lscore
= compute_last_played_score(&afsi
);
616 score
= nscore
+ lscore
;
620 static int add_afs_statistics(const struct osl_row
*row
)
623 struct afs_info afsi
;
626 ret
= get_afsi_of_row(row
, &afsi
);
630 x
= afsi
.last_played
;
631 s
= statistics
.last_played_sum
;
633 statistics
.last_played_qd
+= (x
- s
/ n
) * (x
- s
/ n
) * n
/ (n
+ 1);
634 statistics
.last_played_sum
+= x
;
637 s
= statistics
.num_played_sum
;
639 statistics
.num_played_qd
+= (x
- s
/ n
) * (x
- s
/ n
) * n
/ (n
+ 1);
640 statistics
.num_played_sum
+= x
;
645 static int del_afs_statistics(const struct osl_row
*row
)
647 uint64_t n
, s
, q
, a
, new_s
;
648 struct afs_info afsi
;
650 ret
= get_afsi_of_row(row
, &afsi
);
656 memset(&statistics
, 0, sizeof(statistics
));
660 s
= statistics
.last_played_sum
;
661 q
= statistics
.last_played_qd
;
662 a
= afsi
.last_played
;
664 statistics
.last_played_sum
= new_s
;
665 statistics
.last_played_qd
= q
+ s
* s
/ n
- a
* a
666 - new_s
* new_s
/ (n
- 1);
668 s
= statistics
.num_played_sum
;
669 q
= statistics
.num_played_qd
;
672 statistics
.num_played_sum
= new_s
;
673 statistics
.num_played_qd
= q
+ s
* s
/ n
- a
* a
674 - new_s
* new_s
/ (n
- 1);
681 * Structure used during mood_open().
683 * At mood open time, we look at each file in the audio file table in order to
684 * determine whether it is admissible. If a file happens to be admissible, its
685 * mood score is computed by calling each relevant mood_score_function. Next,
686 * we update the afs_statistics and add a struct admissible_file_info to a
689 * If all files have been processed that way, the final score of each
690 * admissible file is computed by adding the dynamic score (which depends on
691 * the afs_statistics) to the mood score. Finally, all audio files in the
692 * array are added to the score table and the admissible array is freed.
694 * \sa mood_method, admissible_array.
696 struct admissible_file_info
698 /** The admissible audio file. */
699 struct osl_row
*aft_row
;
704 /** The temporary array of admissible files. */
705 struct admissible_array
{
706 /** Files are admissible wrt. this mood. */
708 /** The size of the array */
710 /** Pointer to the array of admissible files. */
711 struct admissible_file_info
*array
;
715 * Add an entry to the array of admissible files.
717 * \param aft_row The audio file to be added.
718 * \param private_data Pointer to a struct admissible_file_info.
720 * \return Negative on errors, positive on success.
722 static int add_if_admissible(struct osl_row
*aft_row
, void *data
)
724 struct admissible_array
*aa
= data
;
728 ret
= compute_mood_score(aft_row
, aa
->m
, &score
);
730 return (ret
== -E_NOT_ADMISSIBLE
)? 1 : ret
;
731 if (statistics
.num
>= aa
->size
) {
734 aa
->array
= para_realloc(aa
->array
,
735 aa
->size
* sizeof(struct admissible_file_info
));
737 aa
->array
[statistics
.num
].aft_row
= aft_row
;
738 aa
->array
[statistics
.num
].score
= score
;
739 ret
= add_afs_statistics(aft_row
);
746 * Compute the new quadratic deviation in case one element changes.
748 * \param n Number of elements.
749 * \param old_qd The quadratic deviation before the change.
750 * \param old_val The value that was replaced.
751 * \param new_val The replacement value.
752 * \param old_sum The sum of all elements before the update.
754 * \return The new quadratic deviation resulting from replacing old_val
757 * Given n real numbers a_1, ..., a_n, their sum S = a_1 + ... + a_n,
758 * their quadratic deviation
760 * q = (a_1 - S/n)^2 + ... + (a_n - S/n)^2,
762 * and a real number b, the quadratic deviation q' of a_1,...a_{n-1}, b (ie.
763 * the last number a_n was replaced by b) may be computed in O(1) time in terms
764 * of n, q, a_n, b, and S as
766 * q' = q + d * s - (2 * S + d) * d / n,
768 * where d = b - a_n, and s = b + a_n.
770 * Example: n = 3, a_1 = 3, a_2 = 5, a_3 = 7, b = 10. Then S = 15, q = 8, d = 3,
773 * q + d * s - (2 * S + d) * d / n = 8 + 51 - 33 = 26,
775 * which equals q' = (3 - 6)^2 + (5 - 6)^2 + (10 - 6)^2.
778 _static_inline_
int64_t update_quadratic_deviation(int64_t n
, int64_t old_qd
,
779 int64_t old_val
, int64_t new_val
, int64_t old_sum
)
781 int64_t delta
= new_val
- old_val
;
782 int64_t sigma
= new_val
+ old_val
;
783 return old_qd
+ delta
* sigma
- (2 * old_sum
+ delta
) * delta
/ n
;
786 static int update_afs_statistics(struct afs_info
*old_afsi
, struct afs_info
*new_afsi
)
789 int ret
= get_num_admissible_files(&n
);
795 statistics
.last_played_qd
= update_quadratic_deviation(n
,
796 statistics
.last_played_qd
, old_afsi
->last_played
,
797 new_afsi
->last_played
, statistics
.last_played_sum
);
798 statistics
.last_played_sum
+= new_afsi
->last_played
- old_afsi
->last_played
;
800 statistics
.num_played_qd
= update_quadratic_deviation(n
,
801 statistics
.num_played_qd
, old_afsi
->num_played
,
802 new_afsi
->num_played
, statistics
.num_played_sum
);
803 statistics
.num_played_sum
+= new_afsi
->num_played
- old_afsi
->num_played
;
807 static int add_to_score_table(const struct osl_row
*aft_row
, long mood_score
)
809 long score
= (compute_dynamic_score(aft_row
) + mood_score
) / 3;
810 return score_add(aft_row
, score
);
813 static int delete_from_statistics_and_score_table(const struct osl_row
*aft_row
)
815 int ret
= del_afs_statistics(aft_row
);
818 return score_delete(aft_row
);
822 * Delete one entry from the statistics and from the score table.
824 * \param aft_row The audio file which is no longer admissible.
826 * \return Positive on success, negative on errors.
828 * \sa score_delete().
830 static int mood_delete_audio_file(const struct osl_row
*aft_row
)
834 ret
= row_belongs_to_score_table(aft_row
, NULL
);
837 if (!ret
) /* not admissible, nothing to do */
839 return delete_from_statistics_and_score_table(aft_row
);
843 * Compute the new score of an audio file wrt. the current mood.
845 * \param aft_row Determines the audio file.
846 * \param old_afsi The audio file selector info before updating.
848 * The \a old_afsi argument may be \p NULL which indicates that no changes to
849 * the audio file info were made.
851 * \return Positive on success, negative on errors.
853 static int mood_update_audio_file(const struct osl_row
*aft_row
,
854 struct afs_info
*old_afsi
)
857 int ret
, is_admissible
, was_admissible
= 0;
858 struct afs_info afsi
;
862 return 1; /* nothing to do */
863 ret
= row_belongs_to_score_table(aft_row
, &rank
);
866 was_admissible
= ret
;
867 ret
= compute_mood_score(aft_row
, current_mood
, &score
);
868 is_admissible
= (ret
> 0);
869 if (!was_admissible
&& !is_admissible
)
871 if (was_admissible
&& !is_admissible
)
872 return delete_from_statistics_and_score_table(aft_row
);
873 if (!was_admissible
&& is_admissible
) {
874 ret
= add_afs_statistics(aft_row
);
877 return add_to_score_table(aft_row
, score
);
880 ret
= get_afsi_of_row(aft_row
, &afsi
);
884 ret
= update_afs_statistics(old_afsi
, &afsi
);
888 score
+= compute_num_played_score(&afsi
);
889 score
+= compute_last_played_score(&afsi
);
891 PARA_DEBUG_LOG("score: %li\n", score
);
892 percent
= (score
+ 100) / 3;
895 else if (percent
< 0)
897 PARA_DEBUG_LOG("moving from rank %u to %lu%%\n", rank
, percent
);
898 return score_update(aft_row
, percent
);
901 static void log_statistics(void)
903 unsigned n
= statistics
.num
;
906 PARA_NOTICE_LOG("no admissible files\n");
909 PARA_INFO_LOG("last_played mean: %lli, last_played sigma: %llu\n",
910 (long long int)(statistics
.last_played_sum
/ n
),
911 (long long unsigned)int_sqrt(statistics
.last_played_qd
/ n
));
912 PARA_INFO_LOG("num_played mean: %lli, num_played sigma: %llu\n",
913 (long long int)statistics
.num_played_sum
/ n
,
914 (long long unsigned)int_sqrt(statistics
.num_played_qd
/ n
));
918 * Close the current mood.
920 * Free all resources of the current mood which were allocated during
923 void close_current_mood(void)
925 destroy_mood(current_mood
);
927 memset(&statistics
, 0, sizeof(statistics
));
932 * Change the current mood.
934 * \param mood_name The name of the mood to open.
936 * If \a mood_name is \a NULL, load the dummy mood that accepts every audio file
937 * and uses a scoring method based only on the \a last_played information.
939 * If there is already an open mood, it will be closed first.
941 * \return Positive on success, negative on errors. Loading the dummy mood
944 * \sa struct admissible_file_info, struct admissible_array, struct
945 * afs_info::last_played, mood_close().
947 int change_current_mood(char *mood_name
)
950 struct admissible_array aa
= {
958 struct osl_object obj
= {
960 .size
= strlen(mood_name
) + 1
962 ret
= osl_get_row(moods_table
, BLOBCOL_NAME
, &obj
, &row
);
964 PARA_NOTICE_LOG("no such mood: %s\n", mood_name
);
967 ret
= load_mood(row
, &m
);
970 close_current_mood();
973 close_current_mood();
974 current_mood
= alloc_new_mood("dummy");
977 PARA_NOTICE_LOG("computing statistics of admissible files\n");
978 ret
= audio_file_loop(&aa
, add_if_admissible
);
982 PARA_INFO_LOG("%d admissible files \n", statistics
.num
);
983 for (i
= 0; i
< statistics
.num
; i
++) {
984 struct admissible_file_info
*a
= aa
.array
+ i
;
985 ret
= add_to_score_table(a
->aft_row
, a
->score
);
989 PARA_NOTICE_LOG("loaded mood %s\n", current_mood
->name
);
990 ret
= statistics
.num
;
996 * Close and re-open the current mood.
998 * This function is used if changes to the audio file table or the
999 * attribute table were made that render the current list of admissible
1000 * files useless. For example, if an attribute is removed from the
1001 * attribute table, this function is called.
1003 * \return Positive on success, negative on errors. If no mood is currently
1004 * open, the function returns success.
1006 * \sa mood_open(), mood_close().
1008 int reload_current_mood(void)
1011 char *mood_name
= NULL
;
1013 PARA_NOTICE_LOG("reloading current mood\n");
1016 if (current_mood
->name
)
1017 mood_name
= para_strdup(current_mood
->name
);
1018 close_current_mood();
1019 ret
= change_current_mood(mood_name
);
1024 int moods_event_handler(enum afs_events event
, __a_unused
struct para_buffer
*pb
,
1029 * The three blob events might change the set of admissible files,
1030 * so we must reload the score list.
1035 if (data
== moods_table
|| data
== playlists_table
)
1036 return 1; /* no reload necessary for these */
1037 return reload_current_mood();
1038 /* these also require reload of the score table */
1040 case ATTRIBUTE_REMOVE
:
1041 case ATTRIBUTE_RENAME
:
1042 return reload_current_mood();
1043 /* changes to the aft only require to re-examine the audio file */
1045 struct afsi_change_event_data
*aced
= data
;
1046 return mood_update_audio_file(aced
->aft_row
, aced
->old_afsi
);
1049 case AUDIO_FILE_RENAME
:
1050 case AUDIO_FILE_ADD
:
1051 return mood_update_audio_file(data
, NULL
);
1052 case AUDIO_FILE_REMOVE
:
1053 return mood_delete_audio_file(data
);