apps/tagtree.c

   1 /***************************************************************************
   2  *             __________               __   ___.
   3  *   Open      \______   \ ____   ____ |  | _\_ |__   _______  ___
   4  *   Source     |       _//  _ \_/ ___\|  |/ /| __ \ /  _ \  \/  /
   5  *   Jukebox    |    |   (  <_> )  \___|    < | \_\ (  <_> > <  <
   6  *   Firmware   |____|_  /\____/ \___  >__|_ \|___  /\____/__/\_ \
   7  *                     \/            \/     \/    \/            \/
   8  * $Id$
   9  *
  10  * Copyright (C) 2005 by Miika Pekkarinen
  11  *
  12  * All files in this archive are subject to the GNU General Public License.
  13  * See the file COPYING in the source tree root for full license agreement.
  14  *
  15  * This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
  16  * KIND, either express or implied.
  17  *
  18  ****************************************************************************/
  19
  20 /**
  21  * Basic structure on this file was copied from dbtree.c and modified to
  22  * support the tag cache interface.
  23  */
  24 #include <stdio.h>
  25 #include <string.h>
  26 #include <stdlib.h>
  27 #include "config.h"
  28 #include "system.h"
  29 #include "kernel.h"
  30 #include "splash.h"
  31 #include "icons.h"
  32 #include "tree.h"
  33 #include "action.h"
  34 #include "settings.h"
  35 #include "tagcache.h"
  36 #include "tagtree.h"
  37 #include "lang.h"
  38 #include "logf.h"
  39 #include "playlist.h"
  40 #include "keyboard.h"
  41 #include "gui/list.h"
  42 #include "buffer.h"
  43 #include "atoi.h"
  44 #include "playback.h"
  45 #include "yesno.h"
  46 #include "misc.h"
  47 #include "filetypes.h"
  48
  49 #define FILE_SEARCH_INSTRUCTIONS ROCKBOX_DIR "/tagnavi.config"
  50
  51 static int tagtree_play_folder(struct tree_context* c);
  52
  53 static char searchstring[128];
  54
  55 enum variables {
  56     var_sorttype = 100,
  57     var_limit,
  58     var_strip,
  59     var_menu_start,
  60     var_include,
  61     var_rootmenu,
  62     var_format,
  63     menu_next,
  64     menu_load,
  65 };
  66
  67 /* Capacity 10 000 entries (for example 10k different artists) */
  68 #define UNIQBUF_SIZE (64*1024)
  69 static long *uniqbuf;
  70
  71 #define MAX_TAGS 5
  72 #define MAX_MENU_ID_SIZE 32
  73
  74 static struct tagcache_search tcs, tcs2;
  75 static bool sort_inverse;
  76
  77 /*
  78  * "%3d. %s" autoscore title %sort = "inverse" %limit = "100"
  79  *
  80  * valid = true
  81  * formatstr = "%-3d. %s"
  82  * tags[0] = tag_autoscore
  83  * tags[1] = tag_title
  84  * tag_count = 2
  85  *
  86  * limit = 100
  87  * sort_inverse = true
  88  */
  89 struct display_format {
  90     char name[32];
  91     struct tagcache_search_clause *clause[TAGCACHE_MAX_CLAUSES];
  92     int clause_count;
  93     char *formatstr;
  94     int group_id;
  95     int tags[MAX_TAGS];
  96     int tag_count;
  97
  98     int limit;
  99     int strip;
 100     bool sort_inverse;
 101     bool sort;
 102 };
 103
 104 static struct display_format *formats[TAGMENU_MAX_FMTS];
 105 static int format_count;
 106
 107 struct search_instruction {
 108     char name[64];
 109     int tagorder[MAX_TAGS];
 110     int tagorder_count;
 111     struct tagcache_search_clause *clause[MAX_TAGS][TAGCACHE_MAX_CLAUSES];
 112     int format_id[MAX_TAGS];
 113     int clause_count[MAX_TAGS];
 114     int result_seek[MAX_TAGS];
 115 };
 116
 117 struct menu_entry {
 118     char name[64];
 119     int type;
 120     struct search_instruction *si;
 121     int link;
 122 };
 123
 124 struct root_menu {
 125     char title[64];
 126     char id[MAX_MENU_ID_SIZE];
 127     int itemcount;
 128     struct menu_entry *items[TAGMENU_MAX_ITEMS];
 129 };
 130
 131 /* Statusbar text of the current view. */
 132 static char current_title[MAX_TAGS][128];
 133
 134 static struct root_menu *menus[TAGMENU_MAX_MENUS];
 135 static struct root_menu *menu;
 136 static struct search_instruction *csi;
 137 static const char *strp;
 138 static int menu_count;
 139 static int root_menu;
 140
 141 static int current_offset;
 142 static int current_entry_count;
 143
 144 static int format_count;
 145 static struct tree_context *tc;
 146
 147 static int get_token_str(char *buf, int size)
 148 {
 149     /* Find the start. */
 150     while (*strp != '"' && *strp != '\0')
 151         strp++;
 152
 153     if (*strp == '\0' || *(++strp) == '\0')
 154         return -1;
 155
 156     /* Read the data. */
 157     while (*strp != '"' && *strp != '\0' && --size > 0)
 158         *(buf++) = *(strp++);
 159
 160     *buf = '\0';
 161     if (*strp != '"')
 162         return -2;
 163
 164     strp++;
 165
 166     return 0;
 167 }
 168
 169 #define MATCH(tag,str1,str2,settag) \
 170     if (!strcasecmp(str1, str2)) { \
 171         *tag = settag; \
 172         return 1; \
 173     }
 174
 175 static int get_tag(int *tag)
 176 {
 177     char buf[128];
 178     int i;
 179
 180     /* Find the start. */
 181     while ((*strp == ' ' || *strp == '>') && *strp != '\0')
 182         strp++;
 183
 184     if (*strp == '\0' || *strp == '?')
 185         return 0;
 186
 187     for (i = 0; i < (int)sizeof(buf)-1; i++)
 188     {
 189         if (*strp == '\0' || *strp == ' ')
 190             break ;
 191         buf[i] = *strp;
 192         strp++;
 193     }
 194     buf[i] = '\0';
 195
 196     MATCH(tag, buf, "album", tag_album);
 197     MATCH(tag, buf, "artist", tag_artist);
 198     MATCH(tag, buf, "bitrate", tag_bitrate);
 199     MATCH(tag, buf, "composer", tag_composer);
 200     MATCH(tag, buf, "comment", tag_comment);
 201     MATCH(tag, buf, "albumartist", tag_albumartist);
 202     MATCH(tag, buf, "ensemble", tag_albumartist);
 203     MATCH(tag, buf, "genre", tag_genre);
 204     MATCH(tag, buf, "length", tag_length);
 205     MATCH(tag, buf, "Lm", tag_virt_length_min);
 206     MATCH(tag, buf, "Ls", tag_virt_length_sec);
 207     MATCH(tag, buf, "Pm", tag_virt_playtime_min);
 208     MATCH(tag, buf, "Ps", tag_virt_playtime_sec);
 209     MATCH(tag, buf, "title", tag_title);
 210     MATCH(tag, buf, "filename", tag_filename);
 211     MATCH(tag, buf, "tracknum", tag_tracknumber);
 212     MATCH(tag, buf, "year", tag_year);
 213     MATCH(tag, buf, "playcount", tag_playcount);
 214     MATCH(tag, buf, "rating", tag_rating);
 215     MATCH(tag, buf, "lastplayed", tag_lastplayed);
 216     MATCH(tag, buf, "commitid", tag_commitid);
 217     MATCH(tag, buf, "entryage", tag_virt_entryage);
 218     MATCH(tag, buf, "autoscore", tag_virt_autoscore);
 219     MATCH(tag, buf, "%sort", var_sorttype);
 220     MATCH(tag, buf, "%limit", var_limit);
 221     MATCH(tag, buf, "%strip", var_strip);
 222     MATCH(tag, buf, "%menu_start", var_menu_start);
 223     MATCH(tag, buf, "%include", var_include);
 224     MATCH(tag, buf, "%root_menu", var_rootmenu);
 225     MATCH(tag, buf, "%format", var_format);
 226     MATCH(tag, buf, "->", menu_next);
 227     MATCH(tag, buf, "==>", menu_load);
 228
 229     logf("NO MATCH: %s\n", buf);
 230     if (buf[0] == '?')
 231         return 0;
 232
 233     return -1;
 234 }
 235
 236 static int get_clause(int *condition)
 237 {
 238     char buf[4];
 239     int i;
 240
 241     /* Find the start. */
 242     while (*strp == ' ' && *strp != '\0')
 243         strp++;
 244
 245     if (*strp == '\0')
 246         return 0;
 247
 248     for (i = 0; i < (int)sizeof(buf)-1; i++)
 249     {
 250         if (*strp == '\0' || *strp == ' ')
 251             break ;
 252         buf[i] = *strp;
 253         strp++;
 254     }
 255     buf[i] = '\0';
 256
 257     MATCH(condition, buf, "=", clause_is);
 258     MATCH(condition, buf, "==", clause_is);
 259     MATCH(condition, buf, "!=", clause_is_not);
 260     MATCH(condition, buf, ">", clause_gt);
 261     MATCH(condition, buf, ">=", clause_gteq);
 262     MATCH(condition, buf, "<", clause_lt);
 263     MATCH(condition, buf, "<=", clause_lteq);
 264     MATCH(condition, buf, "~", clause_contains);
 265     MATCH(condition, buf, "!~", clause_not_contains);
 266     MATCH(condition, buf, "^", clause_begins_with);
 267     MATCH(condition, buf, "!^", clause_not_begins_with);
 268     MATCH(condition, buf, "$", clause_ends_with);
 269     MATCH(condition, buf, "!$", clause_not_ends_with);
 270     MATCH(condition, buf, "@", clause_oneof);
 271
 272     return 0;
 273 }
 274
 275 static bool read_clause(struct tagcache_search_clause *clause)
 276 {
 277     char buf[256];
 278
 279     if (get_tag(&clause->tag) <= 0)
 280         return false;
 281
 282     if (get_clause(&clause->type) <= 0)
 283         return false;
 284
 285     if (get_token_str(buf, sizeof buf) < 0)
 286         return false;
 287
 288     clause->str = buffer_alloc(strlen(buf)+1);
 289     strcpy(clause->str, buf);
 290
 291     logf("got clause: %d/%d [%s]", clause->tag, clause->type, clause->str);
 292
 293     if (*(clause->str) == '\0')
 294         clause->input = true;
 295     else
 296         clause->input = false;
 297
 298     if (tagcache_is_numeric_tag(clause->tag))
 299     {
 300         clause->numeric = true;
 301         clause->numeric_data = atoi(clause->str);
 302     }
 303     else
 304         clause->numeric = false;
 305
 306     return true;
 307 }
 308
 309 static bool read_variable(char *buf, int size)
 310 {
 311     int condition;
 312
 313     if (!get_clause(&condition))
 314         return false;
 315
 316     if (condition != clause_is)
 317         return false;
 318
 319     if (get_token_str(buf, size) < 0)
 320         return false;
 321
 322     return true;
 323 }
 324
 325 /* "%3d. %s" autoscore title %sort = "inverse" %limit = "100" */
 326 static int get_format_str(struct display_format *fmt)
 327 {
 328     int ret;
 329     char buf[128];
 330     int i;
 331
 332     memset(fmt, 0, sizeof(struct display_format));
 333
 334     if (get_token_str(fmt->name, sizeof fmt->name) < 0)
 335         return -10;
 336
 337     /* Determine the group id */
 338     fmt->group_id = 0;
 339     for (i = 0; i < format_count; i++)
 340     {
 341         if (!strcasecmp(formats[i]->name, fmt->name))
 342         {
 343             fmt->group_id = formats[i]->group_id;
 344             break;
 345         }
 346
 347         if (formats[i]->group_id > fmt->group_id)
 348             fmt->group_id = formats[i]->group_id;
 349     }
 350
 351     if (i == format_count)
 352         fmt->group_id++;
 353
 354     logf("format: (%d) %s", fmt->group_id, fmt->name);
 355
 356     if (get_token_str(buf, sizeof buf) < 0)
 357         return -10;
 358
 359     fmt->formatstr = buffer_alloc(strlen(buf) + 1);
 360     strcpy(fmt->formatstr, buf);
 361
 362     while (fmt->tag_count < MAX_TAGS)
 363     {
 364         ret = get_tag(&fmt->tags[fmt->tag_count]);
 365         if (ret < 0)
 366             return -11;
 367
 368         if (ret == 0)
 369             break;
 370
 371         switch (fmt->tags[fmt->tag_count]) {
 372         case var_sorttype:
 373             if (!read_variable(buf, sizeof buf))
 374                 return -12;
 375             if (!strcasecmp("inverse", buf))
 376                 fmt->sort_inverse = true;
 377
 378             fmt->sort = true;
 379             break;
 380
 381         case var_limit:
 382             if (!read_variable(buf, sizeof buf))
 383                 return -13;
 384             fmt->limit = atoi(buf);
 385             break;
 386
 387         case var_strip:
 388             if (!read_variable(buf, sizeof buf))
 389                 return -14;
 390             fmt->strip = atoi(buf);
 391             break;
 392
 393         default:
 394             fmt->tag_count++;
 395         }
 396     }
 397
 398     return 1;
 399 }
 400
 401 static int add_format(const char *buf)
 402 {
 403     strp = buf;
 404
 405     if (formats[format_count] == NULL)
 406         formats[format_count] = buffer_alloc(sizeof(struct display_format));
 407
 408     memset(formats[format_count], 0, sizeof(struct display_format));
 409     if (get_format_str(formats[format_count]) < 0)
 410     {
 411         logf("get_format_str() parser failed!");
 412         return -4;
 413     }
 414
 415     while (*strp != '\0' && *strp != '?')
 416         strp++;
 417
 418     if (*strp == '?')
 419     {
 420         int clause_count = 0;
 421         strp++;
 422
 423         while (1)
 424         {
 425             if (clause_count >= TAGCACHE_MAX_CLAUSES)
 426             {
 427                 logf("too many clauses");
 428                 break;
 429             }
 430
 431             formats[format_count]->clause[clause_count] =
 432                 buffer_alloc(sizeof(struct tagcache_search_clause));
 433
 434             if (!read_clause(formats[format_count]->clause[clause_count]))
 435                 break;
 436
 437             clause_count++;
 438         }
 439
 440         formats[format_count]->clause_count = clause_count;
 441     }
 442
 443     format_count++;
 444
 445     return 1;
 446 }
 447
 448 static int get_condition(struct search_instruction *inst)
 449 {
 450     int clause_count;
 451     char buf[128];
 452
 453     switch (*strp)
 454     {
 455         case '=':
 456         {
 457             int i;
 458
 459             if (get_token_str(buf, sizeof buf) < 0)
 460                 return -1;
 461
 462             for (i = 0; i < format_count; i++)
 463             {
 464                 if (!strcasecmp(formats[i]->name, buf))
 465                     break;
 466             }
 467
 468             if (i == format_count)
 469             {
 470                 logf("format not found: %s", buf);
 471                 return -2;
 472             }
 473
 474             inst->format_id[inst->tagorder_count] = formats[i]->group_id;
 475             return 1;
 476         }
 477         case '?':
 478         case ' ':
 479         case '&':
 480             strp++;
 481             return 1;
 482         case '-':
 483         case '\0':
 484             return 0;
 485     }
 486
 487     clause_count = inst->clause_count[inst->tagorder_count];
 488     if (clause_count >= TAGCACHE_MAX_CLAUSES)
 489     {
 490         logf("Too many clauses");
 491         return false;
 492     }
 493
 494     inst->clause[inst->tagorder_count][clause_count] =
 495         buffer_alloc(sizeof(struct tagcache_search_clause));
 496
 497     if (!read_clause(inst->clause[inst->tagorder_count][clause_count]))
 498         return -1;
 499
 500     inst->clause_count[inst->tagorder_count]++;
 501
 502     return 1;
 503 }
 504
 505 /* example search:
 506  * "Best" artist ? year >= "2000" & title !^ "crap" & genre = "good genre" \
 507  *      : album  ? year >= "2000" : songs
 508  * ^  begins with
 509  * *  contains
 510  * $  ends with
 511  */
 512
 513 static bool parse_search(struct menu_entry *entry, const char *str)
 514 {
 515     int ret;
 516     int type;
 517     struct search_instruction *inst = entry->si;
 518     char buf[MAX_PATH];
 519     int i;
 520     struct root_menu *new_menu;
 521
 522     strp = str;
 523
 524     /* Parse entry name */
 525     if (get_token_str(entry->name, sizeof entry->name) < 0)
 526     {
 527         logf("No name found.");
 528         return false;
 529     }
 530
 531     /* Parse entry type */
 532     if (get_tag(&entry->type) <= 0)
 533         return false;
 534
 535     if (entry->type == menu_load)
 536     {
 537         if (get_token_str(buf, sizeof buf) < 0)
 538             return false;
 539
 540         /* Find the matching root menu or "create" it */
 541         for (i = 0; i < menu_count; i++)
 542         {
 543             if (!strcasecmp(menus[i]->id, buf))
 544             {
 545                 entry->link = i;
 546                 return true;
 547             }
 548         }
 549
 550         if (menu_count >= TAGMENU_MAX_MENUS)
 551         {
 552             logf("max menucount reached");
 553             return false;
 554         }
 555
 556         /* Allocate a new menu unless link is found. */
 557         menus[menu_count] = buffer_alloc(sizeof(struct root_menu));
 558         new_menu = menus[menu_count];
 559         memset(new_menu, 0, sizeof(struct root_menu));
 560         strncpy(new_menu->id, buf, MAX_MENU_ID_SIZE-1);
 561         entry->link = menu_count;
 562         ++menu_count;
 563
 564         return true;
 565     }
 566
 567     if (entry->type != menu_next)
 568         return false;
 569
 570     while (inst->tagorder_count < MAX_TAGS)
 571     {
 572         ret = get_tag(&inst->tagorder[inst->tagorder_count]);
 573         if (ret < 0)
 574         {
 575             logf("Parse error #1");
 576             logf("%s", strp);
 577             return false;
 578         }
 579
 580         if (ret == 0)
 581             break ;
 582
 583         logf("tag: %d", inst->tagorder[inst->tagorder_count]);
 584
 585         while ( (ret = get_condition(inst)) > 0 ) ;
 586         if (ret < 0)
 587             return false;
 588
 589         inst->tagorder_count++;
 590
 591         if (get_tag(&type) <= 0 || type != menu_next)
 592             break;
 593     }
 594
 595     return true;
 596 }
 597
 598 static int compare(const void *p1, const void *p2)
 599 {
 600     struct tagentry *e1 = (struct tagentry *)p1;
 601     struct tagentry *e2 = (struct tagentry *)p2;
 602
 603     if (sort_inverse)
 604         return strncasecmp(e2->name, e1->name, MAX_PATH);
 605
 606     return strncasecmp(e1->name, e2->name, MAX_PATH);
 607 }
 608
 609 static void tagtree_buffer_event(struct mp3entry *id3, bool last_track)
 610 {
 611     (void)id3;
 612     (void)last_track;
 613
 614     /* Do not gather data unless proper setting has been enabled. */
 615     if (!global_settings.runtimedb)
 616         return;
 617
 618     logf("be:%d%s", last_track, id3->path);
 619
 620     if (!tagcache_find_index(&tcs, id3->path))
 621     {
 622         logf("tc stat: not found: %s", id3->path);
 623         return;
 624     }
 625
 626     id3->playcount  = tagcache_get_numeric(&tcs, tag_playcount);
 627     if(!id3->rating) id3->rating = tagcache_get_numeric(&tcs, tag_rating);
 628     id3->lastplayed = tagcache_get_numeric(&tcs, tag_lastplayed);
 629     id3->score      = tagcache_get_numeric(&tcs, tag_virt_autoscore) / 10;
 630
 631     tagcache_search_finish(&tcs);
 632 }
 633
 634 static void tagtree_unbuffer_event(struct mp3entry *id3, bool last_track)
 635 {
 636     (void)last_track;
 637     long playcount;
 638     long rating;
 639     long playtime;
 640     long lastplayed;
 641
 642     /* Do not gather data unless proper setting has been enabled. */
 643     if (!global_settings.runtimedb)
 644     {
 645         logf("runtimedb gathering not enabled");
 646         return;
 647     }
 648
 649     /* Don't process unplayed tracks. */
 650     if (id3->elapsed == 0)
 651     {
 652         logf("not logging unplayed track");
 653         return;
 654     }
 655
 656     if (!tagcache_find_index(&tcs, id3->path))
 657     {
 658         logf("tc stat: not found: %s", id3->path);
 659         return;
 660     }
 661
 662     playcount  = tagcache_get_numeric(&tcs, tag_playcount);
 663     playtime   = tagcache_get_numeric(&tcs, tag_playtime);
 664     lastplayed = tagcache_get_numeric(&tcs, tag_lastplayed);
 665
 666     playcount++;
 667
 668     rating   = (long) id3->rating;
 669
 670     lastplayed = tagcache_increase_serial();
 671     if (lastplayed < 0)
 672     {
 673         logf("incorrect tc serial:%ld", lastplayed);
 674         tagcache_search_finish(&tcs);
 675         return;
 676     }
 677
 678     /* Ignore the last 15s (crossfade etc.) */
 679     playtime += MIN(id3->length, id3->elapsed + 15 * 1000);
 680
 681     logf("ube:%s", id3->path);
 682     logf("-> %d/%ld/%ld/%ld", last_track, playcount, rating, playtime);
 683     logf("-> %ld/%ld/%ld", id3->elapsed, id3->length, MIN(id3->length, id3->elapsed + 15 * 1000));
 684
 685     /* lastplayed not yet supported. */
 686
 687     if (!tagcache_modify_numeric_entry(&tcs, tag_playcount, playcount)
 688         || !tagcache_modify_numeric_entry(&tcs, tag_rating, rating)
 689         || !tagcache_modify_numeric_entry(&tcs, tag_playtime, playtime)
 690         || !tagcache_modify_numeric_entry(&tcs, tag_lastplayed, lastplayed))
 691     {
 692         logf("tc stat: modify failed!");
 693         tagcache_search_finish(&tcs);
 694         return;
 695     }
 696
 697     tagcache_search_finish(&tcs);
 698 }
 699
 700 bool tagtree_export(void)
 701 {
 702     gui_syncsplash(0, str(LANG_CREATING));
 703     if (!tagcache_create_changelog(&tcs))
 704     {
 705         gui_syncsplash(HZ*2, str(LANG_FAILED));
 706     }
 707
 708     return false;
 709 }
 710
 711 bool tagtree_import(void)
 712 {
 713     gui_syncsplash(0, str(LANG_WAIT));
 714     if (!tagcache_import_changelog())
 715     {
 716         gui_syncsplash(HZ*2, str(LANG_FAILED));
 717     }
 718
 719     return false;
 720 }
 721
 722 static bool parse_menu(const char *filename);
 723
 724 static int parse_line(int n, const char *buf, void *parameters)
 725 {
 726     char data[256];
 727     int variable;
 728     static bool read_menu;
 729     int i;
 730
 731     (void)parameters;
 732
 733     logf("parse:%d/%s", n, buf);
 734
 735     /* First line, do initialisation. */
 736     if (n == 0)
 737     {
 738         if (strcasecmp(TAGNAVI_VERSION, buf))
 739         {
 740             logf("Version mismatch");
 741             return -1;
 742         }
 743
 744         read_menu = false;
 745     }
 746
 747     if (buf[0] == '#')
 748         return 0;
 749
 750     if (buf[0] == '\0')
 751     {
 752         if (read_menu)
 753         {
 754             /* End the menu */
 755             read_menu = false;
 756         }
 757         return 0;
 758     }
 759
 760     if (!read_menu)
 761     {
 762         strp = buf;
 763         if (get_tag(&variable) <= 0)
 764             return 0;
 765
 766         switch (variable)
 767         {
 768             case var_format:
 769                 if (add_format(strp) < 0)
 770                 {
 771                     logf("Format add fail: %s", data);
 772                 }
 773                 break;
 774
 775             case var_include:
 776                 if (get_token_str(data, sizeof(data)) < 0)
 777                 {
 778                     logf("%%include empty");
 779                     return 0;
 780                 }
 781
 782                 if (!parse_menu(data))
 783                 {
 784                     logf("Load menu fail: %s", data);
 785                 }
 786                 break;
 787
 788             case var_menu_start:
 789                 if (menu_count >= TAGMENU_MAX_MENUS)
 790                 {
 791                     logf("max menucount reached");
 792                     return 0;
 793                 }
 794
 795                 if (get_token_str(data, sizeof data) < 0)
 796                 {
 797                     logf("%%menu_start id empty");
 798                     return 0;
 799                 }
 800
 801                 menu = NULL;
 802                 for (i = 0; i < menu_count; i++)
 803                 {
 804                     if (!strcasecmp(menus[i]->id, data))
 805                     {
 806                         menu = menus[i];
 807                     }
 808                 }
 809
 810                 if (menu == NULL)
 811                 {
 812                     menus[menu_count] = buffer_alloc(sizeof(struct root_menu));
 813                     menu = menus[menu_count];
 814                     ++menu_count;
 815                     memset(menu, 0, sizeof(struct root_menu));
 816                     strncpy(menu->id, data, MAX_MENU_ID_SIZE-1);
 817                 }
 818
 819                 if (get_token_str(menu->title, sizeof(menu->title)) < 0)
 820                 {
 821                     logf("%%menu_start title empty");
 822                     return 0;
 823                 }
 824                 logf("menu: %s", menu->title);
 825                 read_menu = true;
 826                 break;
 827
 828             case var_rootmenu:
 829                 /* Only set root menu once. */
 830                 if (root_menu >= 0)
 831                     break;
 832
 833                 if (get_token_str(data, sizeof(data)) < 0)
 834                 {
 835                     logf("%%root_menu empty");
 836                     return 0;
 837                 }
 838
 839                 for (i = 0; i < menu_count; i++)
 840                 {
 841                     if (!strcasecmp(menus[i]->id, data))
 842                     {
 843                         root_menu = i;
 844                     }
 845                 }
 846                 break;
 847         }
 848
 849         return 0;
 850     }
 851
 852     if (menu->itemcount >= TAGMENU_MAX_ITEMS)
 853     {
 854         logf("max itemcount reached");
 855         return 0;
 856     }
 857
 858     /* Allocate */
 859     if (menu->items[menu->itemcount] == NULL)
 860     {
 861         menu->items[menu->itemcount] = buffer_alloc(sizeof(struct menu_entry));
 862         memset(menu->items[menu->itemcount], 0, sizeof(struct menu_entry));
 863         menu->items[menu->itemcount]->si = buffer_alloc(sizeof(struct search_instruction));
 864     }
 865
 866     memset(menu->items[menu->itemcount]->si, 0, sizeof(struct search_instruction));
 867     if (!parse_search(menu->items[menu->itemcount], buf))
 868         return 0;
 869
 870     menu->itemcount++;
 871
 872     return 0;
 873 }
 874
 875 static bool parse_menu(const char *filename)
 876 {
 877     int fd;
 878     char buf[1024];
 879
 880     if (menu_count >= TAGMENU_MAX_MENUS)
 881     {
 882         logf("max menucount reached");
 883         return false;
 884     }
 885
 886     fd = open(filename, O_RDONLY);
 887     if (fd < 0)
 888     {
 889         logf("Search instruction file not found.");
 890         return false;
 891     }
 892
 893     /* Now read file for real, parsing into si */
 894     fast_readline(fd, buf, sizeof buf, NULL, parse_line);
 895     close(fd);
 896
 897     return true;
 898 }
 899
 900 void tagtree_init(void)
 901 {
 902     format_count = 0;
 903     menu_count = 0;
 904     menu = NULL;
 905     root_menu = -1;
 906     parse_menu(FILE_SEARCH_INSTRUCTIONS);
 907
 908     /* If no root menu is set, assume it's the first single menu
 909      * we have. That shouldn't normally happen. */
 910     if (root_menu < 0)
 911         root_menu = 0;
 912
 913     uniqbuf = buffer_alloc(UNIQBUF_SIZE);
 914     audio_set_track_buffer_event(tagtree_buffer_event);
 915     audio_set_track_unbuffer_event(tagtree_unbuffer_event);
 916 }
 917
 918 static bool show_search_progress(bool init, int count)
 919 {
 920     static int last_tick = 0;
 921
 922     if (init)
 923     {
 924         last_tick = current_tick;
 925         return true;
 926     }
 927
 928     if (current_tick - last_tick > HZ/4)
 929     {
 930         gui_syncsplash(0, str(LANG_PLAYLIST_SEARCH_MSG), count,
 931 #if CONFIG_KEYPAD == PLAYER_PAD
 932                        str(LANG_STOP_ABORT)
 933 #else
 934                        str(LANG_OFF_ABORT)
 935 #endif
 936                        );
 937         if (action_userabort(TIMEOUT_NOBLOCK))
 938             return false;
 939         last_tick = current_tick;
 940         yield();
 941     }
 942
 943     return true;
 944 }
 945
 946 static int format_str(struct tagcache_search *tcs, struct display_format *fmt,
 947                       char *buf, int buf_size)
 948 {
 949     char fmtbuf[8];
 950     bool read_format = false;
 951     int fmtbuf_pos = 0;
 952     int parpos = 0;
 953     int buf_pos = 0;
 954     int i;
 955
 956     memset(buf, 0, buf_size);
 957     for (i = 0; fmt->formatstr[i] != '\0'; i++)
 958     {
 959         if (fmt->formatstr[i] == '%')
 960         {
 961             read_format = true;
 962             fmtbuf_pos = 0;
 963             if (parpos >= fmt->tag_count)
 964             {
 965                 logf("too many format tags");
 966                 return -1;
 967             }
 968         }
 969
 970         if (read_format)
 971         {
 972             fmtbuf[fmtbuf_pos++] = fmt->formatstr[i];
 973             if (fmtbuf_pos >= buf_size)
 974             {
 975                 logf("format parse error");
 976                 return -2;
 977             }
 978
 979             if (fmt->formatstr[i] == 's')
 980             {
 981                 fmtbuf[fmtbuf_pos] = '\0';
 982                 read_format = false;
 983                 if (fmt->tags[parpos] == tcs->type)
 984                 {
 985                     snprintf(&buf[buf_pos], buf_size - buf_pos, fmtbuf, tcs->result);
 986                 }
 987                 else
 988                 {
 989                     /* Need to fetch the tag data. */
 990                     if (!tagcache_retrieve(tcs, tcs->idx_id, fmt->tags[parpos],
 991                                            &buf[buf_pos], buf_size - buf_pos))
 992                     {
 993                         logf("retrieve failed");
 994                         return -3;
 995                     }
 996                 }
 997                 buf_pos += strlen(&buf[buf_pos]);
 998                 parpos++;
 999             }
1000             else if (fmt->formatstr[i] == 'd')
1001             {
1002                 fmtbuf[fmtbuf_pos] = '\0';
1003                 read_format = false;
1004                 snprintf(&buf[buf_pos], buf_size - buf_pos, fmtbuf,
1005                          tagcache_get_numeric(tcs, fmt->tags[parpos]));
1006                 buf_pos += strlen(&buf[buf_pos]);
1007                 parpos++;
1008             }
1009             continue;
1010         }
1011
1012         buf[buf_pos++] = fmt->formatstr[i];
1013
1014         if (buf_pos - 1 >= buf_size)
1015         {
1016             logf("buffer overflow");
1017             return -4;
1018         }
1019     }
1020
1021     buf[buf_pos++] = '\0';
1022
1023     return 0;
1024 }
1025
1026 static int retrieve_entries(struct tree_context *c, struct tagcache_search *tcs,
1027                             int offset, bool init)
1028 {
1029     struct tagentry *dptr = (struct tagentry *)c->dircache;
1030     struct display_format *fmt;
1031     int i;
1032     int namebufused = 0;
1033     int total_count = 0;
1034     int special_entry_count = 0;
1035     int level = c->currextra;
1036     int tag;
1037     bool sort = false;
1038     int sort_limit;
1039     int strip;
1040
1041     if (init
1042 #ifdef HAVE_TC_RAMCACHE
1043         && !tagcache_is_ramcache()
1044 #endif
1045         )
1046     {
1047         show_search_progress(true, 0);
1048         gui_syncsplash(0, str(LANG_PLAYLIST_SEARCH_MSG),
1049                        0, csi->name);
1050     }
1051
1052     if (c->currtable == allsubentries)
1053     {
1054         tag = tag_title;
1055         level--;
1056     }
1057     else
1058         tag = csi->tagorder[level];
1059
1060     if (!tagcache_search(tcs, tag))
1061         return -1;
1062
1063     /* Prevent duplicate entries in the search list. */
1064     tagcache_search_set_uniqbuf(tcs, uniqbuf, UNIQBUF_SIZE);
1065
1066     if (level || csi->clause_count[0] || tagcache_is_numeric_tag(tag))
1067         sort = true;
1068
1069     for (i = 0; i < level; i++)
1070     {
1071         if (tagcache_is_numeric_tag(csi->tagorder[i]))
1072         {
1073             static struct tagcache_search_clause cc;
1074
1075             memset(&cc, 0, sizeof(struct tagcache_search_clause));
1076             cc.tag = csi->tagorder[i];
1077             cc.type = clause_is;
1078             cc.numeric = true;
1079             cc.numeric_data = csi->result_seek[i];
1080             tagcache_search_add_clause(tcs, &cc);
1081         }
1082         else
1083         {
1084             tagcache_search_add_filter(tcs, csi->tagorder[i],
1085                                        csi->result_seek[i]);
1086         }
1087     }
1088
1089     for (i = 0; i <= level; i++)
1090     {
1091         int j;
1092
1093         for (j = 0; j < csi->clause_count[i]; j++)
1094             tagcache_search_add_clause(tcs, csi->clause[i][j]);
1095     }
1096
1097     current_offset = offset;
1098     current_entry_count = 0;
1099     c->dirfull = false;
1100
1101     fmt = NULL;
1102     for (i = 0; i < format_count; i++)
1103     {
1104         if (formats[i]->group_id == csi->format_id[level])
1105             fmt = formats[i];
1106     }
1107
1108     if (fmt)
1109     {
1110         sort_inverse = fmt->sort_inverse;
1111         sort_limit = fmt->limit;
1112         strip = fmt->strip;
1113
1114         /* Check if sorting is forced. */
1115         if (fmt->sort)
1116             sort = true;
1117     }
1118     else
1119     {
1120         sort_inverse = false;
1121         sort_limit = 0;
1122         strip = 0;
1123     }
1124
1125     if (tag != tag_title && tag != tag_filename)
1126     {
1127         if (offset == 0)
1128         {
1129             dptr->newtable = allsubentries;
1130             dptr->name = str(LANG_TAGNAVI_ALL_TRACKS);
1131             dptr++;
1132             current_entry_count++;
1133         }
1134         special_entry_count++;
1135     }
1136
1137     total_count += special_entry_count;
1138
1139     while (tagcache_get_next(tcs))
1140     {
1141         if (total_count++ < offset)
1142             continue;
1143
1144         dptr->newtable = navibrowse;
1145         if (tag == tag_title || tag == tag_filename)
1146         {
1147             dptr->newtable = playtrack;
1148             dptr->extraseek = tcs->idx_id;
1149         }
1150         else
1151             dptr->extraseek = tcs->result_seek;
1152
1153         fmt = NULL;
1154         /* Check the format */
1155         for (i = 0; i < format_count; i++)
1156         {
1157             if (formats[i]->group_id != csi->format_id[level])
1158                 continue;
1159
1160             if (tagcache_check_clauses(tcs, formats[i]->clause,
1161                                        formats[i]->clause_count))
1162             {
1163                 fmt = formats[i];
1164                 break;
1165             }
1166         }
1167
1168         if (!tcs->ramresult || fmt)
1169         {
1170             char buf[MAX_PATH];
1171
1172             if (fmt)
1173             {
1174                 if (format_str(tcs, fmt, buf, sizeof buf) < 0)
1175                 {
1176                     logf("format_str() failed");
1177                     return 0;
1178                 }
1179             }
1180
1181             dptr->name = &c->name_buffer[namebufused];
1182             if (fmt)
1183                 namebufused += strlen(buf)+1;
1184             else
1185                 namebufused += tcs->result_len;
1186
1187             if (namebufused >= c->name_buffer_size)
1188             {
1189                 logf("chunk mode #2: %d", current_entry_count);
1190                 c->dirfull = true;
1191                 sort = false;
1192                 break ;
1193             }
1194             if (fmt)
1195                 strcpy(dptr->name, buf);
1196             else
1197                 strcpy(dptr->name, tcs->result);
1198         }
1199         else
1200             dptr->name = tcs->result;
1201
1202         dptr++;
1203         current_entry_count++;
1204
1205         if (current_entry_count >= global_settings.max_files_in_dir)
1206         {
1207             logf("chunk mode #3: %d", current_entry_count);
1208             c->dirfull = true;
1209             sort = false;
1210             break ;
1211         }
1212
1213         if (init && !tcs->ramsearch)
1214         {
1215             if (!show_search_progress(false, i))
1216             {
1217                 tagcache_search_finish(tcs);
1218                 return current_entry_count;
1219             }
1220         }
1221     }
1222
1223     if (sort)
1224         qsort(c->dircache + special_entry_count * c->dentry_size,
1225               current_entry_count - special_entry_count,
1226               c->dentry_size, compare);
1227
1228     if (!init)
1229     {
1230         tagcache_search_finish(tcs);
1231         return current_entry_count;
1232     }
1233
1234     while (tagcache_get_next(tcs))
1235     {
1236         if (!tcs->ramsearch)
1237         {
1238             if (!show_search_progress(false, total_count))
1239                 break;
1240         }
1241         total_count++;
1242     }
1243
1244     tagcache_search_finish(tcs);
1245
1246     if (!sort && (sort_inverse || sort_limit))
1247     {
1248         gui_syncsplash(HZ*4, str(LANG_SHOWDIR_BUFFER_FULL), total_count);
1249         logf("Too small dir buffer");
1250         return 0;
1251     }
1252
1253     if (sort_limit)
1254         total_count = MIN(total_count, sort_limit);
1255
1256     if (strip)
1257     {
1258         dptr = c->dircache;
1259         for (i = 0; i < total_count; i++, dptr++)
1260         {
1261             int len = strlen(dptr->name);
1262
1263             if (len < strip)
1264                 continue;
1265
1266             dptr->name = &dptr->name[strip];
1267         }
1268     }
1269
1270     return total_count;
1271 }
1272
1273 static int load_root(struct tree_context *c)
1274 {
1275     struct tagentry *dptr = (struct tagentry *)c->dircache;
1276     int i;
1277
1278     tc = c;
1279     c->currtable = root;
1280     if (c->dirlevel == 0)
1281         c->currextra = root_menu;
1282
1283     menu = menus[c->currextra];
1284     if (menu == NULL)
1285         return 0;
1286
1287     for (i = 0; i < menu->itemcount; i++)
1288     {
1289         dptr->name = menu->items[i]->name;
1290         switch (menu->items[i]->type)
1291         {
1292             case menu_next:
1293                 dptr->newtable = navibrowse;
1294                 dptr->extraseek = i;
1295                 break;
1296
1297             case menu_load:
1298                 dptr->newtable = root;
1299                 dptr->extraseek = menu->items[i]->link;
1300                 break;
1301         }
1302
1303         dptr++;
1304     }
1305
1306     current_offset = 0;
1307     current_entry_count = i;
1308
1309     return i;
1310 }
1311
1312 int tagtree_load(struct tree_context* c)
1313 {
1314     int count;
1315     int table = c->currtable;
1316
1317     c->dentry_size = sizeof(struct tagentry);
1318     c->dirsindir = 0;
1319
1320     if (!table)
1321     {
1322         c->dirfull = false;
1323         table = root;
1324         c->currtable = table;
1325         c->currextra = root_menu;
1326     }
1327
1328     switch (table)
1329     {
1330         case root:
1331             count = load_root(c);
1332             break;
1333
1334         case allsubentries:
1335         case navibrowse:
1336             logf("navibrowse...");
1337             cpu_boost(true);
1338             count = retrieve_entries(c, &tcs, 0, true);
1339             cpu_boost(false);
1340             break;
1341
1342         default:
1343             logf("Unsupported table %d\n", table);
1344             return -1;
1345     }
1346
1347     if (count < 0)
1348     {
1349         c->dirlevel = 0;
1350         count = load_root(c);
1351         gui_syncsplash(HZ, str(LANG_TAGCACHE_BUSY));
1352     }
1353
1354     /* The _total_ numer of entries available. */
1355     c->dirlength = c->filesindir = count;
1356
1357     return count;
1358 }
1359
1360 int tagtree_enter(struct tree_context* c)
1361 {
1362     int rc = 0;
1363     struct tagentry *dptr;
1364     int newextra;
1365     int seek;
1366
1367     dptr = tagtree_get_entry(c, c->selected_item);
1368
1369     c->dirfull = false;
1370     newextra = dptr->newtable;
1371     seek = dptr->extraseek;
1372
1373     if (c->dirlevel >= MAX_DIR_LEVELS)
1374         return 0;
1375
1376     c->selected_item_history[c->dirlevel]=c->selected_item;
1377     c->table_history[c->dirlevel] = c->currtable;
1378     c->extra_history[c->dirlevel] = c->currextra;
1379     c->pos_history[c->dirlevel] = c->firstpos;
1380     c->dirlevel++;
1381
1382     switch (c->currtable) {
1383         case root:
1384             c->currextra = newextra;
1385
1386             if (newextra == root)
1387             {
1388                 menu = menus[seek];
1389                 c->currextra = seek;
1390             }
1391
1392             else if (newextra == navibrowse)
1393             {
1394                 int i, j;
1395
1396                 csi = menu->items[seek]->si;
1397                 c->currextra = 0;
1398
1399                 strncpy(current_title[c->currextra], dptr->name,
1400                         sizeof(current_title[0]) - 1);
1401
1402                 /* Read input as necessary. */
1403                 for (i = 0; i < csi->tagorder_count; i++)
1404                 {
1405                     for (j = 0; j < csi->clause_count[i]; j++)
1406                     {
1407                         if (!csi->clause[i][j]->input)
1408                             continue;
1409
1410                         rc = kbd_input(searchstring, sizeof(searchstring));
1411                         if (rc == -1 || !searchstring[0])
1412                         {
1413                             tagtree_exit(c);
1414                             return 0;
1415                         }
1416
1417                         if (csi->clause[i][j]->numeric)
1418                             csi->clause[i][j]->numeric_data = atoi(searchstring);
1419                         else
1420                             csi->clause[i][j]->str = searchstring;
1421                     }
1422                 }
1423             }
1424             c->currtable = newextra;
1425
1426             break;
1427
1428         case navibrowse:
1429         case allsubentries:
1430             if (newextra == playtrack)
1431             {
1432                 c->dirlevel--;
1433                 /* about to create a new current playlist...
1434                  allow user to cancel the operation */
1435                 if (global_settings.warnon_erase_dynplaylist &&
1436                     !global_settings.party_mode &&
1437                     playlist_modified(NULL))
1438                 {
1439                     char *lines[]={str(LANG_WARN_ERASEDYNPLAYLIST_PROMPT)};
1440                     struct text_message message={lines, 1};
1441
1442                     if (gui_syncyesno_run(&message, NULL, NULL) != YESNO_YES)
1443                         break;
1444                 }
1445
1446                 if (tagtree_play_folder(c) >= 0)
1447                     rc = 2;
1448                 break;
1449             }
1450
1451             c->currtable = newextra;
1452             csi->result_seek[c->currextra] = seek;
1453             if (c->currextra < csi->tagorder_count-1)
1454                 c->currextra++;
1455             else
1456                 c->dirlevel--;
1457
1458             /* Update the statusbar title */
1459             strncpy(current_title[c->currextra], dptr->name,
1460                     sizeof(current_title[0]) - 1);
1461             break;
1462
1463         default:
1464             c->dirlevel--;
1465             break;
1466     }
1467
1468     c->selected_item=0;
1469     gui_synclist_select_item(&tree_lists, c->selected_item);
1470
1471     return rc;
1472 }
1473
1474 void tagtree_exit(struct tree_context* c)
1475 {
1476     c->dirfull = false;
1477     if (c->dirlevel > 0)
1478         c->dirlevel--;
1479     c->selected_item=c->selected_item_history[c->dirlevel];
1480     gui_synclist_select_item(&tree_lists, c->selected_item);
1481     c->currtable = c->table_history[c->dirlevel];
1482     c->currextra = c->extra_history[c->dirlevel];
1483     c->firstpos  = c->pos_history[c->dirlevel];
1484 }
1485
1486 int tagtree_get_filename(struct tree_context* c, char *buf, int buflen)
1487 {
1488     struct tagentry *entry;
1489
1490     entry = tagtree_get_entry(c, c->selected_item);
1491
1492     if (!tagcache_search(&tcs, tag_filename))
1493         return -1;
1494
1495     if (!tagcache_retrieve(&tcs, entry->extraseek, tcs.type, buf, buflen))
1496     {
1497         tagcache_search_finish(&tcs);
1498         return -2;
1499     }
1500
1501     tagcache_search_finish(&tcs);
1502
1503     return 0;
1504 }
1505
1506 static bool insert_all_playlist(struct tree_context *c, int position, bool queue)
1507 {
1508     int i;
1509     char buf[MAX_PATH];
1510     int from, to, direction;
1511     int files_left = c->filesindir;
1512
1513     cpu_boost(true);
1514     if (!tagcache_search(&tcs, tag_filename))
1515     {
1516         gui_syncsplash(HZ, str(LANG_TAGCACHE_BUSY));
1517         cpu_boost(false);
1518         return false;
1519     }
1520
1521     if (position == PLAYLIST_REPLACE)
1522     {
1523         if (remove_all_tracks(NULL) == 0)
1524             position = PLAYLIST_INSERT_LAST;
1525         else return -1;    }
1526
1527     if (position == PLAYLIST_INSERT_FIRST)
1528     {
1529         from = c->filesindir - 1;
1530         to = -1;
1531         direction = -1;
1532     }
1533     else
1534     {
1535         from = 0;
1536         to = c->filesindir;
1537         direction = 1;
1538     }
1539
1540     for (i = from; i != to; i += direction)
1541     {
1542         /* Count back to zero */
1543         if (!show_search_progress(false, files_left--))
1544             break;
1545
1546         if (!tagcache_retrieve(&tcs, tagtree_get_entry(c, i)->extraseek,
1547                                tcs.type, buf, sizeof buf))
1548         {
1549             continue;
1550         }
1551
1552         if (playlist_insert_track(NULL, buf, position, queue, false) < 0)
1553         {
1554             logf("playlist_insert_track failed");
1555             break;
1556         }
1557         yield();
1558     }
1559     playlist_sync(NULL);
1560     tagcache_search_finish(&tcs);
1561     cpu_boost(false);
1562
1563     return true;
1564 }
1565
1566 bool tagtree_insert_selection_playlist(int position, bool queue)
1567 {
1568     struct tagentry *dptr;
1569     char buf[MAX_PATH];
1570     int dirlevel = tc->dirlevel;
1571
1572     /* We need to set the table to allsubentries. */
1573     show_search_progress(true, 0);
1574
1575     dptr = tagtree_get_entry(tc, tc->selected_item);
1576
1577     /* Insert a single track? */
1578     if (dptr->newtable == playtrack)
1579     {
1580         if (tagtree_get_filename(tc, buf, sizeof buf) < 0)
1581         {
1582             logf("tagtree_get_filename failed");
1583             return false;
1584         }
1585         playlist_insert_track(NULL, buf, position, queue, true);
1586
1587         return true;
1588     }
1589
1590     if (dptr->newtable == navibrowse)
1591     {
1592         tagtree_enter(tc);
1593         tagtree_load(tc);
1594         dptr = tagtree_get_entry(tc, tc->selected_item);
1595     }
1596     else if (dptr->newtable != allsubentries)
1597     {
1598         logf("unsupported table: %d", dptr->newtable);
1599         return false;
1600     }
1601
1602     /* Now the current table should be allsubentries. */
1603     if (dptr->newtable != playtrack)
1604     {
1605         tagtree_enter(tc);
1606         tagtree_load(tc);
1607         dptr = tagtree_get_entry(tc, tc->selected_item);
1608
1609         /* And now the newtable should be playtrack. */
1610         if (dptr->newtable != playtrack)
1611         {
1612             logf("newtable: %d !!", dptr->newtable);
1613             tc->dirlevel = dirlevel;
1614             return false;
1615         }
1616     }
1617
1618     if (tc->filesindir <= 0)
1619         gui_syncsplash(HZ, str(LANG_END_PLAYLIST_PLAYER));
1620     else
1621     {
1622         logf("insert_all_playlist");
1623         if (!insert_all_playlist(tc, position, queue))
1624             gui_syncsplash(HZ*2, str(LANG_FAILED));
1625     }
1626
1627     /* Finally return the dirlevel to its original value. */
1628     while (tc->dirlevel > dirlevel)
1629         tagtree_exit(tc);
1630     tagtree_load(tc);
1631
1632     return true;
1633 }
1634
1635 static int tagtree_play_folder(struct tree_context* c)
1636 {
1637     if (playlist_create(NULL, NULL) < 0)
1638     {
1639         logf("Failed creating playlist\n");
1640         return -1;
1641     }
1642
1643     if (!insert_all_playlist(c, PLAYLIST_INSERT_LAST, false))
1644         return -2;
1645
1646     if (global_settings.playlist_shuffle)
1647         c->selected_item = playlist_shuffle(current_tick, c->selected_item);
1648     if (!global_settings.play_selected)
1649         c->selected_item = 0;
1650     gui_synclist_select_item(&tree_lists, c->selected_item);
1651
1652     playlist_start(c->selected_item,0);
1653
1654     return 0;
1655 }
1656
1657 struct tagentry* tagtree_get_entry(struct tree_context *c, int id)
1658 {
1659     struct tagentry *entry = (struct tagentry *)c->dircache;
1660     int realid = id - current_offset;
1661
1662     /* Load the next chunk if necessary. */
1663     if (realid >= current_entry_count || realid < 0)
1664     {
1665         cpu_boost(true);
1666         if (retrieve_entries(c, &tcs2, MAX(0, id - (current_entry_count / 2)),
1667                              false) < 0)
1668         {
1669             logf("retrieve failed");
1670             cpu_boost(false);
1671             return NULL;
1672         }
1673         realid = id - current_offset;
1674         cpu_boost(false);
1675     }
1676
1677     return &entry[realid];
1678 }
1679
1680 char *tagtree_get_title(struct tree_context* c)
1681 {
1682     switch (c->currtable)
1683     {
1684         case root:
1685             return menu->title;
1686
1687         case navibrowse:
1688         case allsubentries:
1689             return current_title[c->currextra];
1690     }
1691
1692     return "?";
1693 }
1694
1695 int tagtree_get_attr(struct tree_context* c)
1696 {
1697     int attr = -1;
1698     switch (c->currtable)
1699     {
1700         case navibrowse:
1701             if (csi->tagorder[c->currextra] == tag_title)
1702                 attr = FILE_ATTR_AUDIO;
1703             else
1704                 attr = ATTR_DIRECTORY;
1705             break;
1706
1707         case allsubentries:
1708             attr = FILE_ATTR_AUDIO;
1709             break;
1710
1711         default:
1712             attr = ATTR_DIRECTORY;
1713             break;
1714     }
1715
1716     return attr;
1717 }
1718
1719 int tagtree_get_icon(struct tree_context* c)
1720 {
1721     int icon = Icon_Folder;
1722
1723     if (tagtree_get_attr(c) == FILE_ATTR_AUDIO)
1724         icon = Icon_Audio;
1725
1726     return icon;
1727 }