2000-05-23 01:55:31 +00:00
|
|
|
/*
|
|
|
|
* NuFX archive manipulation library
|
2007-02-19 23:12:22 +00:00
|
|
|
* Copyright (C) 2000-2007 by Andy McFadden, All Rights Reserved.
|
2000-05-23 01:55:31 +00:00
|
|
|
* This is free software; you can redistribute it and/or modify it under the
|
2007-02-19 23:12:22 +00:00
|
|
|
* terms of the BSD License, see the file COPYING-LIB.
|
2000-05-23 01:55:31 +00:00
|
|
|
*
|
|
|
|
* Implementation of NuFunnel, NuStraw and ProgressUpdater.
|
|
|
|
*/
|
|
|
|
#include "NufxLibPriv.h"
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* ===========================================================================
|
2002-09-21 00:49:42 +00:00
|
|
|
* Progress updater
|
2000-05-23 01:55:31 +00:00
|
|
|
* ===========================================================================
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Initialize the fields in a ProgressData structure, prior to compressing
|
|
|
|
* data into a record.
|
|
|
|
*
|
|
|
|
* The same structure will be used when expanding all threads in a given
|
|
|
|
* record.
|
|
|
|
*/
|
2014-12-23 00:00:33 +00:00
|
|
|
NuError Nu_ProgressDataInit_Compress(NuArchive* pArchive,
|
|
|
|
NuProgressData* pProgressData, const NuRecord* pRecord,
|
|
|
|
const char* origPathname)
|
2000-05-23 01:55:31 +00:00
|
|
|
{
|
2002-09-21 00:49:42 +00:00
|
|
|
const char* cp;
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2014-12-22 02:17:23 +00:00
|
|
|
Assert(pProgressData != NULL);
|
|
|
|
Assert(pArchive != NULL);
|
|
|
|
Assert(pRecord != NULL);
|
|
|
|
Assert(origPathname != NULL);
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
pProgressData->pRecord = pRecord;
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
pProgressData->origPathname = origPathname;
|
|
|
|
pProgressData->pathname = pRecord->filename;
|
|
|
|
cp = strrchr(pRecord->filename,
|
|
|
|
NuGetSepFromSysInfo(pRecord->recFileSysInfo));
|
2014-12-22 02:17:23 +00:00
|
|
|
if (cp == NULL || *(cp+1) == '\0')
|
2002-09-21 00:49:42 +00:00
|
|
|
pProgressData->filename = pProgressData->pathname;
|
|
|
|
else
|
|
|
|
pProgressData->filename = cp+1;
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
pProgressData->operation = kNuOpAdd;
|
|
|
|
pProgressData->state = kNuProgressPreparing;
|
|
|
|
/*pProgressData->compressedLength = 0;*/
|
|
|
|
/*pProgressData->compressedProgress = 0;*/
|
|
|
|
pProgressData->uncompressedLength = 0;
|
|
|
|
pProgressData->uncompressedProgress = 0;
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
pProgressData->compress.threadFormat = (NuThreadFormat)-1;
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2014-12-22 02:17:23 +00:00
|
|
|
/* ya know... if this is NULL, none of the above matters much */
|
2002-09-21 00:49:42 +00:00
|
|
|
pProgressData->progressFunc = pArchive->progressUpdaterFunc;
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
return kNuErrNone;
|
2000-05-23 01:55:31 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Initialize the fields in a ProgressData structure, prior to expanding
|
|
|
|
* data from a record.
|
|
|
|
*
|
|
|
|
* The same structure will be used when expanding all threads in a given
|
|
|
|
* record.
|
|
|
|
*/
|
2014-12-23 00:00:33 +00:00
|
|
|
NuError Nu_ProgressDataInit_Expand(NuArchive* pArchive,
|
|
|
|
NuProgressData* pProgressData, const NuRecord* pRecord,
|
|
|
|
const char* newPathname, char newFssep, NuValue convertEOL)
|
2000-05-23 01:55:31 +00:00
|
|
|
{
|
2002-09-21 00:49:42 +00:00
|
|
|
const NuThread* pThreadIter;
|
|
|
|
const char* cp;
|
|
|
|
int i;
|
|
|
|
|
2014-12-22 02:17:23 +00:00
|
|
|
Assert(pProgressData != NULL);
|
|
|
|
Assert(pArchive != NULL);
|
|
|
|
Assert(pRecord != NULL);
|
|
|
|
Assert(newPathname != NULL);
|
2002-09-21 00:49:42 +00:00
|
|
|
Assert(newFssep != 0);
|
|
|
|
|
|
|
|
pProgressData->pRecord = pRecord;
|
2014-12-22 02:17:23 +00:00
|
|
|
pProgressData->expand.pThread = NULL;
|
2002-09-21 00:49:42 +00:00
|
|
|
|
|
|
|
pProgressData->origPathname = pRecord->filename;
|
|
|
|
pProgressData->pathname = newPathname;
|
|
|
|
cp = strrchr(newPathname, newFssep);
|
2014-12-22 02:17:23 +00:00
|
|
|
if (cp == NULL || *(cp+1) == '\0')
|
2002-09-21 00:49:42 +00:00
|
|
|
pProgressData->filename = newPathname;
|
|
|
|
else
|
|
|
|
pProgressData->filename = cp+1;
|
|
|
|
|
|
|
|
pProgressData->expand.convertEOL = convertEOL;
|
|
|
|
|
|
|
|
/* total up the data threads */
|
|
|
|
pProgressData->expand.totalCompressedLength = 0;
|
|
|
|
pProgressData->expand.totalUncompressedLength = 0;
|
|
|
|
|
|
|
|
for (i = 0; i < (int)pRecord->recTotalThreads; i++) {
|
|
|
|
pThreadIter = Nu_GetThread(pRecord, i);
|
|
|
|
if (pThreadIter->thThreadClass != kNuThreadClassData)
|
|
|
|
continue;
|
|
|
|
pProgressData->expand.totalCompressedLength += pThreadIter->thCompThreadEOF;
|
|
|
|
pProgressData->expand.totalUncompressedLength += pThreadIter->actualThreadEOF;
|
|
|
|
}
|
|
|
|
|
|
|
|
pProgressData->operation = kNuOpExtract;
|
|
|
|
if (pArchive->testMode)
|
|
|
|
pProgressData->operation = kNuOpTest;
|
|
|
|
pProgressData->state = kNuProgressPreparing;
|
|
|
|
/*pProgressData->expand.compressedLength = 0;*/
|
|
|
|
/*pProgressData->expand.compressedProgress = 0;*/
|
|
|
|
pProgressData->uncompressedLength = 0;
|
|
|
|
pProgressData->uncompressedProgress = 0;
|
|
|
|
|
2014-12-22 02:17:23 +00:00
|
|
|
/* ya know... if this is NULL, none of the above matters much */
|
2002-09-21 00:49:42 +00:00
|
|
|
pProgressData->progressFunc = pArchive->progressUpdaterFunc;
|
|
|
|
|
|
|
|
return kNuErrNone;
|
2000-05-23 01:55:31 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Do the setup on a ProgressData prior to compressing a thread.
|
|
|
|
*/
|
2014-12-23 00:00:33 +00:00
|
|
|
NuError Nu_ProgressDataCompressPrep(NuArchive* pArchive, NuStraw* pStraw,
|
2014-12-22 02:35:09 +00:00
|
|
|
NuThreadFormat threadFormat, uint32_t sourceLen)
|
2000-05-23 01:55:31 +00:00
|
|
|
{
|
2002-09-21 00:49:42 +00:00
|
|
|
NuProgressData* pProgressData;
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2014-12-22 02:17:23 +00:00
|
|
|
Assert(pArchive != NULL);
|
|
|
|
Assert(pStraw != NULL);
|
2002-09-21 00:49:42 +00:00
|
|
|
Assert(sourceLen < 32767*65536);
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
pProgressData = pStraw->pProgress;
|
2014-12-22 02:17:23 +00:00
|
|
|
if (pProgressData == NULL)
|
2002-09-21 00:49:42 +00:00
|
|
|
return kNuErrNone;
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
pProgressData->uncompressedLength = sourceLen;
|
|
|
|
pProgressData->compress.threadFormat = threadFormat;
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
return kNuErrNone;
|
2000-05-23 01:55:31 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Do the setup on a ProgressData prior to expanding a thread.
|
|
|
|
*
|
|
|
|
* "pThread" is the thread being expanded.
|
|
|
|
*/
|
2014-12-23 00:00:33 +00:00
|
|
|
NuError Nu_ProgressDataExpandPrep(NuArchive* pArchive, NuFunnel* pFunnel,
|
2002-09-21 00:49:42 +00:00
|
|
|
const NuThread* pThread)
|
2000-05-23 01:55:31 +00:00
|
|
|
{
|
2002-09-21 00:49:42 +00:00
|
|
|
NuProgressData* pProgressData;
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2014-12-22 02:17:23 +00:00
|
|
|
Assert(pArchive != NULL);
|
|
|
|
Assert(pFunnel != NULL);
|
|
|
|
Assert(pThread != NULL);
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
pProgressData = pFunnel->pProgress;
|
2014-12-22 02:17:23 +00:00
|
|
|
if (pProgressData == NULL)
|
2002-09-21 00:49:42 +00:00
|
|
|
return kNuErrNone;
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
/*pProgressData->compressedLength = pThread->thCompThreadEOF;*/
|
|
|
|
pProgressData->uncompressedLength = pThread->actualThreadEOF;
|
|
|
|
pProgressData->expand.pThread = pThread;
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
return kNuErrNone;
|
2000-05-23 01:55:31 +00:00
|
|
|
}
|
|
|
|
|
2002-12-28 03:10:09 +00:00
|
|
|
/*
|
|
|
|
* Compute a completion percentage.
|
|
|
|
*/
|
2014-12-23 00:00:33 +00:00
|
|
|
static int Nu_ComputePercent(uint32_t total, uint32_t progress)
|
2002-12-28 03:10:09 +00:00
|
|
|
{
|
2014-12-22 02:35:09 +00:00
|
|
|
uint32_t perc;
|
2002-12-28 03:10:09 +00:00
|
|
|
|
|
|
|
if (!total)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
if (total < 21474836) {
|
|
|
|
perc = (progress * 100 + 50) / total;
|
|
|
|
if (perc > 100)
|
|
|
|
perc = 100;
|
|
|
|
} else {
|
|
|
|
perc = progress / (total / 100);
|
|
|
|
if (perc > 100)
|
|
|
|
perc = 100;
|
|
|
|
}
|
|
|
|
|
|
|
|
return (int) perc;
|
|
|
|
}
|
|
|
|
|
2000-05-23 01:55:31 +00:00
|
|
|
/*
|
|
|
|
* Send the initial progress message, before the output file is opened
|
|
|
|
* (when extracting) or the input file is opened (when adding).
|
|
|
|
*/
|
2014-12-23 00:00:33 +00:00
|
|
|
NuError Nu_SendInitialProgress(NuArchive* pArchive, NuProgressData* pProgress)
|
2000-05-23 01:55:31 +00:00
|
|
|
{
|
2002-09-21 00:49:42 +00:00
|
|
|
NuResult result;
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2014-12-22 02:17:23 +00:00
|
|
|
Assert(pArchive != NULL);
|
|
|
|
Assert(pProgress != NULL);
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2014-12-22 02:17:23 +00:00
|
|
|
if (pProgress->progressFunc == NULL)
|
2002-09-21 00:49:42 +00:00
|
|
|
return kNuErrNone;
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-12-28 03:10:09 +00:00
|
|
|
pProgress->percentComplete = Nu_ComputePercent(
|
|
|
|
pProgress->uncompressedLength, pProgress->uncompressedProgress);
|
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
result = (*pProgress->progressFunc)(pArchive, (NuProgressData*) pProgress);
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
if (result == kNuSkip)
|
|
|
|
return kNuErrSkipped; /* [dunno how well this works] */
|
|
|
|
if (result == kNuAbort)
|
|
|
|
return kNuErrAborted;
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
return kNuErrNone;
|
2000-05-23 01:55:31 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* ===========================================================================
|
2002-09-21 00:49:42 +00:00
|
|
|
* NuFunnel object
|
2000-05-23 01:55:31 +00:00
|
|
|
* ===========================================================================
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Allocate and initialize a Funnel.
|
|
|
|
*/
|
2014-12-23 00:00:33 +00:00
|
|
|
NuError Nu_FunnelNew(NuArchive* pArchive, NuDataSink* pDataSink,
|
|
|
|
NuValue convertEOL, NuValue convertEOLTo, NuProgressData* pProgress,
|
|
|
|
NuFunnel** ppFunnel)
|
2000-05-23 01:55:31 +00:00
|
|
|
{
|
2002-09-21 00:49:42 +00:00
|
|
|
NuError err = kNuErrNone;
|
2014-12-22 02:17:23 +00:00
|
|
|
NuFunnel* pFunnel = NULL;
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2014-12-22 02:17:23 +00:00
|
|
|
Assert(ppFunnel != NULL);
|
|
|
|
Assert(pDataSink != NULL);
|
2002-09-21 00:49:42 +00:00
|
|
|
Assert(convertEOL == kNuConvertOff ||
|
|
|
|
convertEOL == kNuConvertOn ||
|
|
|
|
convertEOL == kNuConvertAuto);
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
pFunnel = Nu_Calloc(pArchive, sizeof(*pFunnel));
|
|
|
|
BailAlloc(pFunnel);
|
|
|
|
pFunnel->buffer = Nu_Malloc(pArchive, kNuFunnelBufSize);
|
|
|
|
BailAlloc(pFunnel->buffer);
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
pFunnel->pDataSink = pDataSink;
|
|
|
|
pFunnel->convertEOL = convertEOL;
|
|
|
|
pFunnel->convertEOLTo = convertEOLTo;
|
2003-03-10 23:05:48 +00:00
|
|
|
pFunnel->convertEOLFrom = kNuEOLUnknown;
|
2002-09-21 00:49:42 +00:00
|
|
|
pFunnel->pProgress = pProgress;
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2003-03-11 22:09:16 +00:00
|
|
|
pFunnel->checkStripHighASCII = (pArchive->valStripHighASCII != 0);
|
2003-03-10 23:05:48 +00:00
|
|
|
pFunnel->doStripHighASCII = false; /* determined on first write */
|
|
|
|
|
|
|
|
pFunnel->isFirstWrite = true;
|
|
|
|
|
2000-05-23 01:55:31 +00:00
|
|
|
bail:
|
2002-09-21 00:49:42 +00:00
|
|
|
if (err != kNuErrNone)
|
|
|
|
Nu_FunnelFree(pArchive, pFunnel);
|
|
|
|
else
|
|
|
|
*ppFunnel = pFunnel;
|
|
|
|
return err;
|
2000-05-23 01:55:31 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Free a Funnel.
|
|
|
|
*
|
|
|
|
* The data should already have been written; it's not the duty of a
|
|
|
|
* "free" function to flush data out.
|
|
|
|
*/
|
2014-12-23 00:00:33 +00:00
|
|
|
NuError Nu_FunnelFree(NuArchive* pArchive, NuFunnel* pFunnel)
|
2000-05-23 01:55:31 +00:00
|
|
|
{
|
2014-12-22 02:17:23 +00:00
|
|
|
if (pFunnel == NULL)
|
2002-09-21 00:49:42 +00:00
|
|
|
return kNuErrNone;
|
2000-05-23 01:55:31 +00:00
|
|
|
|
|
|
|
#ifdef DEBUG_MSGS
|
2002-09-21 00:49:42 +00:00
|
|
|
if (pFunnel->bufCount)
|
|
|
|
Nu_ReportError(NU_BLOB_DEBUG, kNuErrNone,
|
|
|
|
"freeing non-empty funnel");
|
2000-05-23 01:55:31 +00:00
|
|
|
#endif
|
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
Nu_Free(pArchive, pFunnel->buffer);
|
|
|
|
Nu_Free(pArchive, pFunnel);
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
return kNuErrNone;
|
2000-05-23 01:55:31 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
#if 0
|
|
|
|
/*
|
|
|
|
* Set the maximum amount of output we're willing to push through the
|
|
|
|
* funnel. Attempts to write more than this many bytes will fail. This
|
|
|
|
* allows us to bail out as soon as it's apparent that compression is
|
|
|
|
* failing and is actually resulting in a larger file.
|
|
|
|
*/
|
2014-12-23 00:00:33 +00:00
|
|
|
void Nu_FunnelSetMaxOutput(NuFunnel* pFunnel, uint32_t maxBytes)
|
2000-05-23 01:55:31 +00:00
|
|
|
{
|
2014-12-22 02:17:23 +00:00
|
|
|
Assert(pFunnel != NULL);
|
2002-09-21 00:49:42 +00:00
|
|
|
Assert(maxBytes > 0);
|
|
|
|
|
|
|
|
pFunnel->outMax = maxBytes;
|
|
|
|
if (pFunnel->outCount >= pFunnel->outMax)
|
|
|
|
pFunnel->outMaxExceeded = true;
|
|
|
|
else
|
|
|
|
pFunnel->outMaxExceeded = false;
|
2000-05-23 01:55:31 +00:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
2003-03-10 23:05:48 +00:00
|
|
|
/*
|
|
|
|
* Check to see if this is a high-ASCII file. To qualify, EVERY
|
|
|
|
* character must have its high bit set, except for spaces (0x20).
|
|
|
|
* (The exception is courtesy Glen Bredon's "Merlin".)
|
|
|
|
*/
|
2014-12-23 00:00:33 +00:00
|
|
|
static Boolean Nu_CheckHighASCII(const NuFunnel* pFunnel, const uint8_t* buffer,
|
2014-12-22 02:35:09 +00:00
|
|
|
uint32_t count)
|
2003-03-10 23:05:48 +00:00
|
|
|
{
|
|
|
|
Boolean isHighASCII;
|
|
|
|
|
2014-12-22 02:17:23 +00:00
|
|
|
Assert(buffer != NULL);
|
2003-03-10 23:05:48 +00:00
|
|
|
Assert(count != 0);
|
|
|
|
Assert(pFunnel->checkStripHighASCII);
|
|
|
|
|
|
|
|
isHighASCII = true;
|
|
|
|
while (count--) {
|
|
|
|
if ((*buffer & 0x80) == 0 && *buffer != 0x20) {
|
|
|
|
isHighASCII = false;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
buffer++;
|
|
|
|
}
|
|
|
|
|
|
|
|
return isHighASCII;
|
|
|
|
}
|
|
|
|
|
2000-05-23 01:55:31 +00:00
|
|
|
/*
|
|
|
|
* Table determining what's a binary character and what isn't. It would
|
|
|
|
* possibly be more compact to generate this from a simple description,
|
|
|
|
* but I'm hoping static/const data will end up in the code segment and
|
|
|
|
* save space on the heap.
|
|
|
|
*
|
|
|
|
* This corresponds to less-316's ISO-latin1 "8bcccbcc18b95.33b.". This
|
|
|
|
* may be too loose by itself; we may want to require that the lower-ASCII
|
|
|
|
* values appear in higher proportions than the upper-ASCII values.
|
|
|
|
* Otherwise we run the risk of converting a binary file with specific
|
2003-03-10 23:05:48 +00:00
|
|
|
* properties. (Note that "upper-ASCII" refers to umlauts and other
|
|
|
|
* accented characters, not DOS 3.3 "high ASCII".)
|
2000-05-23 01:55:31 +00:00
|
|
|
*
|
|
|
|
* The auto-detect mechanism will never be perfect though, so there's not
|
|
|
|
* much point in tweaking it to death.
|
|
|
|
*/
|
|
|
|
static const char gNuIsBinary[256] = {
|
2002-09-21 00:49:42 +00:00
|
|
|
1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, /* ^@-^O */
|
|
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* ^P-^_ */
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* - / */
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0 - ? */
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* @ - O */
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* P - _ */
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* ` - o */
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, /* p - DEL */
|
|
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 0x80 */
|
|
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 0x90 */
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0xa0 */
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0xb0 */
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0xc0 */
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0xd0 */
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0xe0 */
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0xf0 */
|
2000-05-23 01:55:31 +00:00
|
|
|
};
|
|
|
|
|
2003-03-10 23:05:48 +00:00
|
|
|
#define kNuMaxUpperASCII 1 /* max #of binary chars per 100 bytes */
|
2002-09-21 00:49:42 +00:00
|
|
|
#define kNuMinConvThreshold 40 /* min of 40 chars for auto-detect */
|
2000-05-23 01:55:31 +00:00
|
|
|
/*
|
|
|
|
* Decide, based on the contents of the buffer, whether we should do an
|
|
|
|
* EOL conversion on the data.
|
|
|
|
*
|
|
|
|
* We need to decide if we are looking at text data, and if so, what kind
|
|
|
|
* of line terminator is in use.
|
|
|
|
*
|
|
|
|
* If we don't have enough data to make a determination, don't mess with it.
|
2003-02-18 21:39:44 +00:00
|
|
|
* (Thought for the day: add a "bias" flag, based on the NuRecord fileType,
|
2003-03-10 23:05:48 +00:00
|
|
|
* that causes us to handle borderline or sub-min-threshold cases more
|
|
|
|
* reasonably. If it's of type TXT, it's probably text.)
|
2000-05-23 01:55:31 +00:00
|
|
|
*
|
|
|
|
* We try to figure out whether it's CR, LF, or CRLF, so that we can
|
|
|
|
* skip the CPU-intensive conversion process if it isn't necessary.
|
2003-03-10 23:05:48 +00:00
|
|
|
*
|
|
|
|
* We will also enable a "high-ASCII" stripper if requested. This is
|
|
|
|
* only enabled when EOL conversions are enabled.
|
2003-03-11 22:09:16 +00:00
|
|
|
*
|
|
|
|
* Returns kConvEOLOff or kConvEOLOn, and sets pFunnel->doStripHighASCII
|
|
|
|
* if pFunnel->CheckStripHighASCII is set.
|
2000-05-23 01:55:31 +00:00
|
|
|
*/
|
2014-12-23 00:00:33 +00:00
|
|
|
static NuValue Nu_DetermineConversion(NuFunnel* pFunnel, const uint8_t* buffer,
|
|
|
|
uint32_t count)
|
2000-05-23 01:55:31 +00:00
|
|
|
{
|
2014-12-22 02:35:09 +00:00
|
|
|
uint32_t bufCount, numBinary, numLF, numCR;
|
2003-03-10 23:05:48 +00:00
|
|
|
Boolean isHighASCII;
|
2014-12-22 02:35:09 +00:00
|
|
|
uint8_t val;
|
2002-09-21 00:49:42 +00:00
|
|
|
|
|
|
|
if (count < kNuMinConvThreshold)
|
|
|
|
return kNuConvertOff;
|
|
|
|
|
2003-03-10 23:05:48 +00:00
|
|
|
/*
|
|
|
|
* Check to see if the buffer is all high-ASCII characters. If it is,
|
|
|
|
* we want to strip characters before we test them below.
|
|
|
|
*/
|
|
|
|
if (pFunnel->checkStripHighASCII) {
|
|
|
|
isHighASCII = Nu_CheckHighASCII(pFunnel, buffer, count);
|
|
|
|
DBUG(("+++ determined isHighASCII=%d\n", isHighASCII));
|
|
|
|
} else {
|
|
|
|
isHighASCII = false;
|
|
|
|
DBUG(("+++ not even checking isHighASCII\n"));
|
|
|
|
}
|
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
bufCount = count;
|
|
|
|
numBinary = numLF = numCR = 0;
|
|
|
|
while (bufCount--) {
|
|
|
|
val = *buffer++;
|
2003-03-10 23:05:48 +00:00
|
|
|
if (isHighASCII)
|
|
|
|
val &= 0x7f;
|
2002-09-21 00:49:42 +00:00
|
|
|
if (gNuIsBinary[val])
|
|
|
|
numBinary++;
|
|
|
|
if (val == kNuCharLF)
|
|
|
|
numLF++;
|
|
|
|
if (val == kNuCharCR)
|
|
|
|
numCR++;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* if #found is > #allowed, it's a binary file */
|
|
|
|
if (count < 100) {
|
|
|
|
/* use simplified check on files between kNuMinConvThreshold and 100 */
|
2003-03-10 23:05:48 +00:00
|
|
|
if (numBinary > kNuMaxUpperASCII)
|
2002-09-21 00:49:42 +00:00
|
|
|
return kNuConvertOff;
|
2003-03-10 23:05:48 +00:00
|
|
|
} else if (numBinary > (count / 100) * kNuMaxUpperASCII)
|
2002-09-21 00:49:42 +00:00
|
|
|
return kNuConvertOff;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If our "convert to" setting is the same as what we're converting
|
|
|
|
* from, we can turn off the converter and speed things up.
|
|
|
|
*
|
|
|
|
* These are simplistic, but this is intended as an optimization. We
|
|
|
|
* will blow it if the input has lots of CRs and LFs scattered about,
|
|
|
|
* and they just happen to be in equal amounts, but it's not clear
|
|
|
|
* to me that an automatic EOL conversion makes sense on that sort
|
|
|
|
* of file anyway.
|
2003-03-10 23:05:48 +00:00
|
|
|
*
|
|
|
|
* None of this applies if we also need to do a high-ASCII conversion.
|
2002-09-21 00:49:42 +00:00
|
|
|
*/
|
2003-03-10 23:05:48 +00:00
|
|
|
if (isHighASCII) {
|
|
|
|
pFunnel->doStripHighASCII = true;
|
|
|
|
} else {
|
|
|
|
if (numLF && !numCR)
|
|
|
|
pFunnel->convertEOLFrom = kNuEOLLF;
|
|
|
|
else if (!numLF && numCR)
|
|
|
|
pFunnel->convertEOLFrom = kNuEOLCR;
|
|
|
|
else if (numLF && numLF == numCR)
|
|
|
|
pFunnel->convertEOLFrom = kNuEOLCRLF;
|
|
|
|
else
|
|
|
|
pFunnel->convertEOLFrom = kNuEOLUnknown;
|
|
|
|
}
|
2002-09-21 00:49:42 +00:00
|
|
|
|
|
|
|
return kNuConvertOn;
|
2000-05-23 01:55:31 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Write a block of data to the appropriate output device. Test for
|
|
|
|
* excessive data, and raise "outMaxExceeded" if we overrun.
|
|
|
|
*
|
|
|
|
* This is either a Funnel function or a DataSink function, depending on
|
|
|
|
* your perspective.
|
|
|
|
*/
|
2014-12-23 00:00:33 +00:00
|
|
|
static inline void Nu_FunnelPutBlock(NuFunnel* pFunnel, const uint8_t* buf,
|
|
|
|
uint32_t len)
|
2000-05-23 01:55:31 +00:00
|
|
|
{
|
2014-12-22 02:17:23 +00:00
|
|
|
Assert(pFunnel != NULL);
|
|
|
|
Assert(pFunnel->pDataSink != NULL);
|
|
|
|
Assert(buf != NULL);
|
2002-09-21 00:49:42 +00:00
|
|
|
Assert(len > 0);
|
2000-05-23 01:55:31 +00:00
|
|
|
|
|
|
|
#if 0
|
2002-09-21 00:49:42 +00:00
|
|
|
if (pFunnel->outMax) {
|
|
|
|
if (pFunnel->outMaxExceeded)
|
|
|
|
return;
|
|
|
|
if (pFunnel->outCount + len > pFunnel->outMax) {
|
|
|
|
pFunnel->outMaxExceeded = true;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
pFunnel->outCount += len;
|
2000-05-23 01:55:31 +00:00
|
|
|
#endif
|
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
Nu_DataSinkPutBlock(pFunnel->pDataSink, buf, len);
|
2000-05-23 01:55:31 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Output the EOL marker requested for this system.
|
|
|
|
*/
|
2014-12-23 00:00:33 +00:00
|
|
|
static inline void Nu_PutEOL(NuFunnel* pFunnel)
|
2000-05-23 01:55:31 +00:00
|
|
|
{
|
2014-12-22 02:35:09 +00:00
|
|
|
uint8_t ch;
|
2002-09-21 00:49:42 +00:00
|
|
|
|
|
|
|
if (pFunnel->convertEOLTo == kNuEOLCR) {
|
|
|
|
ch = kNuCharCR;
|
|
|
|
Nu_FunnelPutBlock(pFunnel, &ch, 1);
|
|
|
|
} else if (pFunnel->convertEOLTo == kNuEOLLF) {
|
|
|
|
ch = kNuCharLF;
|
|
|
|
Nu_FunnelPutBlock(pFunnel, &ch, 1);
|
|
|
|
} else if (pFunnel->convertEOLTo == kNuEOLCRLF) {
|
|
|
|
ch = kNuCharCR;
|
|
|
|
Nu_FunnelPutBlock(pFunnel, &ch, 1);
|
|
|
|
ch = kNuCharLF;
|
|
|
|
Nu_FunnelPutBlock(pFunnel, &ch, 1);
|
|
|
|
} else {
|
|
|
|
Assert(0);
|
|
|
|
}
|
2000-05-23 01:55:31 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Write a buffer of data, using the EOL conversion associated with the
|
|
|
|
* funnel (if any).
|
|
|
|
*
|
|
|
|
* When converting to the system's EOL convention, we take anything
|
|
|
|
* that looks like an EOL mark and convert it. Doesn't matter if it's
|
|
|
|
* CR, LF, or CRLF; all three get converted to whatever the system uses.
|
|
|
|
*/
|
2014-12-23 00:00:33 +00:00
|
|
|
static NuError Nu_FunnelWriteConvert(NuFunnel* pFunnel, const uint8_t* buffer,
|
|
|
|
uint32_t count)
|
2000-05-23 01:55:31 +00:00
|
|
|
{
|
2002-09-21 00:49:42 +00:00
|
|
|
NuError err = kNuErrNone;
|
2014-12-22 02:35:09 +00:00
|
|
|
uint32_t progressCount = count;
|
2002-09-21 00:49:42 +00:00
|
|
|
|
|
|
|
/*if (pFunnel->outMaxExceeded)
|
|
|
|
return kNuErrOutMax;*/
|
|
|
|
|
2003-03-10 23:05:48 +00:00
|
|
|
if (pFunnel->isFirstWrite) {
|
2002-09-21 00:49:42 +00:00
|
|
|
/*
|
|
|
|
* This is the first write/flush we've done on this Funnel.
|
|
|
|
* Check the data we have buffered to decide whether or not
|
2003-03-10 23:05:48 +00:00
|
|
|
* we want to do text conversions.
|
2002-09-21 00:49:42 +00:00
|
|
|
*/
|
2003-03-10 23:05:48 +00:00
|
|
|
if (pFunnel->convertEOL == kNuConvertAuto) {
|
|
|
|
pFunnel->convertEOL = Nu_DetermineConversion(pFunnel, buffer,count);
|
|
|
|
DBUG(("+++ DetermineConversion --> %ld / %ld (%d)\n",
|
|
|
|
pFunnel->convertEOL, pFunnel->convertEOLFrom,
|
|
|
|
pFunnel->doStripHighASCII));
|
|
|
|
|
|
|
|
if (pFunnel->convertEOLFrom == pFunnel->convertEOLTo) {
|
|
|
|
DBUG(("+++ Switching redundant converter off\n"));
|
|
|
|
pFunnel->convertEOL = kNuConvertOff;
|
|
|
|
}
|
|
|
|
/* put it where the progress meter can see it */
|
2014-12-22 02:17:23 +00:00
|
|
|
if (pFunnel->pProgress != NULL)
|
2003-03-10 23:05:48 +00:00
|
|
|
pFunnel->pProgress->expand.convertEOL = pFunnel->convertEOL;
|
|
|
|
} else if (pFunnel->convertEOL == kNuConvertOn) {
|
|
|
|
if (pFunnel->checkStripHighASCII) {
|
|
|
|
/* assume this part of the buffer is representative */
|
|
|
|
pFunnel->doStripHighASCII = Nu_CheckHighASCII(pFunnel,
|
|
|
|
buffer, count);
|
|
|
|
} else {
|
|
|
|
Assert(!pFunnel->doStripHighASCII);
|
|
|
|
}
|
|
|
|
DBUG(("+++ Converter is on, convHighASCII=%d\n",
|
|
|
|
pFunnel->doStripHighASCII));
|
2002-09-21 00:49:42 +00:00
|
|
|
}
|
|
|
|
}
|
2003-03-10 23:05:48 +00:00
|
|
|
Assert(pFunnel->convertEOL != kNuConvertAuto); /* on or off now */
|
|
|
|
pFunnel->isFirstWrite = false;
|
2002-09-21 00:49:42 +00:00
|
|
|
|
|
|
|
if (pFunnel->convertEOL == kNuConvertOff) {
|
|
|
|
/* write it straight */
|
|
|
|
Nu_FunnelPutBlock(pFunnel, buffer, count);
|
|
|
|
} else {
|
2003-03-10 23:05:48 +00:00
|
|
|
/* do the EOL conversion and optional high-bit stripping */
|
|
|
|
Boolean lastCR = pFunnel->lastCR; /* make local copy */
|
2014-12-22 02:35:09 +00:00
|
|
|
uint8_t uch;
|
2003-03-10 23:05:48 +00:00
|
|
|
int mask;
|
|
|
|
|
|
|
|
if (pFunnel->doStripHighASCII)
|
|
|
|
mask = 0x7f;
|
|
|
|
else
|
|
|
|
mask = 0xff;
|
2002-09-21 00:49:42 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* We could get a significant speed improvement here by writing
|
|
|
|
* non-EOL chars as a larger block instead of single bytes.
|
|
|
|
*/
|
|
|
|
while (count--) {
|
2003-03-10 23:05:48 +00:00
|
|
|
uch = (*buffer) & mask;
|
|
|
|
|
|
|
|
if (uch == kNuCharCR) {
|
2002-09-21 00:49:42 +00:00
|
|
|
Nu_PutEOL(pFunnel);
|
|
|
|
lastCR = true;
|
2003-03-10 23:05:48 +00:00
|
|
|
} else if (uch == kNuCharLF) {
|
2002-09-21 00:49:42 +00:00
|
|
|
if (!lastCR)
|
|
|
|
Nu_PutEOL(pFunnel);
|
|
|
|
lastCR = false;
|
|
|
|
} else {
|
|
|
|
Nu_FunnelPutBlock(pFunnel, &uch, 1);
|
|
|
|
lastCR = false;
|
|
|
|
}
|
|
|
|
buffer++;
|
|
|
|
}
|
2003-03-10 23:05:48 +00:00
|
|
|
pFunnel->lastCR = lastCR; /* save copy */
|
2002-09-21 00:49:42 +00:00
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
/*if (pFunnel->outMaxExceeded)
|
|
|
|
err = kNuErrOutMax;*/
|
|
|
|
|
|
|
|
err = Nu_DataSinkGetError(pFunnel->pDataSink);
|
|
|
|
|
|
|
|
/* update progress counter with pre-LFCR count */
|
2014-12-22 02:17:23 +00:00
|
|
|
if (err == kNuErrNone && pFunnel->pProgress != NULL)
|
2002-09-21 00:49:42 +00:00
|
|
|
pFunnel->pProgress->uncompressedProgress += progressCount;
|
|
|
|
|
|
|
|
return err;
|
2000-05-23 01:55:31 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Flush any data currently in the funnel.
|
|
|
|
*/
|
2014-12-23 00:00:33 +00:00
|
|
|
NuError Nu_FunnelFlush(NuArchive* pArchive, NuFunnel* pFunnel)
|
2000-05-23 01:55:31 +00:00
|
|
|
{
|
2002-09-21 00:49:42 +00:00
|
|
|
NuError err = kNuErrNone;
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
if (!pFunnel->bufCount)
|
|
|
|
goto bail;
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
err = Nu_FunnelWriteConvert(pFunnel, pFunnel->buffer, pFunnel->bufCount);
|
|
|
|
BailError(err);
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
pFunnel->bufCount = 0;
|
|
|
|
err = Nu_FunnelSendProgressUpdate(pArchive, pFunnel);
|
|
|
|
/* fall through with error */
|
2000-05-23 01:55:31 +00:00
|
|
|
|
|
|
|
bail:
|
2002-09-21 00:49:42 +00:00
|
|
|
return err;
|
2000-05-23 01:55:31 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Write a bunch of bytes into a funnel. They will be held in the buffer
|
|
|
|
* if they fit, or flushed out the bottom if not.
|
|
|
|
*/
|
2014-12-23 00:00:33 +00:00
|
|
|
NuError Nu_FunnelWrite(NuArchive* pArchive, NuFunnel* pFunnel,
|
|
|
|
const uint8_t* buffer, uint32_t count)
|
2000-05-23 01:55:31 +00:00
|
|
|
{
|
2002-09-21 00:49:42 +00:00
|
|
|
NuError err = kNuErrNone;
|
|
|
|
|
|
|
|
/*pFunnel->inCount += count;*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If it will fit into the buffer, just copy it in.
|
|
|
|
*/
|
|
|
|
if (pFunnel->bufCount + count < kNuFunnelBufSize) {
|
2002-09-26 22:11:12 +00:00
|
|
|
if (count == 1) /* minor optimization */
|
|
|
|
*(pFunnel->buffer + pFunnel->bufCount) = *buffer;
|
|
|
|
else
|
|
|
|
memcpy(pFunnel->buffer + pFunnel->bufCount, buffer, count);
|
2002-09-21 00:49:42 +00:00
|
|
|
pFunnel->bufCount += count;
|
|
|
|
goto bail;
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* Won't fit. We have to flush what we have, and we can either
|
|
|
|
* blow out what we were just given or put it at the start of
|
|
|
|
* the buffer.
|
|
|
|
*/
|
2002-10-11 21:57:38 +00:00
|
|
|
if (pFunnel->bufCount) {
|
|
|
|
err = Nu_FunnelFlush(pArchive, pFunnel);
|
|
|
|
BailError(err);
|
|
|
|
} else {
|
|
|
|
err = Nu_FunnelSendProgressUpdate(pArchive, pFunnel);
|
|
|
|
BailError(err);
|
|
|
|
}
|
|
|
|
|
|
|
|
Assert(pFunnel->bufCount == 0);
|
2002-09-21 00:49:42 +00:00
|
|
|
|
|
|
|
if (count >= kNuFunnelBufSize / 4) {
|
|
|
|
/* it's more than 25% of the buffer, just write it now */
|
|
|
|
err = Nu_FunnelWriteConvert(pFunnel, buffer, count);
|
|
|
|
BailError(err);
|
|
|
|
} else {
|
|
|
|
memcpy(pFunnel->buffer, buffer, count);
|
|
|
|
pFunnel->bufCount = count;
|
|
|
|
}
|
|
|
|
goto bail;
|
|
|
|
}
|
2000-05-23 01:55:31 +00:00
|
|
|
|
|
|
|
bail:
|
2002-09-21 00:49:42 +00:00
|
|
|
return err;
|
2000-05-23 01:55:31 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Set the Funnel's progress state.
|
|
|
|
*/
|
2014-12-23 00:00:33 +00:00
|
|
|
NuError Nu_FunnelSetProgressState(NuFunnel* pFunnel, NuProgressState state)
|
2000-05-23 01:55:31 +00:00
|
|
|
{
|
2014-12-22 02:17:23 +00:00
|
|
|
Assert(pFunnel != NULL);
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2014-12-22 02:17:23 +00:00
|
|
|
if (pFunnel->pProgress == NULL)
|
2002-09-21 00:49:42 +00:00
|
|
|
return kNuErrNone;
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
pFunnel->pProgress->state = state;
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
return kNuErrNone;
|
2000-05-23 01:55:31 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Send a progress update to the application, if they're interested.
|
|
|
|
*/
|
2014-12-23 00:00:33 +00:00
|
|
|
NuError Nu_FunnelSendProgressUpdate(NuArchive* pArchive, NuFunnel* pFunnel)
|
2000-05-23 01:55:31 +00:00
|
|
|
{
|
2002-09-21 00:49:42 +00:00
|
|
|
NuProgressData* pProgress;
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2014-12-22 02:17:23 +00:00
|
|
|
Assert(pArchive != NULL);
|
|
|
|
Assert(pFunnel != NULL);
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
pProgress = pFunnel->pProgress;
|
2014-12-22 02:17:23 +00:00
|
|
|
if (pProgress == NULL)
|
2002-09-21 00:49:42 +00:00
|
|
|
return kNuErrNone; /* no progress meter attached */
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
/* don't continue if they're not accepting progress messages */
|
2014-12-22 02:17:23 +00:00
|
|
|
if (pProgress->progressFunc == NULL)
|
2002-09-21 00:49:42 +00:00
|
|
|
return kNuErrNone;
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
/* other than the choice of arguments, it's pretty much the same story */
|
|
|
|
return Nu_SendInitialProgress(pArchive, pProgress);
|
2000-05-23 01:55:31 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Pull the "doExpand" parameter out of the data source.
|
|
|
|
*/
|
2014-12-23 00:00:33 +00:00
|
|
|
Boolean Nu_FunnelGetDoExpand(NuFunnel* pFunnel)
|
2000-05-23 01:55:31 +00:00
|
|
|
{
|
2014-12-22 02:17:23 +00:00
|
|
|
Assert(pFunnel != NULL);
|
|
|
|
Assert(pFunnel->pDataSink != NULL);
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
return Nu_DataSinkGetDoExpand(pFunnel->pDataSink);
|
2000-05-23 01:55:31 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* ===========================================================================
|
2002-09-21 00:49:42 +00:00
|
|
|
* NuStraw object
|
2000-05-23 01:55:31 +00:00
|
|
|
* ===========================================================================
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Allocate and initialize a Straw.
|
|
|
|
*/
|
2014-12-23 00:00:33 +00:00
|
|
|
NuError Nu_StrawNew(NuArchive* pArchive, NuDataSource* pDataSource,
|
2002-09-21 00:49:42 +00:00
|
|
|
NuProgressData* pProgress, NuStraw** ppStraw)
|
2000-05-23 01:55:31 +00:00
|
|
|
{
|
2002-09-21 00:49:42 +00:00
|
|
|
NuError err = kNuErrNone;
|
2014-12-22 02:17:23 +00:00
|
|
|
NuStraw* pStraw = NULL;
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2014-12-22 02:17:23 +00:00
|
|
|
Assert(ppStraw != NULL);
|
|
|
|
Assert(pDataSource != NULL);
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
pStraw = Nu_Calloc(pArchive, sizeof(*pStraw));
|
|
|
|
BailAlloc(pStraw);
|
|
|
|
pStraw->pDataSource = pDataSource;
|
|
|
|
pStraw->pProgress = pProgress;
|
|
|
|
pStraw->lastProgress = 0;
|
|
|
|
pStraw->lastDisplayed = 0;
|
2000-05-23 01:55:31 +00:00
|
|
|
|
|
|
|
bail:
|
2002-09-21 00:49:42 +00:00
|
|
|
if (err != kNuErrNone)
|
|
|
|
Nu_StrawFree(pArchive, pStraw);
|
|
|
|
else
|
|
|
|
*ppStraw = pStraw;
|
|
|
|
return err;
|
2000-05-23 01:55:31 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Free a Straw.
|
|
|
|
*/
|
2014-12-23 00:00:33 +00:00
|
|
|
NuError Nu_StrawFree(NuArchive* pArchive, NuStraw* pStraw)
|
2000-05-23 01:55:31 +00:00
|
|
|
{
|
2014-12-22 02:17:23 +00:00
|
|
|
if (pStraw == NULL)
|
2002-09-21 00:49:42 +00:00
|
|
|
return kNuErrNone;
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
/* we don't own the data source or progress meter */
|
|
|
|
Nu_Free(pArchive, pStraw);
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
return kNuErrNone;
|
2000-05-23 01:55:31 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
2002-12-28 03:10:09 +00:00
|
|
|
* Set the Straw's progress state.
|
2000-05-23 01:55:31 +00:00
|
|
|
*/
|
2014-12-23 00:00:33 +00:00
|
|
|
NuError Nu_StrawSetProgressState(NuStraw* pStraw, NuProgressState state)
|
2000-05-23 01:55:31 +00:00
|
|
|
{
|
2014-12-22 02:17:23 +00:00
|
|
|
Assert(pStraw != NULL);
|
|
|
|
Assert(pStraw->pProgress != NULL);
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
pStraw->pProgress->state = state;
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
return kNuErrNone;
|
2000-05-23 01:55:31 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Send a progress update to the application, if they're interested.
|
|
|
|
*/
|
2014-12-23 00:00:33 +00:00
|
|
|
NuError Nu_StrawSendProgressUpdate(NuArchive* pArchive, NuStraw* pStraw)
|
2000-05-23 01:55:31 +00:00
|
|
|
{
|
2002-09-21 00:49:42 +00:00
|
|
|
NuProgressData* pProgress;
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2014-12-22 02:17:23 +00:00
|
|
|
Assert(pArchive != NULL);
|
|
|
|
Assert(pStraw != NULL);
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
pProgress = pStraw->pProgress;
|
2014-12-22 02:17:23 +00:00
|
|
|
if (pProgress == NULL)
|
2002-09-21 00:49:42 +00:00
|
|
|
return kNuErrNone; /* no progress meter attached */
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
/* don't continue if they're not accepting progress messages */
|
2014-12-22 02:17:23 +00:00
|
|
|
if (pProgress->progressFunc == NULL)
|
2002-09-21 00:49:42 +00:00
|
|
|
return kNuErrNone;
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
/* other than the choice of arguments, it's pretty much the same story */
|
|
|
|
return Nu_SendInitialProgress(pArchive, pProgress);
|
2000-05-23 01:55:31 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Read data from a straw.
|
|
|
|
*/
|
2014-12-23 00:00:33 +00:00
|
|
|
NuError Nu_StrawRead(NuArchive* pArchive, NuStraw* pStraw, uint8_t* buffer,
|
|
|
|
long len)
|
2000-05-23 01:55:31 +00:00
|
|
|
{
|
2002-09-21 00:49:42 +00:00
|
|
|
NuError err;
|
|
|
|
|
2014-12-22 02:17:23 +00:00
|
|
|
Assert(pArchive != NULL);
|
|
|
|
Assert(pStraw != NULL);
|
|
|
|
Assert(buffer != NULL);
|
2002-09-21 00:49:42 +00:00
|
|
|
Assert(len > 0);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* No buffering going on, so this is straightforward.
|
|
|
|
*/
|
|
|
|
|
|
|
|
err = Nu_DataSourceGetBlock(pStraw->pDataSource, buffer, len);
|
|
|
|
BailError(err);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Progress updating for adding is a little more complicated than
|
|
|
|
* for extracting. When extracting, the funnel controls the size
|
|
|
|
* of the output buffer, and only pushes an update when the output
|
|
|
|
* buffer fills. Here, we don't know how much will be asked for at
|
|
|
|
* a time, so we have to pace the updates or we risk flooding the
|
|
|
|
* application.
|
|
|
|
*
|
|
|
|
* We also have another problem: we want to indicate how much data
|
|
|
|
* has been processed, not how much data is *about* to be processed.
|
|
|
|
* So we have to set the percentage based on how much was requested
|
|
|
|
* on the previous call. (This assumes that whatever they asked for
|
|
|
|
* last time has already been fully processed.)
|
|
|
|
*/
|
2014-12-22 02:17:23 +00:00
|
|
|
if (pStraw->pProgress != NULL) {
|
2002-09-21 00:49:42 +00:00
|
|
|
pStraw->pProgress->uncompressedProgress = pStraw->lastProgress;
|
|
|
|
pStraw->lastProgress += len;
|
|
|
|
|
|
|
|
if (!pStraw->pProgress->uncompressedProgress ||
|
|
|
|
(pStraw->pProgress->uncompressedProgress - pStraw->lastDisplayed
|
|
|
|
> (kNuFunnelBufSize * 3 / 4)))
|
|
|
|
{
|
|
|
|
err = Nu_StrawSendProgressUpdate(pArchive, pStraw);
|
|
|
|
pStraw->lastDisplayed = pStraw->pProgress->uncompressedProgress;
|
|
|
|
BailError(err);
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
2000-05-23 01:55:31 +00:00
|
|
|
|
|
|
|
bail:
|
2002-09-21 00:49:42 +00:00
|
|
|
return err;
|
2000-05-23 01:55:31 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Rewind a straw. This rewinds the underlying data source, and resets
|
|
|
|
* some progress counters.
|
|
|
|
*/
|
2014-12-23 00:00:33 +00:00
|
|
|
NuError Nu_StrawRewind(NuArchive* pArchive, NuStraw* pStraw)
|
2000-05-23 01:55:31 +00:00
|
|
|
{
|
2014-12-22 02:17:23 +00:00
|
|
|
Assert(pStraw != NULL);
|
|
|
|
Assert(pStraw->pDataSource != NULL);
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
pStraw->lastProgress = 0;
|
|
|
|
pStraw->lastDisplayed = 0;
|
2000-05-23 01:55:31 +00:00
|
|
|
|
2002-09-21 00:49:42 +00:00
|
|
|
return Nu_DataSourceRewind(pStraw->pDataSource);
|
2000-05-23 01:55:31 +00:00
|
|
|
}
|
|
|
|
|