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
|
/*
* DEBUG: section 20 Storage Manager Swapfile Unpacker
* AUTHOR: Robert Collins
*
* SQUID Web Proxy Cache http://www.squid-cache.org/
* ----------------------------------------------------------
*
* Squid is the result of efforts by numerous individuals from
* the Internet community; see the CONTRIBUTORS file for full
* details. Many organizations have provided support for Squid's
* development; see the SPONSORS file for full details. Squid is
* Copyrighted (C) 2001 by the Regents of the University of
* California; see the COPYRIGHT file for full details. Squid
* incorporates software developed and/or copyrighted by other
* sources; see the CREDITS file for full details.
*
* 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.
*
* This program 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 this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
*
*/
#include "squid.h"
#include "defines.h"
#include "Debug.h"
#include "StoreMetaUnpacker.h"
#include "StoreMeta.h"
int const StoreMetaUnpacker::MinimumBufferLength = sizeof(char) + sizeof(int);
/// useful for meta stored in pre-initialized (with zeros) db files
bool
StoreMetaUnpacker::isBufferZero()
{
// We could memcmp the entire buffer, but it is probably safe enough
// to test a few bytes because if we do not detect a corrupted entry
// it is not a big deal. Empty entries are not isBufferSane anyway.
const int depth = 10;
if (buflen < depth)
return false; // cannot be sure enough
for (int i = 0; i < depth; ++i) {
if (buf[i])
return false;
}
return true;
}
bool
StoreMetaUnpacker::isBufferSane()
{
if (buf[0] != (char) STORE_META_OK)
return false;
/*
* sanity check on 'buflen' value. It should be at least big
* enough to hold one type and one length.
*/
getBufferLength();
if (*hdr_len < MinimumBufferLength)
return false;
if (*hdr_len > buflen)
return false;
return true;
}
void
StoreMetaUnpacker::getBufferLength()
{
memcpy(hdr_len, &buf[1], sizeof(int));
}
StoreMetaUnpacker::StoreMetaUnpacker (char const *aBuffer, ssize_t aLen, int *anInt) : buf (aBuffer), buflen(aLen), hdr_len(anInt), position(1 + sizeof(int))
{
assert (aBuffer != NULL);
}
void
StoreMetaUnpacker::getType()
{
type = buf[position];
++position;
}
void
StoreMetaUnpacker::getLength()
{
memcpy(&length, &buf[position], sizeof(int));
position += sizeof(int);
}
bool
StoreMetaUnpacker::doOneEntry()
{
getType();
getLength();
if (position + length > *hdr_len) {
debugs(20, DBG_CRITICAL, "storeSwapMetaUnpack: overflow!");
debugs(20, DBG_CRITICAL, "\ttype=" << type << ", length=" << length << ", *hdr_len=" << *hdr_len << ", offset=" << position);
return false;
}
StoreMeta *newNode = StoreMeta::Factory(type, length, &buf[position]);
if (newNode)
tail = StoreMeta::Add (tail, newNode);
position += length;
return true;
}
bool
StoreMetaUnpacker::moreToProcess() const
{
return *hdr_len - position - MinimumBufferLength >= 0;
}
StoreMeta *
StoreMetaUnpacker::createStoreMeta ()
{
tlv *TLV = NULL;
tail = &TLV;
assert(hdr_len != NULL);
if (!isBufferSane())
return NULL;
getBufferLength();
assert (position == 1 + sizeof(int));
while (moreToProcess()) {
if (!doOneEntry())
break;
}
return TLV;
}
|