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 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684
|
// -*- mode: cpp; mode: fold -*-
// Description /*{{{*/
// $Id: tagfile.cc,v 1.37.2.2 2003/12/31 16:02:30 mdz Exp $
/* ######################################################################
Fast scanner for RFC-822 type header information
This uses a rotating buffer to load the package information into.
The scanner runs over it and isolates and indexes a single section.
##################################################################### */
/*}}}*/
// Include Files /*{{{*/
#include<config.h>
#include <apt-pkg/tagfile.h>
#include <apt-pkg/error.h>
#include <apt-pkg/strutl.h>
#include <apt-pkg/fileutl.h>
#include <string>
#include <stdio.h>
#include <ctype.h>
#include <stdlib.h>
#include <string.h>
#include <apti18n.h>
/*}}}*/
using std::string;
class pkgTagFilePrivate
{
public:
pkgTagFilePrivate(FileFd *pFd, unsigned long long Size) : Fd(*pFd), Buffer(NULL),
Start(NULL), End(NULL),
Done(false), iOffset(0),
Size(Size)
{
}
FileFd &Fd;
char *Buffer;
char *Start;
char *End;
bool Done;
unsigned long long iOffset;
unsigned long long Size;
};
// TagFile::pkgTagFile - Constructor /*{{{*/
// ---------------------------------------------------------------------
/* */
pkgTagFile::pkgTagFile(FileFd *pFd,unsigned long long Size)
{
/* The size is increased by 4 because if we start with the Size of the
filename we need to try to read 1 char more to see an EOF faster, 1
char the end-pointer can be on and maybe 2 newlines need to be added
to the end of the file -> 4 extra chars */
Size += 4;
d = new pkgTagFilePrivate(pFd, Size);
if (d->Fd.IsOpen() == false)
d->Start = d->End = d->Buffer = 0;
else
d->Buffer = (char*)malloc(sizeof(char) * Size);
if (d->Buffer == NULL)
d->Done = true;
else
d->Done = false;
d->Start = d->End = d->Buffer;
d->iOffset = 0;
if (d->Done == false)
Fill();
}
/*}}}*/
// TagFile::~pkgTagFile - Destructor /*{{{*/
// ---------------------------------------------------------------------
/* */
pkgTagFile::~pkgTagFile()
{
free(d->Buffer);
delete d;
}
/*}}}*/
// TagFile::Offset - Return the current offset in the buffer /*{{{*/
APT_PURE unsigned long pkgTagFile::Offset()
{
return d->iOffset;
}
/*}}}*/
// TagFile::Resize - Resize the internal buffer /*{{{*/
// ---------------------------------------------------------------------
/* Resize the internal buffer (double it in size). Fail if a maximum size
* size is reached.
*/
bool pkgTagFile::Resize()
{
// fail is the buffer grows too big
if(d->Size > 1024*1024+1)
return false;
return Resize(d->Size * 2);
}
bool pkgTagFile::Resize(unsigned long long const newSize)
{
unsigned long long const EndSize = d->End - d->Start;
// get new buffer and use it
char* newBuffer = (char*)realloc(d->Buffer, sizeof(char) * newSize);
if (newBuffer == NULL)
return false;
d->Buffer = newBuffer;
d->Size = newSize;
// update the start/end pointers to the new buffer
d->Start = d->Buffer;
d->End = d->Start + EndSize;
return true;
}
/*}}}*/
// TagFile::Step - Advance to the next section /*{{{*/
// ---------------------------------------------------------------------
/* If the Section Scanner fails we refill the buffer and try again.
* If that fails too, double the buffer size and try again until a
* maximum buffer is reached.
*/
bool pkgTagFile::Step(pkgTagSection &Tag)
{
while (Tag.Scan(d->Start,d->End - d->Start) == false)
{
if (Fill() == false)
return false;
if(Tag.Scan(d->Start,d->End - d->Start))
break;
if (Resize() == false)
return _error->Error(_("Unable to parse package file %s (1)"),
d->Fd.Name().c_str());
}
d->Start += Tag.size();
d->iOffset += Tag.size();
Tag.Trim();
return true;
}
/*}}}*/
// TagFile::Fill - Top up the buffer /*{{{*/
// ---------------------------------------------------------------------
/* This takes the bit at the end of the buffer and puts it at the start
then fills the rest from the file */
bool pkgTagFile::Fill()
{
unsigned long long EndSize = d->End - d->Start;
unsigned long long Actual = 0;
memmove(d->Buffer,d->Start,EndSize);
d->Start = d->Buffer;
d->End = d->Buffer + EndSize;
if (d->Done == false)
{
// See if only a bit of the file is left
unsigned long long const dataSize = d->Size - ((d->End - d->Buffer) + 1);
if (d->Fd.Read(d->End, dataSize, &Actual) == false)
return false;
if (Actual != dataSize)
d->Done = true;
d->End += Actual;
}
if (d->Done == true)
{
if (EndSize <= 3 && Actual == 0)
return false;
if (d->Size - (d->End - d->Buffer) < 4)
return true;
// Append a double new line if one does not exist
unsigned int LineCount = 0;
for (const char *E = d->End - 1; E - d->End < 6 && (*E == '\n' || *E == '\r'); E--)
if (*E == '\n')
LineCount++;
if (LineCount < 2)
{
if ((unsigned)(d->End - d->Buffer) >= d->Size)
Resize(d->Size + 3);
for (; LineCount < 2; LineCount++)
*d->End++ = '\n';
}
return true;
}
return true;
}
/*}}}*/
// TagFile::Jump - Jump to a pre-recorded location in the file /*{{{*/
// ---------------------------------------------------------------------
/* This jumps to a pre-recorded file location and reads the record
that is there */
bool pkgTagFile::Jump(pkgTagSection &Tag,unsigned long long Offset)
{
// We are within a buffer space of the next hit..
if (Offset >= d->iOffset && d->iOffset + (d->End - d->Start) > Offset)
{
unsigned long long Dist = Offset - d->iOffset;
d->Start += Dist;
d->iOffset += Dist;
// if we have seen the end, don't ask for more
if (d->Done == true)
return Tag.Scan(d->Start, d->End - d->Start);
else
return Step(Tag);
}
// Reposition and reload..
d->iOffset = Offset;
d->Done = false;
if (d->Fd.Seek(Offset) == false)
return false;
d->End = d->Start = d->Buffer;
if (Fill() == false)
return false;
if (Tag.Scan(d->Start, d->End - d->Start) == true)
return true;
// This appends a double new line (for the real eof handling)
if (Fill() == false)
return false;
if (Tag.Scan(d->Start, d->End - d->Start) == false)
return _error->Error(_("Unable to parse package file %s (2)"),d->Fd.Name().c_str());
return true;
}
/*}}}*/
// pkgTagSection::pkgTagSection - Constructor /*{{{*/
// ---------------------------------------------------------------------
/* */
pkgTagSection::pkgTagSection()
: Section(0), TagCount(0), d(NULL), Stop(0)
{
memset(&Indexes, 0, sizeof(Indexes));
memset(&AlphaIndexes, 0, sizeof(AlphaIndexes));
}
/*}}}*/
// TagSection::Scan - Scan for the end of the header information /*{{{*/
// ---------------------------------------------------------------------
/* This looks for the first double new line in the data stream.
It also indexes the tags in the section. */
bool pkgTagSection::Scan(const char *Start,unsigned long MaxLength)
{
const char *End = Start + MaxLength;
Stop = Section = Start;
memset(AlphaIndexes,0,sizeof(AlphaIndexes));
if (Stop == 0)
return false;
TagCount = 0;
while (TagCount+1 < sizeof(Indexes)/sizeof(Indexes[0]) && Stop < End)
{
TrimRecord(true,End);
// this can happen when TrimRecord trims away the entire Record
// (e.g. because it just contains comments)
if(Stop == End)
return true;
// Start a new index and add it to the hash
if (isspace(Stop[0]) == 0)
{
Indexes[TagCount++] = Stop - Section;
AlphaIndexes[AlphaHash(Stop,End)] = TagCount;
}
Stop = (const char *)memchr(Stop,'\n',End - Stop);
if (Stop == 0)
return false;
for (; Stop+1 < End && Stop[1] == '\r'; Stop++)
/* nothing */
;
// Double newline marks the end of the record
if (Stop+1 < End && Stop[1] == '\n')
{
Indexes[TagCount] = Stop - Section;
TrimRecord(false,End);
return true;
}
Stop++;
}
return false;
}
/*}}}*/
// TagSection::TrimRecord - Trim off any garbage before/after a record /*{{{*/
// ---------------------------------------------------------------------
/* There should be exactly 2 newline at the end of the record, no more. */
void pkgTagSection::TrimRecord(bool BeforeRecord, const char*& End)
{
if (BeforeRecord == true)
return;
for (; Stop < End && (Stop[0] == '\n' || Stop[0] == '\r'); Stop++);
}
/*}}}*/
// TagSection::Trim - Trim off any trailing garbage /*{{{*/
// ---------------------------------------------------------------------
/* There should be exactly 1 newline at the end of the buffer, no more. */
void pkgTagSection::Trim()
{
for (; Stop > Section + 2 && (Stop[-2] == '\n' || Stop[-2] == '\r'); Stop--);
}
/*}}}*/
// TagSection::Exists - return True if a tag exists /*{{{*/
bool pkgTagSection::Exists(const char* const Tag)
{
unsigned int tmp;
return Find(Tag, tmp);
}
/*}}}*/
// TagSection::Find - Locate a tag /*{{{*/
// ---------------------------------------------------------------------
/* This searches the section for a tag that matches the given string. */
bool pkgTagSection::Find(const char *Tag,unsigned int &Pos) const
{
unsigned int Length = strlen(Tag);
unsigned int I = AlphaIndexes[AlphaHash(Tag)];
if (I == 0)
return false;
I--;
for (unsigned int Counter = 0; Counter != TagCount; Counter++,
I = (I+1)%TagCount)
{
const char *St;
St = Section + Indexes[I];
if (strncasecmp(Tag,St,Length) != 0)
continue;
// Make sure the colon is in the right place
const char *C = St + Length;
for (; isspace(*C) != 0; C++);
if (*C != ':')
continue;
Pos = I;
return true;
}
Pos = 0;
return false;
}
/*}}}*/
// TagSection::Find - Locate a tag /*{{{*/
// ---------------------------------------------------------------------
/* This searches the section for a tag that matches the given string. */
bool pkgTagSection::Find(const char *Tag,const char *&Start,
const char *&End) const
{
unsigned int Length = strlen(Tag);
unsigned int I = AlphaIndexes[AlphaHash(Tag)];
if (I == 0)
return false;
I--;
for (unsigned int Counter = 0; Counter != TagCount; Counter++,
I = (I+1)%TagCount)
{
const char *St;
St = Section + Indexes[I];
if (strncasecmp(Tag,St,Length) != 0)
continue;
// Make sure the colon is in the right place
const char *C = St + Length;
for (; isspace(*C) != 0; C++);
if (*C != ':')
continue;
// Strip off the gunk from the start end
Start = C;
End = Section + Indexes[I+1];
if (Start >= End)
return _error->Error("Internal parsing error");
for (; (isspace(*Start) != 0 || *Start == ':') && Start < End; Start++);
for (; isspace(End[-1]) != 0 && End > Start; End--);
return true;
}
Start = End = 0;
return false;
}
/*}}}*/
// TagSection::FindS - Find a string /*{{{*/
// ---------------------------------------------------------------------
/* */
string pkgTagSection::FindS(const char *Tag) const
{
const char *Start;
const char *End;
if (Find(Tag,Start,End) == false)
return string();
return string(Start,End);
}
/*}}}*/
// TagSection::FindI - Find an integer /*{{{*/
// ---------------------------------------------------------------------
/* */
signed int pkgTagSection::FindI(const char *Tag,signed long Default) const
{
const char *Start;
const char *Stop;
if (Find(Tag,Start,Stop) == false)
return Default;
// Copy it into a temp buffer so we can use strtol
char S[300];
if ((unsigned)(Stop - Start) >= sizeof(S))
return Default;
strncpy(S,Start,Stop-Start);
S[Stop - Start] = 0;
char *End;
signed long Result = strtol(S,&End,10);
if (S == End)
return Default;
return Result;
}
/*}}}*/
// TagSection::FindULL - Find an unsigned long long integer /*{{{*/
// ---------------------------------------------------------------------
/* */
unsigned long long pkgTagSection::FindULL(const char *Tag, unsigned long long const &Default) const
{
const char *Start;
const char *Stop;
if (Find(Tag,Start,Stop) == false)
return Default;
// Copy it into a temp buffer so we can use strtoull
char S[100];
if ((unsigned)(Stop - Start) >= sizeof(S))
return Default;
strncpy(S,Start,Stop-Start);
S[Stop - Start] = 0;
char *End;
unsigned long long Result = strtoull(S,&End,10);
if (S == End)
return Default;
return Result;
}
/*}}}*/
// TagSection::FindFlag - Locate a yes/no type flag /*{{{*/
// ---------------------------------------------------------------------
/* The bits marked in Flag are masked on/off in Flags */
bool pkgTagSection::FindFlag(const char *Tag,unsigned long &Flags,
unsigned long Flag) const
{
const char *Start;
const char *Stop;
if (Find(Tag,Start,Stop) == false)
return true;
return FindFlag(Flags, Flag, Start, Stop);
}
bool pkgTagSection::FindFlag(unsigned long &Flags, unsigned long Flag,
char const* Start, char const* Stop)
{
switch (StringToBool(string(Start, Stop)))
{
case 0:
Flags &= ~Flag;
return true;
case 1:
Flags |= Flag;
return true;
default:
_error->Warning("Unknown flag value: %s",string(Start,Stop).c_str());
return true;
}
return true;
}
/*}}}*/
// TFRewrite - Rewrite a control record /*{{{*/
// ---------------------------------------------------------------------
/* This writes the control record to stdout rewriting it as necessary. The
override map item specificies the rewriting rules to follow. This also
takes the time to sort the feild list. */
/* The order of this list is taken from dpkg source lib/parse.c the fieldinfos
array. */
static const char *iTFRewritePackageOrder[] = {
"Package",
"Essential",
"Status",
"Priority",
"Section",
"Installed-Size",
"Maintainer",
"Original-Maintainer",
"Architecture",
"Source",
"Version",
"Revision", // Obsolete
"Config-Version", // Obsolete
"Replaces",
"Provides",
"Depends",
"Pre-Depends",
"Recommends",
"Suggests",
"Conflicts",
"Breaks",
"Conffiles",
"Filename",
"Size",
"MD5sum",
"SHA1",
"SHA256",
"SHA512",
"MSDOS-Filename", // Obsolete
"Description",
0};
static const char *iTFRewriteSourceOrder[] = {"Package",
"Source",
"Binary",
"Version",
"Priority",
"Section",
"Maintainer",
"Original-Maintainer",
"Build-Depends",
"Build-Depends-Indep",
"Build-Conflicts",
"Build-Conflicts-Indep",
"Architecture",
"Standards-Version",
"Format",
"Directory",
"Files",
0};
/* Two levels of initialization are used because gcc will set the symbol
size of an array to the length of the array, causing dynamic relinking
errors. Doing this makes the symbol size constant */
const char **TFRewritePackageOrder = iTFRewritePackageOrder;
const char **TFRewriteSourceOrder = iTFRewriteSourceOrder;
bool TFRewrite(FILE *Output,pkgTagSection const &Tags,const char *Order[],
TFRewriteData *Rewrite)
{
unsigned char Visited[256]; // Bit 1 is Order, Bit 2 is Rewrite
for (unsigned I = 0; I != 256; I++)
Visited[I] = 0;
// Set new tag up as necessary.
for (unsigned int J = 0; Rewrite != 0 && Rewrite[J].Tag != 0; J++)
{
if (Rewrite[J].NewTag == 0)
Rewrite[J].NewTag = Rewrite[J].Tag;
}
// Write all all of the tags, in order.
if (Order != NULL)
{
for (unsigned int I = 0; Order[I] != 0; I++)
{
bool Rewritten = false;
// See if this is a field that needs to be rewritten
for (unsigned int J = 0; Rewrite != 0 && Rewrite[J].Tag != 0; J++)
{
if (strcasecmp(Rewrite[J].Tag,Order[I]) == 0)
{
Visited[J] |= 2;
if (Rewrite[J].Rewrite != 0 && Rewrite[J].Rewrite[0] != 0)
{
if (isspace(Rewrite[J].Rewrite[0]))
fprintf(Output,"%s:%s\n",Rewrite[J].NewTag,Rewrite[J].Rewrite);
else
fprintf(Output,"%s: %s\n",Rewrite[J].NewTag,Rewrite[J].Rewrite);
}
Rewritten = true;
break;
}
}
// See if it is in the fragment
unsigned Pos;
if (Tags.Find(Order[I],Pos) == false)
continue;
Visited[Pos] |= 1;
if (Rewritten == true)
continue;
/* Write out this element, taking a moment to rewrite the tag
in case of changes of case. */
const char *Start;
const char *Stop;
Tags.Get(Start,Stop,Pos);
if (fputs(Order[I],Output) < 0)
return _error->Errno("fputs","IO Error to output");
Start += strlen(Order[I]);
if (fwrite(Start,Stop - Start,1,Output) != 1)
return _error->Errno("fwrite","IO Error to output");
if (Stop[-1] != '\n')
fprintf(Output,"\n");
}
}
// Now write all the old tags that were missed.
for (unsigned int I = 0; I != Tags.Count(); I++)
{
if ((Visited[I] & 1) == 1)
continue;
const char *Start;
const char *Stop;
Tags.Get(Start,Stop,I);
const char *End = Start;
for (; End < Stop && *End != ':'; End++);
// See if this is a field that needs to be rewritten
bool Rewritten = false;
for (unsigned int J = 0; Rewrite != 0 && Rewrite[J].Tag != 0; J++)
{
if (stringcasecmp(Start,End,Rewrite[J].Tag) == 0)
{
Visited[J] |= 2;
if (Rewrite[J].Rewrite != 0 && Rewrite[J].Rewrite[0] != 0)
{
if (isspace(Rewrite[J].Rewrite[0]))
fprintf(Output,"%s:%s\n",Rewrite[J].NewTag,Rewrite[J].Rewrite);
else
fprintf(Output,"%s: %s\n",Rewrite[J].NewTag,Rewrite[J].Rewrite);
}
Rewritten = true;
break;
}
}
if (Rewritten == true)
continue;
// Write out this element
if (fwrite(Start,Stop - Start,1,Output) != 1)
return _error->Errno("fwrite","IO Error to output");
if (Stop[-1] != '\n')
fprintf(Output,"\n");
}
// Now write all the rewrites that were missed
for (unsigned int J = 0; Rewrite != 0 && Rewrite[J].Tag != 0; J++)
{
if ((Visited[J] & 2) == 2)
continue;
if (Rewrite[J].Rewrite != 0 && Rewrite[J].Rewrite[0] != 0)
{
if (isspace(Rewrite[J].Rewrite[0]))
fprintf(Output,"%s:%s\n",Rewrite[J].NewTag,Rewrite[J].Rewrite);
else
fprintf(Output,"%s: %s\n",Rewrite[J].NewTag,Rewrite[J].Rewrite);
}
}
return true;
}
/*}}}*/
|