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