1 /* Copyright (C) 2007 Andre Noll <maan@tuebingen.mpg.de>, see file COPYING. */
3 /** \file mood.c Paraslash's mood handling functions. */
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.
22 int mp_init(const char *definition, int nbytes, struct mp_context **result,
24 bool mp_eval_row(const struct osl_row *aft_row, struct mp_context *ctx);
25 void mp_shutdown(struct mp_context *ctx);
28 * Contains statistical data of the currently admissible audio files.
30 * It is used to assign normalized score values to each admissible audio file.
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 */
50 static struct afs_statistics statistics = {.normalization_divisor = 1};
53 /** The name of this mood. */
55 /** Info for the bison parser. */
56 struct mp_context *parser_context;
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.
63 static struct mood *current_mood;
66 * Find the position of the most-significant set bit.
68 * Copied and slightly adapted from the linux source tree, version 4.9.39
71 __a_const static uint32_t fls64(uint64_t v)
74 const uint64_t ones = ~(uint64_t)0U;
76 if ((v & (ones << 32)) == 0) {
80 if ((v & (ones << (64 - 16))) == 0) {
84 if ((v & (ones << (64 - 8))) == 0) {
88 if ((v & (ones << (64 - 4))) == 0) {
92 if ((v & (ones << (64 - 2))) == 0) {
96 if ((v & (ones << (64 - 1))) == 0)
102 * Compute the integer square root floor(sqrt(x)).
104 * Taken 2007 from the linux source tree.
106 __a_const static uint64_t int_sqrt(uint64_t x)
108 uint64_t op = x, res = 0, one = 1;
110 one = one << (fls64(x) & ~one);
112 if (op >= res + one) {
113 op = op - (res + one);
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)
127 return mp_eval_row(aft_row, m->parser_context);
130 static void destroy_mood(struct mood *m)
134 mp_shutdown(m->parser_context);
139 static struct mood *alloc_new_mood(const char *name)
141 struct mood *m = para_calloc(sizeof(struct mood));
143 m->name = para_strdup(name);
147 static int load_mood(const struct osl_row *mood_row, struct mood **m,
151 struct osl_object mood_def;
154 ret = mood_get_name_and_def_by_row(mood_row, &mood_name, &mood_def);
157 *errmsg = make_message(
158 "could not read mood definition");
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);
171 static int check_mood(struct osl_row *mood_row, void *data)
173 struct para_buffer *pb = data;
174 char *mood_name, *errmsg;
175 struct osl_object mood_def;
177 int ret = mood_get_name_and_def_by_row(mood_row, &mood_name, &mood_def);
180 para_printf(pb, "cannot read mood\n");
183 if (!*mood_name) /* ignore dummy row */
185 m = alloc_new_mood("check");
186 ret = mp_init(mood_def.data, mood_def.size, &m->parser_context,
189 para_printf(pb, "%s: %s\n", mood_name, errmsg);
191 para_printf(pb, "%s\n", para_strerror(-ret));
194 ret = 1; /* don't fail the loop on invalid mood definitions */
196 osl_close_disk_object(&mood_def);
201 * Check all moods for syntax errors.
203 * \param aca Only ->pbout is used for diagnostics.
205 * \return Negative on fatal errors. Inconsistent mood definitions are not
206 * considered an error.
208 int mood_check_callback(struct afs_callback_arg *aca)
210 para_printf(&aca->pbout, "checking moods...\n");
211 return osl(osl_rbtree_loop(moods_table, BLOBCOL_ID, &aca->pbout,
216 * The normalized num_played and last_played values are defined as
218 * nn := -(np - mean_n) / sigma_n and nl := -(lp - mean_l) / sigma_l
220 * For a (hypothetical) file with np = 0 and lp = now we thus have
222 * nn = mean_n / sigma_n =: hn > 0
223 * nl = -(now - mean_l) / sigma_l =: hl < 0
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
228 * sn := nn * -hl and sl := nl * hn
231 * num_played mean/sigma: 87/14
232 * last_played mean/sigma: 45/32 days
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.
238 * The total score s := sn + sl has the representation
240 * s = -cn * (np - mean_n) - cl * (lp - mean_l)
242 * with positive correction factors
244 * cn = (now - mean_l) / (sqrt(ql) * sqrt(qn) / n)
245 * cl = mean_n / (sqrt(ql) * sqrt(qn) / n)
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.
252 static int64_t normalized_value(int64_t x, int64_t n, int64_t sum, int64_t qd)
256 return 100 * (n * x - sum) / (int64_t)int_sqrt(n) / (int64_t)int_sqrt(qd);
259 static long compute_score(struct afs_info *afsi)
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);
268 static int add_afs_statistics(const struct osl_row *row)
271 struct afs_info afsi;
274 ret = get_afsi_of_row(row, &afsi);
278 x = afsi.last_played;
279 s = statistics.last_played_sum;
281 q = (x > s / n)? x - s / n : s / n - x;
282 statistics.last_played_qd += q * q * n / (n + 1);
284 statistics.last_played_sum += x;
287 s = statistics.num_played_sum;
289 q = (x > s / n)? x - s / n : s / n - x;
290 statistics.num_played_qd += q * q * n / (n + 1);
292 statistics.num_played_sum += x;
297 static int del_afs_statistics(const struct osl_row *row)
299 uint64_t n, s, q, a, new_s;
300 struct afs_info afsi;
302 ret = get_afsi_of_row(row, &afsi);
308 memset(&statistics, 0, sizeof(statistics));
309 statistics.normalization_divisor = 1;
313 s = statistics.last_played_sum;
314 q = statistics.last_played_qd;
315 a = afsi.last_played;
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);
321 s = statistics.num_played_sum;
322 q = statistics.num_played_qd;
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);
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.
342 struct admissible_array {
343 /** Files are admissible wrt. this mood. */
345 /** The size of the array */
347 /** Pointer to the array of admissible files. */
348 struct osl_row **array;
352 * Check whether the given audio file is admissible. If it is, add it to array
353 * of admissible files.
355 static int add_if_admissible(struct osl_row *aft_row, void *data)
357 struct admissible_array *aa = data;
360 ret = row_is_admissible(aft_row, aa->m);
363 if (statistics.num >= aa->size) {
366 aa->array = para_realloc(aa->array,
367 aa->size * sizeof(struct osl_row *));
369 aa->array[statistics.num] = aft_row;
370 return add_afs_statistics(aft_row);
374 * Compute the new quadratic deviation in case one element changes.
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.
382 * \return The new quadratic deviation resulting from replacing old_val
385 * Given n real numbers a_1, ..., a_n, their sum S = a_1 + ... + a_n,
386 * their quadratic deviation
388 * q = (a_1 - S/n)^2 + ... + (a_n - S/n)^2,
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
394 * q' = q + d * s - (2 * S + d) * d / n
395 * = q + d * (s - 2 * S / n - d /n),
397 * where d = b - a_n, and s = b + a_n.
399 * Example: n = 3, a_1 = 3, a_2 = 5, a_3 = 7, b = 10. Then S = 15, q = 8, d = 3,
402 * q + d * s - (2 * S + d) * d / n = 8 + 51 - 33 = 26,
404 * which equals q' = (3 - 6)^2 + (5 - 6)^2 + (10 - 6)^2.
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)
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);
415 static int update_afs_statistics(struct afs_info *old_afsi,
416 struct afs_info *new_afsi)
419 int ret = get_num_admissible_files(&n);
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;
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;
437 static int add_to_score_table(const struct osl_row *aft_row)
440 struct afs_info afsi;
441 int ret = get_afsi_of_row(aft_row, &afsi);
445 score = compute_score(&afsi);
446 return score_add(aft_row, score);
449 static int delete_from_statistics_and_score_table(const struct osl_row *aft_row)
451 int ret = del_afs_statistics(aft_row);
454 return score_delete(aft_row);
458 * Delete one entry from the statistics and from the score table.
460 * \param aft_row The audio file which is no longer admissible.
462 * \return Positive on success, negative on errors.
464 * \sa \ref score_delete().
466 static int mood_delete_audio_file(const struct osl_row *aft_row)
470 ret = row_belongs_to_score_table(aft_row, NULL);
473 if (!ret) /* not admissible, nothing to do */
475 return delete_from_statistics_and_score_table(aft_row);
479 * Compute the new score of an audio file wrt. the current mood.
481 * \param aft_row Determines the audio file.
482 * \param old_afsi The audio file selector info before updating.
484 * The \a old_afsi argument may be \p NULL which indicates that no changes to
485 * the audio file info were made.
487 * \return Positive on success, negative on errors.
489 static int mood_update_audio_file(const struct osl_row *aft_row,
490 struct afs_info *old_afsi)
493 int ret, is_admissible, was_admissible = 0;
494 struct afs_info afsi;
498 return 1; /* nothing to do */
499 ret = row_belongs_to_score_table(aft_row, &rank);
502 was_admissible = ret;
503 ret = row_is_admissible(aft_row, current_mood);
506 is_admissible = (ret > 0);
507 if (!was_admissible && !is_admissible)
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);
515 return add_to_score_table(aft_row);
518 ret = get_afsi_of_row(aft_row, &afsi);
522 ret = update_afs_statistics(old_afsi, &afsi);
526 score = compute_score(&afsi);
527 PARA_DEBUG_LOG("score: %li\n", score);
528 percent = (score + 100) / 3;
531 else if (percent < 0)
533 PARA_DEBUG_LOG("moving from rank %u to %li%%\n", rank, percent);
534 return score_update(aft_row, percent);
537 /* sse: seconds since epoch. */
538 static void log_statistics(int64_t sse)
540 unsigned n = statistics.num;
541 int mean_days, sigma_days;
543 assert(current_mood);
544 PARA_NOTICE_LOG("loaded mood %s\n", current_mood->name?
545 current_mood->name : "(dummy)");
547 PARA_WARNING_LOG("no admissible files\n");
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);
566 * Close the current mood.
568 * Frees all resources of the current mood.
570 void close_current_mood(void)
572 destroy_mood(current_mood);
574 memset(&statistics, 0, sizeof(statistics));
575 statistics.normalization_divisor = 1;
578 static void compute_correction_factors(int64_t sse)
580 struct afs_statistics *s = &statistics;
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;
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;
597 * Change the current mood.
599 * \param mood_name The name of the mood to open.
600 * \param errmsg Error description is returned here.
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.
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.
608 * If there is already an open mood, it will be closed first.
610 * \return Positive on success, negative on errors. Loading the dummy mood
613 * \sa struct \ref afs_info::last_played, \ref mp_eval_row().
615 int change_current_mood(const char *mood_name, char **errmsg)
618 struct admissible_array aa = {
623 * We can not use the "now" pointer from sched.c here because we are
624 * called before schedule(), which initializes "now".
631 struct osl_object obj;
634 *errmsg = make_message("empty mood name");
635 return -ERRNO_TO_PARA_ERROR(EINVAL);
637 obj.data = (char *)mood_name;
638 obj.size = strlen(mood_name) + 1;
639 ret = osl(osl_get_row(moods_table, BLOBCOL_NAME, &obj, &row));
642 *errmsg = make_message("no such mood: %s",
646 ret = load_mood(row, &m, errmsg);
649 close_current_mood();
651 } else { /* load dummy mood */
652 close_current_mood();
653 current_mood = alloc_new_mood(NULL);
656 PARA_NOTICE_LOG("computing statistics of admissible files\n");
657 ret = audio_file_loop(&aa, add_if_admissible);
660 *errmsg = make_message("audio file loop failed");
663 clock_get_realtime(&rnow);
664 compute_correction_factors(rnow.tv_sec);
665 log_statistics(rnow.tv_sec);
666 for (i = 0; i < statistics.num; i++) {
667 ret = add_to_score_table(aa.array[i]);
670 *errmsg = make_message(
671 "could not add row to score table");
675 ret = statistics.num;
679 close_current_mood();
684 * Close and re-open the current mood.
686 * This function is called on events which render the current list of
687 * admissible files useless, for example if an attribute is removed from the
690 * If no mood is currently open, the function returns success.
692 static int reload_current_mood(void)
695 char *mood_name = NULL;
697 ret = clear_score_table();
702 PARA_NOTICE_LOG("reloading %s\n", current_mood->name?
703 current_mood->name : "(dummy)");
704 if (current_mood->name)
705 mood_name = para_strdup(current_mood->name);
706 close_current_mood();
707 ret = change_current_mood(mood_name, NULL);
713 * Notification callback for the moods table.
715 * \param event Type of the event just occurred.
717 * \param data Its type depends on the event.
719 * This function performs actions required due to the occurrence of the given
720 * event. Possible actions include reload of the current mood and update of the
721 * score of an audio file.
725 int moods_event_handler(enum afs_events event, __a_unused struct para_buffer *pb,
732 * The three blob events might change the set of admissible files,
733 * so we must reload the score list.
738 if (data == moods_table || data == playlists_table)
739 return 1; /* no reload necessary for these */
740 return reload_current_mood();
741 /* these also require reload of the score table */
743 case ATTRIBUTE_REMOVE:
744 case ATTRIBUTE_RENAME:
745 return reload_current_mood();
746 /* changes to the aft only require to re-examine the audio file */
748 struct afsi_change_event_data *aced = data;
749 return mood_update_audio_file(aced->aft_row, aced->old_afsi);
752 case AUDIO_FILE_RENAME:
754 return mood_update_audio_file(data, NULL);
755 case AUDIO_FILE_REMOVE:
756 return mood_delete_audio_file(data);