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