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 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520
|
// distribution boxbackup-0.11rc2 (svn version: 2072)
//
// Copyright (c) 2003 - 2008
// Ben Summers and contributors. All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions
// are met:
//
// 1. Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// 2. Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
// 3. All use of this software and associated advertising materials must
// display the following acknowledgment:
// This product includes software developed by Ben Summers.
// 4. The names of the Authors may not be used to endorse or promote
// products derived from this software without specific prior written
// permission.
//
// [Where legally impermissible the Authors do not disclaim liability for
// direct physical injury or death caused solely by defects in the software
// unless it is modified by a third party.]
//
// THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR
// IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
// WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
// DISCLAIMED. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY DIRECT,
// INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
// (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
// SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
// HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
// STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
// ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
// POSSIBILITY OF SUCH DAMAGE.
//
//
//
// --------------------------------------------------------------------------
//
// File
// Name: ExcludeList.cpp
// Purpose: General purpose exclusion list
// Created: 28/1/04
//
// --------------------------------------------------------------------------
#include "Box.h"
#ifdef HAVE_REGEX_SUPPORT
#ifdef HAVE_PCREPOSIX_H
#include <pcreposix.h>
#else
#include <regex.h>
#endif
#define EXCLUDELIST_IMPLEMENTATION_REGEX_T_DEFINED
#endif
#include "ExcludeList.h"
#include "Utils.h"
#include "Configuration.h"
#include "Archive.h"
#include "Logging.h"
#include "MemLeakFindOn.h"
// --------------------------------------------------------------------------
//
// Function
// Name: ExcludeList::ExcludeList()
// Purpose: Constructor. Generates an exclude list which will allow everything
// Created: 28/1/04
//
// --------------------------------------------------------------------------
ExcludeList::ExcludeList()
: mpAlwaysInclude(0)
{
}
// --------------------------------------------------------------------------
//
// Function
// Name: ExcludeList::~ExcludeList()
// Purpose: Destructor
// Created: 28/1/04
//
// --------------------------------------------------------------------------
ExcludeList::~ExcludeList()
{
#ifdef HAVE_REGEX_SUPPORT
// free regex memory
while(mRegex.size() > 0)
{
regex_t *pregex = mRegex.back();
mRegex.pop_back();
// Free regex storage, and the structure itself
::regfree(pregex);
delete pregex;
}
#endif
// Clean up exceptions list
if(mpAlwaysInclude != 0)
{
delete mpAlwaysInclude;
mpAlwaysInclude = 0;
}
}
#ifdef WIN32
std::string ExcludeList::ReplaceSlashesDefinite(const std::string& input) const
{
std::string output = input;
for (std::string::size_type pos = output.find("/");
pos != std::string::npos;
pos = output.find("/"))
{
output.replace(pos, 1, DIRECTORY_SEPARATOR);
}
for (std::string::iterator i = output.begin(); i != output.end(); i++)
{
*i = tolower(*i);
}
return output;
}
std::string ExcludeList::ReplaceSlashesRegex(const std::string& input) const
{
std::string output = input;
for (std::string::size_type pos = output.find("/");
pos != std::string::npos;
pos = output.find("/"))
{
output.replace(pos, 1, "\\" DIRECTORY_SEPARATOR);
}
for (std::string::iterator i = output.begin(); i != output.end(); i++)
{
*i = tolower(*i);
}
return output;
}
#endif
// --------------------------------------------------------------------------
//
// Function
// Name: ExcludeList::AddDefiniteEntries(const std::string &)
// Purpose: Adds a number of definite entries to the exclude list -- ones which
// will be excluded if and only if the test string matches exactly.
// Uses the Configuration classes' multi-value conventions, with
// multiple entires in one string separated by Configuration::MultiValueSeparator
// Created: 28/1/04
//
// --------------------------------------------------------------------------
void ExcludeList::AddDefiniteEntries(const std::string &rEntries)
{
// Split strings up
std::vector<std::string> ens;
SplitString(rEntries, Configuration::MultiValueSeparator, ens);
// Add to set of excluded strings
for(std::vector<std::string>::const_iterator i(ens.begin()); i != ens.end(); ++i)
{
if(i->size() > 0)
{
std::string entry = *i;
// Convert any forward slashes in the string
// to backslashes
#ifdef WIN32
entry = ReplaceSlashesDefinite(entry);
#endif
if (entry.size() > 0 && entry[entry.size() - 1] ==
DIRECTORY_SEPARATOR_ASCHAR)
{
BOX_WARNING("Exclude entry ends in path "
"separator, will never match: "
<< entry);
}
mDefinite.insert(entry);
}
}
}
// --------------------------------------------------------------------------
//
// Function
// Name: ExcludeList::AddRegexEntries(const std::string &)
// Purpose: Adds a number of regular expression entries to the exclude list --
// if the test expression matches any of these regex, it will be excluded.
// Uses the Configuration classes' multi-value conventions, with
// multiple entires in one string separated by Configuration::MultiValueSeparator
// Created: 28/1/04
//
// --------------------------------------------------------------------------
void ExcludeList::AddRegexEntries(const std::string &rEntries)
{
#ifdef HAVE_REGEX_SUPPORT
// Split strings up
std::vector<std::string> ens;
SplitString(rEntries, Configuration::MultiValueSeparator, ens);
// Create and add new regular expressions
for(std::vector<std::string>::const_iterator i(ens.begin()); i != ens.end(); ++i)
{
if(i->size() > 0)
{
// Allocate memory
regex_t *pregex = new regex_t;
try
{
std::string entry = *i;
// Convert any forward slashes in the string
// to appropriately escaped backslashes
#ifdef WIN32
entry = ReplaceSlashesRegex(entry);
#endif
// Compile
int errcode = ::regcomp(pregex, entry.c_str(),
REG_EXTENDED | REG_NOSUB);
if (errcode != 0)
{
char buf[1024];
regerror(errcode, pregex, buf, sizeof(buf));
BOX_ERROR("Invalid regular expression: " <<
entry << ": " << buf);
THROW_EXCEPTION(CommonException, BadRegularExpression)
}
// Store in list of regular expressions
mRegex.push_back(pregex);
// Store in list of regular expression string for Serialize
mRegexStr.push_back(entry.c_str());
}
catch(...)
{
delete pregex;
throw;
}
}
}
#else
THROW_EXCEPTION(CommonException, RegexNotSupportedOnThisPlatform)
#endif
}
// --------------------------------------------------------------------------
//
// Function
// Name: ExcludeList::IsExcluded(const std::string &)
// Purpose: Returns true if the entry should be excluded
// Created: 28/1/04
//
// --------------------------------------------------------------------------
bool ExcludeList::IsExcluded(const std::string &rTest) const
{
std::string test = rTest;
#ifdef WIN32
test = ReplaceSlashesDefinite(test);
#endif
// Check against the always include list
if(mpAlwaysInclude != 0)
{
if(mpAlwaysInclude->IsExcluded(test))
{
// Because the "always include" list says it's 'excluded'
// this means it should actually be included.
return false;
}
}
// Is it in the set of definite entries?
if(mDefinite.find(test) != mDefinite.end())
{
return true;
}
// Check against regular expressions
#ifdef HAVE_REGEX_SUPPORT
for(std::vector<regex_t *>::const_iterator i(mRegex.begin()); i != mRegex.end(); ++i)
{
// Test against this expression
if(regexec(*i, test.c_str(), 0, 0 /* no match information required */, 0 /* no flags */) == 0)
{
// match happened
return true;
}
// In all other cases, including an error, just continue to the next expression
}
#endif
return false;
}
// --------------------------------------------------------------------------
//
// Function
// Name: ExcludeList::SetAlwaysIncludeList(ExcludeList *)
// Purpose: Takes ownership of the list, deletes any pre-existing list.
// NULL is acceptable to delete the list.
// The AlwaysInclude list is a list of exceptions to the exclusions.
// Created: 19/2/04
//
// --------------------------------------------------------------------------
void ExcludeList::SetAlwaysIncludeList(ExcludeList *pAlwaysInclude)
{
// Delete old list
if(mpAlwaysInclude != 0)
{
delete mpAlwaysInclude;
mpAlwaysInclude = 0;
}
// Store the pointer
mpAlwaysInclude = pAlwaysInclude;
}
// --------------------------------------------------------------------------
//
// Function
// Name: ExcludeList::Deserialize(Archive & rArchive)
// Purpose: Deserializes this object instance from a stream of bytes, using an Archive abstraction.
//
// Created: 2005/04/11
//
// --------------------------------------------------------------------------
void ExcludeList::Deserialize(Archive & rArchive)
{
//
//
//
mDefinite.clear();
#ifdef HAVE_REGEX_SUPPORT
// free regex memory
while(mRegex.size() > 0)
{
regex_t *pregex = mRegex.back();
mRegex.pop_back();
// Free regex storage, and the structure itself
::regfree(pregex);
delete pregex;
}
mRegexStr.clear();
#endif
// Clean up exceptions list
if(mpAlwaysInclude != 0)
{
delete mpAlwaysInclude;
mpAlwaysInclude = 0;
}
//
//
//
int64_t iCount = 0;
rArchive.Read(iCount);
if (iCount > 0)
{
for (int v = 0; v < iCount; v++)
{
// load each one
std::string strItem;
rArchive.Read(strItem);
mDefinite.insert(strItem);
}
}
//
//
//
#ifdef HAVE_REGEX_SUPPORT
rArchive.Read(iCount);
if (iCount > 0)
{
for (int v = 0; v < iCount; v++)
{
std::string strItem;
rArchive.Read(strItem);
// Allocate memory
regex_t* pregex = new regex_t;
try
{
// Compile
if(::regcomp(pregex, strItem.c_str(),
REG_EXTENDED | REG_NOSUB) != 0)
{
THROW_EXCEPTION(CommonException,
BadRegularExpression)
}
// Store in list of regular expressions
mRegex.push_back(pregex);
// Store in list of regular expression strings
// for Serialize
mRegexStr.push_back(strItem);
}
catch(...)
{
delete pregex;
throw;
}
}
}
#endif // HAVE_REGEX_SUPPORT
//
//
//
int64_t aMagicMarker = 0;
rArchive.Read(aMagicMarker);
if (aMagicMarker == ARCHIVE_MAGIC_VALUE_NOOP)
{
// NOOP
}
else if (aMagicMarker == ARCHIVE_MAGIC_VALUE_RECURSE)
{
mpAlwaysInclude = new ExcludeList;
if (!mpAlwaysInclude)
{
throw std::bad_alloc();
}
mpAlwaysInclude->Deserialize(rArchive);
}
else
{
// there is something going on here
THROW_EXCEPTION(CommonException, Internal)
}
}
// --------------------------------------------------------------------------
//
// Function
// Name: ExcludeList::Serialize(Archive & rArchive)
// Purpose: Serializes this object instance into a stream of bytes, using an Archive abstraction.
//
// Created: 2005/04/11
//
// --------------------------------------------------------------------------
void ExcludeList::Serialize(Archive & rArchive) const
{
//
//
//
int64_t iCount = mDefinite.size();
rArchive.Write(iCount);
for (std::set<std::string>::const_iterator i = mDefinite.begin();
i != mDefinite.end(); i++)
{
rArchive.Write(*i);
}
//
//
//
#ifdef HAVE_REGEX_SUPPORT
// don't even try to save compiled regular expressions,
// use string copies instead.
ASSERT(mRegex.size() == mRegexStr.size());
iCount = mRegexStr.size();
rArchive.Write(iCount);
for (std::vector<std::string>::const_iterator i = mRegexStr.begin();
i != mRegexStr.end(); i++)
{
rArchive.Write(*i);
}
#endif // HAVE_REGEX_SUPPORT
//
//
//
if (!mpAlwaysInclude)
{
int64_t aMagicMarker = ARCHIVE_MAGIC_VALUE_NOOP;
rArchive.Write(aMagicMarker);
}
else
{
int64_t aMagicMarker = ARCHIVE_MAGIC_VALUE_RECURSE; // be explicit about whether recursion follows
rArchive.Write(aMagicMarker);
mpAlwaysInclude->Serialize(rArchive);
}
}
|