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