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
|
/* -*- c-basic-offset: 4 indent-tabs-mode: nil -*- vi:set ts=8 sts=4 sw=4: */
/*
Sonic Visualiser
An audio file viewer and annotation editor.
Centre for Digital Music, Queen Mary, University of London.
This file copyright 2006 QMUL.
This program 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. See the file
COPYING included with this distribution for more information.
*/
#include "StorageAdviser.h"
#include "Exceptions.h"
#include "TempDirectory.h"
#include "system/System.h"
#include <iostream>
namespace sv {
double StorageAdviser::m_greed = 1.0;
QString
StorageAdviser::criteriaToString(int criteria)
{
QStringList labels;
if (criteria & SpeedCritical) labels.push_back("SpeedCritical");
if (criteria & PrecisionCritical) labels.push_back("PrecisionCritical");
if (criteria & LongRetentionLikely) labels.push_back("LongRetentionLikely");
if (criteria & FrequentLookupLikely) labels.push_back("FrequentLookupLikely");
if (labels.empty()) return "None";
else return labels.join("+");
}
QString
StorageAdviser::recommendationToString(int recommendation)
{
QStringList labels;
if (recommendation & UseMemory) labels.push_back("UseMemory");
if (recommendation & PreferMemory) labels.push_back("PreferMemory");
if (recommendation & PreferDisc) labels.push_back("PreferDisc");
if (recommendation & UseDisc) labels.push_back("UseDisc");
if (recommendation & ConserveSpace) labels.push_back("ConserveSpace");
if (recommendation & UseAsMuchAsYouLike) labels.push_back("UseAsMuchAsYouLike");
if (labels.empty()) return "None";
else return labels.join("+");
}
QString
StorageAdviser::storageStatusToString(StorageStatus status)
{
if (status == Insufficient) return "Insufficient";
if (status == Marginal) return "Marginal";
if (status == Sufficient) return "Sufficient";
return "Unknown";
}
size_t StorageAdviser::m_discPlanned = 0;
size_t StorageAdviser::m_memoryPlanned = 0;
StorageAdviser::Recommendation
StorageAdviser::m_baseRecommendation = StorageAdviser::NoRecommendation;
StorageAdviser::Recommendation
StorageAdviser::recommend(Criteria criteria,
size_t minimumSize,
size_t maximumSize)
{
SVDEBUG << "StorageAdviser::recommend: criteria " << criteria
<< " (" + criteriaToString(criteria) + ")"
<< ", minimumSize " << minimumSize
<< ", maximumSize " << maximumSize << endl;
if (m_baseRecommendation != NoRecommendation) {
SVDEBUG << "StorageAdviser::recommend: Returning fixed recommendation "
<< m_baseRecommendation << " ("
<< recommendationToString(m_baseRecommendation) << ")" << endl;
return m_baseRecommendation; // for now
}
QString path;
try {
path = TempDirectory::getInstance()->getPath();
} catch (const std::exception &e) {
SVDEBUG << "StorageAdviser::recommend: ERROR: Failed to get temporary directory path: " << e.what() << endl;
int r = UseMemory | ConserveSpace;
SVDEBUG << "StorageAdviser: returning fallback " << r
<< " (" << recommendationToString(r) << ")" << endl;
return Recommendation(r);
}
ssize_t discFree = GetDiscSpaceMBAvailable(path.toLocal8Bit());
ssize_t memoryFree, memoryTotal;
GetRealMemoryMBAvailable(memoryFree, memoryTotal);
SVDEBUG << "StorageAdviser: disc space: " << discFree
<< "M, memory free: " << memoryFree
<< "M, memory total: " << memoryTotal << "M" << endl;
// In 32-bit addressing mode we can't address more than 4Gb.
// If the total memory is reported as more than 4Gb, we should
// reduce the available amount by the difference between 4Gb
// and the total. This won't give us an accurate idea of the
// amount of memory available any more, but it should be enough
// to prevent us from trying to allocate more for our own use
// than can be addressed at all!
if (sizeof(void *) < 8) {
if (memoryTotal > 4096) {
ssize_t excess = memoryTotal - 4096;
if (memoryFree > excess) {
memoryFree -= excess;
} else {
memoryFree = 0;
}
SVDEBUG << "StorageAdviser: more real memory found than we "
<< "can address in a 32-bit process, reducing free "
<< "estimate to " << memoryFree << "M accordingly" << endl;
}
}
if (m_greed < 1.0) {
memoryFree = ssize_t(round(m_greed * memoryFree));
SVDEBUG << "StorageAdviser: greed is set to " << m_greed
<< ", scaled free real memory down to " << memoryFree << endl;
}
SVDEBUG << "StorageAdviser: disc planned: " << (m_discPlanned / 1024)
<< "K, memory planned: " << (m_memoryPlanned / 1024) << "K" << endl;
SVDEBUG << "StorageAdviser: min requested: " << minimumSize
<< "K, max requested: " << maximumSize << "K" << endl;
if (discFree > ssize_t(m_discPlanned / 1024 + 1)) {
discFree -= m_discPlanned / 1024 + 1;
} else if (discFree > 0) { // can also be -1 for unknown
discFree = 0;
}
if (memoryFree > ssize_t(m_memoryPlanned / 1024 + 1)) {
memoryFree -= m_memoryPlanned / 1024 + 1;
} else if (memoryFree > 0) { // can also be -1 for unknown
memoryFree = 0;
}
//!!! We have a potentially serious problem here if multiple
//recommendations are made in advance of any of the resulting
//allocations, as the allocations that have been recommended for
//won't be taken into account in subsequent recommendations.
StorageStatus memoryStatus = Unknown;
StorageStatus discStatus = Unknown;
ssize_t minmb = ssize_t(minimumSize / 1024 + 1);
ssize_t maxmb = ssize_t(maximumSize / 1024 + 1);
if (memoryFree == -1) memoryStatus = Unknown;
else if (memoryFree < memoryTotal / 3 && memoryFree < 512) memoryStatus = Insufficient;
else if (minmb > (memoryFree * 3) / 4) memoryStatus = Insufficient;
else if (maxmb > (memoryFree * 3) / 4) memoryStatus = Marginal;
else if (minmb > (memoryFree / 3)) memoryStatus = Marginal;
else if (memoryTotal == -1 ||
minmb > (memoryTotal / 10)) memoryStatus = Marginal;
else memoryStatus = Sufficient;
if (discFree == -1) discStatus = Unknown;
else if (minmb > (discFree * 3) / 4) discStatus = Insufficient;
else if (maxmb > (discFree / 4)) discStatus = Marginal;
else if (minmb > (discFree / 10)) discStatus = Marginal;
else discStatus = Sufficient;
SVDEBUG << "StorageAdviser: memory status: " << memoryStatus
<< " (" << storageStatusToString(memoryStatus) << ")"
<< ", disc status " << discStatus
<< " (" << storageStatusToString(discStatus) << ")" << endl;
int recommendation = NoRecommendation;
if (memoryStatus == Insufficient || memoryStatus == Unknown) {
recommendation |= UseDisc;
if (discStatus == Insufficient && minmb > discFree) {
throw InsufficientDiscSpace(path, minmb, discFree);
}
if (discStatus == Insufficient || discStatus == Marginal) {
recommendation |= ConserveSpace;
} else if (discStatus == Unknown && !(criteria & PrecisionCritical)) {
recommendation |= ConserveSpace;
} else {
recommendation |= UseAsMuchAsYouLike;
}
} else if (memoryStatus == Marginal) {
if (((criteria & SpeedCritical) ||
(criteria & FrequentLookupLikely)) &&
!(criteria & PrecisionCritical) &&
!(criteria & LongRetentionLikely)) {
// requirements suggest a preference for memory
if (discStatus != Insufficient) {
recommendation |= PreferMemory;
} else {
recommendation |= UseMemory;
}
recommendation |= ConserveSpace;
} else {
if (discStatus == Insufficient) {
recommendation |= (UseMemory | ConserveSpace);
} else if (discStatus == Marginal) {
recommendation |= (PreferMemory | ConserveSpace);
} else if (discStatus == Unknown) {
recommendation |= (PreferDisc | ConserveSpace);
} else {
recommendation |= (UseDisc | UseAsMuchAsYouLike);
}
}
} else {
if (discStatus == Insufficient) {
recommendation |= (UseMemory | ConserveSpace);
} else if (discStatus != Sufficient) {
recommendation |= (PreferMemory | ConserveSpace);
} else {
if ((criteria & SpeedCritical) ||
(criteria & FrequentLookupLikely)) {
recommendation |= PreferMemory;
if (criteria & PrecisionCritical) {
recommendation |= UseAsMuchAsYouLike;
} else {
recommendation |= ConserveSpace;
}
} else {
recommendation |= PreferDisc;
recommendation |= UseAsMuchAsYouLike;
}
}
}
SVDEBUG << "StorageAdviser: returning recommendation " << recommendation
<< " (" << recommendationToString(recommendation) << ")" << endl;
return Recommendation(recommendation);
}
void
StorageAdviser::notifyPlannedAllocation(AllocationArea area, size_t size)
{
if (area == MemoryAllocation) m_memoryPlanned += size;
else if (area == DiscAllocation) m_discPlanned += size;
SVDEBUG << "StorageAdviser: storage planned up: now memory: " << m_memoryPlanned << ", disc "
<< m_discPlanned << endl;
}
void
StorageAdviser::notifyDoneAllocation(AllocationArea area, size_t size)
{
if (area == MemoryAllocation) {
if (m_memoryPlanned > size) m_memoryPlanned -= size;
else m_memoryPlanned = 0;
} else if (area == DiscAllocation) {
if (m_discPlanned > size) m_discPlanned -= size;
else m_discPlanned = 0;
}
SVDEBUG << "StorageAdviser: storage planned down: now memory: " << m_memoryPlanned << ", disc "
<< m_discPlanned << endl;
}
void
StorageAdviser::setFixedRecommendation(Recommendation recommendation)
{
m_baseRecommendation = recommendation;
}
void
StorageAdviser::setRAMGreed(double greed)
{
if (greed < 0.0) greed = 0.0;
if (greed > 1.0) greed = 1.0;
m_greed = greed;
}
} // end namespace sv
|