1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360
|
/*----------------------------------------------------------------------------
libtunepimp -- The MusicBrainz tagging library.
Let a thousand taggers bloom!
Copyright (C) Robert Kaye 2003
This file is part of libtunepimp.
libtunepimp is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
libtunepimp is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with libtunepimp; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
$Id: filecache.cpp 1311 2004-05-29 23:47:46Z robert $
----------------------------------------------------------------------------*/
#ifdef WIN32
#if _MSC_VER == 1200
#pragma warning(disable:4786)
#endif
#endif
#include "filecache.h"
#include "tunepimp.h"
// Speedup notes:
// Add reverse indexes on fileName, track id
// Create given a state, return all items in that state.
// Keep count of unsaved items
FileCache::FileCache(TunePimp *pimp)
{
numUnsaved = 0;
serialNum = 0;
this->pimp = pimp;
}
FileCache::~FileCache(void)
{
}
int FileCache::add(const string &fileName)
{
map<unsigned, pair<Track *, int> >::iterator i;
Track *track = NULL;
string temp;
int ret;
pair<Track *, int> p;
mutex.acquire();
for(i = cache.begin(); i != cache.end(); i++)
{
(*i).second.first->getFileName(temp);
if (temp == fileName)
{
ret = (*i).first;
mutex.release();
return ret;
}
}
track = new Track(&pimp->context);
track->setStatus(eMetadataRead);
track->setFileName(fileName);
p.first = track;
p.second = 0;
cache[serialNum] = p;
xref[track] = serialNum++;
mutex.release();
return serialNum - 1;
}
void FileCache::getFileIds(vector<int> &ids)
{
map<unsigned, pair<Track *, int> >::iterator i;
ids.clear();
mutex.acquire();
for(i = cache.begin(); i != cache.end(); i++)
ids.push_back((*i).first);
mutex.release();
}
int FileCache::getFileIdFromTrack(Track *track)
{
map<Track *, int>::iterator j;
int fileId = -1;
mutex.acquire();
j = xref.find(track);
if (j != xref.end())
fileId = (*j).second;
mutex.release();
return fileId;
}
int FileCache::getNumItems(void)
{
int count;
mutex.acquire();
count = cache.size();
mutex.release();
return count;
}
// TODO: Optimize the next two function by keeping a mutexed counter
int FileCache::getNumUnsavedItems(void)
{
map<unsigned, pair<Track *, int> >::iterator i;
int count = 0;
mutex.acquire();
for(i = cache.begin(); i != cache.end(); i++)
if ((*i).second.first->getStatus() == eRecognized ||
(*i).second.first->getStatus() == eError)
{
if ((*i).second.first->hasChanged())
count++;
}
mutex.release();
return count;
}
// An array of hash maps to index all the counts for the next two functions
void FileCache::getCounts(map<TPFileStatus, int> &counts)
{
map<unsigned, pair<Track *, int> >::iterator i;
mutex.acquire();
for(i = cache.begin(); i != cache.end(); i++)
counts[(*i).second.first->getStatus()]++;
mutex.release();
}
void FileCache::getTracksFromStatus(TPFileStatus status, vector<Track *> &tracks)
{
map<unsigned, pair<Track *, int> >::iterator i;
tracks.clear();
mutex.acquire();
for(i = cache.begin(); i != cache.end(); i++)
if ((*i).second.first->getStatus() == status)
{
(*i).second.second++;
tracks.push_back((*i).second.first);
}
mutex.release();
}
int FileCache::getRecognizedFileList (int threshold, vector<int> &fileIds)
{
map<unsigned, pair<Track *, int> >::iterator i;
int count = 0;
fileIds.clear();
mutex.acquire();
for(i = cache.begin(); i != cache.end(); i++)
{
if ((*i).second.first->getStatus() == eRecognized)
{
fileIds.push_back((*i).first);
if ((*i).second.first->getSimilarity() < threshold)
count++;
}
}
mutex.release();
return count;
}
void FileCache::remove(int index)
{
map<unsigned, pair<Track *, int> >::iterator i;
mutex.acquire();
i = cache.find(index);
if (i != cache.end())
{
if ((*i).second.second == 0)
cache.erase(i);
else
{
Track *track;
track = (*i).second.first;
track->lock();
track->setStatus(eDeleted);
track->unlock();
}
}
mutex.release();
}
Track *FileCache::getNextItem(TPFileStatus status)
{
map<unsigned, pair<Track *, int> >::iterator i, saved = cache.end();
Track *track = NULL;
unsigned id = 0xFFFFFFFF;
string temp;
mutex.acquire();
for(i = cache.begin(); i != cache.end(); i++)
if ((*i).second.first->getStatus() == status)
{
if (saved == cache.end() || id > (unsigned)(*i).first)
{
id = (*i).first;
saved = i;
}
}
if (saved != cache.end())
{
(*saved).second.second++;
track = (*saved).second.first;
}
mutex.release();
return track;
}
// This will need a reverse index on name
Track *FileCache::getTrackFromFileName(const string &fileName)
{
map<unsigned, pair<Track *, int> >::iterator i;
Track *track = NULL;
string temp;
mutex.acquire();
for(i = cache.begin(); i != cache.end(); i++)
{
(*i).second.first->getFileName(temp);
if (temp == fileName)
{
(*i).second.second++;
track = (*i).second.first;
break;
}
}
mutex.release();
return track;
}
// reverse index on trackId
Track *FileCache::getTrackFromTrackId(const string &trackId)
{
map<unsigned, pair<Track *, int> >::iterator i;
Track *track = NULL;
Metadata data;
mutex.acquire();
for(i = cache.begin(); i != cache.end(); i++)
{
(*i).second.first->getServerMetadata(data);
if (data.trackId == trackId)
{
(*i).second.second++;
track = (*i).second.first;
break;
}
}
mutex.release();
return track;
}
Track *FileCache::getTrack(int fileId)
{
map<unsigned, pair<Track *, int> >::iterator i;
Track *track = NULL;
mutex.acquire();
i = cache.find(fileId);
if (i != cache.end())
{
(*i).second.second++;
track = (*i).second.first;
}
mutex.release();
return track;
}
void FileCache::release(Track *track)
{
map<unsigned, pair<Track *, int> >::iterator i;
map<Track *, int>::iterator j;
TPFileStatus status;
int index;
mutex.acquire();
j = xref.find(track);
if (j != xref.end())
{
index = (*j).second;
i = cache.find(index);
if (i != cache.end())
{
(*i).second.second--;
if ((*i).second.second == 0)
{
track->lock();
status = track->getStatus();
track->unlock();
if (status == eDeleted)
{
cache.erase(i);
xref.erase(j);
pimp->trackRemoved(index);
}
}
}
}
mutex.release();
}
#if 0
void FileCache::dump(void)
{
map<unsigned, pair<Track *, int> >::iterator i;
Track *track = NULL;
string fileName;
mutex.acquire();
for(i = cache.begin(); i != cache.end(); i++)
{
track = (*i).second.first;
track->getFileName(fileName);
}
mutex.release();
}
#endif
|