]> git.saurik.com Git - apt.git/blame - apt-pkg/tagfile.h
Merge branch 'debian/sid' into debian/experimental
[apt.git] / apt-pkg / tagfile.h
CommitLineData
578bfd0a
AL
1// -*- mode: cpp; mode: fold -*-
2// Description /*{{{*/
0852eaef 3// $Id: tagfile.h,v 1.20 2003/05/19 17:13:57 doogie Exp $
578bfd0a
AL
4/* ######################################################################
5
6 Fast scanner for RFC-822 type header information
7
8 This parser handles Debian package files (and others). Their form is
b2e465d6 9 RFC-822 type header fields in groups separated by a blank line.
578bfd0a 10
6fc33863 11 The parser reads the file and provides methods to step linearly
578bfd0a
AL
12 over it or to jump to a pre-recorded start point and read that record.
13
14 A second class is used to perform pre-parsing of the record. It works
15 by indexing the start of each header field and providing lookup
16 functions for header fields.
17
18 ##################################################################### */
19 /*}}}*/
578bfd0a
AL
20#ifndef PKGLIB_TAGFILE_H
21#define PKGLIB_TAGFILE_H
22
ce62f1de
DK
23#include <apt-pkg/macros.h>
24
b2e465d6 25#include <stdio.h>
1abbce9e 26
472ff00e 27#include <string>
8710a36a
DK
28#include <vector>
29#include <list>
472ff00e 30
b9dadc24
DK
31#ifndef APT_8_CLEANER_HEADERS
32#include <apt-pkg/fileutl.h>
33#endif
34
472ff00e
DK
35class FileFd;
36
578bfd0a
AL
37class pkgTagSection
38{
39 const char *Section;
8710a36a
DK
40 struct TagData {
41 unsigned int StartTag;
42 unsigned int EndTag;
43 unsigned int StartValue;
44 unsigned int NextInBucket;
45
46 TagData(unsigned int const StartTag) : StartTag(StartTag), NextInBucket(0) {}
47 };
48 std::vector<TagData> Tags;
49 unsigned int LookupTable[0x100];
50
43fb90dc
MV
51 // dpointer placeholder (for later in case we need it)
52 void *d;
c176c4d0 53
81e9789b
MV
54 protected:
55 const char *Stop;
56
578bfd0a
AL
57 public:
58
59 inline bool operator ==(const pkgTagSection &rhs) {return Section == rhs.Section;};
60 inline bool operator !=(const pkgTagSection &rhs) {return Section != rhs.Section;};
61
b2e465d6 62 bool Find(const char *Tag,const char *&Start, const char *&End) const;
c8b860fb 63 bool Find(const char *Tag,unsigned int &Pos) const;
8f3ba4e8 64 std::string FindS(const char *Tag) const;
a2fdb57f
MV
65 signed int FindI(const char *Tag,signed long Default = 0) const;
66 bool FindB(const char *Tag, bool const &Default = false) const;
e2c66de5 67 unsigned long long FindULL(const char *Tag, unsigned long long const &Default = 0) const;
500827ed
AL
68 bool FindFlag(const char *Tag,unsigned long &Flags,
69 unsigned long Flag) const;
d64e130a 70 bool static FindFlag(unsigned long &Flags, unsigned long Flag,
fe0f7911 71 const char* Start, const char* Stop);
8710a36a
DK
72
73 /** \brief searches the boundaries of the current section
74 *
75 * While parameter Start marks the beginning of the section, this method
76 * will search for the first double newline in the data stream which marks
77 * the end of the section. It also does a first pass over the content of
78 * the section parsing it as encountered for processing later on by Find
79 *
80 * @param Start is the beginning of the section
81 * @param MaxLength is the size of valid data in the stream pointed to by Start
82 * @param Restart if enabled internal state will be cleared, otherwise it is
83 * assumed that now more data is available in the stream and the parsing will
84 * start were it encountered insufficent data the last time.
85 *
86 * @return \b true if section end was found, \b false otherwise.
87 * Beware that internal state will be inconsistent if \b false is returned!
88 */
89 APT_MUSTCHECK bool Scan(const char *Start, unsigned long MaxLength, bool const Restart = true);
b2e465d6
AL
90 inline unsigned long size() const {return Stop - Section;};
91 void Trim();
81e9789b 92 virtual void TrimRecord(bool BeforeRecord, const char* &End);
8710a36a
DK
93
94 /** \brief amount of Tags in the current section
95 *
96 * Note: if a Tag is mentioned repeatly it will be counted multiple
97 * times, but only the last occurance is available via Find methods.
98 */
99 unsigned int Count() const;
100 bool Exists(const char* const Tag) const;
101
b2e465d6 102 inline void Get(const char *&Start,const char *&Stop,unsigned int I) const
8710a36a
DK
103 {Start = Section + Tags[I].StartTag; Stop = Section + Tags[I+1].StartTag;}
104
b2e465d6 105 inline void GetSection(const char *&Start,const char *&Stop) const
a05599f1
AL
106 {
107 Start = Section;
108 Stop = this->Stop;
109 };
110
b40394c0 111 pkgTagSection();
43fb90dc 112 virtual ~pkgTagSection() {};
578bfd0a
AL
113};
114
1abbce9e 115class pkgTagFilePrivate;
578bfd0a
AL
116class pkgTagFile
117{
1abbce9e 118 pkgTagFilePrivate *d;
75c541fd 119
ce62f1de
DK
120 APT_HIDDEN bool Fill();
121 APT_HIDDEN bool Resize();
122 APT_HIDDEN bool Resize(unsigned long long const newSize);
75c541fd 123
578bfd0a
AL
124 public:
125
126 bool Step(pkgTagSection &Section);
4b2746d5 127 unsigned long Offset();
650faab0 128 bool Jump(pkgTagSection &Tag,unsigned long long Offset);
29f7b36c 129
feab34c5
MV
130 void Init(FileFd *F,unsigned long long Size = 32*1024);
131
650faab0 132 pkgTagFile(FileFd *F,unsigned long long Size = 32*1024);
43fb90dc 133 virtual ~pkgTagFile();
578bfd0a
AL
134};
135
b2e465d6
AL
136/* This is the list of things to rewrite. The rewriter
137 goes through and changes or adds each of these headers
138 to suit. A zero forces the header to be erased, an empty string
139 causes the old value to be used. (rewrite rule ignored) */
140struct TFRewriteData
141{
142 const char *Tag;
143 const char *Rewrite;
144 const char *NewTag;
145};
146extern const char **TFRewritePackageOrder;
147extern const char **TFRewriteSourceOrder;
148
149bool TFRewrite(FILE *Output,pkgTagSection const &Tags,const char *Order[],
150 TFRewriteData *Rewrite);
151
578bfd0a 152#endif