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 static 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:%s", 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+1;
 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     long tagcache_idx;
 669
 670     /* Do not gather data unless proper setting has been enabled. */
 671     if (!global_settings.runtimedb)
 672     {
 673         logf("runtimedb gathering not enabled");
 674         return;
 675     }
 676
 677     tagcache_idx=id3->tagcache_idx;
 678     if (!tagcache_idx)
 679     {
 680         logf("No tagcache index pointer found");
 681         return;
 682     }
 683     tagcache_idx--;
 684
 685     /* Don't process unplayed tracks. */
 686     if (id3->elapsed == 0)
 687     {
 688         logf("not logging unplayed track");
 689         return;
 690     }
 691
 692     playcount = id3->playcount + 1;
 693     lastplayed = tagcache_increase_serial();
 694     if (lastplayed < 0)
 695     {
 696         logf("incorrect tc serial:%ld", lastplayed);
 697         return;
 698     }
 699
 700     /* Ignore the last 15s (crossfade etc.) */
 701     playtime = id3->playtime + MIN(id3->length, id3->elapsed + 15 * 1000);
 702
 703     logf("ube:%s", id3->path);
 704     logf("-> %ld/%ld", playcount, playtime);
 705     logf("-> %ld/%ld/%ld", id3->elapsed, id3->length, MIN(id3->length, id3->elapsed + 15 * 1000));
 706
 707     /* Queue the updates to the tagcache system. */
 708     tagcache_update_numeric(tagcache_idx, tag_playcount, playcount);
 709     tagcache_update_numeric(tagcache_idx, tag_playtime, playtime);
 710     tagcache_update_numeric(tagcache_idx, tag_lastplayed, lastplayed);
 711 }
 712
 713 bool tagtree_export(void)
 714 {
 715     gui_syncsplash(0, str(LANG_CREATING));
 716     if (!tagcache_create_changelog(&tcs))
 717     {
 718         gui_syncsplash(HZ*2, ID2P(LANG_FAILED));
 719     }
 720
 721     return false;
 722 }
 723
 724 bool tagtree_import(void)
 725 {
 726     gui_syncsplash(0, ID2P(LANG_WAIT));
 727     if (!tagcache_import_changelog())
 728     {
 729         gui_syncsplash(HZ*2, ID2P(LANG_FAILED));
 730     }
 731
 732     return false;
 733 }
 734
 735 static bool parse_menu(const char *filename);
 736
 737 static int parse_line(int n, const char *buf, void *parameters)
 738 {
 739     char data[256];
 740     int variable;
 741     static bool read_menu;
 742     int i;
 743
 744     (void)parameters;
 745
 746     logf("parse:%d/%s", n, buf);
 747
 748     /* First line, do initialisation. */
 749     if (n == 0)
 750     {
 751         if (strcasecmp(TAGNAVI_VERSION, buf))
 752         {
 753             logf("Version mismatch");
 754             return -1;
 755         }
 756
 757         read_menu = false;
 758     }
 759
 760     if (buf[0] == '#')
 761         return 0;
 762
 763     if (buf[0] == '\0')
 764     {
 765         if (read_menu)
 766         {
 767             /* End the menu */
 768             read_menu = false;
 769         }
 770         return 0;
 771     }
 772
 773     if (!read_menu)
 774     {
 775         strp = buf;
 776         if (get_tag(&variable) <= 0)
 777             return 0;
 778
 779         switch (variable)
 780         {
 781             case var_format:
 782                 if (add_format(strp) < 0)
 783                 {
 784                     logf("Format add fail: %s", data);
 785                 }
 786                 break;
 787
 788             case var_include:
 789                 if (get_token_str(data, sizeof(data)) < 0)
 790                 {
 791                     logf("%%include empty");
 792                     return 0;
 793                 }
 794
 795                 if (!parse_menu(data))
 796                 {
 797                     logf("Load menu fail: %s", data);
 798                 }
 799                 break;
 800
 801             case var_menu_start:
 802                 if (menu_count >= TAGMENU_MAX_MENUS)
 803                 {
 804                     logf("max menucount reached");
 805                     return 0;
 806                 }
 807
 808                 if (get_token_str(data, sizeof data) < 0)
 809                 {
 810                     logf("%%menu_start id empty");
 811                     return 0;
 812                 }
 813
 814                 menu = NULL;
 815                 for (i = 0; i < menu_count; i++)
 816                 {
 817                     if (!strcasecmp(menus[i]->id, data))
 818                     {
 819                         menu = menus[i];
 820                     }
 821                 }
 822
 823                 if (menu == NULL)
 824                 {
 825                     menus[menu_count] = buffer_alloc(sizeof(struct root_menu));
 826                     menu = menus[menu_count];
 827                     ++menu_count;
 828                     memset(menu, 0, sizeof(struct root_menu));
 829                     strncpy(menu->id, data, MAX_MENU_ID_SIZE-1);
 830                 }
 831
 832                 if (get_token_str(menu->title, sizeof(menu->title)) < 0)
 833                 {
 834                     logf("%%menu_start title empty");
 835                     return 0;
 836                 }
 837                 logf("menu: %s", menu->title);
 838                 read_menu = true;
 839                 break;
 840
 841             case var_rootmenu:
 842                 /* Only set root menu once. */
 843                 if (root_menu >= 0)
 844                     break;
 845
 846                 if (get_token_str(data, sizeof(data)) < 0)
 847                 {
 848                     logf("%%root_menu empty");
 849                     return 0;
 850                 }
 851
 852                 for (i = 0; i < menu_count; i++)
 853                 {
 854                     if (!strcasecmp(menus[i]->id, data))
 855                     {
 856                         root_menu = i;
 857                     }
 858                 }
 859                 break;
 860         }
 861
 862         return 0;
 863     }
 864
 865     if (menu->itemcount >= TAGMENU_MAX_ITEMS)
 866     {
 867         logf("max itemcount reached");
 868         return 0;
 869     }
 870
 871     /* Allocate */
 872     if (menu->items[menu->itemcount] == NULL)
 873     {
 874         menu->items[menu->itemcount] = buffer_alloc(sizeof(struct menu_entry));
 875         memset(menu->items[menu->itemcount], 0, sizeof(struct menu_entry));
 876         menu->items[menu->itemcount]->si = buffer_alloc(sizeof(struct search_instruction));
 877     }
 878
 879     memset(menu->items[menu->itemcount]->si, 0, sizeof(struct search_instruction));
 880     if (!parse_search(menu->items[menu->itemcount], buf))
 881         return 0;
 882
 883     menu->itemcount++;
 884
 885     return 0;
 886 }
 887
 888 static bool parse_menu(const char *filename)
 889 {
 890     int fd;
 891     char buf[1024];
 892
 893     if (menu_count >= TAGMENU_MAX_MENUS)
 894     {
 895         logf("max menucount reached");
 896         return false;
 897     }
 898
 899     fd = open(filename, O_RDONLY);
 900     if (fd < 0)
 901     {
 902         logf("Search instruction file not found.");
 903         return false;
 904     }
 905
 906     /* Now read file for real, parsing into si */
 907     fast_readline(fd, buf, sizeof buf, NULL, parse_line);
 908     close(fd);
 909
 910     return true;
 911 }
 912
 913 void tagtree_init(void)
 914 {
 915     format_count = 0;
 916     menu_count = 0;
 917     menu = NULL;
 918     root_menu = -1;
 919     parse_menu(FILE_SEARCH_INSTRUCTIONS);
 920
 921     /* If no root menu is set, assume it's the first single menu
 922      * we have. That shouldn't normally happen. */
 923     if (root_menu < 0)
 924         root_menu = 0;
 925
 926     uniqbuf = buffer_alloc(UNIQBUF_SIZE);
 927     audio_set_track_buffer_event(tagtree_buffer_event);
 928     audio_set_track_unbuffer_event(tagtree_unbuffer_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         gui_syncsplash(0, str(LANG_PLAYLIST_SEARCH_MSG), count,
 946                           str(LANG_OFF_ABORT));
 947         if (action_userabort(TIMEOUT_NOBLOCK))
 948             return false;
 949         last_tick = current_tick;
 950         yield();
 951     }
 952
 953     return true;
 954 }
 955
 956 static int format_str(struct tagcache_search *tcs, struct display_format *fmt,
 957                       char *buf, int buf_size)
 958 {
 959     char fmtbuf[8];
 960     bool read_format = false;
 961     int fmtbuf_pos = 0;
 962     int parpos = 0;
 963     int buf_pos = 0;
 964     int i;
 965
 966     memset(buf, 0, buf_size);
 967     for (i = 0; fmt->formatstr[i] != '\0'; i++)
 968     {
 969         if (fmt->formatstr[i] == '%')
 970         {
 971             read_format = true;
 972             fmtbuf_pos = 0;
 973             if (parpos >= fmt->tag_count)
 974             {
 975                 logf("too many format tags");
 976                 return -1;
 977             }
 978         }
 979
 980         if (read_format)
 981         {
 982             fmtbuf[fmtbuf_pos++] = fmt->formatstr[i];
 983             if (fmtbuf_pos >= buf_size)
 984             {
 985                 logf("format parse error");
 986                 return -2;
 987             }
 988
 989             if (fmt->formatstr[i] == 's')
 990             {
 991                 fmtbuf[fmtbuf_pos] = '\0';
 992                 read_format = false;
 993                 if (fmt->tags[parpos] == tcs->type)
 994                 {
 995                     snprintf(&buf[buf_pos], buf_size - buf_pos, fmtbuf, tcs->result);
 996                 }
 997                 else
 998                 {
 999                     /* Need to fetch the tag data. */
1000                     if (!tagcache_retrieve(tcs, tcs->idx_id, fmt->tags[parpos],
1001                                            &buf[buf_pos], buf_size - buf_pos))
1002                     {
1003                         logf("retrieve failed");
1004                         return -3;
1005                     }
1006                 }
1007                 buf_pos += strlen(&buf[buf_pos]);
1008                 parpos++;
1009             }
1010             else if (fmt->formatstr[i] == 'd')
1011             {
1012                 fmtbuf[fmtbuf_pos] = '\0';
1013                 read_format = false;
1014                 snprintf(&buf[buf_pos], buf_size - buf_pos, fmtbuf,
1015                          tagcache_get_numeric(tcs, fmt->tags[parpos]));
1016                 buf_pos += strlen(&buf[buf_pos]);
1017                 parpos++;
1018             }
1019             continue;
1020         }
1021
1022         buf[buf_pos++] = fmt->formatstr[i];
1023
1024         if (buf_pos - 1 >= buf_size)
1025         {
1026             logf("buffer overflow");
1027             return -4;
1028         }
1029     }
1030
1031     buf[buf_pos++] = '\0';
1032
1033     return 0;
1034 }
1035
1036 static int retrieve_entries(struct tree_context *c, struct tagcache_search *tcs,
1037                             int offset, bool init)
1038 {
1039     struct tagentry *dptr = (struct tagentry *)c->dircache;
1040     struct display_format *fmt;
1041     int i;
1042     int namebufused = 0;
1043     int total_count = 0;
1044     int special_entry_count = 0;
1045     int level = c->currextra;
1046     int tag;
1047     bool sort = false;
1048     int sort_limit;
1049     int strip;
1050
1051     if (init
1052 #ifdef HAVE_TC_RAMCACHE
1053         && !tagcache_is_ramcache()
1054 #endif
1055         )
1056     {
1057         /* Show search progress straight away if the disk needs to spin up,
1058            otherwise show it after the normal 1/2 second delay */
1059         show_search_progress(
1060 #if !defined(HAVE_FLASH_STORAGE) && !defined(SIMULATOR)
1061             ata_disk_is_active()
1062 #else
1063             true
1064 #endif
1065             , 0);
1066     }
1067
1068     if (c->currtable == allsubentries)
1069     {
1070         tag = tag_title;
1071         level--;
1072     }
1073     else
1074         tag = csi->tagorder[level];
1075
1076     if (!tagcache_search(tcs, tag))
1077         return -1;
1078
1079     /* Prevent duplicate entries in the search list. */
1080     tagcache_search_set_uniqbuf(tcs, uniqbuf, UNIQBUF_SIZE);
1081
1082     if (level || csi->clause_count[0] || tagcache_is_numeric_tag(tag))
1083         sort = true;
1084
1085     for (i = 0; i < level; i++)
1086     {
1087         if (tagcache_is_numeric_tag(csi->tagorder[i]))
1088         {
1089             static struct tagcache_search_clause cc;
1090
1091             memset(&cc, 0, sizeof(struct tagcache_search_clause));
1092             cc.tag = csi->tagorder[i];
1093             cc.type = clause_is;
1094             cc.numeric = true;
1095             cc.numeric_data = csi->result_seek[i];
1096             tagcache_search_add_clause(tcs, &cc);
1097         }
1098         else
1099         {
1100             tagcache_search_add_filter(tcs, csi->tagorder[i],
1101                                        csi->result_seek[i]);
1102         }
1103     }
1104
1105     for (i = 0; i <= level; i++)
1106     {
1107         int j;
1108
1109         for (j = 0; j < csi->clause_count[i]; j++)
1110             tagcache_search_add_clause(tcs, csi->clause[i][j]);
1111     }
1112
1113     current_offset = offset;
1114     current_entry_count = 0;
1115     c->dirfull = false;
1116
1117     fmt = NULL;
1118     for (i = 0; i < format_count; i++)
1119     {
1120         if (formats[i]->group_id == csi->format_id[level])
1121             fmt = formats[i];
1122     }
1123
1124     if (fmt)
1125     {
1126         sort_inverse = fmt->sort_inverse;
1127         sort_limit = fmt->limit;
1128         strip = fmt->strip;
1129
1130         /* Check if sorting is forced. */
1131         if (fmt->sort)
1132             sort = true;
1133     }
1134     else
1135     {
1136         sort_inverse = false;
1137         sort_limit = 0;
1138         strip = 0;
1139     }
1140
1141     if (tag != tag_title && tag != tag_filename)
1142     {
1143         if (offset == 0)
1144         {
1145             dptr->newtable = allsubentries;
1146             dptr->name = str(LANG_TAGNAVI_ALL_TRACKS);
1147             dptr++;
1148             current_entry_count++;
1149         }
1150         if (offset <= 1)
1151         {
1152             dptr->newtable = navibrowse;
1153             dptr->name = str(LANG_TAGNAVI_RANDOM);
1154             dptr->extraseek = -1;
1155             dptr++;
1156             current_entry_count++;
1157         }
1158         special_entry_count+=2;
1159     }
1160
1161     total_count += special_entry_count;
1162
1163     while (tagcache_get_next(tcs))
1164     {
1165         if (total_count++ < offset)
1166             continue;
1167
1168         dptr->newtable = navibrowse;
1169         if (tag == tag_title || tag == tag_filename)
1170         {
1171             dptr->newtable = playtrack;
1172             dptr->extraseek = tcs->idx_id;
1173         }
1174         else
1175             dptr->extraseek = tcs->result_seek;
1176
1177         fmt = NULL;
1178         /* Check the format */
1179         for (i = 0; i < format_count; i++)
1180         {
1181             if (formats[i]->group_id != csi->format_id[level])
1182                 continue;
1183
1184             if (tagcache_check_clauses(tcs, formats[i]->clause,
1185                                        formats[i]->clause_count))
1186             {
1187                 fmt = formats[i];
1188                 break;
1189             }
1190         }
1191
1192         if (!tcs->ramresult || fmt)
1193         {
1194             char buf[MAX_PATH];
1195
1196             if (fmt)
1197             {
1198                 if (format_str(tcs, fmt, buf, sizeof buf) < 0)
1199                 {
1200                     logf("format_str() failed");
1201                     return 0;
1202                 }
1203             }
1204
1205             dptr->name = &c->name_buffer[namebufused];
1206             if (fmt)
1207                 namebufused += strlen(buf)+1;
1208             else
1209                 namebufused += tcs->result_len;
1210
1211             if (namebufused >= c->name_buffer_size)
1212             {
1213                 logf("chunk mode #2: %d", current_entry_count);
1214                 c->dirfull = true;
1215                 sort = false;
1216                 break ;
1217             }
1218             if (fmt)
1219                 strcpy(dptr->name, buf);
1220             else
1221                 strcpy(dptr->name, tcs->result);
1222         }
1223         else
1224             dptr->name = tcs->result;
1225
1226         dptr++;
1227         current_entry_count++;
1228
1229         if (current_entry_count >= global_settings.max_files_in_dir)
1230         {
1231             logf("chunk mode #3: %d", current_entry_count);
1232             c->dirfull = true;
1233             sort = false;
1234             break ;
1235         }
1236
1237         if (init && !tcs->ramsearch)
1238         {
1239             if (!show_search_progress(false, total_count))
1240             {
1241                 tagcache_search_finish(tcs);
1242                 return current_entry_count;
1243             }
1244         }
1245     }
1246
1247     if (sort)
1248         qsort(c->dircache + special_entry_count * c->dentry_size,
1249               current_entry_count - special_entry_count,
1250               c->dentry_size, compare);
1251
1252     if (!init)
1253     {
1254         tagcache_search_finish(tcs);
1255         return current_entry_count;
1256     }
1257
1258     while (tagcache_get_next(tcs))
1259     {
1260         if (!tcs->ramsearch)
1261         {
1262             if (!show_search_progress(false, total_count))
1263                 break;
1264         }
1265         total_count++;
1266     }
1267
1268     tagcache_search_finish(tcs);
1269
1270     if (!sort && (sort_inverse || sort_limit))
1271     {
1272         gui_syncsplash(HZ*4, ID2P(LANG_SHOWDIR_BUFFER_FULL), total_count);
1273         logf("Too small dir buffer");
1274         return 0;
1275     }
1276
1277     if (sort_limit)
1278         total_count = MIN(total_count, sort_limit);
1279
1280     if (strip)
1281     {
1282         dptr = c->dircache;
1283         for (i = 0; i < total_count; i++, dptr++)
1284         {
1285             int len = strlen(dptr->name);
1286
1287             if (len < strip)
1288                 continue;
1289
1290             dptr->name = &dptr->name[strip];
1291         }
1292     }
1293
1294     return total_count;
1295 }
1296
1297 static int load_root(struct tree_context *c)
1298 {
1299     struct tagentry *dptr = (struct tagentry *)c->dircache;
1300     int i;
1301
1302     tc = c;
1303     c->currtable = root;
1304     if (c->dirlevel == 0)
1305         c->currextra = root_menu;
1306
1307     menu = menus[c->currextra];
1308     if (menu == NULL)
1309         return 0;
1310
1311     for (i = 0; i < menu->itemcount; i++)
1312     {
1313         dptr->name = menu->items[i]->name;
1314         switch (menu->items[i]->type)
1315         {
1316             case menu_next:
1317                 dptr->newtable = navibrowse;
1318                 dptr->extraseek = i;
1319                 break;
1320
1321             case menu_load:
1322                 dptr->newtable = root;
1323                 dptr->extraseek = menu->items[i]->link;
1324                 break;
1325         }
1326
1327         dptr++;
1328     }
1329
1330     current_offset = 0;
1331     current_entry_count = i;
1332
1333     return i;
1334 }
1335
1336 int tagtree_load(struct tree_context* c)
1337 {
1338     int count;
1339     int table = c->currtable;
1340
1341     c->dentry_size = sizeof(struct tagentry);
1342     c->dirsindir = 0;
1343
1344     if (!table)
1345     {
1346         c->dirfull = false;
1347         table = root;
1348         c->currtable = table;
1349         c->currextra = root_menu;
1350     }
1351
1352     switch (table)
1353     {
1354         case root:
1355             count = load_root(c);
1356             break;
1357
1358         case allsubentries:
1359         case navibrowse:
1360             logf("navibrowse...");
1361             cpu_boost(true);
1362             count = retrieve_entries(c, &tcs, 0, true);
1363             cpu_boost(false);
1364             break;
1365
1366         default:
1367             logf("Unsupported table %d\n", table);
1368             return -1;
1369     }
1370
1371     if (count < 0)
1372     {
1373         c->dirlevel = 0;
1374         count = load_root(c);
1375         gui_syncsplash(HZ, str(LANG_TAGCACHE_BUSY));
1376     }
1377
1378     /* The _total_ numer of entries available. */
1379     c->dirlength = c->filesindir = count;
1380
1381     return count;
1382 }
1383
1384 int tagtree_enter(struct tree_context* c)
1385 {
1386     int rc = 0;
1387     struct tagentry *dptr;
1388     struct mp3entry *id3;
1389     int newextra;
1390     int seek;
1391     int source;
1392
1393     dptr = tagtree_get_entry(c, c->selected_item);
1394
1395     c->dirfull = false;
1396     seek = dptr->extraseek;
1397     if (seek == -1)
1398     {
1399         if(c->filesindir<=2)
1400             return 0;
1401         srand(current_tick);
1402         dptr = (tagtree_get_entry(c, 2+(rand() % (c->filesindir-2))));
1403         seek = dptr->extraseek;
1404     }
1405     newextra = dptr->newtable;
1406
1407     if (c->dirlevel >= MAX_DIR_LEVELS)
1408         return 0;
1409
1410     c->selected_item_history[c->dirlevel]=c->selected_item;
1411     c->table_history[c->dirlevel] = c->currtable;
1412     c->extra_history[c->dirlevel] = c->currextra;
1413     c->pos_history[c->dirlevel] = c->firstpos;
1414     c->dirlevel++;
1415
1416     switch (c->currtable) {
1417         case root:
1418             c->currextra = newextra;
1419
1420             if (newextra == root)
1421             {
1422                 menu = menus[seek];
1423                 c->currextra = seek;
1424             }
1425
1426             else if (newextra == navibrowse)
1427             {
1428                 int i, j;
1429
1430                 csi = menu->items[seek]->si;
1431                 c->currextra = 0;
1432
1433                 strncpy(current_title[c->currextra], dptr->name,
1434                         sizeof(current_title[0]) - 1);
1435
1436                 /* Read input as necessary. */
1437                 for (i = 0; i < csi->tagorder_count; i++)
1438                 {
1439                     for (j = 0; j < csi->clause_count[i]; j++)
1440                     {
1441                         char* searchstring;
1442                         source = csi->clause[i][j]->source;
1443
1444                         if (source == source_constant)
1445                             continue;
1446
1447                         searchstring=csi->clause[i][j]->str;
1448                         *searchstring = '\0';
1449
1450                         id3 = audio_current_track();
1451
1452                         if (source == source_current_path && id3)
1453                         {
1454                             char *e;
1455                             strncpy(searchstring, id3->path, SEARCHSTR_SIZE);
1456                             e = strrchr(searchstring, '/');
1457                             if (e)
1458                                 *e = '\0';
1459                         }
1460                         else if (source > source_runtime && id3)
1461                         {
1462
1463                             int k = source-source_runtime;
1464                             int offset = id3_to_search_mapping[k].id3_offset;
1465                             char **src = (char**)((char*)id3 + offset);
1466                             if (*src)
1467                             {
1468                                 strncpy(searchstring, *src, SEARCHSTR_SIZE);
1469                                 searchstring[SEARCHSTR_SIZE-1] = '\0';
1470                             }
1471                         }
1472                         else
1473                         {
1474                             rc = kbd_input(searchstring, SEARCHSTR_SIZE);
1475                             if (rc == -1 || !searchstring[0])
1476                             {
1477                                 tagtree_exit(c);
1478                                 return 0;
1479                             }
1480                             if (csi->clause[i][j]->numeric)
1481                                 csi->clause[i][j]->numeric_data = atoi(searchstring);
1482                         }
1483
1484
1485                     }
1486                 }
1487             }
1488             c->currtable = newextra;
1489
1490             break;
1491
1492         case navibrowse:
1493         case allsubentries:
1494             if (newextra == playtrack)
1495             {
1496                 c->dirlevel--;
1497                 /* about to create a new current playlist...
1498                  allow user to cancel the operation */
1499                 if (global_settings.warnon_erase_dynplaylist &&
1500                     !global_settings.party_mode &&
1501                     playlist_modified(NULL))
1502                 {
1503                     char *lines[]={ID2P(LANG_WARN_ERASEDYNPLAYLIST_PROMPT)};
1504                     struct text_message message={lines, 1};
1505
1506                     if (gui_syncyesno_run(&message, NULL, NULL) != YESNO_YES)
1507                         break;
1508                 }
1509
1510                 if (tagtree_play_folder(c) >= 0)
1511                     rc = 2;
1512                 break;
1513             }
1514
1515             c->currtable = newextra;
1516             csi->result_seek[c->currextra] = seek;
1517             if (c->currextra < csi->tagorder_count-1)
1518                 c->currextra++;
1519             else
1520                 c->dirlevel--;
1521
1522             /* Update the statusbar title */
1523             strncpy(current_title[c->currextra], dptr->name,
1524                     sizeof(current_title[0]) - 1);
1525             break;
1526
1527         default:
1528             c->dirlevel--;
1529             break;
1530     }
1531
1532     c->selected_item=0;
1533     gui_synclist_select_item(&tree_lists, c->selected_item);
1534
1535     return rc;
1536 }
1537
1538 void tagtree_exit(struct tree_context* c)
1539 {
1540     c->dirfull = false;
1541     if (c->dirlevel > 0)
1542         c->dirlevel--;
1543     c->selected_item=c->selected_item_history[c->dirlevel];
1544     gui_synclist_select_item(&tree_lists, c->selected_item);
1545     c->currtable = c->table_history[c->dirlevel];
1546     c->currextra = c->extra_history[c->dirlevel];
1547     c->firstpos  = c->pos_history[c->dirlevel];
1548 }
1549
1550 int tagtree_get_filename(struct tree_context* c, char *buf, int buflen)
1551 {
1552     struct tagentry *entry;
1553
1554     entry = tagtree_get_entry(c, c->selected_item);
1555
1556     if (!tagcache_search(&tcs, tag_filename))
1557         return -1;
1558
1559     if (!tagcache_retrieve(&tcs, entry->extraseek, tcs.type, buf, buflen))
1560     {
1561         tagcache_search_finish(&tcs);
1562         return -2;
1563     }
1564
1565     tagcache_search_finish(&tcs);
1566
1567     return 0;
1568 }
1569
1570 static bool insert_all_playlist(struct tree_context *c, int position, bool queue)
1571 {
1572     int i;
1573     char buf[MAX_PATH];
1574     int from, to, direction;
1575     int files_left = c->filesindir;
1576
1577     cpu_boost(true);
1578     if (!tagcache_search(&tcs, tag_filename))
1579     {
1580         gui_syncsplash(HZ, ID2P(LANG_TAGCACHE_BUSY));
1581         cpu_boost(false);
1582         return false;
1583     }
1584
1585     if (position == PLAYLIST_REPLACE)
1586     {
1587         if (remove_all_tracks(NULL) == 0)
1588             position = PLAYLIST_INSERT_LAST;
1589         else return -1;    }
1590
1591     if (position == PLAYLIST_INSERT_FIRST)
1592     {
1593         from = c->filesindir - 1;
1594         to = -1;
1595         direction = -1;
1596     }
1597     else
1598     {
1599         from = 0;
1600         to = c->filesindir;
1601         direction = 1;
1602     }
1603
1604     for (i = from; i != to; i += direction)
1605     {
1606         /* Count back to zero */
1607         if (!show_search_progress(false, files_left--))
1608             break;
1609
1610         if (!tagcache_retrieve(&tcs, tagtree_get_entry(c, i)->extraseek,
1611                                tcs.type, buf, sizeof buf))
1612         {
1613             continue;
1614         }
1615
1616         if (playlist_insert_track(NULL, buf, position, queue, false) < 0)
1617         {
1618             logf("playlist_insert_track failed");
1619             break;
1620         }
1621         yield();
1622     }
1623     playlist_sync(NULL);
1624     tagcache_search_finish(&tcs);
1625     cpu_boost(false);
1626
1627     return true;
1628 }
1629
1630 bool tagtree_insert_selection_playlist(int position, bool queue)
1631 {
1632     struct tagentry *dptr;
1633     char buf[MAX_PATH];
1634     int dirlevel = tc->dirlevel;
1635
1636     /* We need to set the table to allsubentries. */
1637     show_search_progress(true, 0);
1638
1639     dptr = tagtree_get_entry(tc, tc->selected_item);
1640
1641     /* Insert a single track? */
1642     if (dptr->newtable == playtrack)
1643     {
1644         if (tagtree_get_filename(tc, buf, sizeof buf) < 0)
1645         {
1646             logf("tagtree_get_filename failed");
1647             return false;
1648         }
1649         playlist_insert_track(NULL, buf, position, queue, true);
1650
1651         return true;
1652     }
1653
1654     if (dptr->newtable == navibrowse)
1655     {
1656         tagtree_enter(tc);
1657         tagtree_load(tc);
1658         dptr = tagtree_get_entry(tc, tc->selected_item);
1659     }
1660     else if (dptr->newtable != allsubentries)
1661     {
1662         logf("unsupported table: %d", dptr->newtable);
1663         return false;
1664     }
1665
1666     /* Now the current table should be allsubentries. */
1667     if (dptr->newtable != playtrack)
1668     {
1669         tagtree_enter(tc);
1670         tagtree_load(tc);
1671         dptr = tagtree_get_entry(tc, tc->selected_item);
1672
1673         /* And now the newtable should be playtrack. */
1674         if (dptr->newtable != playtrack)
1675         {
1676             logf("newtable: %d !!", dptr->newtable);
1677             tc->dirlevel = dirlevel;
1678             return false;
1679         }
1680     }
1681
1682     if (tc->filesindir <= 0)
1683         gui_syncsplash(HZ, ID2P(LANG_END_PLAYLIST));
1684     else
1685     {
1686         logf("insert_all_playlist");
1687         if (!insert_all_playlist(tc, position, queue))
1688             gui_syncsplash(HZ*2, ID2P(LANG_FAILED));
1689     }
1690
1691     /* Finally return the dirlevel to its original value. */
1692     while (tc->dirlevel > dirlevel)
1693         tagtree_exit(tc);
1694     tagtree_load(tc);
1695
1696     return true;
1697 }
1698
1699 static int tagtree_play_folder(struct tree_context* c)
1700 {
1701     if (playlist_create(NULL, NULL) < 0)
1702     {
1703         logf("Failed creating playlist\n");
1704         return -1;
1705     }
1706
1707     if (!insert_all_playlist(c, PLAYLIST_INSERT_LAST, false))
1708         return -2;
1709
1710     if (global_settings.playlist_shuffle)
1711         c->selected_item = playlist_shuffle(current_tick, c->selected_item);
1712     if (!global_settings.play_selected)
1713         c->selected_item = 0;
1714     gui_synclist_select_item(&tree_lists, c->selected_item);
1715
1716     playlist_start(c->selected_item,0);
1717
1718     return 0;
1719 }
1720
1721 struct tagentry* tagtree_get_entry(struct tree_context *c, int id)
1722 {
1723     struct tagentry *entry = (struct tagentry *)c->dircache;
1724     int realid = id - current_offset;
1725
1726     /* Load the next chunk if necessary. */
1727     if (realid >= current_entry_count || realid < 0)
1728     {
1729         cpu_boost(true);
1730         if (retrieve_entries(c, &tcs2, MAX(0, id - (current_entry_count / 2)),
1731                              false) < 0)
1732         {
1733             logf("retrieve failed");
1734             cpu_boost(false);
1735             return NULL;
1736         }
1737         realid = id - current_offset;
1738         cpu_boost(false);
1739     }
1740
1741     return &entry[realid];
1742 }
1743
1744 char *tagtree_get_title(struct tree_context* c)
1745 {
1746     switch (c->currtable)
1747     {
1748         case root:
1749             return menu->title;
1750
1751         case navibrowse:
1752         case allsubentries:
1753             return current_title[c->currextra];
1754     }
1755
1756     return "?";
1757 }
1758
1759 int tagtree_get_attr(struct tree_context* c)
1760 {
1761     int attr = -1;
1762     switch (c->currtable)
1763     {
1764         case navibrowse:
1765             if (csi->tagorder[c->currextra] == tag_title)
1766                 attr = FILE_ATTR_AUDIO;
1767             else
1768                 attr = ATTR_DIRECTORY;
1769             break;
1770
1771         case allsubentries:
1772             attr = FILE_ATTR_AUDIO;
1773             break;
1774
1775         default:
1776             attr = ATTR_DIRECTORY;
1777             break;
1778     }
1779
1780     return attr;
1781 }
1782
1783 int tagtree_get_icon(struct tree_context* c)
1784 {
1785     int icon = Icon_Folder;
1786
1787     if (tagtree_get_attr(c) == FILE_ATTR_AUDIO)
1788         icon = Icon_Audio;
1789
1790     return icon;
1791 }