apps/tagtree.c

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