// -*- mode: cpp; mode: fold -*- // Description /*{{{*/ // $Id: indexrecords.cc,v 1.1.2.4 2003/12/30 02:11:43 mdz Exp $ /*}}}*/ // Include Files /*{{{*/ #include <apt-pkg/indexrecords.h> #include <apt-pkg/tagfile.h> #include <apt-pkg/error.h> #include <apt-pkg/strutl.h> #include <apti18n.h> #include <sys/stat.h> /*}}}*/ string indexRecords::GetDist() const { return this->Dist; } bool indexRecords::CheckDist(const string MaybeDist) const { return (this->Dist == MaybeDist || this->Suite == MaybeDist); } string indexRecords::GetExpectedDist() const { return this->ExpectedDist; } const indexRecords::checkSum *indexRecords::Lookup(const string MetaKey) { return Entries[MetaKey]; } bool indexRecords::Load(const string Filename) /*{{{*/ { FileFd Fd(Filename, FileFd::ReadOnly); pkgTagFile TagFile(&Fd, Fd.Size() + 256); // XXX if (_error->PendingError() == true) { strprintf(ErrorText, _("Unable to parse Release file %s"),Filename.c_str()); return false; } pkgTagSection Section; if (TagFile.Step(Section) == false) { strprintf(ErrorText, _("No sections in Release file %s"), Filename.c_str()); return false; } const char *Start, *End; Section.Get (Start, End, 0); Suite = Section.FindS("Suite"); Dist = Section.FindS("Codename"); int i; for (i=0;HashString::SupportedHashes()[i] != NULL; i++) { if (!Section.Find(HashString::SupportedHashes()[i], Start, End)) continue; string Name; string Hash; size_t Size; while (Start < End) { if (!parseSumData(Start, End, Name, Hash, Size)) return false; indexRecords::checkSum *Sum = new indexRecords::checkSum; Sum->MetaKeyFilename = Name; Sum->Hash = HashString(HashString::SupportedHashes()[i],Hash); Sum->Size = Size; Entries[Name] = Sum; } break; } if(HashString::SupportedHashes()[i] == NULL) { strprintf(ErrorText, _("No Hash entry in Release file %s"), Filename.c_str()); return false; } string Strdate = Section.FindS("Date"); // FIXME: verify this somehow? return true; } /*}}}*/ vector<string> indexRecords::MetaKeys() /*{{{*/ { std::vector<std::string> keys; std::map<string,checkSum *>::iterator I = Entries.begin(); while(I != Entries.end()) { keys.push_back((*I).first); ++I; } return keys; } /*}}}*/ bool indexRecords::parseSumData(const char *&Start, const char *End, /*{{{*/ string &Name, string &Hash, size_t &Size) { Name = ""; Hash = ""; Size = 0; /* Skip over the first blank */ while ((*Start == '\t' || *Start == ' ' || *Start == '\n') && Start < End) Start++; if (Start >= End) return false; /* Move EntryEnd to the end of the first entry (the hash) */ const char *EntryEnd = Start; while ((*EntryEnd != '\t' && *EntryEnd != ' ') && EntryEnd < End) EntryEnd++; if (EntryEnd == End) return false; Hash.append(Start, EntryEnd-Start); /* Skip over intermediate blanks */ Start = EntryEnd; while (*Start == '\t' || *Start == ' ') Start++; if (Start >= End) return false; EntryEnd = Start; /* Find the end of the second entry (the size) */ while ((*EntryEnd != '\t' && *EntryEnd != ' ' ) && EntryEnd < End) EntryEnd++; if (EntryEnd == End) return false; Size = strtol (Start, NULL, 10); /* Skip over intermediate blanks */ Start = EntryEnd; while (*Start == '\t' || *Start == ' ') Start++; if (Start >= End) return false; EntryEnd = Start; /* Find the end of the third entry (the filename) */ while ((*EntryEnd != '\t' && *EntryEnd != ' ' && *EntryEnd != '\n') && EntryEnd < End) EntryEnd++; Name.append(Start, EntryEnd-Start); Start = EntryEnd; //prepare for the next round return true; } /*}}}*/ indexRecords::indexRecords() { } indexRecords::indexRecords(const string ExpectedDist) : ExpectedDist(ExpectedDist) { }