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 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097
|
// -*- mode: cpp; mode: fold -*-
// Description /*{{{*/
/* ######################################################################
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/configuration.h>
#include <apt-pkg/error.h>
#include <apt-pkg/fileutl.h>
#include <apt-pkg/strutl.h>
#include <apt-pkg/tagfile-keys.h>
#include <apt-pkg/tagfile.h>
#include <list>
#include <cctype>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <apti18n.h>
/*}}}*/
using APT::Configuration::color;
using std::string;
using std::string_view;
class APT_HIDDEN pkgTagFilePrivate /*{{{*/
{
public:
void Reset(FileFd * const pFd, unsigned long long const pSize, pkgTagFile::Flags const pFlags)
{
if (Buffer != NULL)
free(Buffer);
Buffer = NULL;
Fd = pFd;
Flags = pFlags;
Start = NULL;
End = NULL;
Done = false;
iOffset = 0;
Size = pSize;
isCommentedLine = false;
chunks.clear();
}
pkgTagFilePrivate(FileFd * const pFd, unsigned long long const Size, pkgTagFile::Flags const pFlags) : Buffer(NULL)
{
Reset(pFd, Size, pFlags);
}
FileFd * Fd;
pkgTagFile::Flags Flags;
char *Buffer;
char *Start;
char *End;
bool Done;
unsigned long long iOffset;
unsigned long long Size;
bool isCommentedLine;
struct FileChunk
{
bool const good;
size_t length;
FileChunk(bool const pgood, size_t const plength) noexcept : good(pgood), length(plength) {}
};
std::list<FileChunk> chunks;
bool FillBuffer();
void RemoveCommentsFromBuffer();
~pkgTagFilePrivate()
{
if (Buffer != NULL)
free(Buffer);
}
};
/*}}}*/
class APT_HIDDEN pkgTagSectionPrivate /*{{{*/
{
public:
pkgTagSectionPrivate()
{
}
struct TagData {
unsigned int StartTag;
unsigned int EndTag;
unsigned int StartValue;
unsigned int NextInBucket;
explicit TagData(unsigned int const StartTag) : StartTag(StartTag), EndTag(0), StartValue(0), NextInBucket(0) {}
};
std::vector<TagData> Tags;
};
/*}}}*/
static unsigned long BetaHash(const char *Text, size_t Length) /*{{{*/
{
/* This very simple hash function for the last 8 letters gives
very good performance on the debian package files */
if (Length > 8)
{
Text += (Length - 8);
Length = 8;
}
unsigned long Res = 0;
for (size_t i = 0; i < Length; ++i)
Res = ((unsigned long)(Text[i]) & 0xDF) ^ (Res << 1);
return Res & 0x7F;
}
/*}}}*/
// TagFile::pkgTagFile - Constructor /*{{{*/
pkgTagFile::pkgTagFile(FileFd * const pFd,pkgTagFile::Flags const pFlags, unsigned long long const Size)
: d(new pkgTagFilePrivate(pFd, Size + 4, pFlags))
{
Init(pFd, pFlags, Size);
}
pkgTagFile::pkgTagFile(FileFd * const pFd,unsigned long long const Size)
: pkgTagFile(pFd, pkgTagFile::STRICT, Size)
{
}
void pkgTagFile::Init(FileFd * const pFd, pkgTagFile::Flags const pFlags, 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->Reset(pFd, Size, pFlags);
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();
}
void pkgTagFile::Init(FileFd * const pFd,unsigned long long Size)
{
Init(pFd, pkgTagFile::STRICT, Size);
}
/*}}}*/
// TagFile::~pkgTagFile - Destructor /*{{{*/
pkgTagFile::~pkgTagFile() = default;
/*}}}*/
// 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* const newBuffer = static_cast<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)
{
if(Tag.Scan(d->Start,d->End - d->Start) == false)
{
do
{
if (Fill() == false)
return false;
if(Tag.Scan(d->Start,d->End - d->Start, false))
break;
if (Resize() == false)
return _error->Error(_("Unable to parse package file %s (%d)"),
d->Fd->Name().c_str(), 1);
} while (Tag.Scan(d->Start,d->End - d->Start, false) == false);
}
size_t tagSize = Tag.size();
d->Start += tagSize;
if ((d->Flags & pkgTagFile::SUPPORT_COMMENTS) == 0)
d->iOffset += tagSize;
else
{
auto first = d->chunks.begin();
for (; first != d->chunks.end(); ++first)
{
if (first->good == false)
d->iOffset += first->length;
else
{
if (tagSize < first->length)
{
first->length -= tagSize;
d->iOffset += tagSize;
break;
}
else
{
tagSize -= first->length;
d->iOffset += first->length;
}
}
}
d->chunks.erase(d->chunks.begin(), first);
}
if ((d->Flags & pkgTagFile::SUPPORT_COMMENTS) == 0 || Tag.Count() != 0)
{
Tag.Trim();
return true;
}
return Step(Tag);
}
/*}}}*/
// 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 pkgTagFilePrivate::FillBuffer()
{
unsigned long long Actual = 0;
// See if only a bit of the file is left
unsigned long long const dataSize = Size - ((End - Buffer) + 1);
if (Fd->Read(End, dataSize, &Actual) == false)
return false;
if (Actual != dataSize)
Done = true;
End += Actual;
return true;
}
void pkgTagFilePrivate::RemoveCommentsFromBuffer()
{
// look for valid comments in the buffer
char * good_start = nullptr, * bad_start = nullptr;
char * current = Start;
if (isCommentedLine == false)
{
if (Start == Buffer)
{
// the start of the buffer is a newline as a record can't start
// in the middle of a line by definition.
if (*Start == '#')
{
isCommentedLine = true;
++current;
if (current > End)
chunks.emplace_back(false, 1);
}
}
if (isCommentedLine == false)
good_start = Start;
else
bad_start = Start;
}
else
bad_start = Start;
std::vector<std::pair<char*, size_t>> good_parts;
while (current <= End)
{
size_t const restLength = (End - current);
if (isCommentedLine == false)
{
current = static_cast<char*>(memchr(current, '#', restLength));
if (current == nullptr)
{
size_t const goodLength = End - good_start;
chunks.emplace_back(true, goodLength);
if (good_start != Start)
good_parts.push_back(std::make_pair(good_start, goodLength));
break;
}
bad_start = current;
--current;
// ensure that this is really a comment and not a '#' in the middle of a line
if (*current == '\n')
{
size_t const goodLength = (current - good_start) + 1;
chunks.emplace_back(true, goodLength);
good_parts.push_back(std::make_pair(good_start, goodLength));
good_start = nullptr;
isCommentedLine = true;
}
current += 2;
}
else // the current line is a comment
{
current = static_cast<char*>(memchr(current, '\n', restLength));
if (current == nullptr)
{
chunks.emplace_back(false, (End - bad_start));
break;
}
++current;
// is the next line a comment, too?
if (current >= End || *current != '#')
{
chunks.emplace_back(false, (current - bad_start));
good_start = current;
bad_start = nullptr;
isCommentedLine = false;
}
++current;
}
}
if (good_parts.empty() == false)
{
// we found comments, so move later parts over them
current = Start;
for (auto const &good: good_parts)
{
memmove(current, good.first, good.second);
current += good.second;
}
End = current;
}
if (isCommentedLine == true)
{
// deal with a buffer containing only comments
// or an (unfinished) comment at the end
if (good_parts.empty() == true)
End = Start;
else
Start = End;
}
else
{
// the buffer was all comment, but ended with the buffer
if (good_parts.empty() == true && good_start >= End)
End = Start;
else
Start = End;
}
}
bool pkgTagFile::Fill()
{
unsigned long long const EndSize = d->End - d->Start;
if (EndSize != 0)
{
memmove(d->Buffer,d->Start,EndSize);
d->Start = d->End = d->Buffer + EndSize;
}
else
d->Start = d->End = d->Buffer;
unsigned long long Actual = 0;
while (d->Done == false && d->Size > (Actual + 1))
{
if (d->FillBuffer() == false)
return false;
if ((d->Flags & pkgTagFile::SUPPORT_COMMENTS) != 0)
d->RemoveCommentsFromBuffer();
Actual = d->End - d->Buffer;
}
d->Start = d->Buffer;
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 (static_cast<unsigned long long>(d->End - d->Buffer) >= d->Size)
Resize(d->Size + 3);
for (; LineCount < 2; ++LineCount)
*d->End++ = '\n';
}
}
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)
{
// Head back to the start of the buffer, in case we get called for the same section
// again (d->Start will point to next section already)
d->iOffset -= d->Start - d->Buffer;
d->Start = d->Buffer;
if ((d->Flags & pkgTagFile::SUPPORT_COMMENTS) == 0 &&
// We are within a buffer space of the next hit..
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;
d->isCommentedLine = false;
d->chunks.clear();
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) == false)
return _error->Error(_("Unable to parse package file %s (%d)"),d->Fd->Name().c_str(), 2);
return true;
}
/*}}}*/
// pkgTagSection::pkgTagSection - Constructor /*{{{*/
// ---------------------------------------------------------------------
/* */
pkgTagSection::pkgTagSection()
: Section(0), d(new pkgTagSectionPrivate()), Stop(0)
{
memset(&AlphaIndexes, 0, sizeof(AlphaIndexes));
memset(&BetaIndexes, 0, sizeof(BetaIndexes));
}
/*}}}*/
// TagSection::Scan - Scan for the end of the header information /*{{{*/
bool pkgTagSection::Scan(const char *Start,unsigned long MaxLength, bool const Restart)
{
Section = Start;
const char *End = Start + MaxLength;
if (Restart == false && d->Tags.empty() == false)
{
Stop = Section + d->Tags.back().StartTag;
if (End <= Stop)
return false;
Stop = (const char *)memchr(Stop,'\n',End - Stop);
if (Stop == NULL)
return false;
++Stop;
}
else
{
Stop = Section;
if (d->Tags.empty() == false)
{
memset(&AlphaIndexes, 0, sizeof(AlphaIndexes));
memset(&BetaIndexes, 0, sizeof(BetaIndexes));
d->Tags.clear();
}
d->Tags.reserve(0x100);
}
unsigned int TagCount = d->Tags.size();
if (Stop == 0)
return false;
pkgTagSectionPrivate::TagData lastTagData(0);
Key lastTagKey = Key::Unknown;
unsigned int lastTagHash = 0;
while (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_ascii(Stop[0]) == 0)
{
// store the last found tag
if (lastTagData.StartValue != 0)
{
if (lastTagKey != Key::Unknown) {
AlphaIndexes[static_cast<size_t>(lastTagKey)] = TagCount;
} else {
if (BetaIndexes[lastTagHash] != 0)
lastTagData.NextInBucket = BetaIndexes[lastTagHash];
BetaIndexes[lastTagHash] = TagCount;
}
d->Tags.push_back(lastTagData);
}
++TagCount;
lastTagData = pkgTagSectionPrivate::TagData(Stop - Section);
// find the colon separating tag and value
char const * Colon = (char const *) memchr(Stop, ':', End - Stop);
if (Colon == NULL)
return false;
// find the end of the tag (which might or might not be the colon)
char const * EndTag = Colon;
--EndTag;
for (; EndTag > Stop && isspace_ascii(*EndTag) != 0; --EndTag)
;
++EndTag;
lastTagData.EndTag = EndTag - Section;
lastTagKey = pkgTagHash(Stop, EndTag - Stop);
if (lastTagKey == Key::Unknown)
lastTagHash = BetaHash(Stop, EndTag - Stop);
// find the beginning of the value
Stop = Colon + 1;
for (; Stop < End && isspace_ascii(*Stop) != 0; ++Stop)
if (*Stop == '\n' && Stop[1] != ' ')
break;
if (Stop >= End)
return false;
lastTagData.StartValue = Stop - Section;
}
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')
{
if (lastTagData.StartValue != 0)
{
if (lastTagKey != Key::Unknown) {
AlphaIndexes[static_cast<size_t>(lastTagKey)] = TagCount;
} else {
if (BetaIndexes[lastTagHash] != 0)
lastTagData.NextInBucket = BetaIndexes[lastTagHash];
BetaIndexes[lastTagHash] = TagCount;
}
d->Tags.push_back(lastTagData);
}
pkgTagSectionPrivate::TagData const td(Stop - Section);
d->Tags.push_back(td);
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(string_view Tag) const
{
unsigned int tmp;
return Find(Tag, tmp);
}
bool pkgTagSection::Exists(Key key) const
{
unsigned int tmp;
return Find(key, tmp);
}
/*}}}*/
// TagSection::Find - Locate a tag /*{{{*/
// ---------------------------------------------------------------------
/* This searches the section for a tag that matches the given string. */
bool pkgTagSection::Find(Key key,unsigned int &Pos) const
{
auto Bucket = AlphaIndexes[static_cast<size_t>(key)];
Pos = Bucket - 1;
return Bucket != 0;
}
bool pkgTagSection::Find(string_view TagView,unsigned int &Pos) const
{
const char * const Tag = TagView.data();
size_t const Length = TagView.length();
auto key = pkgTagHash(Tag, Length);
if (key != Key::Unknown)
return Find(key, Pos);
unsigned int Bucket = BetaIndexes[BetaHash(Tag, Length)];
if (Bucket == 0)
return false;
for (; Bucket != 0; Bucket = d->Tags[Bucket - 1].NextInBucket)
{
if ((d->Tags[Bucket - 1].EndTag - d->Tags[Bucket - 1].StartTag) != Length)
continue;
char const * const St = Section + d->Tags[Bucket - 1].StartTag;
if (strncasecmp(Tag,St,Length) != 0)
continue;
Pos = Bucket - 1;
return true;
}
Pos = 0;
return false;
}
bool pkgTagSection::FindInternal(unsigned int Pos, const char *&Start,
const char *&End) const
{
if (unlikely(Pos + 1 >= d->Tags.size() || Pos >= d->Tags.size()))
return _error->Error("Internal parsing error");
Start = Section + d->Tags[Pos].StartValue;
// Strip off the gunk from the end
End = Section + d->Tags[Pos + 1].StartTag;
if (unlikely(Start > End))
return _error->Error("Internal parsing error");
for (; isspace_ascii(End[-1]) != 0 && End > Start; --End);
return true;
}
bool pkgTagSection::Find(string_view Tag,const char *&Start,
const char *&End) const
{
unsigned int Pos;
return Find(Tag, Pos) && FindInternal(Pos, Start, End);
}
bool pkgTagSection::Find(Key key,const char *&Start,
const char *&End) const
{
unsigned int Pos;
return Find(key, Pos) && FindInternal(Pos, Start, End);
}
/*}}}*/
// TagSection::FindS - Find a string /*{{{*/
string_view pkgTagSection::Find(string_view Tag) const
{
const char *Start;
const char *End;
if (Find(Tag,Start,End) == false)
return string_view();
return string_view(Start, End - Start);
}
string_view pkgTagSection::Find(Key key) const
{
const char *Start;
const char *End;
if (Find(key,Start,End) == false)
return string_view();
return string_view(Start, End - Start);
}
/*}}}*/
// TagSection::FindRawS - Find a string /*{{{*/
string_view pkgTagSection::FindRawInternal(unsigned int Pos) const
{
if (unlikely(Pos + 1 >= d->Tags.size() || Pos >= d->Tags.size()))
return _error->Error("Internal parsing error"), "";
char const *Start = (char const *) memchr(Section + d->Tags[Pos].EndTag, ':', d->Tags[Pos].StartValue - d->Tags[Pos].EndTag);
char const *End = Section + d->Tags[Pos + 1].StartTag;
if (Start == nullptr)
return "";
++Start;
if (unlikely(Start > End))
return "";
for (; isspace_ascii(End[-1]) != 0 && End > Start; --End);
return string_view(Start, End - Start);
}
string_view pkgTagSection::FindRaw(std::string_view Tag) const
{
unsigned int Pos;
return Find(Tag, Pos) ? FindRawInternal(Pos) : "";
}
string_view pkgTagSection::FindRaw(Key key) const
{
unsigned int Pos;
return Find(key, Pos) ? FindRawInternal(Pos) : "";
}
/*}}}*/
// TagSection::FindI - Find an integer /*{{{*/
// ---------------------------------------------------------------------
/* */
signed int pkgTagSection::FindIInternal(unsigned int Pos,signed long Default) const
{
const char *Start = nullptr;
const char *Stop = nullptr;
if (FindInternal(Pos,Start,Stop) == false)
return Default;
// Copy it into a temp buffer so we can use strtol
char S[300];
if ((size_t)(Stop - Start) >= sizeof(S))
return Default;
strncpy(S,Start,Stop-Start);
S[Stop - Start] = 0;
errno = 0;
char *End;
signed long Result = strtol(S,&End,10);
if (errno == ERANGE ||
Result < std::numeric_limits<int>::min() || Result > std::numeric_limits<int>::max()) {
errno = ERANGE;
_error->Error(_("Cannot convert %s to integer: out of range"), S);
}
if (S == End)
return Default;
return Result;
}
signed int pkgTagSection::FindI(Key key,signed long Default) const
{
unsigned int Pos;
return Find(key, Pos) ? FindIInternal(Pos) : Default;
}
signed int pkgTagSection::FindI(string_view Tag,signed long Default) const
{
unsigned int Pos;
return Find(Tag, Pos) ? FindIInternal(Pos, Default) : Default;
}
/*}}}*/
// TagSection::FindULL - Find an unsigned long long integer /*{{{*/
// ---------------------------------------------------------------------
/* */
unsigned long long pkgTagSection::FindULLInternal(unsigned int Pos, unsigned long long const &Default) const
{
const char *Start = nullptr;
const char *Stop = nullptr;
if (FindInternal(Pos,Start,Stop) == false)
return Default;
// Copy it into a temp buffer so we can use strtoull
char S[100];
if ((size_t)(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;
}
unsigned long long pkgTagSection::FindULL(Key key, unsigned long long const &Default) const
{
unsigned int Pos;
return Find(key, Pos) ? FindULLInternal(Pos, Default) : Default;
}
unsigned long long pkgTagSection::FindULL(string_view Tag, unsigned long long const &Default) const
{
unsigned int Pos;
return Find(Tag, Pos) ? FindULLInternal(Pos, Default) : Default;
}
/*}}}*/
// TagSection::FindB - Find boolean value /*{{{*/
// ---------------------------------------------------------------------
/* */
bool pkgTagSection::FindBInternal(unsigned int Pos, bool Default) const
{
const char *Start = nullptr, *Stop = nullptr;
if (FindInternal(Pos, Start, Stop) == false)
return Default;
return StringToBool(string(Start, Stop));
}
bool pkgTagSection::FindB(Key key, bool Default) const
{
unsigned int Pos;
return Find(key, Pos) ? FindBInternal(Pos, Default): Default;
}
bool pkgTagSection::FindB(string_view Tag, bool Default) const
{
unsigned int Pos;
return Find(Tag, Pos) ? FindBInternal(Pos, Default) : Default;
}
/*}}}*/
// TagSection::FindFlag - Locate a yes/no type flag /*{{{*/
// ---------------------------------------------------------------------
/* The bits marked in Flag are masked on/off in Flags */
bool pkgTagSection::FindFlagInternal(unsigned int Pos, uint8_t &Flags,
uint8_t const Flag) const
{
const char *Start = nullptr;
const char *Stop = nullptr;
if (FindInternal(Pos,Start,Stop) == false)
return true;
return FindFlag(Flags, Flag, Start, Stop);
}
bool pkgTagSection::FindFlag(Key key, uint8_t &Flags,
uint8_t const Flag) const
{
unsigned int Pos;
if (Find(key,Pos) == false)
return true;
return FindFlagInternal(Pos, Flags, Flag);
}
bool pkgTagSection::FindFlag(string_view Tag, uint8_t &Flags,
uint8_t const Flag) const
{
unsigned int Pos;
if (Find(Tag,Pos) == false)
return true;
return FindFlagInternal(Pos, Flags, Flag);
}
bool pkgTagSection::FindFlag(uint8_t &Flags, uint8_t const Flag,
char const* const Start, char const* 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;
}
bool pkgTagSection::FindFlagInternal(unsigned int Pos,unsigned long &Flags,
unsigned long Flag) const
{
const char *Start = nullptr;
const char *Stop = nullptr;
if (FindInternal(Pos,Start,Stop) == false)
return true;
return FindFlag(Flags, Flag, Start, Stop);
}
bool pkgTagSection::FindFlag(Key key,unsigned long &Flags,
unsigned long Flag) const
{
unsigned int Pos;
return Find(key, Pos) ? FindFlagInternal(Pos, Flags, Flag) : true;
}
bool pkgTagSection::FindFlag(string_view Tag,unsigned long &Flags,
unsigned long Flag) const
{
unsigned int Pos;
return Find(Tag, Pos) ? FindFlagInternal(Pos, Flags, Flag) : true;
}
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;
}
/*}}}*/
void pkgTagSection::Get(const char *&Start,const char *&Stop,unsigned int I) const/*{{{*/
{
if (unlikely(I + 1 >= d->Tags.size() || I >= d->Tags.size()))
abort();
Start = Section + d->Tags[I].StartTag;
Stop = Section + d->Tags[I+1].StartTag;
}
/*}}}*/
APT_PURE unsigned int pkgTagSection::Count() const { /*{{{*/
if (d->Tags.empty() == true)
return 0;
// the last element is just marking the end and isn't a real one
return d->Tags.size() - 1;
}
/*}}}*/
// TagSection::Write - Ordered (re)writing of fields /*{{{*/
pkgTagSection::Tag pkgTagSection::Tag::Remove(std::string_view Name)
{
return Tag(REMOVE, Name, "");
}
pkgTagSection::Tag pkgTagSection::Tag::Rename(std::string_view OldName, std::string_view NewName)
{
return Tag(RENAME, OldName, NewName);
}
pkgTagSection::Tag pkgTagSection::Tag::Rewrite(std::string_view Name, std::string_view Data)
{
if (Data.empty() == true)
return Tag(REMOVE, Name, "");
else
return Tag(REWRITE, Name, Data);
}
static bool WriteTag(FileFd &File, std::string Tag, string_view Value, pkgTagSection::WriteFlags flags)
{
if (Value.empty() || isspace_ascii(Value[0]) != 0)
Tag.append(":");
else
Tag.append(": ");
if (flags & pkgTagSection::WRITE_HUMAN)
Tag = color("Show::Field", Tag);
Tag.append(Value.data(), Value.length());
Tag.append("\n");
return File.Write(Tag.c_str(), Tag.length());
}
static bool RewriteTags(FileFd &File, pkgTagSection const *const This, char const *const Tag,
std::vector<pkgTagSection::Tag>::const_iterator &R,
std::vector<pkgTagSection::Tag>::const_iterator const &REnd, pkgTagSection::WriteFlags flags)
{
size_t const TagLen = strlen(Tag);
for (; R != REnd; ++R)
{
std::string data;
if (R->Name.length() == TagLen && strncasecmp(R->Name.c_str(), Tag, R->Name.length()) == 0)
{
if (R->Action != pkgTagSection::Tag::REWRITE)
break;
data = R->Data;
}
else if(R->Action == pkgTagSection::Tag::RENAME && R->Data.length() == TagLen &&
strncasecmp(R->Data.c_str(), Tag, R->Data.length()) == 0)
data = This->FindRaw(R->Name.c_str());
else
continue;
return WriteTag(File, Tag, data, flags);
}
return true;
}
bool pkgTagSection::Write(FileFd &File, char const * const * const Order, std::vector<Tag> const &Rewrite) const
{
return Write(File, WRITE_DEFAULT, Order, Rewrite);
}
bool pkgTagSection::Write(FileFd &File, pkgTagSection::WriteFlags flags, char const *const *const Order, std::vector<Tag> const &Rewrite) const
{
// first pass: Write everything we have an order for
if (Order != NULL)
{
for (unsigned int I = 0; Order[I] != 0; ++I)
{
std::vector<Tag>::const_iterator R = Rewrite.begin();
if (RewriteTags(File, this, Order[I], R, Rewrite.end(), flags) == false)
return false;
if (R != Rewrite.end())
continue;
if (Exists(Order[I]) == false)
continue;
if (WriteTag(File, Order[I], FindRaw(Order[I]), flags) == false)
return false;
}
}
// second pass: See if we have tags which aren't ordered
if (d->Tags.empty() == false)
{
for (std::vector<pkgTagSectionPrivate::TagData>::const_iterator T = d->Tags.begin(); T != d->Tags.end() - 1; ++T)
{
char const * const fieldname = Section + T->StartTag;
size_t fieldnamelen = T->EndTag - T->StartTag;
if (Order != NULL)
{
unsigned int I = 0;
for (; Order[I] != 0; ++I)
{
if (fieldnamelen == strlen(Order[I]) && strncasecmp(fieldname, Order[I], fieldnamelen) == 0)
break;
}
if (Order[I] != 0)
continue;
}
std::string const name(fieldname, fieldnamelen);
std::vector<Tag>::const_iterator R = Rewrite.begin();
if (RewriteTags(File, this, name.c_str(), R, Rewrite.end(), flags) == false)
return false;
if (R != Rewrite.end())
continue;
if (WriteTag(File, name, FindRaw(name), flags) == false)
return false;
}
}
// last pass: see if there are any rewrites remaining we haven't done yet
for (std::vector<Tag>::const_iterator R = Rewrite.begin(); R != Rewrite.end(); ++R)
{
if (R->Action == Tag::REMOVE)
continue;
auto const name = ((R->Action == Tag::RENAME) ? R->Data : R->Name);
if (Exists(name))
continue;
if (Order != NULL)
{
unsigned int I = 0;
for (; Order[I] != 0; ++I)
{
if (strncasecmp(name.c_str(), Order[I], name.length()) == 0 && name.length() == strlen(Order[I]))
break;
}
if (Order[I] != 0)
continue;
}
if (WriteTag(File, name, ((R->Action == Tag::RENAME) ? FindRaw(R->Name) : R->Data), flags) == false)
return false;
}
return true;
}
/*}}}*/
#include "tagfile-order.c"
pkgTagSection::~pkgTagSection() = default;
|