cinelerra/cachebase.C

   1 #include "asset.h"
   2 #include "bcsignals.h"
   3 #include "cachebase.h"
   4 #include "edl.h"
   5 #include "mutex.h"
   6
   7 #include <string.h>
   8
   9
  10
  11
  12 CacheItemBase::CacheItemBase()
  13  : ListItem<CacheItemBase>()
  14 {
  15         age = 0;
  16         asset_id = -1;
  17         path = 0;
  18 }
  19
  20 CacheItemBase::~CacheItemBase()
  21 {
  22         free(path); // path was allocated with strdup in FramceCache::put_frame()
  23 }
  24
  25
  26
  27
  28 int CacheItemBase::get_size()
  29 {
  30         return 0;
  31 }
  32
  33
  34
  35
  36
  37 CacheBase::CacheBase()
  38  : List<CacheItemBase>()
  39 {
  40         lock = new Mutex("CacheBase::lock");
  41         current_item = 0;
  42 }
  43
  44 CacheBase::~CacheBase()
  45 {
  46         delete lock;
  47 }
  48
  49
  50
  51 int CacheBase::get_age()
  52 {
  53         return EDL::next_id();
  54 }
  55
  56
  57 // Called when done with the item returned by get_.
  58 // Ignore if item was 0.
  59 void CacheBase::unlock()
  60 {
  61     lock->unlock();
  62 }
  63
  64 void CacheBase::remove_all()
  65 {
  66         int total = 0;
  67         lock->lock("CacheBase::remove_all");
  68         while(last)
  69         {
  70                 delete last;
  71                 total++;
  72         }
  73         current_item = 0;
  74         lock->unlock();
  75 //printf("CacheBase::remove_all: removed %d entries\n", total);
  76 }
  77
  78
  79 void CacheBase::remove_asset(Asset *asset)
  80 {
  81         int total = 0;
  82         lock->lock("CacheBase::remove_id");
  83         for(current_item = first; current_item; )
  84         {
  85                 if(current_item->path && !strcmp(current_item->path, asset->path) ||
  86                         current_item->asset_id == asset->id)
  87                 {
  88                         CacheItemBase *next = current_item->next;
  89                         delete current_item;
  90                         total++;
  91                         current_item = next;
  92                 }
  93                 else
  94                         current_item = current_item->next;
  95         }
  96         lock->unlock();
  97 //printf("CacheBase::remove_asset: removed %d entries for %s\n", total, asset->path);
  98 }
  99
 100 int CacheBase::get_oldest()
 101 {
 102         int oldest = 0x7fffffff;
 103         lock->lock("CacheBase::get_oldest");
 104         for(CacheItemBase *current = first; current; current = NEXT)
 105         {
 106                 if(current->age < oldest)
 107                         oldest = current->age;
 108         }
 109         lock->unlock();
 110         return oldest;
 111 }
 112
 113
 114
 115 int CacheBase::delete_oldest()
 116 {
 117         int oldest = 0x7fffffff;
 118         CacheItemBase *oldest_item = 0;
 119
 120         lock->lock("CacheBase::delete_oldest");
 121         for(CacheItemBase *current = first; current; current = NEXT)
 122         {
 123                 if(current->age < oldest)
 124                 {
 125                         oldest = current->age;
 126                         oldest_item = current;
 127                 }
 128         }
 129
 130         if(oldest_item)
 131         {
 132 // Too much data to debug if audio.
 133 // printf("CacheBase::delete_oldest: deleted position=%lld %d bytes\n",
 134 // oldest_item->position, oldest_item->get_size());
 135                 delete oldest_item;
 136                 if(current_item == oldest_item) current_item = 0;
 137                 lock->unlock();
 138                 return 0;
 139         }
 140
 141         lock->unlock();
 142         return 1;
 143 }
 144
 145
 146 int64_t CacheBase::get_memory_usage()
 147 {
 148         int64_t result = 0;
 149         lock->lock("CacheBase::get_memory_usage");
 150         for(CacheItemBase *current = first; current; current = NEXT)
 151         {
 152                 result += current->get_size();
 153         }
 154         lock->unlock();
 155         return result;
 156 }
 157
 158 void CacheBase::put_item(CacheItemBase *item)
 159 {
 160 // Get first position >= item
 161         if(!current_item) current_item = first;
 162         while(current_item && current_item->position < item->position)
 163                 current_item = current_item->next;
 164         if(!current_item) current_item = last;
 165         while(current_item && current_item->position >= item->position)
 166                 current_item = current_item->previous;
 167         if(!current_item)
 168                 current_item = first;
 169         else
 170                 current_item = current_item->next;
 171
 172         if(!current_item)
 173         {
 174                 append(item);
 175                 current_item = item;
 176         }
 177         else
 178                 insert_before(current_item, item);
 179 }
 180
 181 // Get first item from list with matching position or 0 if none found.
 182 CacheItemBase* CacheBase::get_item(int64_t position)
 183 {
 184         if(!current_item) current_item = first;
 185         while(current_item && current_item->position < position)
 186                 current_item = current_item->next;
 187         if(!current_item) current_item = last;
 188         while(current_item && current_item->position >= position)
 189                 current_item = current_item->previous;
 190         if(!current_item)
 191                 current_item = first;
 192         else
 193         if(current_item->next)
 194                 current_item = current_item->next;
 195         if(!current_item || current_item->position != position) return 0;
 196         return current_item;
 197 }
 198
 199
 200
 201
 202