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. */
17 * Contains statistical data of the currently admissible audio files.
19 * It is used to assign normalized score values to each admissbile audio file.
21 struct afs_statistics
{
22 /** sum of num played over all admissible files */
23 int64_t num_played_sum
;
24 /** sum of last played times over all admissible files */
25 int64_t last_played_sum
;
26 /** quadratic deviation of num played time */
27 int64_t num_played_qd
;
28 /** quadratic deviation of last played time */
29 int64_t last_played_qd
;
30 /** number of admissible files */
33 struct afs_statistics statistics
;
36 * Assign scores according to a mood_method.
38 * Each mood_method has its own mood_score_function. The first parameter passed
39 * to that function is a pointer to a row of the audio file table. It
40 * determines the audio file for which a score is to be assigned. The second
41 * argument depends on the mood method this function is used for. It usually is
42 * the argument given at the end of a mood line.
44 * Mood score functions must return values between -100 and +100 inclisively.
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 struct osl_row
*, void *);
52 * Preprocess a mood line.
54 * The mood_parser of a mood_method is called once at mood open time for each
55 * line of the current mood definition that contains the mood_method's name as
56 * a keyword. The line is passed to the mood_parser as the first argument. The
57 * mood_parser must determine whether the line is syntactically correct and
58 * return a positive value if so and a negative value otherwise.
60 * Some mood parsers preprocess the data given in the mood line to compute a
61 * structure which depends of the particular mood_method and which is used
62 * later in the mood_score_function of the mood_method. The mood_parser may
63 * store a pointer to its structure via the second argument.
65 * \sa mood_open(), mood_cleanup_function, mood_score_function.
67 typedef int mood_parser(const char *, void **);
70 * Deallocate resources which were allocated by the mood_parser.
72 * This optional function of a mood_method is used to free any resources
73 * allocated in mood_open() by the mood_parser. The argument passed is a
74 * pointer to the mood_method specific data structure that was returned by the
79 typedef void mood_cleanup_function(void *);
82 * Used for scoring and to determine whether a file is admissible.
85 /* The name of the method. */
87 /** Pointer to the mood parser. */
89 /** Pointer to the score function */
90 mood_score_function
*score_function
;
91 /** Optional cleanup function. */
92 mood_cleanup_function
*cleanup
;
96 * Each line of the current mood corresponds to a mood_item.
99 /** The method this line is referring to. */
100 const struct mood_method
*method
;
101 /** The data structure computed by the mood parser. */
103 /** The given score value, or zero if none was given. */
105 /** Non-zero if random scoring was requested. */
107 /** Whether the "not" keyword was given in the mood line. */
109 /** The position in the list of items. */
110 struct list_head mood_item_node
;
114 * Created from the mood definition by mood_open().
116 * When a mood is opened, each line of its definition is investigated, and a
117 * corresponding mood item is produced. Each mood line starts with \p accept,
118 * \p deny, or \p score which determins the type of the mood line. For each
119 * such type a linked list is maintained whose entries are the mood items.
121 * \sa mood_item, mood_open().
124 /** The name of this mood. */
126 /** The list of mood items of type \p accept. */
127 struct list_head accept_list
;
128 /** The list of mood items of type \p deny. */
129 struct list_head deny_list
;
130 /** The list of mood items of type \p score. */
131 struct list_head score_list
;
134 static struct mood
*current_mood
;
137 * Rough approximation to sqrt.
139 * \param x Integer of which to calculate the sqrt.
141 * \return An integer res with res * res <= x.
143 static uint64_t int_sqrt(uint64_t x
)
145 uint64_t op
, res
, one
= 1;
154 if (op
>= res
+ one
) {
155 op
= op
- (res
+ one
);
161 // PARA_NOTICE_LOG("sqrt(%llu) = %llu\n", x, res);
165 static int mm_played_rarely_score_function(const struct osl_row
*row
,
166 __a_unused
void *ignored
)
168 struct afs_info afsi
;
170 int ret
= get_afsi_of_row(row
, &afsi
);
174 ret
= get_num_admissible_files(&num
);
177 if (statistics
.num_played_sum
- num
* afsi
.num_played
178 > int_sqrt(statistics
.num_played_qd
* num
))
183 static int mm_played_rarely_parser(const char *arg
, __a_unused
void **ignored
)
186 PARA_WARNING_LOG("ignored junk at eol: %s\n", arg
);
190 static int mm_name_like_score_function(const struct osl_row
*row
, void *preg
)
193 int ret
= get_audio_file_path_of_row(row
, &path
);
197 ret
= regexec((regex_t
*)preg
, path
, 42, NULL
, 0);
198 return (ret
== REG_NOMATCH
)? -100 : 100;
201 static int mm_name_like_parser(const char *arg
, void **regex
)
203 regex_t
*preg
= para_malloc(sizeof(*preg
));
204 int ret
= regcomp(preg
, arg
, REG_NOSUB
);
208 return -E_MOOD_REGEX
;
214 static void mm_name_like_cleanup(void *preg
)
220 static int mm_is_set_parser(const char *arg
, void **bitnum
)
222 unsigned char *c
= para_malloc(1);
223 int ret
= get_attribute_bitnum_by_name(arg
, c
);
232 static int mm_is_set_score_function(const struct osl_row
*row
, void *bitnum
)
234 unsigned char *bn
= bitnum
;
235 struct afs_info afsi
;
236 int ret
= get_afsi_of_row(row
, &afsi
);
240 if (afsi
.attributes
& (1ULL << *bn
))
245 /* returns 1 if row matches score item, -1 otherwise */
246 static int add_item_score(const struct osl_row
*row
, struct mood_item
*item
, long *score
,
251 *score_arg_sum
+= item
->random_score
? 100 : PARA_ABS(item
->score_arg
);
253 ret
= item
->method
->score_function(row
, item
->parser_data
);
254 if ((ret
< 0 && !item
->logical_not
) || (ret
>= 0 && item
->logical_not
))
255 return -1; /* no match */
257 if (item
->random_score
)
258 *score
+= PARA_ABS(ret
) * para_random(100);
260 *score
+= PARA_ABS(ret
) * item
->score_arg
;
264 static int compute_mood_score(const struct osl_row
*aft_row
, struct mood
*m
,
267 struct mood_item
*item
;
269 long score_arg_sum
= 0, score
= 0;
273 /* reject audio file if it matches any entry in the deny list */
274 list_for_each_entry(item
, &m
->deny_list
, mood_item_node
)
275 if (add_item_score(aft_row
, item
, &score
, &score_arg_sum
) > 0)
276 return -E_NOT_ADMISSIBLE
;
277 list_for_each_entry(item
, &m
->accept_list
, mood_item_node
)
278 if (add_item_score(aft_row
, item
, &score
, &score_arg_sum
) > 0)
280 /* reject if there is no matching entry in the accept list */
281 if (!match
&& !list_empty(&m
->accept_list
))
282 return -E_NOT_ADMISSIBLE
;
283 list_for_each_entry(item
, &m
->score_list
, mood_item_node
)
284 add_item_score(aft_row
, item
, &score
, &score_arg_sum
);
286 score
/= score_arg_sum
;
291 static const struct mood_method mood_methods
[] = {
293 .parser
= mm_played_rarely_parser
,
294 .score_function
= mm_played_rarely_score_function
,
295 .name
= "played_rarely"
298 .parser
= mm_is_set_parser
,
299 .score_function
= mm_is_set_score_function
,
303 .parser
= mm_name_like_parser
,
304 .score_function
= mm_name_like_score_function
,
305 .cleanup
= mm_name_like_cleanup
,
313 static void cleanup_list_entry(struct mood_item
*item
)
315 if (item
->method
&& item
->method
->cleanup
)
316 item
->method
->cleanup(item
->parser_data
);
318 free(item
->parser_data
);
319 list_del(&item
->mood_item_node
);
323 static void destroy_mood(struct mood
*m
)
325 struct mood_item
*tmp
, *item
;
329 list_for_each_entry_safe(item
, tmp
, &m
->accept_list
, mood_item_node
)
330 cleanup_list_entry(item
);
331 list_for_each_entry_safe(item
, tmp
, &m
->deny_list
, mood_item_node
)
332 cleanup_list_entry(item
);
333 list_for_each_entry_safe(item
, tmp
, &m
->score_list
, mood_item_node
)
334 cleanup_list_entry(item
);
339 static struct mood
*alloc_new_mood(const char *name
)
341 struct mood
*m
= para_calloc(sizeof(struct mood
));
342 m
->name
= para_strdup(name
);
343 INIT_LIST_HEAD(&m
->accept_list
);
344 INIT_LIST_HEAD(&m
->deny_list
);
345 INIT_LIST_HEAD(&m
->score_list
);
349 /** The different types of a mood line. */
350 enum mood_line_type
{
361 struct mood_line_parser_data
{
367 * <accept [with score <score>] | deny [with score <score>] | score <score>>
368 * [if] [not] <mood_method> [options]
369 * <score> is either an integer or "random" which assigns a random score to
373 static int parse_mood_line(char *mood_line
, void *data
)
375 struct mood_line_parser_data
*mlpd
= data
;
381 enum mood_line_type mlt
= ML_INVALID
;
382 struct mood_item
*mi
= NULL
;
383 char *buf
= para_strdup(mood_line
);
386 num_words
= split_args(buf
, &argv
, delim
);
388 if (!num_words
) /* empty line */
391 if (**w
== '#') /* comment */
393 if (!strcmp(*w
, "accept"))
395 else if (!strcmp(*w
, "deny"))
397 else if (!strcmp(*w
, "score"))
399 ret
= -E_MOOD_SYNTAX
;
400 if (mlt
== ML_INVALID
)
402 mi
= para_calloc(sizeof(struct mood_item
));
403 if (mlt
!= ML_SCORE
) {
404 ret
= -E_MOOD_SYNTAX
;
408 if (!strcmp(*w
, "with")) {
414 if (mlt
== ML_SCORE
|| !strcmp(*w
, "score")) {
415 ret
= -E_MOOD_SYNTAX
;
419 if (strcmp(*w
, "random")) {
420 mi
->random_score
= 0;
421 ret
= para_atol(*w
, &mi
->score_arg
);
425 mi
->random_score
= 1;
427 goto success
; /* the line "score random" is valid */
431 ret
= -E_MOOD_SYNTAX
;
435 if (!strcmp(*w
, "if")) {
436 ret
= -E_MOOD_SYNTAX
;
441 if (!strcmp(*w
, "not")) {
442 ret
= -E_MOOD_SYNTAX
;
449 for (i
= 0; mood_methods
[i
].parser
; i
++) {
450 if (strcmp(*w
, mood_methods
[i
].name
))
454 ret
= -E_MOOD_SYNTAX
;
455 if (!mood_methods
[i
].parser
)
458 ret
= mood_methods
[i
].parser(*w
, &mi
->parser_data
);
461 mi
->method
= &mood_methods
[i
];
464 if (mlt
== ML_ACCEPT
)
465 para_list_add(&mi
->mood_item_node
, &mlpd
->m
->accept_list
);
466 else if (mlt
== ML_DENY
)
467 para_list_add(&mi
->mood_item_node
, &mlpd
->m
->deny_list
);
469 para_list_add(&mi
->mood_item_node
, &mlpd
->m
->score_list
);
471 PARA_DEBUG_LOG("%s entry added, method: %p\n", mlt
== ML_ACCEPT
? "accept" :
472 (mlt
== ML_DENY
? "deny" : "score"), mi
->method
);
480 free(mi
->parser_data
);
486 static int load_mood(const struct osl_row
*mood_row
, struct mood
**m
)
489 struct osl_object mood_def
;
490 struct mood_line_parser_data mlpd
= {.line_num
= 0};
491 int ret
= mood_get_name_and_def_by_row(mood_row
, &mood_name
, &mood_def
);
497 mlpd
.m
= alloc_new_mood(mood_name
);
498 ret
= for_each_line_ro(mood_def
.data
, mood_def
.size
,
499 parse_mood_line
, &mlpd
);
500 osl_close_disk_object(&mood_def
);
502 PARA_ERROR_LOG("unable to load mood %s: %s\n", mlpd
.m
->name
,
503 PARA_STRERROR(-ret
));
504 destroy_mood(mlpd
.m
);
507 PARA_INFO_LOG("loaded mood %s\n", mlpd
.m
->name
);
513 * Calls load_mood() and reverts its error value: It returns -E_MOOD_LOADED
514 * on _success_, and 1 on errors. This way the loop over all moods stops at the
517 static int load_mood_loop_func(struct osl_row
*mood_row
, void *data
)
519 struct mood
**m
= data
;
520 int ret
= load_mood(mood_row
, m
);
522 if (ret
!= -E_DUMMY_ROW
)
523 PARA_NOTICE_LOG("invalid mood (%d), trying next mood\n", ret
);
526 return -E_MOOD_LOADED
;
529 static int load_first_available_mood(struct mood
**m
)
531 int ret
= osl_rbtree_loop(moods_table
, BLOBCOL_NAME
, m
,
532 load_mood_loop_func
);
533 if (ret
== -E_MOOD_LOADED
) /* success */
536 return ret
; /* error */
537 PARA_NOTICE_LOG("no valid mood found\n");
541 static int check_mood(struct osl_row
*mood_row
, void *data
)
543 struct para_buffer
*pb
= data
;
545 struct osl_object mood_def
;
546 struct mood_line_parser_data mlpd
= {.line_num
= 0};
548 int ret
= mood_get_name_and_def_by_row(mood_row
, &mood_name
, &mood_def
);
551 para_printf(pb
, "failed to get mood definition\n");
554 if (!*mood_name
) /* ignore dummy row */
556 para_printf(pb
, "checking mood %s...\n", mood_name
);
557 ret
= for_each_line_ro(mood_def
.data
, mood_def
.size
,
558 parse_mood_line
, &mlpd
);
560 para_printf(pb
, "%s line %u: %s\n", mood_name
, mlpd
.line_num
,
561 PARA_STRERROR(-ret
));
563 osl_close_disk_object(&mood_def
);
568 * Check all moods for syntax errors.
570 * \param query Unused.
571 * \param result: Contains check messages.
573 int mood_check_callback(__a_unused
const struct osl_object
*query
,
574 struct osl_object
*result
)
576 struct para_buffer pb
= {.buf
= NULL
};
578 para_printf(&pb
, "checking moods...\n");
579 osl_rbtree_loop(moods_table
, BLOBCOL_ID
, &pb
,
581 result
->data
= pb
.buf
;
582 result
->size
= pb
.size
;
587 static unsigned int_log2(uint64_t x
)
599 static int64_t normalized_value(int64_t x
, int64_t n
, int64_t sum
, int64_t qd
)
603 return 100 * (n
* x
- sum
) / (int64_t)int_sqrt(n
* qd
);
606 static long compute_num_played_score(struct afs_info
*afsi
)
608 return -normalized_value(afsi
->num_played
, statistics
.num
,
609 statistics
.num_played_sum
, statistics
.num_played_qd
);
612 static long compute_last_played_score(struct afs_info
*afsi
)
614 return -normalized_value(afsi
->last_played
, statistics
.num
,
615 statistics
.last_played_sum
, statistics
.last_played_qd
);
618 static long compute_dynamic_score(const struct osl_row
*aft_row
)
620 struct afs_info afsi
;
621 int64_t score
, nscore
= 0, lscore
= 0;
624 ret
= get_afsi_of_row(aft_row
, &afsi
);
627 nscore
= compute_num_played_score(&afsi
);
628 lscore
= compute_last_played_score(&afsi
);
629 score
= nscore
+ lscore
;
633 static int add_afs_statistics(const struct osl_row
*row
)
636 struct afs_info afsi
;
639 ret
= get_afsi_of_row(row
, &afsi
);
643 x
= afsi
.last_played
;
644 s
= statistics
.last_played_sum
;
646 statistics
.last_played_qd
+= (x
- s
/ n
) * (x
- s
/ n
) * n
/ (n
+ 1);
647 statistics
.last_played_sum
+= x
;
650 s
= statistics
.num_played_sum
;
652 statistics
.num_played_qd
+= (x
- s
/ n
) * (x
- s
/ n
) * n
/ (n
+ 1);
653 statistics
.num_played_sum
+= x
;
658 static int del_afs_statistics(const struct osl_row
*row
)
660 uint64_t n
, s
, q
, a
, new_s
;
661 struct afs_info afsi
;
663 ret
= get_afsi_of_row(row
, &afsi
);
669 memset(&statistics
, 0, sizeof(statistics
));
673 s
= statistics
.last_played_sum
;
674 q
= statistics
.last_played_qd
;
675 a
= afsi
.last_played
;
677 statistics
.last_played_sum
= new_s
;
678 statistics
.last_played_qd
= q
+ s
* s
/ n
- a
* a
679 - new_s
* new_s
/ (n
- 1);
681 s
= statistics
.num_played_sum
;
682 q
= statistics
.num_played_qd
;
685 statistics
.num_played_sum
= new_s
;
686 statistics
.num_played_qd
= q
+ s
* s
/ n
- a
* a
687 - new_s
* new_s
/ (n
- 1);
694 * Structure used during mood_open().
696 * At mood open time, we look at each file in the audio file table in order to
697 * determine whether it is admissible. If a file happens to be admissible, its
698 * mood score is computed by calling each relevant mood_score_function. Next,
699 * we update the afs_statistics and add a struct admissible_file_info to a
702 * If all files have been processed that way, the final score of each
703 * admissible file is computed by adding the dynamic score (which depends on
704 * the afs_statistics) to the mood score. Finally, all audio files in the
705 * array are added to the score table and the admissible array is freed.
707 * \sa mood_method, admissible_array.
709 struct admissible_file_info
711 /** The admissible audio file. */
712 struct osl_row
*aft_row
;
717 /** The temporary array of admissible files. */
718 struct admissible_array
{
719 /** Files are admissible wrt. this mood. */
721 /** The size of the array */
723 /** Pointer to the array of admissible files. */
724 struct admissible_file_info
*array
;
728 * Add an entry to the array of admissible files.
730 * \param aft_row The audio file to be added.
731 * \param private_data Pointer to a struct admissible_file_info.
733 * \return Negative on errors, positive on success.
735 static int add_if_admissible(struct osl_row
*aft_row
, void *data
)
737 struct admissible_array
*aa
= data
;
741 ret
= compute_mood_score(aft_row
, aa
->m
, &score
);
743 return (ret
== -E_NOT_ADMISSIBLE
)? 1 : ret
;
744 if (statistics
.num
>= aa
->size
) {
747 aa
->array
= para_realloc(aa
->array
,
748 aa
->size
* sizeof(struct admissible_file_info
));
750 aa
->array
[statistics
.num
].aft_row
= aft_row
;
751 aa
->array
[statistics
.num
].score
= score
;
752 ret
= add_afs_statistics(aft_row
);
759 * Compute the new quadratic deviation in case one element changes.
761 * \param n Number of elements.
762 * \param old_qd The quadratic deviation before the change.
763 * \param old_val The value that was repaced.
764 * \param new_val The replacement value.
765 * \param old_sum The sum of all elements before the update.
767 * \return The new quadratic deviation resulting from replacing old_val
770 * Given n real numbers a_1, ..., a_n, their sum S = a_1 + ... + a_n,
771 * their quadratic deviation
773 * q = (a_1 - S/n)^2 + ... + (a_n - S/n)^2,
775 * and a real number b, the quadratic deviation q' of a_1,...a_{n-1}, b (ie.
776 * the last number a_n was replaced by b) may be computed in O(1) time in terms
777 * of n, q, a_n, b, and S as
779 * q' = q + d * s - (2 * S + d) * d / n,
781 * where d = b - a_n, and s = b + a_n.
783 * Example: n = 3, a_1 = 3, a_2 = 5, a_3 = 7, b = 10. Then S = 15, q = 8, d = 3,
786 * q + d * s - (2 * S + d) * d / n = 8 + 51 - 33 = 26,
788 * which equals q' = (3 - 6)^2 + (5 - 6)^2 + (10 - 6)^2.
791 _static_inline_
int64_t update_quadratic_deviation(int64_t n
, int64_t old_qd
,
792 int64_t old_val
, int64_t new_val
, int64_t old_sum
)
794 int64_t delta
= new_val
- old_val
;
795 int64_t sigma
= new_val
+ old_val
;
796 return old_qd
+ delta
* sigma
- (2 * old_sum
+ delta
) * delta
/ n
;
799 static int update_afs_statistics(struct afs_info
*old_afsi
, struct afs_info
*new_afsi
)
802 int ret
= get_num_admissible_files(&n
);
808 statistics
.last_played_qd
= update_quadratic_deviation(n
,
809 statistics
.last_played_qd
, old_afsi
->last_played
,
810 new_afsi
->last_played
, statistics
.last_played_sum
);
811 statistics
.last_played_sum
+= new_afsi
->last_played
- old_afsi
->last_played
;
813 statistics
.num_played_qd
= update_quadratic_deviation(n
,
814 statistics
.num_played_qd
, old_afsi
->num_played
,
815 new_afsi
->num_played
, statistics
.num_played_sum
);
816 statistics
.num_played_sum
+= new_afsi
->num_played
- old_afsi
->num_played
;
820 static int add_to_score_table(const struct osl_row
*aft_row
, long mood_score
)
822 long score
= (compute_dynamic_score(aft_row
) + mood_score
) / 3;
823 return score_add(aft_row
, score
);
826 static int delete_from_statistics_and_score_table(const struct osl_row
*aft_row
)
828 int ret
= del_afs_statistics(aft_row
);
831 return score_delete(aft_row
);
835 * Delete one entry from the statitics and from the score table.
837 * \param aft_row The audio file which is no longer admissible.
839 * \return Positive on success, negative on errors.
841 * \sa score_delete(), mood_update_audio_file().
843 int mood_delete_audio_file(const struct osl_row
*aft_row
)
847 ret
= row_belongs_to_score_table(aft_row
);
850 if (!ret
) /* not admissible, nothing to do */
852 return delete_from_statistics_and_score_table(aft_row
);
856 * Compute the new score of an audio file wrt. the current mood.
858 * \param aft_row Determines the audio file.
859 * \param old_afsi The audio file selector info before updating.
861 * The \a old_afsi argument may be \p NULL which indicates that no changes to
862 * the audio file info were made.
864 * \return Positive on success, negative on errors.
866 int mood_update_audio_file(const struct osl_row
*aft_row
, struct afs_info
*old_afsi
)
869 int ret
, is_admissible
, was_admissible
= 0;
870 struct afs_info afsi
;
873 return 1; /* nothing to do */
874 ret
= row_belongs_to_score_table(aft_row
);
877 was_admissible
= ret
;
878 ret
= compute_mood_score(aft_row
, current_mood
, &score
);
879 is_admissible
= (ret
> 0);
880 if (!was_admissible
&& !is_admissible
)
882 if (was_admissible
&& !is_admissible
)
883 return delete_from_statistics_and_score_table(aft_row
);
884 if (!was_admissible
&& is_admissible
) {
885 ret
= add_afs_statistics(aft_row
);
888 return add_to_score_table(aft_row
, score
);
891 ret
= get_afsi_of_row(aft_row
, &afsi
);
895 ret
= update_afs_statistics(old_afsi
, &afsi
);
899 score
+= compute_num_played_score(&afsi
);
900 score
+= compute_last_played_score(&afsi
);
902 PARA_DEBUG_LOG("score: %li\n", score
);
903 percent
= (score
+ 100) / 3;
906 else if (percent
< 0)
908 PARA_DEBUG_LOG("re-inserting at %lu%%\n", percent
);
909 return score_update(aft_row
, percent
);
912 static void log_statistics(void)
914 unsigned n
= statistics
.num
;
917 PARA_NOTICE_LOG("no admissible files\n");
920 PARA_NOTICE_LOG("last_played mean: %lli, last_played sigma: %llu\n",
921 (long long int)(statistics
.last_played_sum
/ n
),
922 (long long unsigned)int_sqrt(statistics
.last_played_qd
/ n
));
923 PARA_NOTICE_LOG("num_played mean: %lli, num_played sigma: %llu\n",
924 (long long int)statistics
.num_played_sum
/ n
,
925 (long long unsigned)int_sqrt(statistics
.num_played_qd
/ n
));
929 * Change the current mood.
931 * \param mood_name The name of the mood to open.
933 * There are two special cases: If \a mood_name is \a NULL, load the
934 * first available mood. If \a mood_name is the empty string "", load
935 * the dummy mood that accepts every audio file and uses a scoring method
936 * based only on the \a last_played information.
938 * If there is already an open mood, it will be closed first.
940 * \return Positive on success, negative on errors. Loading the dummy mood
943 * \sa struct admissible_file_info, struct admissible_array, struct
944 * afs_info::last_played, mood_close().
946 int change_current_mood(char *mood_name
)
949 struct admissible_array aa
= {
956 ret
= load_first_available_mood(&m
);
959 destroy_mood(current_mood
);
961 } else if (*mood_name
) {
964 struct osl_object obj
= {
966 .size
= strlen(mood_name
) + 1
968 ret
= osl_get_row(moods_table
, BLOBCOL_NAME
, &obj
, &row
);
970 PARA_NOTICE_LOG("no such mood: %s\n", mood_name
);
973 ret
= load_mood(row
, &m
);
976 destroy_mood(current_mood
);
979 destroy_mood(current_mood
);
980 current_mood
= alloc_new_mood("dummy");
983 PARA_NOTICE_LOG("loaded mood %s\n", current_mood
->name
);
984 PARA_INFO_LOG("%s\n", "computing statistics of admissible files");
985 ret
= audio_file_loop(&aa
, add_if_admissible
);
989 PARA_NOTICE_LOG("%d admissible files \n", statistics
.num
);
990 for (i
= 0; i
< statistics
.num
; i
++) {
991 struct admissible_file_info
*a
= aa
.array
+ i
;
992 ret
= add_to_score_table(a
->aft_row
, a
->score
);
996 PARA_NOTICE_LOG("score add complete\n");
1004 * Close the current mood.
1006 * Free all resources of the current mood which were allocated during
1009 void close_current_mood(void)
1011 destroy_mood(current_mood
);
1012 current_mood
= NULL
;
1013 memset(&statistics
, 0, sizeof(statistics
));
1017 * Close and re-open the current mood.
1019 * This function is used if changes to the audio file table or the
1020 * attribute table were made that render the current list of admissible
1021 * files useless. For example, if an attribute is removed from the
1022 * attribute table, this function is called.
1024 * \return Positive on success, negative on errors. If no mood is currently
1025 * open, the function returns success.
1027 * \sa mood_open(), mood_close().
1029 int reload_current_mood(void)
1037 mood_name
= para_strdup(current_mood
->name
);
1038 close_current_mood();
1039 ret
= change_current_mood(mood_name
);