···15741574 int i;
15751575 int namebufused = 0;
15761576 int total_count = 0;
15771577- int special_entry_count = 0;
15771577+ c->special_entry_count = 0;
15781578 int level = c->currextra;
15791579 int tag;
15801580 bool sort = false;
···16911691 dptr->customaction = ONPLAY_NO_CUSTOMACTION;
16921692 dptr++;
16931693 current_entry_count++;
16941694- special_entry_count++;
16941694+ c->special_entry_count++;
16951695 }
16961696 if (offset <= 1)
16971697 {
···17011701 dptr->customaction = ONPLAY_NO_CUSTOMACTION;
17021702 dptr++;
17031703 current_entry_count++;
17041704- special_entry_count++;
17041704+ c->special_entry_count++;
17051705 }
1706170617071707 total_count += 2;
···18391839 qsort_fn = sort_inverse ? strncasecmp_inv : strncasecmp;
1840184018411841 struct tagentry *entries = get_entries(c);
18421842- qsort(&entries[special_entry_count],
18431843- current_entry_count - special_entry_count,
18421842+ qsort(&entries[c->special_entry_count],
18431843+ current_entry_count - c->special_entry_count,
18441844 sizeof(struct tagentry),
18451845 compare);
18461846 }
···18821882 if (strip)
18831883 {
18841884 dptr = get_entries(c);
18851885- for (i = special_entry_count; i < current_entry_count; i++, dptr++)
18851885+ for (i = c->special_entry_count; i < current_entry_count; i++, dptr++)
18861886 {
18871887 int len = strlen(dptr->name);
18881888
+1
apps/tree.h
···9292#ifdef HAVE_TAGCACHE
9393 int currtable; /* db use */
9494 int currextra; /* db use */
9595+ int special_entry_count; /* db use */
9596#endif
9697 int sort_dir; /* directory sort order */
9798 int out_of_tree; /* shortcut from elsewhere */