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