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
|
// =================================================================================================
// Copyright Adobe
// Copyright 2004 Adobe
// All Rights Reserved
//
// NOTICE: Adobe permits you to use, modify, and distribute this file in accordance with the terms
// of the Adobe license agreement accompanying it.
// =================================================================================================
#include "public/include/XMP_Environment.h" // ! XMP_Environment.h must be the first included header.
#include "public/include/XMP_Const.h"
#include "public/include/XMP_IO.hpp"
#include "XMPFiles/source/XMPFiles_Impl.hpp"
#include "source/XMPFiles_IO.hpp"
#include "source/XIO.hpp"
#include "XMPFiles/source/FormatSupport/XMPScanner.hpp"
#include "XMPFiles/source/FileHandlers/Scanner_Handler.hpp"
#include <vector>
using namespace std;
#if EnablePacketScanning
// =================================================================================================
/// \file Scanner_Handler.cpp
/// \brief File format handler for packet scanning.
///
/// This header ...
///
// =================================================================================================
struct CandidateInfo {
XMP_PacketInfo packetInfo;
std::string xmpPacket;
SXMPMeta * xmpObj;
};
// =================================================================================================
// Scanner_MetaHandlerCTor
// =======================
XMPFileHandler * Scanner_MetaHandlerCTor ( XMPFiles * parent )
{
return new Scanner_MetaHandler ( parent );
} // Scanner_MetaHandlerCTor
// =================================================================================================
// Scanner_MetaHandler::Scanner_MetaHandler
// ========================================
Scanner_MetaHandler::Scanner_MetaHandler ( XMPFiles * _parent )
{
this->parent = _parent;
this->handlerFlags = kScanner_HandlerFlags;
} // Scanner_MetaHandler::Scanner_MetaHandler
// =================================================================================================
// Scanner_MetaHandler::~Scanner_MetaHandler
// =========================================
Scanner_MetaHandler::~Scanner_MetaHandler()
{
// ! Inherit the base cleanup.
} // Scanner_MetaHandler::~Scanner_MetaHandler
// =================================================================================================
// PickMainPacket
// ==============
//
// Pick the main packet from the vector of candidates. The rules:
// 1. Use the manifest find containment. Prune contained packets.
// 2. Use the metadata date to pick the most recent.
// 3. if lenient, pick the last writeable packet, or the last if all are read only.
static int
PickMainPacket ( std::vector<CandidateInfo>& candidates, bool beLenient )
{
int pkt; // ! Must be signed.
int main = -1; // Assume the worst.
XMP_OptionBits options;
int metaCount = (int)candidates.size();
if ( metaCount == 0 ) return -1;
if ( metaCount == 1 ) return 0;
// ---------------------------------------------------------------------------------------------
// 1. Look at each packet to see if it has a manifest. If it does, prune all of the others that
// this one says it contains. Hopefully we'll end up with just one packet. Note that we have to
// mark all the children first, then prune. Pruning on the fly means that we won't do a proper
// tree discovery if we prune a parent before a child. This would happen if we happened to visit
// a grandparent first.
int child;
std::vector<bool> pruned ( metaCount, false );
for ( pkt = 0; pkt < (int)candidates.size(); ++pkt ) {
// First see if this candidate has a manifest.
try {
std::string voidValue;
bool found = candidates[pkt].xmpObj->GetProperty ( kXMP_NS_XMP_MM, "Manifest", &voidValue, &options );
if ( (! found) || (! XMP_PropIsArray ( options )) ) continue; // No manifest, or not an array.
} catch ( ... ) {
continue; // No manifest.
};
// Mark all other candidates that are referred to in this manifest.
for ( child = 0; child < (int)candidates.size(); ++child ) {
if ( pruned[child] || (child == pkt) ) continue; // Skip already pruned ones and self.
}
}
// Go ahead and actually remove the marked packets.
for ( pkt = 0; pkt < (int)candidates.size(); ++pkt ) {
if ( pruned[pkt] ) {
delete candidates[pkt].xmpObj;
candidates[pkt].xmpObj = 0;
metaCount -= 1;
}
}
// We're done if the containment pruning left us with 0 or 1 candidate.
if ( metaCount == 0 ) {
XMP_Throw ( "GetMainPacket/PickMainPacket: Recursive containment", kXMPErr_BadXMP );
} else if ( metaCount == 1 ) {
for ( pkt = 0; pkt < (int)candidates.size(); ++pkt ) {
if ( candidates[pkt].xmpObj != 0 ) {
main = pkt;
break;
}
}
}
if ( main != -1 ) return main; // We found the main.
// -------------------------------------------------------------------------------------------
// 2. Pick the packet with the most recent metadata date. If we are being lenient then missing
// dates are older than any real date, and equal dates pick the last packet. If we are being
// strict then any missing or equal dates mean we can't pick.
XMP_DateTime latestTime, currTime;
for ( pkt = 0; pkt < (int)candidates.size(); ++pkt ) {
if ( candidates[pkt].xmpObj == 0 ) continue; // This was pruned in the manifest stage.
bool haveDate = candidates[pkt].xmpObj->GetProperty_Date ( kXMP_NS_XMP, "MetadataDate", &currTime, &options );
if ( ! haveDate ) {
if ( ! beLenient ) return -1;
if ( main == -1 ) {
main = pkt;
// (Exempi) Unsafe, constructor is already called
//memset ( &latestTime, 0, sizeof(latestTime) );
}
} else if ( main == -1 ) {
main = pkt;
latestTime = currTime;
} else {
int timeOp = SXMPUtils::CompareDateTime ( currTime, latestTime );
if ( timeOp > 0 ) {
main = pkt;
latestTime = currTime;
} else if ( timeOp == 0 ) {
if ( ! beLenient ) return -1;
main = pkt;
latestTime = currTime;
}
}
}
if ( main != -1 ) return main; // We found the main.
// --------------------------------------------------------------------------------------------
// 3. If we're being lenient, pick the last writeable packet, or the last if all are read only.
if ( beLenient ) {
for ( pkt = (int)candidates.size()-1; pkt >= 0; --pkt ) {
if ( candidates[pkt].xmpObj == 0 ) continue; // This was pruned in the manifest stage.
if ( candidates[pkt].packetInfo.writeable ) {
main = pkt;
break;
}
}
if ( main == -1 ) {
for ( pkt = (int)candidates.size()-1; pkt >= 0; --pkt ) {
if ( candidates[pkt].xmpObj != 0 ) {
main = pkt;
break;
}
}
}
}
return main;
} // PickMainPacket
// =================================================================================================
// Scanner_MetaHandler::CacheFileData
// ==================================
void Scanner_MetaHandler::CacheFileData()
{
XMP_IO* fileRef = this->parent->ioRef;
bool beLenient = XMP_OptionIsClear ( this->parent->openFlags, kXMPFiles_OpenStrictly );
int pkt;
XMP_Int64 bufPos;
size_t bufLen;
SXMPMeta * newMeta;
XMP_AbortProc abortProc = this->parent->abortProc;
void * abortArg = this->parent->abortArg;
const bool checkAbort = (abortProc != 0);
std::vector<CandidateInfo> candidates; // ! These have SXMPMeta* fields, don't leak on exceptions.
this->containsXMP = false;
try {
// ------------------------------------------------------
// Scan the entire file to find all of the valid packets.
XMP_Int64 fileLen = fileRef->Length();
XMPScanner scanner ( fileLen );
enum { kBufferSize = 64*1024 };
XMP_Uns8 buffer [kBufferSize];
fileRef->Rewind();
for ( bufPos = 0; bufPos < fileLen; bufPos += bufLen ) {
if ( checkAbort && abortProc(abortArg) ) {
XMP_Throw ( "Scanner_MetaHandler::LocateXMP - User abort", kXMPErr_UserAbort );
}
bufLen = fileRef->Read ( buffer, kBufferSize );
if ( bufLen == 0 ) XMP_Throw ( "Scanner_MetaHandler::LocateXMP: Read failure", kXMPErr_ExternalFailure );
scanner.Scan ( buffer, bufPos, bufLen );
}
// --------------------------------------------------------------
// Parse the valid packet snips, building a vector of candidates.
long snipCount = scanner.GetSnipCount();
XMPScanner::SnipInfoVector snips ( snipCount );
scanner.Report ( snips );
for ( pkt = 0; pkt < snipCount; ++pkt ) {
if ( checkAbort && abortProc(abortArg) ) {
XMP_Throw ( "Scanner_MetaHandler::LocateXMP - User abort", kXMPErr_UserAbort );
}
// Seek to the packet then try to parse it.
if ( snips[pkt].fState != XMPScanner::eValidPacketSnip ) continue;
fileRef->Seek ( snips[pkt].fOffset, kXMP_SeekFromStart );
newMeta = new SXMPMeta();
std::string xmpPacket_;
xmpPacket_.reserve ( (size_t)snips[pkt].fLength );
try {
for ( bufPos = 0; bufPos < snips[pkt].fLength; bufPos += bufLen ) {
bufLen = kBufferSize;
if ( (bufPos + bufLen) > (size_t)snips[pkt].fLength ) bufLen = size_t ( snips[pkt].fLength - bufPos );
(void) fileRef->ReadAll ( buffer, (XMP_Int32)bufLen );
xmpPacket_.append ( (const char *)buffer, bufLen );
newMeta->ParseFromBuffer ( (char *)buffer, (XMP_StringLen)bufLen, kXMP_ParseMoreBuffers );
}
newMeta->ParseFromBuffer ( 0, 0, kXMP_NoOptions );
} catch ( ... ) {
delete newMeta;
if ( beLenient ) continue; // Skip if we're being lenient, else rethrow.
throw;
}
// It parsed OK, add it to the array of candidates.
candidates.push_back ( CandidateInfo() );
CandidateInfo & newInfo = candidates.back();
newInfo.xmpObj = newMeta;
newInfo.xmpPacket.swap ( xmpPacket_ );
newInfo.packetInfo.offset = snips[pkt].fOffset;
newInfo.packetInfo.length = (XMP_Int32)snips[pkt].fLength;
newInfo.packetInfo.charForm = snips[pkt].fCharForm;
newInfo.packetInfo.writeable = (snips[pkt].fAccess == 'w');
}
// ----------------------------------------
// Figure out which packet is the main one.
int main = PickMainPacket ( candidates, beLenient );
if ( main != -1 ) {
this->packetInfo = candidates[main].packetInfo;
this->xmpPacket.swap ( candidates[main].xmpPacket );
this->xmpObj = *candidates[main].xmpObj;
this->containsXMP = true;
this->processedXMP = true;
}
for ( pkt = 0; pkt < (int)candidates.size(); ++pkt ) {
if ( candidates[pkt].xmpObj != 0 ) delete candidates[pkt].xmpObj;
}
} catch ( ... ) {
// Clean up the SXMPMeta* fields from the vector of candidates.
for ( pkt = 0; pkt < (int)candidates.size(); ++pkt ) {
if ( candidates[pkt].xmpObj != 0 ) delete candidates[pkt].xmpObj;
}
throw;
}
} // Scanner_MetaHandler::CacheFileData
// =================================================================================================
#endif // IncludePacketScanning
|